paper

Tiny non-Leighton complexes

arXiv:2403.09803 · doi:10.1007/s10711-025-01005-6

Abstract

How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.

5 pages. A Russian version of this paper is at http://halgebra.math.msu.su/staff/klyachko/papers.htm . V4: Minor misprint corrections

Tiny non-Leighton complexes · wovepaper