English
Related papers

Related papers: Signed Poset Polytopes

200 papers

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

Combinatorics · Mathematics 2026-04-13 Feihu Liu

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

Combinatorics · Mathematics 2017-12-05 Xin Fang , Ghislain Fourier , Jan-Philipp Litza , Christoph Pegel

We study conic divisorial ideals from the viewpoint of matroid theory and apply the resulting framework to toric rings arising from signed posets. For a toric ring, we describe the polytope representing divisor classes corresponding to…

Commutative Algebra · Mathematics 2026-05-05 Koji Matsushita

A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman proved that, for each k, every finite poset has a…

Combinatorics · Mathematics 2007-05-23 Glenn G. Chappell

A classical result states that the parity balance of the number of excedances of all permutations (derangements, respectively) of length $n$ is the Euler number. In 2010, Josuat-Verg\`{e}s gives a $q$-analogue with $q$ representing the…

Combinatorics · Mathematics 2020-06-25 Hsin-Chieh Liao

Stanley introduced a lattice polytope $\mathcal{C}_P$ arising from a finite poset $P$, which is called the chain polytope of $P$. The geometric structure of $\mathcal{C}_P$ has good relations with the combinatorial structure of $P$. In…

Combinatorics · Mathematics 2020-09-07 Hidefumi Ohsugi , Akiyoshi Tsuchiya

For any finite connected poset $P$, Galashin introduced a simple convex $(|P|-2)$-dimensional polytope $\mathscr{A}(P)$ called the poset associahedron. Let $P$ be a poset with a proper autonomous subposet $S$ that is a chain of size $n$.…

Combinatorics · Mathematics 2024-07-08 Son Nguyen

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

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

There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…

Combinatorics · Mathematics 2024-09-24 Eleonore Bach , Matthias Beck , Sophie Rehberg

We extend the notion of chain algebra, originally defined in \cite{GN} for finite distributive lattices, to that of finite pure posets. We show this algebra corresponds to the Ehrhart ring of a (0,1)-polytope, termed the chain polytope, and…

Combinatorics · Mathematics 2025-05-21 Dancheng Lu

The set of triangulations of a cyclic polytope possesses two a priori different partial orders, known as the higher Stasheff-Tamari orders. The first of these orders was introduced by Kapranov and Voevodsky, while the second order was…

Combinatorics · Mathematics 2022-06-14 Nicholas J. Williams

We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…

Combinatorics · Mathematics 2025-04-08 Ezgi Kantarcı Oğuz , Cem Yalım Özel , Mohan Ravichandran

Let P be a poset with elements 1,2,...,n. We say that P is sign-balanced if exactly half the linear extensions of P (regarded as permutations of 1,2,...,n) are even permutations, i.e., have an even number of inversions. This concept first…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

Polyhedral products were defined by Bahri, Bendersky, Cohen and Gitler, to be spaces obtained as unions of certain product spaces indexed by the simplices of an abstract simplicial complex. In this paper we give a very general homotopy…

Algebraic Topology · Mathematics 2024-07-02 Daisuke Kishimoto , Ran Levi

Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…

Combinatorics · Mathematics 2025-02-05 Jan Snellman

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

Combinatorics · Mathematics 2013-11-05 Jan Hladky , Andras Mathe , Viresh Patel , Oleg Pikhurko

We study a class of polyhedra associated to marked posets. Examples of these polyhedra are Gelfand-Tsetlin polytopes and cones, as well as Berenstein-Zelevinsky polytopes, all of which have appeared in the representation theory of…

Combinatorics · Mathematics 2017-11-30 Christoph Pegel

Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…

Representation Theory · Mathematics 2024-12-10 Sefi Ladkani

An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. A particularly elegant realization of the associahedron, due to S. Shnider and S. Sternberg…

Combinatorics · Mathematics 2013-12-17 Vincent Pilaud