English
Related papers

Related papers: Commutation classes of reduced words and higher Br…

200 papers

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

Let $W$ be a finite reflection group. For a given $w \in W$, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of $w$ contains as many elements as there are regions in the inversion hyperplane…

Combinatorics · Mathematics 2010-10-05 Axel Hultman

We investigate the Demazure product in a double affine setting. Work by Muthiah and Pusk\'as gives a conjectural way to define this in terms of the $q=0$ specialisation of these Hecke algebras. We instead take a different approach…

Representation Theory · Mathematics 2024-11-22 Lewis Dean

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a linear space V under linear transformations of V; or equivalently, it describes the closure of an orbit of GL(V) acting diagonally on the…

Representation Theory · Mathematics 2007-05-23 Peter Magyar

Let $G$ be a simple algebraic group and $P$ a parabolic subgroup of $G$ with abelian unipotent radical $P^u$, and let $B$ be a Borel subgroup of $G$ contained in P. Let $\mathfrak{p}^u$ be the Lie algebra of $P^u$ and let $L$ be a Levi…

Algebraic Geometry · Mathematics 2018-07-13 Jacopo Gandini , Andrea Maffei

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of…

History and Overview · Mathematics 2024-02-12 Hugh Denoncourt , Dana C. Ernst , Dustin Story

Arrangements of pseudohyperplanes are widely studied in computational geometry. A rich subclass of pseudohyerplane arrangements, which has gained more attention in recent years, is the so-called signotopes. Introduced by Manin and…

Combinatorics · Mathematics 2025-02-25 Helena Bergold , Lukas Egeling , Hung. P. Hoang

The permutation representation afforded by a Coxeter group W acting on the cosets of a standard parabolic subgroup inherits many nice properties from W such as a shellable Bruhat order and a flat deformation over Z[q] to a representation of…

Combinatorics · Mathematics 2010-08-06 Eric M. Rains , Monica J. Vazirani

We derive a formula for computing the size of lower Bruhat intervals for elements in the dominant cone of an affine Weyl group of type $A$. This enumeration problem is reduced to counting lattice points in certain polyhedra. Our main tool…

Combinatorics · Mathematics 2025-12-11 Federico Castillo , Damian de la Fuente , Nicolas Libedinsky , David Plaza

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Vincent Pilaud

We classify all quotients $W/W_J$ up to isomorphism in Bruhat order, with $(W,S)$ a Coxeter system and $W_J$ a parabolic subgroup of $W$. In particular, the non-trivial isomorphisms fall into a small number of cases which are highly…

Representation Theory · Mathematics 2023-03-14 Joseph Newton

The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…

Combinatorics · Mathematics 2025-02-11 Grant T. Barkley

For an untwisted affine Kac-Moody Lie algebra $\mathfrak{g}$ with Cartan and Borel subalgebras $\mathfrak{h} \subset \mathfrak{b} \subset \mathfrak{g}$, affine Demazure modules are certain $U(\mathfrak{b})$-submodules of the irreducible…

Representation Theory · Mathematics 2024-04-05 Marc Besson , Sam Jeralds , Joshua Kiers

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

Combinatorics · Mathematics 2021-01-14 Philippe Biane , Matthieu Josuat-Vergès

Let G be a quasi simple algebraic group over an algebraically closed field k whose characteristic is not very bad for G, and let B be a Borel subgroup of G with Lie algebra b. Given a B-stable abelian subalgebra a of the nilradical of b, we…

Algebraic Geometry · Mathematics 2024-08-05 Jacopo Gandini , Andrea Maffei , Pierluigi Moseneder Frajria , Paolo Papi

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Combinatorics · Mathematics 2020-12-23 Matthew McDevitt , Nik Ruskuc

Let n be a positive integer greater than or equal to 2, and q a complex number, transcendental over Q. In this paper, we give an algorithmic construction of an ordered bijection between the set of H-primes of n \times n quantum matrices and…

Rings and Algebras · Mathematics 2007-05-23 Stéphane Launois

Many important statistics of signed permutations are realized in the corresponding permutation tableaux or bare tableaux of type $B$: Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation…

Combinatorics · Mathematics 2014-12-22 Soojin Cho , Kyoungsuk Park

We prove that semi-infinite Bruhat order on an affine Weyl group is completely determined from those on the quotients by affine Weyl subgroups associated with various maximal (standard) parabolic subgroups of finite type. Furthermore, for…

Representation Theory · Mathematics 2021-05-13 Motohiro Ishii

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Combinatorics · Mathematics 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu
‹ Prev 1 3 4 5 6 7 10 Next ›