Pith. sign in

REVIEW

The flip-graph of the 4-dimensional cube is connected

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1201.6543 v2 pith:JOKYWGWC submitted 2012-01-31 math.MG math.CO

The flip-graph of the 4-dimensional cube is connected

Lionel Pournin This is my paper
classification math.MG math.CO
keywords cubedimensionalflip-graphvertexclassesconnectedconnectednessconsequence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92 487 256 triangulations, partitioned into 247 451 symmetry classes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.