Minimal non-face of the triangulations
Ginji Hamano

TL;DR
This paper investigates the minimal non-faces of triangulations of the standard unit d-cube, demonstrating shellability and calculating the h-polynomial, thereby advancing understanding of their combinatorial structure.
Contribution
It introduces the concept of minimal non-faces in triangulations of the d-cube and proves shellability along with deriving the h-polynomial for these triangulations.
Findings
Triangulations of the d-cube are shellable.
Explicit calculation of the h-polynomial for these triangulations.
Identification of minimal non-faces in the triangulations.
Abstract
In this paper, we discuss about the minimal non-faces of the triangulations by the path of the standard unit -cube. Moreover, we will show that is shellable and the result of the calculation for -polynomial of .
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
TopicsMathematics and Applications
