Paper detail

Every rational polyhedron has finite split rank: new proof

Split rank of a rational polyhedron is finite. The well known proof of this is based on the fact that split closure is stronger than the Chvátal closure, and the Chvátal rank of a rational polyhedron is finite due to the result of Chvátal and Schrijver. In this note we provide an independent proof for the fact that every rational polyhedron has finite split rank. In principal, we construct a nonnegative potential function which decreases by at least one with "every" second split closure unless the integer hull of the polyhedron is reached.

preprint2016arXivOpen access

Signal facts

What is known right now

Open access1 author1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.