English

Depth in Bingo Closure

Combinatorics 2011-10-03 v1

Abstract

Bingo is played on a 5×55\times 5 grid. Take the 25 squares to be the ground set of a closure system in which square ss is dependent on a set SS of squares iff ss completes a line - a row, column, or diagonal - with squares that are already in SS. The closure of a set SS is obtained via an iterative process in which, at each stage, the squares dependent upon the current state are added. In this paper we establish for the n×nn \times n Bingo board the maximum number of steps required in this closure process.

Keywords

Cite

@article{arxiv.1109.6693,
  title  = {Depth in Bingo Closure},
  author = {Jeffrey Beyerl and J. Bowman Light and Robert E. Jamison},
  journal= {arXiv preprint arXiv:1109.6693},
  year   = {2011}
}

Comments

6 pages

R2 v1 2026-06-21T19:12:55.767Z