Partitions into Piatetski-Shapiro sequences

Abstract

Let be a positive real number and m∈N\∞\ be given. Let p, m(n) denote the number of partitions of n into the parts from the Piatestki-Shapiro sequence ( )∈ N with at most m times (repetition allowed). In this paper we establish asymptotic formulas of Hardy-Ramanujan type for p, m(n), by employing a framework of asymptotics of partitions established by Roth-Szekeres in 1953, as well as some results on equidistribution.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…