Related papers: Climbing elements in finite coxeter groups

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

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…

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

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…

This paper introduces and studies the higher-order group inverse in a ring. We extend known properties of the higher-order group inverse from complex matrices to elements of a ring and, in the process, derive new results. We further…

We define and study cocycles on a Coxeter group in each degree generalizing the sign function. When the Coxeter group is a Weyl group, we explain how the degree three cocycle arises naturally from geometry representation theory.

The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…

We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the…

This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…

We characterize those regular, holomorphic or formal maps into the orbit space $V/G$ of a complex representation of a finite group $G$ which admit a regular, holomorphic or formal lift to the representation space $V$. In particular, the…

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

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

The finite orbits of the braid group action on Stokes matrices are studied and are shown to be the orbits on ordered sets of reflections, generating finite groups. All invariants of a reflection arrangement are determined. Determination of…

Let W be a Coxeter group with Coxeter generators S. The rank of the Coxeter system (W,S) is the cardinality |S| of S. The Coxeter system (W,S) has finite rank if and only if W is finitely generated. If (W,S) has infinite rank, then |S| =…

For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…