
TL;DR
This paper investigates permutations where each position and its image are coprime, establishing bounds on their count for large n, revealing asymptotic growth rates between n!/3.73^n and n!/2.5^n.
Contribution
The paper provides new bounds on the number of coprime permutations, advancing understanding of their asymptotic behavior for large n.
Findings
C(n) is bounded between n!/3.73^n and n!/2.5^n for large n
The bounds improve understanding of the distribution of coprime permutations
Asymptotic growth rate of coprime permutations is characterized
Abstract
Let denote the number of permutations of such that for each . We prove that for sufficiently large, .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Bayesian Methods and Mixture Models
