English
Related papers

Related papers: Poset Associahedra and Stack-sorting

200 papers

The theory of polyptych lattices is a framework to obtain a family of toric degenerations whose polytopes are related by piecewise-linear transformations. It can be regarded as a generalization of toric degenerations arising from cluster…

Algebraic Geometry · Mathematics 2026-03-24 Naoki Fujita , Akihiro Higashitani

In this paper we show that the set of closure relations on a finite poset P forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense…

Combinatorics · Mathematics 2016-09-06 Michael Hawrylycz , Victor Reiner

Let $G$ be a discrete group. We prove that the category of $G$-posets admits a model structure that is Quillen equivalent to the standard model structure on $G$-spaces. As is already true nonequivariantly, the three classes of maps defining…

Algebraic Topology · Mathematics 2018-05-18 J. P. May , Marc Stephan , Inna Zakharevich

We prove that any lower unitriangular and totally nonnegative matrix gives rise to a family of polynomials with only real zeros. This has consequences for problems in several areas of mathematics. We use it to develop a general theory for…

Combinatorics · Mathematics 2026-05-22 Petter Brändén , Leonardo Saud Maia Leite

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Combinatorics · Mathematics 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

Group Theory · Mathematics 2026-03-09 Sachin Ballal , Tushar Halder

The phylogenetic tree space, introduced by Billera, Holmes, and Vogtmann, is a cone over a simplicial complex. In this short article, we construct this complex from local gluings of classical polytopes, the associahedron and the…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Daoji Huang , Dominic Spadacene

Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…

Combinatorics · Mathematics 2026-05-15 Nathan Reading

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann

The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with natural applications to mapping class groups and complex dynamics. In this article, we connect this setting with the study of…

Combinatorics · Mathematics 2024-09-17 Michael Dougherty

Motivated by various developments in algebraic combinatorics and its applications, we investigate here the fine structure of a fundamental but little known theorem, the Gerstenhaber and Schack cohomology comparison theorem.The theorem…

Algebraic Topology · Mathematics 2023-10-17 Vane Jacky , Batkam Mbatchou , Frédéric Patras , Calvin Tcheka

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

Combinatorics · Mathematics 2023-01-03 Christos A. Athanasiadis , Katerina Kalampogia-Evangelinou

Generalized permutahedra are a class of polytopes with many interesting combinatorial subclasses. We introduce pruned inside-out polytopes, a generalization of inside-out polytopes introduced by Beck--Zaslavsky (2006), which have many…

Combinatorics · Mathematics 2023-03-13 Sophie Rehberg

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

We prove that every Hassett compactification of the moduli space of weighted stable rational curves that admits both a reduction map from the Losev-Manin compactification and a reduction map to projective space is a toric variety, whose…

Algebraic Geometry · Mathematics 2024-09-16 Jasper Bown , Javier González-Anaya

We define a homology theory for a certain class of posets equipped with a representation. We show that when restricted to Boolean lattices this homology is isomorphic to the homology of the "cube" complex defined by Khovanov.

Geometric Topology · Mathematics 2009-05-22 Brent Everitt , Paul Turner

This paper introduces an inductively defined tree notation for all the faces of polytopes arising from a simplex by truncations. This notation allows us to view inclusion of faces as the process of contracting tree edges. Our notation…

Combinatorics · Mathematics 2017-08-10 Pierre-Louis Curien , Jovana Obradovic , Jelena Ivanovic

We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose…

Optimization and Control · Mathematics 2017-02-07 Antoine Deza , George Manoussakis , Shmuel Onn

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

Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…

Combinatorics · Mathematics 2010-10-12 Suho Oh