A random minimax
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 66 (2011) no. 2, pp. 421-426

Voir la notice de l'article provenant de la source Math-Net.Ru

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: minimax
Mots-clés : random matrix, inclusion-exclusion.
@article{RM_2011_66_2_a4,
     author = {H. L. Montgomery},
     title = {A random minimax},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {421--426},
     publisher = {mathdoc},
     volume = {66},
     number = {2},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2011_66_2_a4/}
}
TY  - JOUR
AU  - H. L. Montgomery
TI  - A random minimax
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2011
SP  - 421
EP  - 426
VL  - 66
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/RM_2011_66_2_a4/
LA  - en
ID  - RM_2011_66_2_a4
ER  - 
%0 Journal Article
%A H. L. Montgomery
%T A random minimax
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2011
%P 421-426
%V 66
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/RM_2011_66_2_a4/
%G en
%F RM_2011_66_2_a4
H. L. Montgomery. A random minimax. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 66 (2011) no. 2, pp. 421-426. http://geodesic.mathdoc.fr/item/RM_2011_66_2_a4/