English
Related papers

Related papers: Equivalence classes of lower and upper descent wea…

200 papers

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

We study different problems related to the Solomon's descent algebra $\Sigma(W)$ of a finite Coxeter group $(W,S)$: positive elements, morphisms between descent algebras, Loewy length... One of the main result is that, if $W$ is irreducible…

Representation Theory · Mathematics 2008-05-30 Cédric Bonnafé , Götz Pfeiffer

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Combinatorics · Mathematics 2025-05-20 Joel Brewster Lewis , Jiayuan Wang

For each permutation $w$, we can construct a collection of hyperplanes $\mathcal{A}_w$ according to the inversions of $w$, which is called the inversion hyperplane arrangement associated to $w$. It was conjectured by Postnikov and confirmed…

Combinatorics · Mathematics 2020-06-16 Neil J. Y. Fan

We describe an algorithm which pattern embeds, in the sense of Woo-Yong, any Bruhat interval of a symmetric group into an interval whose extremes lie in the same right Kazhdan-Lusztig cell. This apparently harmless fact has applications in…

Representation Theory · Mathematics 2021-07-20 Martina Lanini , Peter J. McNamara

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

In this paper we define an equivalence relation on the set of all $x_{J}$ in order to form a basis for a new descent algebra of Weyl groups of type $A_{n}$. By means of this, we construct a new commutative and semi-simple descent algebra of…

Commutative Algebra · Mathematics 2014-04-21 Tulay Yagmur , Himmet Can

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Combinatorics · Mathematics 2024-03-12 Simone Costa

We show that the (non-Noetherian) Stanley-Reisner ring of the order complex of certain intervals in the Bruhat order on the infinite symmetric group $S_\infty$ of all auto-bijections of $\mathbb{N}$ is Cohen-Macaulay in the sense of ideals…

Combinatorics · Mathematics 2026-01-21 Nathaniel Gallup , Leo Gray

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

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

Let $I_n$ be the set of involutions in the symmetric group $S_n$, and for $A \subseteq \{0,1,\ldots,n\}$, let \[ F_n^A=\{\sigma \in I_n \mid \text{$\sigma$ has $a$ fixed points for some $a \in A$}\}. \] We give a complete characterisation…

Combinatorics · Mathematics 2015-02-13 Mikael Hansson

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

Combinatorics · Mathematics 2024-05-13 Alexander Diaz-Lopez , Kathryn Haymaker , Colin McGarry , Dylan McMahon

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

Combinatorics · Mathematics 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

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

For $1<p\le q<\infty$ and $n\in\{3\cdot 2^{k},2^{k}\}$ with $k\ge 1$, we prove that the Poisson-like semigroup $(P_t)_{t\in \mathbb{R}_+}$ on $\mathbb{Z}_n$, associated with the word length $\psi_n(k)=\min(k,n-k)$, is hypercontractive from…

Classical Analysis and ODEs · Mathematics 2025-12-04 Gan Yao

Let $D=(V,A)$ be a digraph of order $n$ and let $W$ be any subset of $V$. We define the minimum semi-degree of $W$ in $D$ to be $\delta^0(W)=\mbox{min}\{\delta^+(W),\delta^-(W)\}$, where $\delta^+(W)$ is the minimum out-degree of $W$ in $D$…

Combinatorics · Mathematics 2020-02-03 Yun Wang , Jin Yan

In recent years, much work has been done to measure and compare the complexity of orbit equivalence relations, especially for certain classes of Polish groups. We start by introducing some language to organize this previous work, namely the…

Logic · Mathematics 2026-05-13 Shaun Allison

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

There are left and right actions of the 0-Hecke monoid of the affine symmetric group $\tilde{S}_n$ on involutions whose cycles are labeled periodically by nonnegative integers. Using these actions we construct two bijections, which are…

Combinatorics · Mathematics 2018-08-29 Eric Marberg