Corpus ID: 229923020

Maximum entropy and integer partitions

@inproceedings{McKinley2020MaximumEA,
  title={Maximum entropy and integer partitions},
  author={Gweneth McKinley and M. Michelen and Will Perkins},
  year={2020}
}
We derive asymptotic formulas for the number of integer partitions with given sums of jth powers of the parts for j belonging to a finite, non-empty set J ⊂ N. The method we use is based on the ‘principle of maximum entropy’ of Jaynes. This principle leads to an intuitive variational formula for the asymptotics of the logarithm of the number of constrained partitions as the solution to a convex optimization problem over real-valued functions. 

Figures from this paper

References

SHOWING 1-10 OF 52 REFERENCES
Large deviations for integer partitions
  • 36
  • PDF
A generalized Hardy-Ramanujan formula for the number of restricted integer partitions
  • 2
  • PDF
Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
  • 37
  • Highly Influential
  • PDF
MAXIMUM ENTROPY FOR REDUCED MOMENT PROBLEMS
  • 110
  • PDF
The structure of random partitions of large integers
  • 132
  • PDF
Maximum entropy in the problem of moments
  • 500
  • PDF
From recursions to asymptotics: on Szekeres' formula for the number of partitions
  • 28
  • PDF
Entropy, optimization and counting
  • 57
  • PDF
Random Partitions with Non Negative rth Differences
  • 19
  • PDF
...
1
2
3
4
5
...