English
Related papers

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

200 papers

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud , Viviane Pons

In this paper, we study the decomposition of Bruhat intervals in a Coxeter group with respect to cosets of a parabolic subgroup. Our main result is that the intersection of a lower Bruhat interval with a parabolic coset contains a unique…

Combinatorics · Mathematics 2022-05-24 Suho Oh , Edward Richmond

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal…

Combinatorics · Mathematics 2023-06-22 Ran Pan , Jeffrey B. Remmel

We study Bruhat intervals in affine Weyl groups by viewing them as regions of alcoves. In type $\widetilde{A}_2$ we show that each interval coincides with a generalized permutohedron minus a star-shaped polygon, and we prove a subtler…

Combinatorics · Mathematics 2025-07-21 Gaston Burrull , Nicolas Libedinsky , Rodrigo Villegas

Let $\{w_{i,j}\}_{1\leq i\leq n, 1\leq j\leq s} \subset L_m=F(X_1,...,X_m)[{\partial \over \partial X_1},..., {\partial \over \partial X_m}]$ be linear partial differential operators of orders with respect to ${\partial \over \partial…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev

Eigenvalue interlacing is a useful tool in linear algebra and spectral analysis. In its simplest form, the interlacing inequality states that a rank-one positive perturbation shifts each eigenvalue up, but not further than the next…

Spectral Theory · Mathematics 2025-09-15 Gregory Berkolaiko , Graham Cox , Yuri Latushkin , Selim Sukhtaiev

Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter…

Combinatorics · Mathematics 2024-03-14 Ben Adenbaum , Jennifer Elder , Pamela E. Harris , J. Carlos Martínez Mori

In the present paper we review the progress of the project of classification and construction of invariant differential operators for non-compact semisimple Lie groups. Our starting points is the class of algebras, which we called earlier…

High Energy Physics - Theory · Physics 2015-06-18 V. K. Dobrev

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

A semibounded operator or relation $S$ in a Hilbert space with lower bound $m \in {\mathbb R}$ has a symmetric extension $S_{\rm f}=S {\, \widehat + \,} (\{0\} \times {\rm mul\,} S^*)$, the weak Friedrichs extension of $S$, and a…

Functional Analysis · Mathematics 2024-03-29 Seppo Hassi , Henk de Snoo

The symmetric algebra $S(\mathfrak g)$ of a reductive Lie algebra $\mathfrak g$ is equipped with the standard Poisson structure, i.e., the Lie-Poisson bracket. Poisson-commutative subalgebras of $S(\mathfrak g)$ attract a great deal of…

Representation Theory · Mathematics 2018-09-05 Dmitri Panyushev , Oksana Yakimova

Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…

Algebraic Geometry · Mathematics 2012-09-17 Massimo Ferrarotti , Elisabetta Fortuna , Leslie Wilson

We study the poset of Borel congruence classes of symmetric matrices ordered by containment of closures. We give a combinatorial description of this poset and calculate its rank function. We discuss the relation between this poset and the…

Combinatorics · Mathematics 2009-12-10 Eli Bagno , Yonah Cherniavsky

Let u and v be permutations on n letters, with u <= v in Bruhat order. A Bruhat interval polytope Q_{u,v} is the convex hull of all permutation vectors z = (z(1), z(2),...,z(n)) with u <= z <= v. Note that when u=e and v=w_0 are the…

Combinatorics · Mathematics 2015-06-11 Emmanuel Tsukerman , Lauren Williams

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_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 a_i$ for $1 \leq i \leq k$,…

Combinatorics · Mathematics 2022-05-25 Simone Costa , Stefano Della Fiore

Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote…

Combinatorics · Mathematics 2023-06-22 Quang T. Bach , Jeffrey B. Remmel

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…

Combinatorics · Mathematics 2024-11-13 Csaba Biro , Sida Wan

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…

Combinatorics · Mathematics 2022-02-16 Volodymyr Mazorchuk , Bridget Eileen Tenner

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

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons