Related papers: Bounding reflection length in an affine Coxeter gr…

We prove that affine Coxeter groups are profinitely rigid.

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

The conjugator length function of a finitely generated group is the function $f$ so that $f(n)$ is the minimal upper bound on the length of a word realizing the conjugacy of two words of length at most $n$. We study herein the spectrum of…

We continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work (math.CO/0301104). A known upper bound for the number of commutation classes of reduced expressions for an element of a…

In this paper we classify reflection subgroups of Euclidean Coxeter groups.

Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…

We present results underlining the conjecture that affine extensions for non-crystallographic Coxeter groups are suitable mathematical objects for the description of the symmetries of Carbon onions and Carbon nanotubes. It is the hope that…

In this short, elementary note we prove that if a faithful reflection representation of a Coxeter group preserves an orthant, then that Coxeter group is a product of symmetric groups acting on its natural permutation representation. We also…

For each positive integer $k$ we present an example of Coxeter system $(G_k,S_k)$ such that $G_k$ is a word-hyperbolic Coxeter group, for any two generating reflections $s,t\in S_k$ the product $st$ has finite order, and the Coxeter graph…

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…

Let $x$ be an eigenvector for an element of a finite irreducible reflection group $W$. Let $W_x$ denote the subgroup of $W$ which stabilises $x$. We provide an upper bound for the number of roots in the root system of $W_x$ . This…

The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain…

A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…

Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g -> r^l(g). (Here 0<r<1, and l denotes the length function with respect to the…

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$…

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 study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter…