منابع مشابه
Accelerated Adaptive Markov Chain for Partition Function Computation
We propose a novel Adaptive Markov Chain Monte Carlo algorithm to compute the partition function. In particular, we show how to accelerate a flat histogram sampling technique by significantly reducing the number of “null moves” in the chain, while maintaining asymptotic convergence properties. Our experiments show that our method converges quickly to highly accurate solutions on a range of benc...
متن کاملThe Dimer Partition Function
We apply the Ginzburg criterion to the dimer problem and we solve the apparent contradiction of a system with mean field α = 12 , the typical value of tricritical systems, and upper critical dimension Dcr = 6. We find that the system has upper critical dimensionDcr = 6 , while for D ≤ 4 it should undergo a first order phase transition. We comment on the latter wrong result examining the approxi...
متن کاملThe Partition Function Revisited
In 1918, Hardy and Ramanujan wrote their landmark paper deriving the asymptotic formula for the partition function. The paper however was fundamental for another reason, namely for introducing the circle method in questions of additive number theory. Though this method is powerful, it is often difficult and technically complicated to employ. In 2011, Bruinier and Ono discovered a new algebraic ...
متن کاملFast Skew Partition Recognition
Chvátal defined a skew partition of a graph G to be a partition of its vertex set into two non-empty parts A and B such that A induces a disconnected subgraph of G and B induces a disconnected subgraph of G. Skew partitions are important in the characterization of perfect graphs. De Figuereido et al. presented a polynomial time algorithm which given a graph either finds a skew partition or dete...
متن کاملCongruences of the Partition Function
Ramanujan also conjectured that congruences (1) exist for the cases A = 5 , 7 , or 11 . This conjecture was proved by Watson [17] for the cases of powers of 5 and 7 and Atkin [3] for the cases of powers of 11. Since then, the problem of finding more examples of such congruences has attracted a great deal of attention. However, Ramanujan-type congruences appear to be very sparse. Prior to the la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2016
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2016.01.017