Permutations and the divisor graph of [1,n]

DOI10.1112/mtk.12177arXiv2207.09652OpenAlexW4310689750MaRDI QIDQ6075454

Nathan McNew

Publication date: 20 September 2023

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.09652

zbMATH Keywords

coprime mappingscoprime permutationsvertex disjoint directed cycle covers of a graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic results on counting functions for algebraic and topological structures (11N45) Paths and cycles (05C38) Other combinatorial number theory (11B75) Asymptotic enumeration (05A16) Arithmetic functions; related numbers; inversion formulas (11A25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)
• Proof of D. J. Newman's coprime mapping conjecture
• Coprime permutations
• Coprime matchings
• Coprime mappings between sets of consecutive integers
• Coprime mappings and lonely runners
• Enumerating coprime permutations
• Number Theory in Memory of Eduard Wirsing

This page was built for publication: Permutations and the divisor graph of [1,n]