English
Related papers

Related papers: Stack-Sorting for Coxeter Groups

200 papers

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale

We extend properties of the weak order on finite Coxeter groups to Weyl groupoids admitting a finite root system. In particular, we determine the topological structure of intervals with respect to weak order, and show that the set of…

Quantum Algebra · Mathematics 2010-03-17 Istvan Heckenberger , Volkmar Welker

Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…

Combinatorics · Mathematics 2022-01-12 Colin Defant

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Combinatorics · Mathematics 2011-02-07 Florent Hivert , Anne Schilling , Nicolas M. Thiéry

The descent algebra of a finite Coxeter group $W$ is a basic algebra, and as such it has a presentation as quiver with relations. In recent work, we have developed a combinatorial framework which allows us to systematically compute such a…

Representation Theory · Mathematics 2008-10-16 Goetz Pfeiffer

Let $G$ be a reductive group with Borel $B$ and Weyl group $W$. Then $B$-double cosets in $G$ are indexed by the Weyl group, say $O(w)$ for $w\in W$. Then we prove the minimal $B$-double coset in the convolution $O(w_1)*O(w_2)$ is…

Representation Theory · Mathematics 2025-03-26 Kenta Suzuki

We start by identifying a class of pseudo-differential operators, generated by the set of continuous negative definite functions, that are in the weak similarity (WS) orbit of the self-adjoint log-Bessel operator on the Euclidean space.…

Probability · Mathematics 2023-01-18 Pierre Patie , Rohan Sarkar

A new recursive procedure of the calculation of partition numbers function $W(s,{\bf d}^m)$ is suggested. We find its zeroes and prove a lemma on the function parity properties. The explicit formulas of $W(s,{\bf d}^m)$ and their periods…

Number Theory · Mathematics 2007-05-23 Leonid G. Fel , Boris Y. Rubinstein

For extra-large Coxeter systems (m(s,r)>3), we construct a natural and explicit set of Soergel bimodules D={D_w}_{w\in W} such that each D_w contains as a direct summand (or is equal to) the indecomposable Soergel bimodule B_w. When…

Representation Theory · Mathematics 2009-07-02 Nicolas Libedinsky

Let $Q$ be an acyclic quiver. Associated with any element $w$ of the Coxeter group of $Q$, triangulated categories $\underline{\Sub}\Lambda_w$ were introduced in \cite{Bua2}. There are shown to be triangle equivalent to generalized cluster…

Representation Theory · Mathematics 2011-11-21 Claire Amiot

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem…

Information Theory · Computer Science 2016-11-17 Robby G. McKilliam , Warren D. Smith , I. Vaughan L. Clarkson

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

Combinatorics · Mathematics 2008-09-16 Patricia Hersh

If S and S' are two finite sets of Coxeter generators for a right-angled Coxeter group W, then the Coxeter systems (W,S) and (W,S') are equivalent.

Group Theory · Mathematics 2026-05-14 David G. Radcliffe

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

Combinatorics · Mathematics 2018-05-24 Julia Heller , Petra Schwer

We provide a complete description of the automorphism group $\Aut (W)$ of a Coxeter group $W$ admitting a star-shaped finite Coxeter diagram. We prove that each automorphism decomposes as a product of inner and diagram automorphisms, along…

Group Theory · Mathematics 2026-05-22 Arijit Mahato , Tushar Kanta Naik , A Rameswar Patro

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

Combinatorics · Mathematics 2022-11-02 Christian Gaetz , Yibo Gao

Given an arbitrary Coxeter system $(W,S)$ and a nonnegative integer $m$, the $m$-Shi arrangement of $(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of $(W,S)$. The classical Shi arrangement ($m=0$) was introduced in the…

Combinatorics · Mathematics 2024-12-13 Matthew Dyer , Christophe Hohlweg , Susanna Fishel , Alice Mark

We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent…

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

Given a Coxeter system (W,S) equipped with an involutive automorphism T, the set of twisted identities is i(T) = {T(w)^{-1}w : w \in W}. We point out how i(T) shows up in several contexts and prove that if there is no s \in S such that…

Combinatorics · Mathematics 2011-11-09 Axel Hultman