2000 character limit reached
"Minesweeper" and spectrum of discrete Laplacians
Published 20 Jun 2008 in cs.DM | (0806.3480v3)
Abstract: The paper is devoted to a problem inspired by the "Minesweeper" computer game. It is shown that certain configurations of open cells guarantee the existence and the uniqueness of solution. Mathematically the problem is reduced to some spectral properties of discrete differential operators. It is shown how the uniqueness can be used to create a new game which preserves the spirit of "Minesweeper" but does not require a computer.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.