The sufficiency of arithmetic progressions for the 3x + 1 Conjecture

@inproceedings{Monks2006TheSO,
  title={The sufficiency of arithmetic progressions for the 3x + 1 Conjecture},
  author={Kenneth M. Monks},
  year={2006}
}
Define T: Z + → Z + by T(x) = (3x+1)/2 if x is odd and T (x) = x/2 if x is even. The 3x +1 Conjecture states that the T-orbit of every positive integer contains 1. A set of positive integers is said to be sufficient if the T-orbit of every positive integer intersects the T-orbit of an element of that set. Thus to prove the 3x+1 Conjecture it suffices to prove it on some sufficient set. Andaloro proved that the sets 1 + 2 n N are sufficient for n < 4 and asked if 1 + 2 n N is also sufficient for… Expand
Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+1 graph
TLDR
This paper constructs sufficient sets of arbitrarily low asymptotic density in the natural numbers and shows that the 3 x + 1 digraph exhibits a surprising and beautiful self-duality modulo 2 n for any n, and proves that it does not have this property for any other modulus. Expand
THE CONGRUENCE STRUCTURE OF THE 3x + 1 MAP
Let T :Z !Z be deflned by T(x) = 1 x if x is even, and T(x) = 1 (3x+1) if x is odd. The 3x + 1 Conjecture asserts that every positive x has an iterate T n (x) = 1. It is known that T n mapsExpand
The 3x+1 Problem: An Annotated Bibliography, II (2000-2009)
The 3x+1 problem concerns iteration of the map T(n) =(3n+1)/2 if n odd; n/2 if n even. The 3x +1 Conjecture asserts that for every positive integer n>1 the forward orbit of n includes the integer 1.Expand
First Occurrence of Parity Vectors and the Regular Structure of k-Span Predecessor Sets in the Collatz Graph
TLDR
The main result, which generalizes Colussi [TCS 2011], exploits the properties of first occurrence of parity vectors via their encoding $\mathcal{E}(p)$ and the symmetries of the $(\alpha_{0,-1})$-tree in order to highlight some regular structure in the Collatz graph. Expand
The Collatz conjecture and De Bruijn graphs
We study variants of the well-known Collatz graph, by considering the action of the 3n + 1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic toExpand
Conservation of Singularities in Functional Equations Associated to Collatz-Type Dynamical Systems; or, Dreamcatchers for Hydra Maps
It is known that the Collatz Conjecture (and the study of similar maps, here called "Hydra maps") can be stated in terms of solution sets of functional equations; or, equivalently, the fixed pointsExpand
Fractal Property for A Novel Function generated by Generalized Approximate 3x+1 Functions
Today, study of generalized 3x+1 function becomes a highlight in fractal area. In this paper, since fractal property of generalized 3x+1 functions T(z) and C(z) is difficult to study, we study twoExpand
2 2 A pr 2 00 8 The 3 x + 1 Problem : An Annotated Bibliography , II ( 2001 – )
The 3x + 1 problem concerns iteration of the map T : Z → Z given by
Binary Expression of Ancestors in the Collatz Graph
TLDR
This paper implements the algorithm which generates the regular expression, $\texttt{reg}_k(x)$ for any $x$ and $k, and gives a new exploratory tool for further study of the Collatz graph in binary. Expand
A pr 2 00 7 The 3 x + 1 Problem : An Annotated Bibliography , II ( 2001 – )
  • 2009

References

SHOWING 1-9 OF 9 REFERENCES
A non-iterative 2-adic statement of the 3N+1 conjecture
Associated with the 3N + 1 problem is a permutation of the 2-adic integers. The IN + 1 conjecture is equivalent to the conjecture that 3s is an integer if O(s) is a positive integer. We state a newExpand
Real 3x + 1
The famous 3x + 1 problem involves applying two maps: T 0 (x) = x/2 and T 1 (x) = (3x + 1)/2 to positive integers. If x is even, one applies To, if it is odd, one applies T 1 The conjecture statesExpand
Introduction to Number Theory
This seems simple enough, but let’s play with this definition. The Pythagoreans, an ancient sect of mathematical mystics, said that a number is perfect if it equals the sum of its positive integralExpand
The Dynamical System Generated by the 3n+1 Function
Some ideas around 3n+1 iterations.- Analysis of the Collatz graph.- 3-adic averages of counting functions.- An asymptotically homogeneous Markov chain.- Mixing and predecessor density.
E-mail address: monksk2@scranton
  • E-mail address: monksk2@scranton
E-mail address: monksk2@scranton.edu License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
  • E-mail address: monksk2@scranton.edu License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
MONKS
  • MONKS
Real 3 x + 1
  • Proc . Amer . Math . Soc .