English
Related papers

Related papers: Order polytopes of crown posets

200 papers

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

Combinatorics · Mathematics 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

In this paper, we study the Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_{h}$ associated to vectors $h\in\Z^{n}$ as well as $\widehat{\mathcal{P}}$…

Representation Theory · Mathematics 2025-05-06 Fang Li , Jie Pan

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…

Combinatorics · Mathematics 2012-12-19 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

Antimonotonous quadratic forms generalizing P-faithful posets defined by authors earlier are introduced. The criterion of antimonotonousness is given for posets with positive semidefinite quadratic forms. As consequence the new proofs of…

Representation Theory · Mathematics 2007-05-23 L. A. Nazarova , A. V. Roiter , M. N. Smirnova

It is known that Shintani zeta functions, which generalise multiple zeta functions, extend to meromorphic functions with poles on affine hyperplanes. We refine this result in showing that the poles lie on hyperplanes parallel to the facets…

Number Theory · Mathematics 2022-06-01 Diego A. Lopez

A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…

Combinatorics · Mathematics 2023-10-26 Arnau Padrol , Eva Philippe

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…

Specht polynomials classically realize the irreducible representations of the symmetric group. The ideals defined by these polynomials provide a strong connection with the combinatorics of Young tableaux and have been intensively studied by…

Combinatorics · Mathematics 2023-05-30 Sebastian Debus , Philippe Moustrou , Cordian Riener , Hugues Verdure

The Ehrhart polynomial and Ehrhart series count lattice points in integer dilations of a lattice polytope. We introduce and study a $q$-deformation of the Ehrhart series, based on the notions of harmonic spaces and Macaulay's inverse…

Combinatorics · Mathematics 2024-09-25 Victor Reiner , Brendon Rhoades

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

Combinatorics · Mathematics 2015-08-26 Andrew Timothy Wilson

We describe an efficient method for computing the Ehrhart polynomial of Gelfand--Tsetlin polytopes arising from Kostka coefficients. The key idea is to exploit Ehrhart--Macdonald reciprocity: evaluating the Ehrhart polynomial at negative…

Combinatorics · Mathematics 2026-05-29 Per Alexandersson

In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…

Combinatorics · Mathematics 2021-05-24 Luis Ferroni

Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic…

Logic · Mathematics 2020-11-26 Ivan Chajda , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

We describe an algorithm computing the monodromy and the pole order filtration on the top Milnor fiber cohomology of hypersurfaces in $\mathbb{P}^n$ whose pole order spectral sequence degenerates at the second page. In the case of…

Algebraic Geometry · Mathematics 2017-10-05 Alexandru Dimca , Gabriel Sticlaru

Mixture models on order relations play a central role in recent investigations of transitivity in binary choice data. In such a model, the vectors of choice probabilities are the convex combinations of the characteristic vectors of all…

Combinatorics · Mathematics 2015-11-03 Jean-Paul Doignon , Selim Rexhep

For a poset P, a subposet A, and an order preserving map F from A into the real numbers, the marked order polytope parametrizes the order preserving extensions of F to P. We show that the function counting integral-valued extensions is a…

Combinatorics · Mathematics 2014-07-21 Katharina Jochemko , Raman Sanyal

In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…

Combinatorics · Mathematics 2025-07-21 Ekaterina V. Melikhova

The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has…

Combinatorics · Mathematics 2021-08-24 Stefan Felsner , Torsten Ueckerdt , Kaja Wille

We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…

Combinatorics · Mathematics 2009-10-27 Yonah Cherniavsky

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…

Combinatorics · Mathematics 2020-02-25 Alexander Garver , Stefan Grosser , Jacob P. Matherne , Alejandro H. Morales