Related papers: Coxeter elements of the symmetric groups whose pow…

We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.

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 a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Over 50 years ago, Rota posted the following celebrated `Research Problem': prove or disprove that the partial order of partitions on an $n$-set (i.e., the refinement order) is Sperner. A counterexample was eventually discovered by Canfield…

In [E. Tsukerman and L. Williams, {\em Bruhat Interval Polytopes}, Advances in Mathematics, 285 (2015), 766-810] it is shown that every Bruhat interval of the symmetric group satisfies the so-called generalized lifting property. In this…

This paper studies the geometric rigidity of the universal Coxeter group of rank $n$, which is the free product $W_n$ of $n$ copies of $\mathbb{Z}/2\mathbb{Z}$. We prove that for $n\geq 4$ the group of symmetries of the spine of the…

Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…

Let (G,S) be a finitely generated Coxeter group, such that the Coxeter system is indecomposable and the canonical bilinear form is indefinite but non-degenerate. We show that the reduced C-*-algebra of G is simple with unique normalised…

We prove that two Artin groups of spherical type are isomorphic if and only if their defining Coxeter graphs are the same.

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…

If $n>4$ and $c(\theta)$ denotes the set of irreducible constituents of a character $\theta$, then $c(\chi^k)={\rm Irr}(S_n)$ for all nonlinear $\chi\in {\rm Irr}(S_n)$ if and only if $k\geq n-1$.

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

We introduce a new statistic on the hyperoctahedral groups (Coxeter groups of type B), and give a conjectural formula for its signed distributions over arbitrary descent classes. The statistic is analogous to the classical Coxeter length…

Let ${\mathcal A}$ be a finite real linear hyperplane arrangement in three dimensions. Suppose further that all the regions of ${\mathcal A}$ are isometric. We prove that ${\mathcal A}$ is necessarily a Coxeter arrangement. As it is well…

We prove the following: there are infinitely many finite-covolume (resp. cocompact) Coxeter groups acting on hyperbolic space H^n for every n < 20 (resp. n < 7). When n=7 or 8, they may be taken to be nonarithmetic. Furthermore, for 1 < n <…

In this paper, we investigate two questions on Kneser graphs $KG_{n,k}$. First, we prove that the union of $s$ intersecting families in ${[n]\choose k}$ has size at most ${n\choose k}-{n-s\choose k}$ for all sufficiently large $n$ that…

We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…

We characterize relatively norm compact sets in the regular $C^*$-algebra of finitely generated Coxeter groups using a geometrically defined positive semigroup acting on the algebra.

For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…