Shadow-complexity and trisection genus
Abstract
The shadow-complexity is an invariant of closed 4-manifolds defined by using 2-dimensional polyhedra called Turaev's shadows, which, roughly speaking, measures how complicated a 2-skeleton of the 4-manifold is. In this paper, we define a new version scr of shadow-complexity depending on an extra parameter r≥0, and we investigate the relationship between this complexity and the trisection genus g. More explicitly, we prove an inequality g(W) ≤ 2+2scr(W) for any closed 4-manifold W and any r≥1/2. Moreover, we determine the exact values of sc1/2 for infinitely many 4-manifolds, and also we classify all the closed 4-manifolds with sc1/2≤1/2.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.