English
Related papers

Related papers: Quadratic Gr\"obner bases arising from partially o…

200 papers

Richard Stanley introduced the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ arising from a finite partially ordered set $P$, and showed that the Ehrhart polynomial of $\mathcal{O}(P)$ is equal to that of…

Combinatorics · Mathematics 2015-07-14 Takayuki Hibi , Kazunori Matsuda , Akiyoshi Tsuchiya

Let $P$ and $Q$ be finite partially ordered sets on $[d] = \{1, \ldots, d\}$, and $\mathcal{O}(P) \subset \mathbb{R}^{d}$ and $\mathcal{O}(Q) \subset \mathbb{R}^{d}$ their order polytopes. The twinned order polytope of $P$ and $Q$ is the…

Commutative Algebra · Mathematics 2015-05-19 Takayuki Hibi , Kazunori Matsuda

It is shown that the toric ideal of the centrally symmetric configuration of the order polytope of a finite partially ordered set possesses a squarefree quadratic initial ideal. It then follows that the convex polytope arising from the…

Commutative Algebra · Mathematics 2016-01-08 Takayuki Hibi , Kazunori Matsuda , Hidefumi Ohsugi , Kazuki Shibata

Let $(P,\leq_P)$ and $(Q,\leq_Q)$ be finite partially ordered sets with $|P|=|Q|=d$, and $\mathcal{C}(P) \subset \mathbb{R}^d$ and $\mathcal{C}(Q) \subset \mathbb{R}^d$ their chain polytopes. The twinned chain polytope of $P$ and $Q$ is the…

Combinatorics · Mathematics 2020-09-08 Akiyoshi Tsuchiya

Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree…

Combinatorics · Mathematics 2016-11-17 Takayuki Hibi , Nan Li , Yoshimi Sahara , Akihiro Shikama

Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes.

Combinatorics · Mathematics 2010-01-19 Takayuki Hibi , Akihiro Higashitani

Via the theory of reverse lexicographic squarefree initial ideals of toric ideals, we give a new class of Gorenstein Fano polytopes (reflexive polytopes) arising from a pair of stable set polytopes of perfect graphs.

Commutative Algebra · Mathematics 2019-01-11 Hidefumi Ohsugi , Takayuki Hibi

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

Combinatorics · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…

Metric Geometry · Mathematics 2007-05-23 Barry Monson , Egon Schulte

An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…

Combinatorics · Mathematics 2024-06-21 Marston Conder , Isabelle Steinmann

Let $K[\mathcal{O}(P)]$ denote the toric ring of the order polytope $\mathcal{O}(P)$ of a finite partially ordered set $P$ and $K[\mathcal{C}(P)]$ that of the chain polytope $\mathcal{C}(P)$. It will be shown that $\beta_{p,…

Combinatorics · Mathematics 2018-12-27 Takayuki Hibi , Akihiro Higashitani

For a polytope P, the Chvatal closure P' is obtained by simultaneously strengthening all feasible inequalities cx <= b (with integral c) to cx <= floor(b). The number of iterations of this procedure that are needed until the integral hull…

Combinatorics · Mathematics 2012-04-27 Thomas Rothvoss , Laura Sanita

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…

Combinatorics · Mathematics 2015-10-09 Marie Albenque , Kolja Knauer

We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…

Combinatorics · Mathematics 2019-07-29 Egon Schulte , Pablo Soberón , Gordon Ian Williams

We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, we show that for any…

Combinatorics · Mathematics 2025-09-23 Ragnar Freij-Hollanti , Teemu Lundström , Aki Mori

Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a…

Functional Analysis · Mathematics 2021-06-03 Michael Jury , Igor Klep , Mark E. Mancuso , Scott McCullough , James Eldred Pascoe

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

Commutative Algebra · Mathematics 2016-10-26 Gábor Braun , Sebastian Pokutta

Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…

Combinatorics · Mathematics 2024-05-30 Claudio Alexandre Piedade , Philippe Tranchida

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

An integral convex polytope ${\mathcal P}$ is said to be Gorenstein if its toric ring $K[{\mathcal P}]$ is normal and Gorenstein. In this paper, Gorenstein cut polytopes of graphs are characterized explicitly. First, we prove that…

Combinatorics · Mathematics 2019-01-11 Hidefumi Ohsugi
‹ Prev 1 2 3 10 Next ›