English
Related papers

Related papers: Pop-Stack-Sorting for Coxeter Groups

200 papers

We consider the involutions known as "toggles," which have been used to give simplified proofs of the fundamental properties of the promotion and evacuation maps. We transfer these involutions so that they generate a group $\mathscr P_n$…

Combinatorics · Mathematics 2020-09-29 Colin Defant

The $P = W$ conjecture identifies the perverse filtration of the Hitchin system on the cohomology of the moduli space of Higgs bundles with the weight filtration of the corresponding character variety. In this paper, we introduce an…

Algebraic Geometry · Mathematics 2020-02-21 Simone Melchiorre Chiarello , Tamas Hausel , Andras Szenes

For a Coxeter group $W$ we have an associating bi-linear form $B$ on a real vector space. We assume that $B$ has the signature $(n-1,1)$. In this case we have the Cannon-Thurston map for $W$, that is, a $W$-equivariant continuous surjection…

Geometric Topology · Mathematics 2014-04-04 Ryosuke Mineyama

Let $G=\Sp(2g,\mathbb{Z})$ be the symplectic group over the integers. Given $m\in \mathbb{N}$, it is natural to ask if there exists a non-trivial matrix $A\in G$ such that $A^{m}=I$, where $I$ is the identity matrix in $G$. In this paper,…

Group Theory · Mathematics 2013-08-23 Kumar Balasubramanian , Ganesh Ji Omar

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

Combinatorics · Mathematics 2020-11-17 George M. Bergman

The notion of a linear Coxeter system introduced by Vinberg generalizes the geometric representation of a Coxeter group. Our main theorem asserts that if $v$ is an element of the Tits cone of a linear Coxeter system and $\cW$ is the…

Representation Theory · Mathematics 2012-04-11 Georg Hofmann , Karl-Hermann Neeb

Let $(W,S)$ be a finite Coxeter system. Tits defined an associative product on the set $\Sigma$ of simplices of the associated Coxeter complex. The corresponding semigroup algebra is the Solomon-Tits algebra of $W$. It contains the Solomon…

Rings and Algebras · Mathematics 2007-05-23 Manfred Schocker

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

Let W be an infinite Coxeter group. We initiate the study of the set E of limit points of "normalized" positive roots (representing the directions of the roots) of W. We show that E is contained in the isotropic cone of the bilinear form B…

Group Theory · Mathematics 2019-08-15 Christophe Hohlweg , Jean-Philippe Labbé , Vivien Ripoll

Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the…

Group Theory · Mathematics 2014-09-23 Anna Erschler

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

Data Structures and Algorithms · Computer Science 2019-10-10 Giulio Cerbai , Lapo Cioni , Luca Ferrari

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…

Group Theory · Mathematics 2007-05-23 Patrick Bahls

Fix a word $w$ in a free group $F$ on $r$ generators. A $w$-random permutation in the symmetric group $S_N$ is obtained by sampling $r$ independent uniformly random permutations $\sigma_{1},\ldots,\sigma_{r}\in S_{N}$ and evaluating…

Group Theory · Mathematics 2026-02-03 Liam Hanany , Doron Puder

Affine subgroups having the same Coxeter number with the affine Coxeter groups W(An), W(Dn), and W(En) are constructed by graph folding technique. The affine groups W(Cn) and W(Bn) are obtained from the Coxeter groups W(A2n-1) and W(D2n-1)…

Mathematical Physics · Physics 2026-04-17 Nazife Ozdes Koca , Mehmet Koca

Let W be an irreducible, finitely generated Coxeter group. The geometric representation provides an discrete embedding in the orthogonal group of the so-called Tits form. One can look at the representation modulo the kernel of this form; we…

Group Theory · Mathematics 2012-11-27 Yves de Cornulier

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

Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…

Representation Theory · Mathematics 2014-12-18 Meinolf Geck , Lacrimioara Iancu

Let $s$ be West's deterministic stack-sorting map. A well-known result (West) is that any length $n$ permutation can be sorted with $n-1$ iterations of $s.$ In 2020, Defant introduced the notion of highly-sorted permutations -- permutations…

Combinatorics · Mathematics 2024-05-06 Owen Zhang

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Combinatorics · Mathematics 2026-05-13 Nathan Reading