Lattice exit models

2017/05/19 by S. Gill Williamson, Williamson, S. Gill · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1705.06838

arxiv created 2017/08/28 · arxiv updated 2017/08/29

Abstract

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.

Cited by

• On the difficulty of proving P equals NP in ZFC

Related

• Graphs, lattices and deconstruction hierarchies
• Maximal Closed Set and Half-Space Separations in Finite Closure Systems
• Lattices freely generated by posets within a variety. Part I: Four easy varieties
• Finding models through graph saturation
• The Systematic Normal Form of Lattices