Related papers: Computation in Coxeter groups II. Minimal roots

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…

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…

Chapoton has observed a simple product formula for the number of reflections in a finite Coxeter group that have full support. We give a uniform proof of his formula for Weyl groups. We furthermore refine his formula by the length of the…

In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding…

This expository article introduces the topic of roots in a compact Lie group. Compared to the many other treatments of this standard topic, I intended for mine to be relatively elementary, example-driven, and free of unnecessary…

In this article we show how the structure of Coxeter groups are present in gate sets of reversible and quantum computing. These groups have efficient word problems which means that circuits built from these gates have potential to be…

We introduce the concept of hyperreflection groups, which are a generalization of Coxeter groups. We prove the Deletion and Exchange Conditions for hyperreflection groups, and we discuss special subgroups and fundamental sectors of…

On etudie divers aspects d'une formule qui compte les reflexions pleines dans les groupes de Coxeter finis. ***** We study several points about a formula which counts reflexions in a finite Coxeter group whose reduced decompositions involve…

Quaternionic representations of Coxeter (reflection) groups of ranks 3 and 4, as well as those of E_8, have been used extensively in the literature. The present paper analyses such Coxeter groups in the Clifford Geometric Algebra framework,…

We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…

In this paper we study affine reflection subgroups in arbitrary infinite Coxeter groups of finite rank. In particular, we study the distribution of roots of Coxeter groups in the root subsystems associated with affine reflection subgroups.…

In this paper, we make the case that Clifford algebra is the natural framework for root systems and reflection groups, as well as related groups such as the conformal and modular groups: The metric that exists on these spaces can always be…

There has been recent interest in novel Clifford geometric invariants of linear transformations. This motivates the investigation of such invariants for a certain type of geometric transformation of interest in the context of root systems,…

A minimal model of polychronous groups in neural networks is presented. The model is computationally efficient and allows the study of polychronous groups independent of specific neuron models. Computational experiments were performed with…

In this article we classify the Coxeter systems for which the Brink-Howlett automaton is minimal. We show that this automaton is minimal if and only if each elementary root is supported on a standard spherical subsystem, thereby resolving a…

In well-known work, Kazhdan and Lusztig (1979) defined a new set of Hecke algebra basis elements (actually two such sets) associated to elements in any Coxeter group. Often these basis elements are computed by a standard recursive algorithm…

We introduce the computer algebra package {\sf PyCox}, written entirely in the {\sf Python} language. It implements a set of algorithms - in a spirit similar to the older {\sf CHEVIE} system - for working with Coxeter groups and Hecke…

The computation of the cohomology for finite groups of Lie type in the describing characteristic is a challenging and difficult problem. In earlier work, the authors constructed an induction functor which takes modules over the finite group…

Given any Coxeter group, we define rigid reflections and rigid roots using non-self-intersecting curves on a Riemann surface with labeled curves. When the Coxeter group arises from an acyclic quiver, they are related to the rigid…

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…