A random minimax

H. L. Montgomery

University of Michigan, USA

Abstract: Stones are placed randomly on an $m\times n$ board, one at a time, with no more than one stone per unit cell. By means of a two-dimensional cross-classification, a formula is derived for the probability that a row becomes full (with $n$ stones) at a time when there is another row that is still entirely empty.
Bibliography: 2 titles.

Keywords: random matrix, minimax, inclusion-exclusion.

UDC: 519.212.2

MSC: Primary 05A05; Secondary 33C05

Received: 03.10.2010

DOI: 10.4213/rm9422

 English version: Russian Mathematical Surveys, 2011, 66:2, 421–426

Bibliographic databases:

• 
• 
• 
• 
• 
•