Partitions into semiprimes

Abstract

Let P denote the set of primes and N⊂ N be a set with arbitrary weights attached to its elements. Set pN(n) to be the restricted partition function which counts partitions of n with all its parts lying in N. By employing a suitable variation of the Hardy-Littlewood circle method we provide the asymptotic formula of pN(n) for the set of semiprimes N = \p1 p2 : p1, p2 ∈ P\ 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 pN(n) for general weighted sets N by assigning different strategies for the major, non-principal major, and minor arcs. Our result is contextualized alongside other recent results in partition asymptotics.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…