REVIEW
Octahedralizing 3-colorable 3-polytopes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Octahedralizing 3-colorable 3-polytopes
classification
math.CO
keywords
colorablepolytopeadditionalanswerboundarycomplexcross-polytopaldimension
read the original abstract
We investigate the question of whether any $d$-colorable simplicial $d$-polytope can be octahedralized, i.e., it can be subdivided to a $d$-dimensional geometric cross-polytopal complex. We give a positive answer in dimension $3$, with the additional property that the octahedralization introduces no new vertices on the boundary of the polytope.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.