English
Related papers

Related papers: Freely braided elements in Coxeter groups

200 papers

We show that any two elements of the pure braid group either commute or generate a free group, settling a question of Luis Paris. Our proof involves the theory of 3-manifolds and the theory of group actions on trees.

Geometric Topology · Mathematics 2008-12-10 Christopher J Leininger , Dan Margalit

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…

Group Theory · Mathematics 2019-01-30 Robert W. Bell , Rita Gitik

Given two conjugate mapping classes f and g, we produce a conjugating element w such that |w| < K(|f|+|g|), where |.| denotes the word metric with respect to a fixed generating set, and K is a constant depending only on the generating set.…

Geometric Topology · Mathematics 2012-11-06 Jing Tao

In this paper, we provide an upper bound for the number of one-element commutation classes of a permutation, that is, the number of reduced words in which no commutation can be applied. Using this upper bound, we prove a conjecture that…

Combinatorics · Mathematics 2026-01-15 Ricardo Mamede , José Luis Santos , Diogo Soares

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

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

Group Theory · Mathematics 2025-01-30 Gideon Amir , Guy Blachar , Subhajit Ghosh , Uzi Vishne

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

We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…

Geometric Topology · Mathematics 2021-12-10 Sebastian Baader , Michael Lönne

We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the…

Combinatorics · Mathematics 2015-09-07 William Slofstra

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

Combinatorics · Mathematics 2015-03-03 Bridget Eileen Tenner

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

An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group W is cyclically fully commutative if any…

Group Theory · Mathematics 2014-10-03 Mathias Pétréolle

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Combinatorics · Mathematics 2009-03-30 Drew Armstrong

The mixed braid groups are the subgroups of Artin braid groups whose elements preserve a given partition of the base points. We prove that the centralizer of any braid can be expressed in terms of semidirect and direct products of mixed…

Geometric Topology · Mathematics 2007-05-23 Juan Gonzalez-Meneses , Bert Wiest

We study the diameter of the graph $G(w)$ of reduced words of an element $w$ in a Coxeter group $W$ whose edges correspond to applications of the Coxeter relations. We resolve conjectures of Reiner--Roichman and Dahlberg--Kim by proving a…

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

A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…

Combinatorics · Mathematics 2013-03-08 Christos A. Athanasiadis , Yuval Roichman

Let $G$ be a connected reductive group over an algebraically closed field with Weyl group $W$. The analogy between Lusztig varieties and Deligne-Lusztig varieties associated to minimal length elements in elliptic conjugacy classes of $W$…

Representation Theory · Mathematics 2023-12-11 Chengze Duan

In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…

Group Theory · Mathematics 2026-05-06 Yeeka Yau

We introduce `braidability' as a new symmetry for (infinite) sequences of noncommutative random variables related to representations of the braid group $B_\infty$. It provides an extension of exchangeability which is tied to the symmetric…

Operator Algebras · Mathematics 2009-11-13 Rolf Gohm , Claus Köstler

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