English
Related papers

Related papers: Interval structures in the Bruhat and weak orders

200 papers

Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter…

Combinatorics · Mathematics 2024-03-14 Ben Adenbaum , Jennifer Elder , Pamela E. Harris , J. Carlos Martínez Mori

Weak Bruhat interval modules of the $0$-Hecke algebra in type $A$ provide a uniform approach to studying modules associated with noteworthy families of quasisymmetric functions. Recently this kind of modules were generalized from type $A$…

Representation Theory · Mathematics 2024-10-11 Han Yang , Houyi Yu

We give a simple characterization of special matchings in lower Bruhat intervals (that is, intervals starting from the identity element) of a Coxeter group. As a byproduct, we obtain some results on the action of special matchings.

Combinatorics · Mathematics 2017-12-12 Fabrizio Caselli , Mario Marietti

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 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

The number of Bruhat intervals in Coxeter groups is finite, and for the first few lengths, the intervals were described up to an isomorphism by A. Hultman using the correspondence between Bruhat intervals and cell decompositions of a 2d…

Combinatorics · Mathematics 2021-10-05 Evgeniya Akhmedova

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

We study Bruhat intervals in affine Weyl groups by viewing them as regions of alcoves. In type $\widetilde{A}_2$ we show that each interval coincides with a generalized permutohedron minus a star-shaped polygon, and we prove a subtler…

Combinatorics · Mathematics 2025-07-21 Gaston Burrull , Nicolas Libedinsky , Rodrigo Villegas

In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related…

Combinatorics · Mathematics 2015-05-29 Bridget Eileen Tenner

We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…

Combinatorics · Mathematics 2024-08-30 Mathilde Bouvel , Luca Ferrari , Bridget Eileen Tenner

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

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

Using the notion of series parallel interval order, we propose a unified setting to describe Dyck lattices and Tamari lattices (two well known lattice structures on Catalan objects) in terms of basic notions of the theory of posets. As a…

Combinatorics · Mathematics 2010-07-13 Filippo Disanto , Luca Ferrari , Renzo Pinzani , Simone Rinaldi

We study the interplay between the discrete geometry of Bruhat poset intervals and subword complexes of finite Coxeter systems. We establish connections between the cones generated by cover labels for Bruhat intervals and of root…

Combinatorics · Mathematics 2021-03-08 Dennis Jahn , Christian Stump

Lehmer's code defines a bijection between the symmetric group and the set of staircase compositions. In this paper, we characterize a poset structure on these compositions that is equivalent to the strong Bruhat order on the symmetric…

Combinatorics · Mathematics 2025-06-13 Jordan Lambert , Lonardo Rabelo

In this paper we consider arbitrary intervals in the left weak order on the symmetric group $S_n$. We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the…

Combinatorics · Mathematics 2013-08-20 Hugh Denoncourt

We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak…

Combinatorics · Mathematics 2016-10-19 Patricia Hersh , Cristian Lenart

We study flag enumeration in intervals in the Bruhat order on a Coxeter group by means of a structural recursion on intervals in the Bruhat order. The recursion gives the isomorphism type of a Bruhat interval in terms of smaller intervals,…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

We extend the recently-introduced weak Bruhat interval modules of the type A $0$-Hecke algebra to all finite Coxeter types. We determine, in a type-independent manner, structural properties for certain general families of these modules,…

Representation Theory · Mathematics 2023-11-17 Joshua Bardwell , Dominic Searles

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud , Viviane Pons
‹ Prev 1 2 3 10 Next ›