Constructive Bounds on Ordered Factorizations

DOI10.1137/S0895480104445861zbMath1090.05004OpenAlexW2094878921WikidataQ114073904 ScholiaQ114073904MaRDI QIDQ5470760

Don Coppersmith, Moshe Lewenstein

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104445861

zbMATH Keywords

Riemann zeta function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Rate of growth of arithmetic functions (11N56)

Related Items (5)

On the maximal order of numbers in the ``factorisatio numerorum problem ⋮ Large values and champion numbers of Kalmár's arithmetic function ⋮ On asymptotic behavior of Dirichlet inverse ⋮ On extended Eulerian numbers ⋮ On ordered factorizations into distinct parts

This page was built for publication: Constructive Bounds on Ordered Factorizations