English
Related papers

Related papers: Linear extensions and shelling orders

200 papers

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Combinatorics · Mathematics 2015-03-03 Thomas Gobet , Nathan Williams

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

We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for…

Combinatorics · Mathematics 2021-03-12 Bridget Eileen Tenner

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

Combinatorics · Mathematics 2022-11-02 Christian Gaetz , Yibo Gao

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler

In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…

Combinatorics · Mathematics 2010-11-05 Drew Armstrong , Patricia Hersh

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading

We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of…

Combinatorics · Mathematics 2007-05-23 I. Novik , A. Postnikov , B. Sturmfels

We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…

Combinatorics · Mathematics 2019-01-28 Sophie Morier-Genoud , Valentin Ovsienko

We utilize the coherent-constructible correspondence to construct full strongly exceptional collections of nef line bundles in the derived category of a toric variety through the combinatorics of constructible sheaves built from polytopes.…

Algebraic Geometry · Mathematics 2023-11-08 Mario Sanchez

It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…

Logic · Mathematics 2013-10-18 Denis I. Saveliev

Cosetal extensions of monoids generalise extensions of groups, special Schreier extensions of monoids and Leech's normal extensions of groups by monoids. They share a number of properties with group extensions, including a notion of Baer…

Rings and Algebras · Mathematics 2022-01-19 Peter Faul , Graham Manuell

We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a…

Commutative Algebra · Mathematics 2008-12-01 Anda Olteanu

We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…

Combinatorics · Mathematics 2018-11-20 Monique Laurent , Shin-ichi Tanigawa

We call a central extension bounded if its Euler class is represented by a bounded cocycle. We prove that a bounded central extension of a hierarchically hyperbolic group (HHG) is still a HHG; conversely if a central extension is a HHG,…

Group Theory · Mathematics 2026-01-07 Francesco Fournier-Facio , Giorgio Mangioni , Alessandro Sisto

Panhandle matroids are a specific family of lattice-path matroids corresponding to panhandle-shaped Ferrers diagrams. Their matroid polytopes are the subpolytopes carved from a hypersimplex to form matroid polytopes of paving matroids. It…

Combinatorics · Mathematics 2025-05-30 Danai Deligeorgaki , Daniel McGinnis , Andrés R. Vindas-Meléndez

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

Every irreducible odd dimensional representation of the $n$'th symmetric or hyperoctahedral group, when restricted to the $(n-1)$'th, has a unique irreducible odd-dimensional constituent. Furthermore, the subgraph induced by odd-dimensional…

Representation Theory · Mathematics 2021-12-07 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Rudi Pendavingh , Geva Yashfe

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

Combinatorics · Mathematics 2025-09-17 Nathan Bowler , Attila Joó