Simple upper bounds for partition functions

By Wladimir de Azevedo Pribitkin. 2009

36 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Joseph Bonneau
2. Anupam Datta
3. Jeremiah Blocki

Citations in the corpus

• Differentially Private Password Frequency Lists (2016, background): “(n)| ∼ 1 4n √ 3 exp ( π √ 2n 3 ) , and Pribitkin [10] proved a very similar upper bound on”