Tiny non-Leighton complexes
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910926744059904 |
|---|---|
| author | Dergacheva, Natalia S. Klyachko, Anton A. |
| author_facet | Dergacheva, Natalia S. Klyachko, Anton A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_09803 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tiny non-Leighton complexes Dergacheva, Natalia S. Klyachko, Anton A. Geometric Topology Combinatorics Group Theory 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. |
| title | Tiny non-Leighton complexes |
| topic | Geometric Topology Combinatorics Group Theory |
| url | https://arxiv.org/abs/2403.09803 |