Partitions into semiprimes

From MaRDI portal



Abstract: Let mathbbP denote the set of primes and mathcalNsubsetmathbbN be a set with arbitrary weights attached to its elements. Set mathfrakpmathcalN(n) to be the restricted partition function which counts partitions of n with all its parts lying in mathcalN. By employing a suitable variation of the Hardy-Littlewood circle method we provide the asymptotic formula of mathfrakpmathcalN(n) for the set of semiprimes mathcalN=p1p2:p1,p2inmathbbP in different set-ups (counting factors, repeating the count of factors, and different factors). In order to deal with the minor arc, we investigate a double Weyl sum over prime products and find its corresponding bound thereby extending some of the results of Vinogradov on partitions. We also describe a methodology to find the asymptotic partition mathfrakpmathcalN(n) for general weighted sets mathcalN by assigning different strategies for the major, non-principal major, and minor arcs. Our result is contextualized alongside other recent results in partition asymptotics.














This page was built for publication: Partitions into semiprimes

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