zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Rectangular arrays with fixed margins. (English) Zbl 0839.05005
Aldous, David (ed.) et al., Discrete probability and algorithms. Proceedings of the workshops “Probability and algorithms” and “The finite Markov chain renaissance” held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993. New York, NY: Springer-Verlag. IMA Vol. Math. Appl. 72, 15-41 (1995).
This is an elegant survey article about the number of rectangular arrays of nonnegative integers with given row and column sums and its importance in various combinatorial and statistical applications. The combinatorial problems include magical squares, enumeration of permutations by descents, enumeration of double cosets, the description of tensor product decompositions, Young tableaux and Kostka numbers. The statistical applications focus on tests for independence in contingency tables with given margins. Several exact and approximative methods for determining the array numbers are described. The computational complexity is discussed. The authors also present Monte Carlo techniques based on Markov chains on the set of arrays with prespecified margins. For the entire collection see [Zbl 0822.00011].

05A15Exact enumeration problems, generating functions
60G50Sums of independent random variables; random walks
60C05Combinatorial probability
60J10Markov chains (discrete-time Markov processes on discrete state spaces)
05A16Asymptotic enumeration
62H17Contingency tables (statistics)
65C05Monte Carlo methods
05B15Orthogonal arrays, Latin squares, Room squares