English
Related papers

Related papers: Inversion arrangements and the weak Bruhat order

200 papers

We introduce the partial reductions and inverse Hamiltonian reductions between affine $\mathcal{W}$-algebras along the closure relations of associated nilpotent orbits in the case of $\mathfrak{sl}_4$, fulfilling all the missing…

Quantum Algebra · Mathematics 2026-01-28 Justine Fasquel , Zachary Fehily , Ethan Fursman , Shigenori Nakatsuka

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

Combinatorics · Mathematics 2020-09-09 Bridget Eileen Tenner

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

It was shown in \cite{FPV} that the classification of $n$-component systems of conservation laws possessing a third-order Hamiltonian structure reduces to the following algebraic problem: classify $n$-planes $H$ in $\wedge^2(V_{n+2})$ such…

Algebraic Geometry · Mathematics 2018-10-30 E Ferapontov , L Manivel

Let $W$ be a finite Weyl group and $\A$ be the corresponding Weyl arrangement. A deformation of $\A$ is an affine arrangement which is obtained by adding to each hyperplane $H\in\A$ several parallel translations of $H$ by the positive root…

Combinatorics · Mathematics 2011-09-09 Takuro Abe , Hiroaki Terao

In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with…

Combinatorics · Mathematics 2021-06-01 Daniel Hothem

Let $\mathfrak{S}_n$ be the set of all permutations of $[n]=\{1,\ldots,n\}$ and let $W$ be the subset consisting of permutations $\sigma \in \mathfrak{S}_n$ avoiding 132 and 312-patterns. The monomial ideal $I_W = \left\langle…

Combinatorics · Mathematics 2020-03-24 Chanchal Kumar , Amit Roy

We formulate and prove examples of a conjecture which describes the W-algebras in type A as successive quantum Hamiltonian reductions of affine vertex algebras associated with several hook-type nilpotent orbits. This implies that the affine…

Representation Theory · Mathematics 2025-03-26 Thomas Creutzig , Justine Fasquel , Andrew R. Linshaw , Shigenori Nakatsuka

Gilbert Strang posited that a permutation matrix of bandwidth $w$ can be written as a product of $N < 2w$ permutation matrices of bandwidth 1. A proof employing a greedy ``parallel bubblesort'' algorithm on the rows of the permutation…

Combinatorics · Mathematics 2010-07-21 Michael Daniel Samson , Martianus Frederic Ezerman

A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element $w$ in Bruhat order in a compatible order yields back the…

Combinatorics · Mathematics 2023-02-28 Christian Gaetz , Ram K. Goel

When $G$ is a complex reductive algebraic group, MV polytopes are in bijection with the non-negative tropical points of the unipotent group of $G$. By fixing $w$ from the Weyl group, we can define MV polytopes whose highest vertex is…

Combinatorics · Mathematics 2023-01-26 Kathlyn Dykes

The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…

Combinatorics · Mathematics 2022-01-03 Arvind Ayyer , Naya Banerjee

A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…

Combinatorics · Mathematics 2023-09-12 Priyavrat Deshpande , Krishna Menon , Writika Sarkar

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag…

Representation Theory · Mathematics 2007-05-23 Evgeny Smirnov

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

Let $\mathfrak{g} = \bigoplus_{i \in \mathbb{Z} /m \mathbb{Z}} \mathfrak{g}_i$ be a periodically graded semisimple complex Lie algebra. In this note, we give a uniform proof of the recent result by W. de Graaf and H. V. L\^e that the…

Representation Theory · Mathematics 2026-03-31 Filippo Ambrosio , Andrea Santi

Based on the Kazama-Suzuki type coset construction and its inverse coset between the subregular $\mathcal{W}$-algebras for $\mathfrak{sl}_n$ and the principal $\mathcal{W}$-superalgebras for $\mathfrak{sl}_{1|n}$, we prove weight-wise…

Representation Theory · Mathematics 2022-06-22 Thomas Creutzig , Naoki Genra , Shigenori Nakatsuka , Ryo Sato

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

We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the…

Combinatorics · Mathematics 2015-09-07 William Slofstra

In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly…

Combinatorics · Mathematics 2010-05-20 Masato Kobayashi