English
Related papers

Related papers: Garside shadows and biautomatic structures in Coxe…

200 papers

We show that for a large class $\mathcal{W}$ of Coxeter groups the following holds: Given a group $W_\Gamma$ in $\mathcal{W}$, the automorphism group ${\rm Aut}(W_\Gamma)$ virtually surjects onto some infinite Coxeter group. In particular,…

Group Theory · Mathematics 2022-09-05 Olga Varghese

Certain results on representations of quivers have analogs in the structure theory of general Coxeter groups. A fixed Coxeter element turns the Coxeter graph into an acyclic quiver, allowing for the definition of a preprojective root. A…

Group Theory · Mathematics 2017-02-08 Mark Kleiner

Let G be a complete Kac-Moody group of rank n \geq 2 over the finite field of order q, with Weyl group W and building \Delta. We first show that if W is right-angled, then for all q \neq 1 mod 4 the group G admits a cocompact lattice \Gamma…

Group Theory · Mathematics 2012-09-04 Inna Capdeboscq , Anne Thomas

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…

Logic in Computer Science · Computer Science 2012-01-25 Martin Huschenbett

For any Coxeter system $(W,S)$ of rank $n$, we introduce an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples $(I,w,J)$, where $I$ and…

Combinatorics · Mathematics 2016-07-04 T. Kyle Petersen

Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$, where $I$ is a finite index set. Fix a nonempty convex subset $\mathscr{L}$ of $W$. If $W$ is of type $A$, then $\mathscr{L}$ is the set of linear extensions of a poset, and…

Combinatorics · Mathematics 2025-05-06 Grant Barkley , Colin Defant , Eliot Hodges , Noah Kravitz , Mitchell Lee

We study $c$-preprojective roots for a Coxeter element $c$ of infinite Coxeter group $W$. In particular, we consider the case when any positive root is $c$-preprojective for some Coxeter element $c$. In this paper, by assuming that the…

Group Theory · Mathematics 2019-11-25 Yuji Komatsu

Let $W$ be a finite Coxeter group. We classify the reflection subgroups of $W$ up to conjugacy and give necessary and sufficient conditions for the map that assigns to a reflection subgroup $R$ of $W$ the conjugacy class of its Coxeter…

Group Theory · Mathematics 2012-01-26 J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

Recently, Wang and the second author constructed a bar involution and canonical basis for a quasi-permutation module of the Hecke algebra associated to a type B Weyl group $W$, where the basis is parameterized by left cosets of a…

Representation Theory · Mathematics 2024-07-26 Zachary Carlini , Yaolong Shen

In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…

Group Theory · Mathematics 2018-02-16 Thomas Gobet

A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…

Representation Theory · Mathematics 2021-07-01 Dean Alvis

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading

Let $(W,S)$ be a Coxeter system and let $w \mapsto w^*$ be an involution of $W$ which preserves the set of simple generators $S$. Lusztig and Vogan have recently shown that the set of twisted involutions (i.e., elements $w \in W$ with…

Representation Theory · Mathematics 2014-05-30 Eric Marberg

This article concerns the realization problem of subgroups of Coxeter groups. We construct a subgroup $G$ of the Coxeter group $W_{15}$ such that $G$ is realized as automorphism groups of a rational surface $X$ and $G \cong Aut(X)^* \cong…

Algebraic Geometry · Mathematics 2024-01-23 Kyounghee Kim

The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…

Geometric Topology · Mathematics 2010-06-03 Sang Jin Lee

In this paper, we study the twist-conjecture for Coxeter systems and rigidity of Coxeter systems up to finite twists. For Coxeter systems $(W,R)$ and $(W,S)$, under the untangle-condition for conjugate subsets, we investigate separations…

Group Theory · Mathematics 2023-06-26 Tetsuya Hosaka

Noncrossing partition posets in a Coxeter group $W$ can fail to be lattices when $W$ is not finite. When the lattice property fails for $W$ of affine type, McCammond and Sulway's construction provides a larger lattice that contains the…

Representation Theory · Mathematics 2025-10-21 Eric J. Hanson , Nathan Reading

Given a finite irreducible Coxeter group $W$ with a fixed Coxeter element $c$, we define the Coxeter pop-tsack torsing operator $\mathsf{Pop}_T:W\to W$ by $\mathsf{Pop}_T(w)=w\cdot\pi_T(w)^{-1}$, where $\pi_T(w)$ is the join in the…

Combinatorics · Mathematics 2021-06-11 Colin Defant , Nathan Williams

Let $\mathcal{W}$ be the set of strongly real elements of $W$, a Coxeter group. Then for $w \in \mathcal{W}$, $e(w)$, the excess of $w$, is defined by $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, x^2 = y^2 = 1\}$. When $W$ is…

Group Theory · Mathematics 2014-05-13 Sarah B. Hart , Peter J. Rowley

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…

Formal Languages and Automata Theory · Computer Science 2022-06-15 Jarkko Peltomäki , Ville Salo