A random minimax
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 66 (2011) no. 2, pp. 421-426
Cet article a éte moissonné depuis 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.
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},
year = {2011},
volume = {66},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/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/
[1] G. E. Andrews, R. Askey, R. Roy, Special functions, Encyclopedia Math. Appl., 71, Cambridge Univ. Press, Cambridge, 1999, xii+664 pp. | MR | Zbl
[2] R. Askey, Orthogonal polynomials and special functions, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1975, vii+110 pp. | MR | Zbl