|
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.
Received: 03.10.2010
Citation:
H. L. Montgomery, “A random minimax”, Russian Math. Surveys, 66:2 (2011), 421–426
Linking options:
https://www.mathnet.ru/eng/rm9422https://doi.org/10.1070/RM2011v066n02ABEH004743 https://www.mathnet.ru/eng/rm/v66/i2/p217
|
Statistics & downloads: |
Abstract page: | 497 | Russian version PDF: | 176 | English version PDF: | 9 | References: | 37 | First page: | 20 |
|