加载中…
The shadow-complexity is an invariant of closed -manifolds defined by using -dimensional polyhedra called Turaev’s shadows, which, roughly speaking, measures how complicated a -skeleton of the -manifold is. In this paper, we define a new version of shadow-complexity depending on an extra parameter , and we investigate the relationship between this complexity and the trisection genus . More explicitly, we prove an inequality for any closed -manifold and any . Moreover, we determine the exact values of for infinitely many -manifolds, and also we classify all the closed -manifolds with .

生成讲解博客的中文版本

生成AI智能校验的中文版本