Restricted partitions: the polynomial case

DOI10.1134/S0016266322040074OpenAlexW4365795769MaRDI QIDQ2699734

D. S. Minenkov, Vsevolod L. Chernyshev, Titus W. Hilberdink, Vladimir E. Nazaikinskii

Publication date: 19 April 2023

Published in: Functional Analysis and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0016266322040074

zbMATH Keywords

counting functionuniform asymptoticsmetric graphabstract prime number theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Asymptotic results on arithmetic functions (11N37) Other combinatorial number theory (11B75)

Related Items (1)

On logarithmic asymptotics for the number of restricted partitions in the exponential case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the entropy of a Bose-Maslov gas
• On the asymptotics of the element counting function in an additive arithmetic semigroup with exponential counting function of prime generators
• Asymptotics of the number of restricted partitions
• Correction to the leading term of asymptotics in the problem of counting the number of points moving on a metric tree
• Polynomial approximation for the number of all possible endpoints of a random walk on a metric graph
• The second term in the asymptotics for the number of points moving along a metric graph
• The number of endpoints of a random walk on a semi-infinite metric path graph
• On the asymptotics of the number of states for the Bose-Maslov gas
• The distribution of the number of summands in the partitions of a positive integer
• A Tauberian theorem for partitions
• Statistics of Gaussian packets on metric and decorated graphs
• Asymptotic estimate for the counting problems corresponding to the dynamical system on some decorated graphs
• On the Partition Function p (n )
• The Difference between Consecutive Prime Numbers

This page was built for publication: Restricted partitions: the polynomial case