Related papers: Incoherent Coxeter Groups
Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…
We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of…
A solution of the isomorphism problem is presented for the class of Coxeter groups W that have a finite set of Coxeter generators S such that the underlying graph of the presentation diagram of the system (W,S) has the property that every…
In this paper, we study the twist-conjecture for Coxeter systems and rigidity of Coxeter systems up to finite twists. For Coxeter systems $(W,R)$ and $(W,S)$, under the untangle-condition for conjugate subsets, we investigate separations…
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…
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.
The article investigates high-level general invertible-sequential processing in the digital and quantum domains. In particular it is shown that (i) invertible digital-sequential processes, constructed using a standard general-inversion…
We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a…
We prove that affine Coxeter groups are profinitely rigid.
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…
A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…
For Coxeter groups with sufficiently large braid relations, we prove that the sequence of powers of a Coxeter element has unbounded reflection length. We establish a connection between the reflection length functions on arbitrary Coxeter…
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…
A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…
Let $d$ be a positive integer. We study the proportion of irreducible characters of infinite families of irreducible Coxeter groups whose values evaluated on a fixed element $g$ are divisible by $d$. For Coxeter groups of types $A_n, B_n$…
In this short, elementary note we prove that if a faithful reflection representation of a Coxeter group preserves an orthant, then that Coxeter group is a product of symmetric groups acting on its natural permutation representation. We also…
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…
We completely classify the possible divergence functions for right-angled Coxeter groups (RACGs). In particular, we show that the divergence of any such group is either polynomial, exponential or infinite. We prove that a RACG is strongly…
A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…
The rich theory of Coxeter groups is used to provide an algebraic construction of finite volume hyperbolic n-manifolds. Combinatorial properties of finite images of these groups can be used to compute the volumes of the resulting manifolds.…