A random minimax

Montgomery, H. L.

A random minimax

dc.contributor.author	Montgomery, H. L.	en_US
dc.date.accessioned	2012-04-06T20:57:42Z
dc.date.available	2012-04-06T20:57:42Z
dc.date.issued	2011	en_US
dc.identifier.citation	Montgomery, H L (2011). "A random minimax." Russian Mathematical Surveys, vol. 66, 2, 421. <http://hdl.handle.net/2027.42/90774>	en_US
dc.identifier.uri	http://stacks.iop.org/0036-0279/66/i=2/a=R05	en_US
dc.identifier.uri	https://hdl.handle.net/2027.42/90774
dc.description.abstract	Stones are placed randomly on an ##IMG## [http://ej.iop.org/images/0036-0279/66/2/R05/tex_rm_4743_img1.gif] {$ 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 ##IMG## [http://ej.iop.org/images/0036-0279/66/2/R05/tex_rm_4743_img2.gif] {$ n$} stones) at a time when there is another row that is still entirely empty. Bibliography: 2 titles.	en_US
dc.publisher	IOP Publishing	en_US
dc.title	A random minimax	en_US
dc.type	Article	en_US
dc.subject.hlbsecondlevel	Physics	en_US
dc.subject.hlbtoplevel	Science	en_US
dc.description.peerreviewed	Peer Reviewed	en_US
dc.description.bitstreamurl	http://deepblue.lib.umich.edu/bitstream/2027.42/90774/1/0036-0279_66_2_R05.pdf
dc.identifier.doi	10.1088/0036-0279-66-2-R05	en_US
dc.identifier.source	Russian Mathematical Surveys	en_US
dc.owningcollname	Physics, Department of

Files in this item

Name:: 0036-0279_66_2_R05.pdf
Size:: 201.4KB
Format:: PDF

View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.