English
Related papers

Related papers: Linear extensions and shelling orders

200 papers

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

Combinatorics · Mathematics 2024-10-29 Paolo Sentinelli

Inspired by Bruggesser-Mani's line shellings of polytopes, we introduce line shellings for the lattice of flats of a matroid: given a normal complex for a Bergman fan of a matroid induced by a building set, we show that the lexicographic…

Combinatorics · Mathematics 2026-01-09 Spencer Backman , Galen Dorpalen-Barry , Anastasia Nathanson , Ethan Partida , Noah Prime

The Bruhat order on a Coxeter group is often described by examining subexpressions of a reduced expression. We prove that an analogous description applies to the Bruhat order on double cosets. This establishes the compatibility of the…

Combinatorics · Mathematics 2024-01-08 Ben Elias , Hankyung Ko , Nicolas Libedinsky , Leonardo Patimo

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

Combinatorics · Mathematics 2022-06-28 Angela Carnevale , Matthew Dyer , Paolo Sentinelli

We show that any lower Bruhat interval in a Coxeter group is a disjoint union of certain two-sided cosets as a consequence of Lifting Property and Subword Property. Furthermore, we describe these details in terms of Bruhat graphs, graded…

Combinatorics · Mathematics 2018-12-18 Masato Kobayashi

We provide a weaker version of the generalized lifting property which holds in complete generality for all finite Coxeter groups, and we use it to show that every parabolic Bruhat interval of a finite Coxeter group is a Coxeter matroid. We…

Combinatorics · Mathematics 2019-04-24 Fabrizio Caselli , Michele D'Adderio , Mario Marietti

We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…

Combinatorics · Mathematics 2007-05-23 Patricia Palacios , Maria Ronco

We develop combinatorics of parabolic double cosets in finite Coxeter groups as a follow-up of recent articles by Billey-Konvalinka-Petersen-Slofstra-Tenner and Petersen. (1) We construct a double coset system as a generalization of a…

Combinatorics · Mathematics 2019-07-30 Masato Kobayashi

A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…

Combinatorics · Mathematics 2025-01-22 Winfried Hochstättler , Michael Wilhelmi

The higher Bruhat orders $\mathcal{B}(n,k)$ were introduced by Manin-Schechtman to study discriminantal hyperplane arrangements and subsequently studied by Ziegler, who connected $\mathcal{B}(n,k)$ to oriented matroids. In this paper, we…

Combinatorics · Mathematics 2024-12-17 Herman Chau

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…

Group Theory · Mathematics 2019-08-15 Matthew Dyer

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…

Combinatorics · Mathematics 2026-04-07 Spencer Backman , Francisco Santos , Chi Ho Yuen

Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…

Representation Theory · Mathematics 2015-08-14 Seth Shelley-Abrahamson , Suhas Vijaykumar

Coxeter matroids generalize matroids just as flag varieties of Lie groups generalize Grassmannians. Valuations of Coxeter matroids are functions that behave well with respect to subdivisions of a Coxeter matroid into smaller ones. We…

Combinatorics · Mathematics 2021-01-27 Christopher Eur , Mario Sanchez , Mariel Supina

In this paper we present a definition of oriented Lagrangian symplectic matroids and their representations. Classical concepts of orientation and this extension may both be thought of as stratifications of thin Schubert cells into unions of…

Combinatorics · Mathematics 2007-05-23 Richard F. Booth , Alexandre V. Borovik , Israel M. Gelfand , Neil White

We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.

Representation Theory · Mathematics 2017-01-11 Ben Elias , Geordie Williamson

Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the…

Combinatorics · Mathematics 2017-08-18 Robert Brijder

In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…

Combinatorics · Mathematics 2022-12-07 Neil J. Y. Fan , Yao Li

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Combinatorics · Mathematics 2009-03-30 Drew Armstrong
‹ Prev 1 2 3 10 Next ›