相关论文: Computation in Coxeter groups II. Minimal roots

This paper examines a systematic method to construct a pair of (inter-related) root systems for arbitrary Coxeter groups from a class of non-standard geometric representations. This method can be employed to construct generalizations of…

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is…

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

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

Real physical systems with reflective and rotational symmetries such as viruses, fullerenes and quasicrystals have recently been modeled successfully in terms of three-dimensional (affine) Coxeter groups. Motivated by this progress, we…

We give a criterion for a finitely generated odd-angled Coxeter group to have a proper finite index subgroup generated by reflections. The answer is given in terms of the least prime divisors of the exponents of the Coxeter relations.

We refine Brink's theorem, that the non-reflection part of a reflection centralizer in a Coxeter group W is a free group. We give an explicit set of generators for centralizer, which is finitely generated when W is. And we give a method for…

For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in…

We describe Ccluster, a software for computing natural $\epsilon$-clusters of complex roots in a given box of the complex plane. This algorithm from Becker et al.~(2016) is near-optimal when applied to the benchmark problem of isolating all…

Let $W$ be a finite irreducible real reflection group, which is a Coxeter group. We explicitly construct a basis for the module of differential 1-forms with logarithmic poles along the Coxeter arrangement by using a primitive derivation. As…

In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes.…

Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…

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…

We show that certain embeddings of Coxeter groups within other Coxeter groups are injective using the notion of Coxeter partitions. Moreover, we study Lusztig's partitions, which are generalizations of Lusztig's admissible maps and Crisp's…

We show how Coxeter's work implies a bijection between complex reflection groups of rank two and real reflection groups in $O(3)$. We also consider this magic square of reflections and rotations in the framework of Clifford algebras: we…

The characterization of orbits of roots under the action of a Coxeter element is a fundamental tool in the study of finite root systems and their reflection groups. This paper develops the analogous tool in the affine setting, adding detail…

In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational…

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…

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…

An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…