EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 21

Odd cutsets and the hard-core model on $ℤ^{d}$

Ron Peled, Wojciech Samotij (2014)

Annales de l'I.H.P. Probabilités et statistiques

We consider the hard-core lattice gas model on $ℤ^{d}$ and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds $C d^{- 1 / 3} {(log d)}^{2}$ , the model exhibits multiple hard-core measures, thus improving the previous bound of $C d^{- 1 / 4} {(log d)}^{3 / 4}$ given by Galvin and Kahn. At the heart of our approach lies the study of a certain class of edge cutsets in $ℤ^{d}$ , the so-called odd cutsets, that appear naturally as the boundary between different phases in the hard-core model. We provide a refined combinatorial...

On a balanced property of derangements.

Bóna, Miklós (2006)

The Electronic Journal of Combinatorics [electronic only]

On an integer sequence related to a product of trigonometric functions, and its combinatorial relevance.

Andrica, Dorin, Tomescu, Ioan (2002)

Journal of Integer Sequences [electronic only]

On averages of randomized class functions on the symmetric groups and their asymptotics

Paul-Olivier Dehaye, Dirk Zeindler (2013)

Annales de l’institut Fourier

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices ( $n$ points). In this paper, we generalize many aspects of this situation. We introduce random shifts of the eigenvalues of the permutation matrices, in two different ways: independently or not for each subset of eigenvalues associated to the same cycle. We also consider vastly more general functions than the characteristic polynomial of a permutation matrix, by...

On colored set partitions of type B n

David Wang (2014)

Open Mathematics

Generalizing Reiner’s notion of set partitions of type B n, we define colored B n-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored B n-partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored B n-partition. We find an asymptotic expression of the total number of colored B n-partitions up to an error of O(n −1/2log7/2 n], and prove that the centralized and...