OpenAlex ·

The Hibi-Li Face-Number Conjecture

Ghislain Fourier

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.23629
Original
Read it at the publisher
Topics
Computational ComplexityCombinatoricsNumber Theory

Abstract

We prove the face-number conjecture of Hibi and Li: for every finite poset, the order polytope has no more faces of any given dimension than the chain polytope. More generally, the face numbers increase weakly along the admissible family of chain--order polytopes when one order coordinate is replaced by a chain coordinate. We also prove that, unless the order and chain polytopes are unimodularly equivalent, all face-number inequalities in dimensions $2,\ldots,|P|-1$ are strict.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics