Pith. sign in

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

arxiv 1903.10178 v2 pith:RTELR265 submitted 2019-03-25 math.CO

classification math.CO
keywords colorablepolytopeadditionalanswerboundarycomplexcross-polytopaldimension
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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). Continue with ORCID to comment.

Pith tools