Sciweavers

10 search results - page 2 / 2
» A Combinatorial Proof of the Sum of q-Cubes
Sort
View
FOCS
2006
IEEE
13 years 11 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
13 years 8 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 6 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
DCG
2010
84views more  DCG 2010»
13 years 4 months ago
Matroid Polytopes and their Volumes
We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the...
Federico Ardila, Carolina Benedetti, Jeffrey Doker
JCT
2007
97views more  JCT 2007»
13 years 4 months ago
What power of two divides a weighted Catalan number?
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
Alexander Postnikov, Bruce E. Sagan