Compositions of n satisfying some coprimality conditions

DOI10.1016/J.JNT.2012.06.012MaRDI QIDQ455802zbMATHOpenAlexFDO

Authors Daniela Bubboloni, Florian Luca, Pablo Spiga

Publication date 22 October 2012

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

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

zbMATH Keywords

compositionscoprime summandpairwise coprime

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Abstract: A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic formula for the number of k-compositions having the first summand coprime to the others. Then, we estimate the number of k-compositions whose summands are all pairwise coprime.

Recommendations

• On the number of \(k\)-compositions \(n\) satisfying certain coprimality conditions
• The theory of compositions. IV: Multicompositions
• Compositions with parts constrained by the leading summand.
• scientific article; zbMATH DE number 1250666
• On Compositeness in Multicompositions

Cites work

• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 3210129 (Why is no real title available?)
• A Multivariate Arithmetic Function of Combinatorial and Topological Significance
• Approximate formulas for some functions of prime numbers
• Die Seltenheit der Gleichungen mit Affekt
• Maximal subgroups of symmetric groups
• Normal coverings and pairwise generation of finite alternating and symmetric groups.
• Normal coverings of finite symmetric and alternating groups.
• On conjugacy classes of maximal subgroups of finite simple groups, and a related zeta function.
• On the orders of Primitive Permutation Groups
• Polynomials with roots modulo every integer
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• The Magma algebra system. I: The user language
• The probability of generating the symmetric group

Cited in

(6)

• Coprime partitions and Jordan totient functions
• The theory of compositions. IV: Multicompositions
• Normal coverings and pairwise generation of finite alternating and symmetric groups.
• Linear bounds for the normal covering number of the symmetric and alternating groups
• Intersective \(S_n\) polynomials with few irreducible factors
• On the number of \(k\)-compositions \(n\) satisfying certain coprimality conditions

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Compositions of n satisfying some coprimality conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q455802)