English
Related papers

Related papers: Interval structures in the Bruhat and weak orders

200 papers

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

Probability · Mathematics 2007-05-23 Adam Hammett , Boris Pittel

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

Combinatorics · Mathematics 2007-05-23 Thomas Brady , Colum Watt

A poset $P = (X,\prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2017-07-26 Simona Boyadzhiyska , Garth Isaak , Ann N Trenk

We observe that the join operation for the Bruhat order on a Weyl group agrees with the intersections of Verma modules in type $A$. The statement is not true in other types, and we propose a conjectural statement of a weaker correspondence.…

Representation Theory · Mathematics 2024-11-11 Hankyung Ko , Volodymyr Mazorchuk , Rafael Mrđen

In a companion manuscript, we introduce a stratification of intersections of a top dimensional real Bruhat cells with another arbitrary cell. This intersection is naturally identified with a subset of the lower triangular group: these…

Algebraic Topology · Mathematics 2021-09-29 Emília Alves , Nicolau Saldanha

Structure constants for the multiplication of Schubert polynomials by Schur symmetric polynomials are known to be related to the enumeration of chains in a new partial order on S_\infty, which we call the universal k-Bruhat order. Here we…

Combinatorics · Mathematics 2016-11-08 Nantel Bergeron , Frank Sottile

Hypergraphic polytopes $\Delta_{\mathbb{H}}$ arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph $\mathbb{H}$. Orienting the $1$-skeleton of such a polytope by a certain generic linear functional gives rise to the…

Combinatorics · Mathematics 2026-05-06 Félix Gélinas , Yirong Yang

We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…

Combinatorics · Mathematics 2020-07-21 Gábor Hetyei

In this paper, we prove that if the dual of a Bruhat interval in a Weyl group is a zircon, then that interval is rationally smooth. Investigating when the converse holds, and drawing inspiration from conjectures by Delanoy, leads us to pose…

Combinatorics · Mathematics 2022-06-15 Vincent Umutabazi

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly,…

Combinatorics · Mathematics 2026-05-20 Nathan Reading

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

Combinatorics · Mathematics 2025-03-25 Ivan Chajda , Helmut Länger

We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.

Combinatorics · Mathematics 2025-05-20 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

We illuminate the relation between the Bruhat order on the symmetric group and structure constants (Littlewood-Richardson coefficients) for the cohomology of the flag manifold in terms of its basis of Schubert classes. Equivalently, the…

alg-geom · Mathematics 2016-11-08 Nantel Bergeron , Frank Sottile

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…

Combinatorics · Mathematics 2009-05-06 Kari Ragnarsson , Bridget Eileen Tenner

A poset $P= (X, \prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2018-04-11 Simona Boyadzhiyska , Garth Isaak , Ann Trenk

We investigate the structure theory of the variety of \emph{PBZ*-lattices} and some of its proper subvarieties. These lattices with additional structure originate in the foundations of quantum mechanics and can be viewed as a common…

Logic · Mathematics 2019-05-16 Roberto Giuntini , Claudia Mureşan , Francesco Paoli

A connection relating Tamari lattices on symmetric groups regarded as lattices under the weak Bruhat order to the positive monoid P of Thompson group F is presented. Tamari congruence classes correspond to classes of equivalent elements in…

Combinatorics · Mathematics 2007-05-23 Zoran Sunic

The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…

Combinatorics · Mathematics 2022-02-17 Francesco Brenti , Angela Carnevale , Bridget Eileen Tenner