English
Related papers

Related papers: Cyclically reduced elements in Coxeter groups

200 papers

Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…

Representation Theory · Mathematics 2021-10-28 Dean Alvis

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…

Discrete Mathematics · Computer Science 2011-08-19 Matthew J. Samuel

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

Combinatorics · Mathematics 2026-04-14 Darij Grinberg , Alexander Postnikov

In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative…

Combinatorics · Mathematics 2016-12-13 Mathias Pétréolle

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

Given a reflection $r$ in a Coxeter group $W$ (possibly of infinite rank), we consider the subgroup of $W$ generated by the reflections in $W$ having (-1)-eigenvectors orthogonal to the (-1)-eigenvector of $r$. In this paper, we determine…

Group Theory · Mathematics 2012-01-18 Koji Nuida

Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for…

Combinatorics · Mathematics 2011-08-17 Hugh Denoncourt

Let W be a Weyl group and let w be a Coxeter elememt of minimal length of W. In the early 1970's I.G.Macdonald stated that the trace of w on an irreducible representation of W is 0,1 or -1. In this paper we give a proof of this statement…

Representation Theory · Mathematics 2024-11-28 G. Lusztig

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

Group Theory · Mathematics 2007-05-23 Michael L. Mihalik , Steven Tschantz

We develop new and precise geometric descriptions of the conjugacy class $[x]$ and coconjugation set $\operatorname{C}(x,x') = \{ y \in \overline{W} \mid yxy^{-1} = x' \}$ for all elements $x,x'$ of any affine Coxeter group $\overline{W}$.…

Group Theory · Mathematics 2025-01-28 Elizabeth Milićević , Petra Schwer , Anne Thomas

We classify pairs of conjugacy classes in almost simple algebraic groups whose product consists of finitely many classes. This leads to several interesting families of examples which are related to a generalization of the Baer--Suzuki…

Group Theory · Mathematics 2013-03-22 Robert Guralnick , Gunter Malle

We lay the foundations of the first-order model theory of Coxeter groups. Firstly, with the exception of the $2$-spherical non-affine case (which we leave open), we characterize the superstable Coxeter groups of finite rank, which we show…

Logic · Mathematics 2022-02-02 Bernhard Muhlherr , Gianluca Paolini , Saharon Shelah

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

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

Let $Q$ be an acyclic quiver and $\Lambda$ be the complete preprojective algebra of $Q$ over an algebraically closed field $k$. To any element $w$ in the Coxeter group of $Q$, Buan, Iyama, Reiten and Scott have introduced and studied in…

Representation Theory · Mathematics 2014-02-26 Claire Amiot , Osamu Iyama , Idun Reiten , Gordana Todorov

We extend the usual notion of fully commutative elements from the Coxeter groups to the complex reflection groups. Then we decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties,…

Group Theory · Mathematics 2018-08-14 Gabriel Feinberg , Sungsoon Kim , Kyu-Hwan Lee , Se-jin Oh

We study the minimal length elements in some double cosets of Coxeter groups and use them to study Lusztig's $G$-stable pieces and the generalization of $G$-stable pieces introduced by Lu and Yakimov. We also use them to study the minimal…

Representation Theory · Mathematics 2007-05-23 Xuhua He

Clans are combinatorial objects indexing the orbits of $GL(\mathbb{C}^p) \times GL(\mathbb{C}^q)$ on the variety of flags in $\mathbb{C}^{p+q}$. This geometry leads to a partial order on the set of clans analogous to weak Bruhat order on…

Combinatorics · Mathematics 2018-06-15 Brian Burks , Brendan Pawlowski

In analogy to the disjoint cycle decomposition in permutation groups, Ore and Specht define a decomposition of elements of the full monomial group and exploit this to describe conjugacy classes and centralisers of elements in the full…

Group Theory · Mathematics 2021-11-29 Dominik Bernhardt , Alice C. Niemeyer , Friedrich Rober , Lucas Wollenhaupt

Let $(W,S)$ be a Coxeter system and suppose that $w \in W$ is fully commutative (in the sense of Stembridge) and has a reduced expression beginning (respectively, ending) with $s \in S$. If there exists $t\in S$ such that $s$ and $t$ do not…

Combinatorics · Mathematics 2018-01-04 Dana C. Ernst