Related papers: Computation in Coxeter groups II. Minimal roots

In this paper, we study combinatorics of congruence subgroups of the modular group. More precisely, we consider the matrix equation that naturally arises in the theory of Coxeter friezes and investigate its irreducible solutions. We give…

By a recent result obtained by R. Howlett and the author considerable progress has been made towards a complete solution of the isomorphism problem for Coxeter groups. In this paper we give a survey on the isomorphism problem and explain in…

Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of $b$ bits over $b+1$ wires that admit especially simple encoding and decoding…

General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques,…

We formulate in this paper the mini-bucket algorithm for approximate inference in terms of exact inference on an approximate model produced by splitting nodes in a Bayesian network. The new formulation leads to a number of theoretical and…

Coresets are compact representations of data sets such that models trained on a coreset are provably competitive with models trained on the full data set. As such, they have been successfully used to scale up clustering models to massive…

We provide local recognition results for the reflection graphs on spherical Coxeter groups. In particular, we study the case $F_4$ which is locally recognizable under additional constraints only. It is then demonstrated in the cases $A_n$…

Given a finite-dimensional real inner product space V and a finite subgroup G of linear isometries, max filtering affords a bilipschitz Euclidean embedding of the orbit space V/G. We identify the max filtering maps of minimum distortion in…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

We prove that two reflection factorizations of a parabolic quasi-Coxeter element in a finite Coxeter group belong to the same Hurwitz orbit if and only if they generate the same subgroup and have the same multiset of conjugacy classes. As a…

The vertices of the four dimensional $120$-cell form a non-crystallographic root system whose corresponding symmetry group is the Coxeter group $H_{4}$. There are two special coordinate representations of this root system in which they and…

We show that certain right-angled Coxeter groups have finite index subgroups that quotient to $\mathbb Z$ with finitely generated kernels. The proof uses Bestvina-Brady Morse theory facilitated by combinatorial arguments. We describe a…

We present an algorithm to reduce the computational effort for the multiplication of a given matrix with an unknown column vector. The algorithm decomposes the given matrix into a product of matrices whose entries are either zero or integer…

In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular…

Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory…

We follow the dual approach to Coxeter systems and show for Weyl groups a criterium which decides whether a set of reflections is generating the group depending on the root and the coroot lattice. Further we study special generating sets…

This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are…

We present a way to associate an algebra $B_G (\Upsilon) $ with every pseudo reflection group $G$. When $G$ is a Coxeter group of simply-laced type we show $B_G (\Upsilon)$ is isomorphic to the generalized Brauer algebra of simply-laced…