pith. sign in

arxiv: math/9905194 · v1 · submitted 1999-05-31 · 🧮 math.CO

The still-Life density problem and its generalizations

classification 🧮 math.CO
keywords neighborsdensityelementlifethreeconjectureeverylattice
0
0 comments X
read the original abstract

A "still Life" is a subset S of the square lattice Z^2 fixed under the transition rule of Conway's Game of Life, i.e. a subset satisfying the following three conditions: 1. No element of Z^2-S has exactly three neighbors in S; 2. Every element of S has at least two neighbors in S; 3. Every element of S has at most three neighbors in S. Here a ``neighbor'' of any x \in Z^2 is one of the eight lattice points closest to x other than x itself. The "still-Life conjecture" is the assertion that a still Life cannot have density greater than 1/2 (a bound easily attained, for instance by {(x,y): x is even}). We prove this conjecture, showing that in fact condition 3 alone ensures that S has density at most 1/2. We then consider variations of the problem such as changing the number of allowed neighbors or the definition of neighborhoods; using a variety of methods we find some partial results and many new open problems and conjectures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finding codes on infinite grids automatically

    math.CO 2023-03 unverdicted novelty 5.0

    New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.