Permutation Patterns of the Iterated Syracuse Function
Abstract
Let be the set of odd positive integers and let S: → be the Syracuse function. It is proved that, for every permutation σ of (1,2,3), the set of triples of the form (m,S(m),S2(m)) with permutation pattern σ has positive density, and these densities are computed. However, there exist permutations τ of (1,2,3,4) such that no quadruple (m,S(m), S2(m), S3(m)) has permutation pattern τ. This implies the nonexistence of certain permutation patterns of n-tuples (m,S(m),…, Sn-1(m)) for all n ≥ 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.