English

Permutation Patterns of the Iterated Syracuse Function

Number Theory 2024-09-26 v1 Combinatorics

Abstract

Let Ω\Omega be the set of odd positive integers and let S:ΩΩS:\Omega \rightarrow \Omega be the Syracuse function. It is proved that, for every permutation σ\sigma of (1,2,3)(1,2,3), the set of triples of the form (m,S(m),S2(m))(m,S(m),S^2(m)) with permutation pattern σ\sigma has positive density, and these densities are computed. However, there exist permutations τ\tau of (1,2,3,4)(1,2,3,4) such that no quadruple (m,S(m),S2(m),S3(m))(m,S(m), S^2(m), S^3(m)) has permutation pattern τ\tau. This implies the nonexistence of certain permutation patterns of nn-tuples (m,S(m),,Sn1(m))(m,S(m),\ldots, S^{n-1}(m)) for all n4n \geq 4.

Keywords

Cite

@article{arxiv.2308.00644,
  title  = {Permutation Patterns of the Iterated Syracuse Function},
  author = {Melvyn B. Nathanson},
  journal= {arXiv preprint arXiv:2308.00644},
  year   = {2024}
}

Comments

21 pages

R2 v1 2026-06-28T11:45:42.110Z