Scholarlink

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

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Tiny non-Leighton complexes

  • 期刊论文

  • 发表日期：

    2025年5月3日

查看全文
  • Natalia S. Dergacheva,
  • Anton A. Klyachko

摘要

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