Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+1 graph

@article{Monks2012StronglySS,
  title={Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+1 graph},
  author={Keenan Monks and Kenneth G. Monks and Kenneth M. Monks and Maria Monks},
  journal={Discret. Math.},
  year={2012},
  volume={313},
  pages={468-489}
}
  • Keenan Monks, Kenneth G. Monks, +1 author Maria Monks
  • Published in Discret. Math. 2012
  • Computer Science, Mathematics
  • Abstract The 3 x + 1 conjecture asserts that the T -orbit of every positive integer contains 1 , where T maps x ↦ x / 2 for x even and x ↦ ( 3 x + 1 ) / 2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer intersects the orbit of some member of S . Monks (2006)  [8] showed that every infinite arithmetic sequence is sufficient. In this paper we further investigate the concept of sufficiency. We construct sufficient sets of arbitrarily low asymptotic… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    On the 3x+1 conjecture

    VIEW 1 EXCERPT
    CITES BACKGROUND

    The Collatz conjecture and De Bruijn graphs

    VIEW 3 EXCERPTS
    CITES RESULTS & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    The 3x + 1 Problem and its Generalizations

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Endomorphisms and automorphisms of the shift dynamical system

    • G. A. Hedlund
    • Computer Science, Mathematics
    • Mathematical systems theory
    • 2005

    The autoconjugacy of the 3x+1 function

    VIEW 3 EXCERPTS

    On the minimal cycle lengths of the Collatz sequences, preprint

    • M. K. Sinisalo
    • Univ. of Oulu, Finland,
    • 2003
    VIEW 1 EXCERPT