Papers
Topics
Authors
Recent
Search
2000 character limit reached

Partitions into Piatetski-Shapiro sequences

Published 5 Apr 2021 in math.NT and math.CO | (2104.01886v1)

Abstract: Let $\kappa$ be a positive real number and $m\in\mathbb{N}\cup{\infty}$ be given. Let $p_{\kappa, m}(n)$ denote the number of partitions of $n$ into the parts from the Piatestki-Shapiro sequence $(\lfloor \ell{\kappa}\rfloor)_{\ell\in \mathbb{N}}$ with at most $m$ times (repetition allowed). In this paper we establish asymptotic formulas of Hardy-Ramanujan type for $p_{\kappa, m}(n)$, by employing a framework of asymptotics of partitions established by Roth-Szekeres in 1953, as well as some results on equidistribution.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.