Related papers: Conjugacy of Coxeter elements
In this article, we first show that in case $n$ is even which Coxeter element in $\mathfrak{S}_{n}$ affords the longest by taking its power to $n/2$. We also show that in case $n$ is odd which Coxeter element affords the longest in…
In this paper we study the equivalence relation on the set of acyclic orientations of a graph Y that arises through source-to-sink conversions. This source-to-sink conversion encodes, e.g. conjugation of Coxeter elements of a Coxeter group.…
A solution of the isomorphism problem is presented for the class of Coxeter groups W that have a finite set of Coxeter generators S such that the underlying graph of the presentation diagram of the system (W,S) has the property that every…
In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…
We prove that the centralizer of a Coxeter element in an irreducible Coxeter group is the cyclic group generated by that Coxeter element.
In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…
In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…
We extend a result of Lewis and Reiner from finite Coxeter groups to all Coxeter groups by showing that two reflection factorizations of a Coxeter element lie in the same Hurwitz orbit if and only if they share the same multiset of…
By underlying the commutation relation in a right-angled Coxeter group W, we recover the fact that right-angled Coxeter groups are rigid and we describe the second subgroup of Aut(W) that appears in the decomposition of Aut(W) into a…
An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…
By the work of Sela, for any free group $F$, the Coxeter group $W_ 3 = \mathbb{Z}/2\mathbb{Z} \ast \mathbb{Z}/2\mathbb{Z} \ast \mathbb{Z}/2\mathbb{Z}$ is elementarily equivalent to $W_3 \ast F$, and so Coxeter groups are not closed under…
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. In the present work, we focus on fully commutative involutions,…
Let $W$ be an irreducible Coxeter group. We define the Coxeter pop-stack-sorting operator $\mathsf{Pop}:W\to W$ to be the map that fixes the identity element and sends each nonidentity element $w$ to the meet of the elements covered by $w$…
In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…
For any permutation w, we characterize the reduced words of w that are their own commutation class. When w is the long element n(n-1)...321 and n \ge 4, there are exactly four such words.
We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…
An element of a group is said to be reversible if it is conjugate to its inverse. We characterise the reversible elements in the group of diffeomorphisms of the real line, and in the subgroup of order preserving diffeomorphisms.
A right-angled Coxeter group is a group with a given set of generators of order two, subject only to the relations that certain pairs of the generators commute. Various papers have shown how homological properties of the Coxeter group are…
Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…
Let $W$ be a $2$-dimensional Coxeter group, that is, a one with $\frac{1}{m_{st}}+\frac{1}{m_{sr}}+\frac{1}{m_{tr}}\leq 1$ for all triples of distinct $s,t,r\in S$. We prove that $W$ is biautomatic. We do it by showing that a natural…