Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
14 - Asymptotic formulas for partitions with bounded multiplicity
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 235 - 254Publisher: Cambridge University PressPrint publication year: 2014
References
[1] and , On Ingham's Tauberian theorem for partitions. Proc. Cambridge Philos. Soc. 48, 566–570, 1952.Google Scholar
[2] , Revisiting Rademacher's formula for the partition function p(n). Ramanujan J. 4, 455–467, 2000.Google Scholar
[3] , A general asymptotic formula for partitions. Proc. Am. Math. Soc. 1, 182–191, 1950.Google Scholar
[5] , and , Number of representations related to linear recurrent basis. Acta Arith. 88(4), 371–396, 1999.Google Scholar
[7] , On an elementary proof of some asymptotic formulae in the theory of partitions. Ann. Math. (2) 43, 437–450, 1942.Google Scholar
[8] and , Concerning periodicity in the asymptotic behavior of partition functions. J. Aust. Math. Soc. Ser. A 21, 447–456, 1976.Google Scholar
[9] and , Partitions into summands of the form [mα]. Proceedings of the Seventh Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1977), pp. 371–377. Utilitas Math., Winnipeg, Man., 1978.
[10] , and , Partition functions in numeration systems with bounded multiplicity. Unif. Distrib. Theory 9(1), 43–77, 2014.Google Scholar
[11] and , Analytic Combinatorics. Cambridge University Press, Cambridge, 2009.
[12] and , Table of Integrals, Series, and Products, seventh edition. Academic Press, San Diego, CA, 2007.
[13] , Jr., Partitions with a restriction on the multiplicity of the summands. Trans. Am. Math. Soc. 155, 375–384, 1971.Google Scholar
[14] and , Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. Ser. 2 17, 75–115, 1918.Google Scholar
[15] , On the number of partitions of a number into unequal parts. Trans. Am. Math. Soc. 51, 939–961, 1942.Google Scholar
[19] , The evaluation of the constant in the formula for the number of partitions of n. Am. J. Math. 73, 599–601, 1951.Google Scholar
[21] Protasov, Asymptotic behavior of the partition function. Sb. Math. 191, 381–414, 2000.Google Scholar
[22] , On the expansion of the partition function in a series, Ann. Math. 44, 416–422, 1943.Google Scholar
[23] , Some binary partition functions. Analytic Number Theory (AllertonPark, IL, 1989). Progress in Mathematics, volume 85, pp. 451–47. Birkhäuser, Boston, MA, 1990.
[26] and , Some asymptotic formulae in the theory of partitions. Q. J. Math. Oxford 5(2), 241–259, 1954.Google Scholar
[27] , Einige Anwendungen Tauberscher Sätze in der Zahlentheorie. C: Mahler's Partitionsproblem. J. Reine Angew. Math. 228, 182–188, 1967.Google Scholar
[28] , Statistical mechanics and the partition of numbers I. The transition of liquid helium. Proc. R. Soc. London 109, 361–375, 1949.Google Scholar
[29] , Asymptotic partition formulae, III. Partitions into kth powers. Acta Math. 63, 143–191, 1934.Google Scholar
- 2
- Cited by