Simple upper bounds for partition functions
From MaRDI portal
Publication:1039627
DOI10.1007/s11139-007-9022-zzbMath1195.11138OpenAlexW2077614283MaRDI QIDQ1039627
Publication date: 23 November 2009
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-007-9022-z
Related Items
On the number of conjugacy classes of a primitive permutation group, Gaussian polytopes: a cumulant-based approach, Divisor sequences of atoms in Krull monoids, A Polyakov formula for sectors, Effective bounds for Fourier coefficients of certain weakly holomorphic modular forms, Polynomial approximation of anisotropic analytic functions of several variables, On the parameterized complexity of the acyclic matching problem, A comparison of Integer partitions based on smallest part, On the cardinality of lower sets and universal discretization, On the dimension of matrix embeddings of torsion-free nilpotent groups, On explaining integer vectors by few homogeneous segments, Estimates for the norms of products of sines and cosines, On the Malle–Navarro conjecture for 2- and 3-blocks of general linear and unitary groups, A shortest path-based approach to the multileaf collimator sequencing problem, Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters, On the involution fixity of simple groups, Quasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems
Cites Work
- The distribution of the number of summands in the partitions of a positive integer
- Elementary Methods in Number Theory
- A Convergent Series for the Partition Function p ( n )
- On the Partition Function p (n )
- Revisiting Rademacher's formula for the partition function \(p(n)\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
