10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Polynomial Partition Asymptotics

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Let \(f \in \mathbb{Z}[y]\) be a polynomial such that \(f(\mathbb{N}) \subseteq \mathbb{N}\), and let \(p_{\mathcal{A}_{f}}(n)\) denote number of partitions of \(n\) whose parts lie in the set \(\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}\). Under hypotheses on the roots of \(f-f(0)\), we use the Hardy--Littlewood circle method, a polylogarithm identity, and the Matsumoto--Weng zeta function to derive asymptotic formulae for \(p_{\mathcal{A}_f}(n)\), and the growth function \(p_{A_f}(n+1)-p_{\mathcal{A}_f}(n)\), as \(n\) tends to infinity. This generalises the analogous asymptotic formulae for number of partitions into perfect \(k\)th powers, established by Vaughan for \(k=2\), and Gafni for the case \(k \geq 2\), in 2015 and 2016 respectively.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: not found
          • Article: not found

          Asymptotic Formulaae in Combinatory Analysis

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Asymptotic partition formulae. III. Partitions into k-th powers

            E. WRIGHT (1934)
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Squares: Additive questions and partitions

              This memoir is concerned with a number of additive questions in which squares occur. For ternary additive problems with at least one square, the exceptional set is considered and it is shown that current methods cannot be sharpened substantially. In a different direction, but using cognate methods, an asymptotic formula is obtained for the number of partitions of a number into squares.
                Bookmark

                Author and article information

                Journal
                2017-04-30
                Article
                1705.00384
                d5efc625-8acf-4e8d-8e13-e0d8a93bcc3f

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Primary 11P05, 11P55, 11P82
                22 pages
                math.NT

                Number theory
                Number theory

                Comments

                Comment on this article