Shadow-complexity and trisection genus
Hironobu Naoe, Masaki Ogawa

TL;DR
This paper introduces a new shadow-complexity invariant for closed 4-manifolds, explores its relationship with the trisection genus, and classifies manifolds based on this invariant, providing new insights into 4-manifold complexity.
Contribution
It defines a parameterized shadow-complexity and establishes bounds relating it to the trisection genus, including exact calculations and classifications for certain manifolds.
Findings
Proves inequality g(W) ≤ 2 + 2 sc_r(W) for r ≥ 1/2.
Determines exact sc_{1/2} values for infinitely many 4-manifolds.
Classifies all 4-manifolds with sc_{1/2} ≤ 1/2.
Abstract
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhotonic Crystals and Applications · Advanced Algebra and Logic · Semiconductor Lasers and Optical Devices
