English
Related papers

Related papers: Dynamics of Pop-Tsack Torsing

200 papers

Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…

Combinatorics · Mathematics 2017-04-28 Mikael Hansson , Axel Hultman

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

We revisit the structure of the normalizer $N_W(P)$ of a parabolic subgroup $P$ in a finite Coxeter group $W$, originally described by Howlett. Building on Howlett's Lemma, which provides canonical complements for reflection subgroups, and…

Group Theory · Mathematics 2026-03-30 J. Matthew Douglass , Götz Pfeiffer , Gerhard Roehrle

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Combinatorics · Mathematics 2024-02-07 Joel Brewster Lewis , Alejandro H. Morales

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

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

Combinatorics · Mathematics 2026-05-13 Nathan Reading , David E Speyer

The noncrossing partition poset associated to a Coxeter group $W$ and Coxeter element $c$ is the interval $[1,c]_T$ in the absolute order on $W$. We construct a new model of noncrossing partititions for $W$ of classical affine type, using…

Combinatorics · Mathematics 2026-05-13 Laura G. Brestensky , Nathan Reading

In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…

Representation Theory · Mathematics 2011-06-14 J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

Let $\mathrm{Mac}(W)$ be the MacNeille completion of the Bruhat order of a Coxeter group $W$. We introduce an action of the $0$-Hecke monoid of type $W$ on $\mathrm{Mac}(W)$, which allows us to define a weak order and a descent set…

Combinatorics · Mathematics 2026-05-11 Colin Defant

We introduce a technique of projection onto the Coxeter plane of an arbitrary higher dimensional lattice described by the affine Coxeter group. The Coxeter plane is determined by the simple roots of the Coxeter graph I2 (h) where h is the…

Mathematical Physics · Physics 2014-03-06 Mehmet Koca , Nazife O. Koca , Ramazan Koc

We give an interpretation of the map $\pi^c$ defined by Reading, which is a map from the elements of a Coxeter group to the $c$-sortable elements, in terms of the representation theory of preprojective algebras. Moreover, we study a close…

Representation Theory · Mathematics 2020-05-15 Yuya Mizuno , Hugh Thomas

The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an…

Group Theory · Mathematics 2015-08-28 Sarah B. Hart , Peter J. Rowley

Let $W$ be a finite Weyl group and ${\hat{W}}$ be the corresponding affine Weyl group. We show that a large element in ${\hat{W}}$, randomly generated by (reduced) multiplication by simple generators, almost surely has one of $|W|$-specific…

Probability · Mathematics 2015-09-10 Thomas Lam

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

Combinatorics · Mathematics 2017-08-22 Elise delMas , Thomas Hameister , Victor Reiner

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…

Combinatorics · Mathematics 2013-02-13 Henrik Eriksson , Kimmo Eriksson

This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…

We refine a conjecture by Lehrer and Solomon on the structure of the Orlik-Solomon algebra of a finite Coxeter group $W$ and relate it to the descent algebra of $W$. As a result, we claim that both the group algebra of $W$, as well as the…

Representation Theory · Mathematics 2013-03-11 J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…

Combinatorics · Mathematics 2024-02-12 Tomas Boothby , Jeffrey Burkert , Morgan Eichwald , R. M. Green , Dana C. Ernst , Matthew Macauley

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

As a visualization of Cartier and Foata's "partially commutative monoid" theory, G.X. Viennot introduced "heaps of pieces" in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models…

Combinatorics · Mathematics 2019-12-20 Shih-Wei Chao , Matthew Macauley