Lattice exit models
S. Gill Williamson · arXiv (Cornell University) · 2017
We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale regularities of labels) they provide concrete geometric examples of ZFC independence. We note some combinatorial and algorithmic implications.