Partitions into Piatetski-Shapiro sequences
Number Theory
2021-04-06 v1 Combinatorics
Abstract
Let be a positive real number and be given. Let denote the number of partitions of into the parts from the Piatestki-Shapiro sequence with at most times (repetition allowed). In this paper we establish asymptotic formulas of Hardy-Ramanujan type for , by employing a framework of asymptotics of partitions established by Roth-Szekeres in 1953, as well as some results on equidistribution.
Keywords
Cite
@article{arxiv.2104.01886,
title = {Partitions into Piatetski-Shapiro sequences},
author = {Nian Hong Zhou and Ya-Li Li},
journal= {arXiv preprint arXiv:2104.01886},
year = {2021}
}
Comments
19 pages