Diagonal Sums of Boxed Plane Partitions

  title={Diagonal Sums of Boxed Plane Partitions},
  author={David Bruce Wilson},
  journal={Electron. J. Comb.},
  • D. Wilson
  • Published 7 December 2000
  • Mathematics
  • Electron. J. Comb.
We give a simple proof of a nice formula for the means and covariances of the diagonal sums of a uniformly random boxed plane parition. 
Volume Laws for Boxed Plane Partitions and Area Laws for Ferrers Diagrams
We asymptotically analyse the volume random variables of general, symmetric and cyclically symmetric plane partitions fitting inside a box. We consider the respective symmetry class equipped with the
Inverses of Bipartite Graphs
All bipartite graphs with a unique perfect matching whose adjacency matrices have inverses diagonally similar to non-negative matrices are characterized, which settles an open problem of Godsil on inversed graphs.
Mixing times of lozenge tiling and card shuffling Markov chains
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its
Gibbs rapidly samples colorings of G(n, d/n)
The results are the first polynomial time mixing results proven for the coloring model on G(n, d/n) for d > 1 where the number of colors does not depend on n and generalize to the hard-core model at low fugacity and to general models of soft constraints at high temperatures.
An Overview of the Deterministic Dynamic Associative Memory (DDAM) Model for Case Representation and Retrieval
The Deterministic Dynamic Associative Memory (DDAM) is a novel associative memory model which generalizes the trie model and addresses the issues of case representation and retrieval. This paper is
Combinatorial and probabilistic aspects of lattice path models
Nach einer Einordnung der Ergebnisse in ihre jeweiligen Gebiete im ersten Kapitel beschaftigt sich das zweite Kapitel mit zufalligen Pflasterungen eines Sechsecks mit 60-Grad-Rauten und festen


Generating functions for plane partitions of a given shape
For fixed integers α and β, planar arrays of integers of a given shape, in which the entries decrease at least by α along rows and at least by β along columns, are considered. For various classes of
What Is Enumerative Combinatorics
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I
Enumerative Combinatorics, volume
  • the electronic journal of combinatorics
  • 1999
the electronic journal of combinatorics
  • the electronic journal of combinatorics
  • 2001