Related papers: Intervals and factors in the Bruhat order
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…
We prove that the grades of simple modules indexed by boolean permutations, over the incidence algebra of the symmetric group with respect to the Bruhat order, are given by Lusztig's a-function. Our arguments are combinatorial, and include…
We determine the sharp asymptotic scale of the probability that two uniformly random permutations are comparable in weak Bruhat order, showing that $\mathbb{P}(\sigma_1 \preceq_W \sigma_2)=\exp\Bigl(\bigl(-\tfrac12+o(1)\bigr)\,n\log…
In this article, we study the metacommutation problem in locally Eichler orders. From this arises a permutation of the set of locally principal left ideals of a given prime reduced norm. Previous results on the cycle structure were…
We define the notion of a separable element in a finite Weyl group, generalizing the well-studied class of separable permutations. We prove that the upper and lower order ideals in weak Bruhat order generated by a separable element are…
Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
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…
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…
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…
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…
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number…
For any permutation w, we characterize the reduced words of w that are their own commutation class. When w is the long element n(n-1)...321 and n \ge 4, there are exactly four such words.
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…
In [Journal of Pure and Applied Algebra {224} (2020), no 12, 106449], V. Mazorchuk and R. Mr{\dj}en (with some help by A. Hultman) prove that, given a Weyl group, the intersection of a Bruhat interval with a parabolic coset has a unique…
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…
We introduce and study a family of operators which act in the span of a Weyl group $W$ and provide a multi-parameter solution to the quantum Yang-Baxter equations of the corresponding type. Our operators generalize the "quantum Bruhat…
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…
The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.