Results 1 
9 of
9
Boltzmann Samplers For The Random Generation Of Combinatorial Structures
 Combinatorics, Probability and Computing
, 2004
"... This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models. The idea is to perform random generation of possibly complex structured objects by placing an appropriate measure spread over the whole of a combina ..."
Abstract

Cited by 67 (2 self)
 Add to MetaCart
This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models. The idea is to perform random generation of possibly complex structured objects by placing an appropriate measure spread over the whole of a combinatorial class  an object receives a probability essentially proportional to an exponential of its size. As demonstrated here, the resulting algorithms based on realarithmetic operations often operate in linear time. They can be implemented easily, be analysed mathematically with great precision, and, when suitably tuned, tend to be very efficient in practice.
Random Sampling from Boltzmann Principles
, 2002
"... This extended abstract proposes a surprisingly simple framework for the random generation of combinatorial configurations based on Boltzmann models. Random generation of possibly complex structured objects is performed by placing an appropriate measure spread over the whole of a combinatorial class. ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
This extended abstract proposes a surprisingly simple framework for the random generation of combinatorial configurations based on Boltzmann models. Random generation of possibly complex structured objects is performed by placing an appropriate measure spread over the whole of a combinatorial class. The resulting algorithms can be implemented easily within a computer algebra system, be analysed mathematically with great precision, and, when suitably tuned, tend to be efficient in practice, as they often operate in linear time.
The limit shape and fluctuations of random partitions of naturals with fixed number of summands
 Moscow Math. J
, 2001
"... Dedicated to Robert Minlos on the occasion of his 70 th birthday Abstract. We consider the uniform distribution on the set of partitions of integer n with c √ n numbers of summands, c> 0 is a positive constant. We calculate the limit shape of such partitions, assuming c is constant and n tends to in ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Dedicated to Robert Minlos on the occasion of his 70 th birthday Abstract. We consider the uniform distribution on the set of partitions of integer n with c √ n numbers of summands, c> 0 is a positive constant. We calculate the limit shape of such partitions, assuming c is constant and n tends to infinity. If c → ∞ then the limit shape tends to known limit shape for unrestricted number of summands (see reference [11]). If the growth is slower than √ n then the limit shape is universal (e −t). We prove the invariance principle (central limit theorem for fluctuations around the limit shape) and find precise expression for correlation functions. These results can be interpreted in terms of statistical physics of ideal gas, from this point of view the limit shape is a limit distribution of the energy of two dimensional ideal gas with respect to the energy of particles. The proof of the limit theorem uses partially inversed Fourier transformation of the characteristic function and refines the methods of the previous papers of authors (see references).
The Wulff construction in statistical mechanics and in combinatorics. Russ
 Math. Surv
, 2001
"... We present the geometric solutions to some variational problems of statistical mechanics and combinatorics. Together with the Wulff construction, which predicts the shape of the crystals, we discuss the construction which exhibit the shape of a typical Young diagram and of a typical skyscraper. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present the geometric solutions to some variational problems of statistical mechanics and combinatorics. Together with the Wulff construction, which predicts the shape of the crystals, we discuss the construction which exhibit the shape of a typical Young diagram and of a typical skyscraper.
The nature of partition bijections II. Asymptotic stability
"... We introduce a notion of asymptotic stability for bijections between sets of partitions and a class of geometric bijections. We then show that a number of classical partition bijections are geometric and that geometric bijections under certain conditions are asymptotically stable. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We introduce a notion of asymptotic stability for bijections between sets of partitions and a class of geometric bijections. We then show that a number of classical partition bijections are geometric and that geometric bijections under certain conditions are asymptotically stable.
Kronecker products, characters, partitions, and the tensor square conjectures
"... Abstract. We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups Sn contain all irreducibles as their constituents. Our main result is that they contain representations corresponding to hooks and two row Young diagrams. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups Sn contain all irreducibles as their constituents. Our main result is that they contain representations corresponding to hooks and two row Young diagrams. For that, we develop a new sufficient condition for the positivity of Kronecker coefficients in terms of characters, and use combinatorics of rim hook tableaux combined with known results on unimodality of certain partition functions. We also present connections and speculations on random characters of Sn. 1. Introduction and
A note on limit shapes of minimal difference partitions
, 801
"... We provide a variational derivation of the limit shape of minimal difference partitions and discuss the link with exclusion statistics. This paper is dedicated to Professor Leonid Pastur for his 70th anniversary. A partition of a natural integer E [1] is a decomposition of E as a sum of a nonincreas ..."
Abstract
 Add to MetaCart
We provide a variational derivation of the limit shape of minimal difference partitions and discuss the link with exclusion statistics. This paper is dedicated to Professor Leonid Pastur for his 70th anniversary. A partition of a natural integer E [1] is a decomposition of E as a sum of a nonincreasing sequence of positive integers {hj}, i.e., E = ∑ j hj such that hj ≥ hj+1, for j = 1,2.... For example, 4 can be partitioned in 5 ways: 4, 3 + 1,
Hydrodynamic limit for an evolutional model of twodimensional Young diagrams
, 2009
"... We construct dynamics of twodimensional Young diagrams, which are naturally associated with their grandcanonical ensembles, by allowing the creation and annihilation of unit squares located at the boundary of the diagrams. The grandcanonical ensembles, which were introduced by Vershik [17], are uni ..."
Abstract
 Add to MetaCart
We construct dynamics of twodimensional Young diagrams, which are naturally associated with their grandcanonical ensembles, by allowing the creation and annihilation of unit squares located at the boundary of the diagrams. The grandcanonical ensembles, which were introduced by Vershik [17], are uniform measures under conditioning on their size (or equivalently, area). We then show that, as the averaged size of the diagrams diverges, the corresponding height variable converges to a solution of a certain nonlinear partial differential equation under a proper hydrodynamic scaling. Furthermore, the stationary solution of the limit equation is identified with the socalled Vershik curve. We discuss both uniform and restricted uniform statistics for the Young diagrams. 1
unknown title
, 1999
"... Geometric variational problems of statistical mechanics and of combinatorics ..."
Abstract
 Add to MetaCart
Geometric variational problems of statistical mechanics and of combinatorics