Coprime partitions and Jordan totient functions

DOI10.1016/j.jnt.2021.05.017zbMath1490.05012arXiv2007.05972OpenAlexW3183648988WikidataQ114156924 ScholiaQ114156924MaRDI QIDQ2668925

Florian Luca, Daniela Bubboloni

Publication date: 9 March 2022

Published in: Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

coprime compositionscoprime partitionsgeneralized Jordan totient functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Asymptotic results on arithmetic functions (11N37) Elementary theory of partitions (11P81) Arithmetic functions; related numbers; inversion formulas (11A25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite primitive permutation groups containing a permutation having at most four cycles
• Compositions of n satisfying some coprimality conditions
• Normal coverings of finite symmetric and alternating groups.
• Intersective \(S_n\) polynomials with few irreducible factors
• On the number of \(k\)-compositions \(n\) satisfying certain coprimality conditions
• Jordan totient quotients
• Linear bounds for the normal covering number of the symmetric and alternating groups
• Normal coverings and pairwise generation of finite alternating and symmetric groups.
• Polynomials with roots mod p for all primes p
• Cyclotomic polynomials at roots of unity
• Partitions with parts in a finite set
• On Galois Realizations of the 2-Coverable Symmetric and Alternating Groups

This page was built for publication: Coprime partitions and Jordan totient functions