Related papers: Automorphisms of Coxeter groups

Let G be a free group in a variety of groups, but G is not absolutely free. We prove that the group of automorphisms Aut(G) is linear iff G is a virtually nilpotent group.

Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

By definition, a group is called narrow if it does not contain a copy of a non-abelian free group. We describe the structure of finite and narrow normal subgroups in Coxeter groups and their automorphism groups.

The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…

We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…

For a Coxeter group $W$ we have an associating bi-linear form $B$ on a real vector space. We assume that $B$ has the signature $(n-1,1)$. In this case we have the Cannon-Thurston map for $W$, that is, a $W$-equivariant continuous surjection…

A group $G$ is said to be just infinite if $G$ itself is infinite but all proper quotients of $G$ are finite. We show that a Coxeter group $W_\Gamma$ is just infinite if and only if $\Gamma$ is isomorphic to one of the following graphs:…

In positive characteristic, algebraic curves can have many more automorphisms than expected from the classical Hurwitz's bound. There even exist algebraic curves of arbitrary high genus g with more than 16g^4 automorphisms. It has been…

Affine subgroups having the same Coxeter number with the affine Coxeter groups W(An), W(Dn), and W(En) are constructed by graph folding technique. The affine groups W(Cn) and W(Bn) are obtained from the Coxeter groups W(A2n-1) and W(D2n-1)…

We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…

We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…

We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer $m > 1$. For almost all finite structures (labelled or unlabelled) such that at least $m$ elements are moved by some…

We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of…

We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…

We consider Lusztig's $\mathbf{a}$-function on Coxeter groups (in the equal parameter case) and classify all Coxeter groups with finitely many elements of $\mathbf{a}$-value 2 in terms of Coxeter diagrams.

The method of direct calculation of the group of $\mathbb R$-algebra automorphisms of a Weil algebra is presented in detail. The paper is focused on the case of a one-componental group and presents two cases of values of the determinant of…

Let $(W,S)$ be a Coxeter system, let $S=I \dot{\cup} J$ be a partition of $S$ such that no element of $I$ is conjugate to an element of $J$, let $\widetilde{J}$ be the set of $W_I$-conjugates of elements of $J$ and let $\widetilde{W}$ be…

We determine the quantum automorphism groups of finite graphs. These are quantum subgroups of the quantum permutation groups defined by Wang. The quantum automorphism group is a stronger invariant for finite graphs than the usual one. We…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

We further develop the theory of $W\!$-graph ideals, first introduced by the authors in reference [6]. We discuss $W\!$-graph subideals, and induction and restriction of $W\!$-graph ideals for parabolic subgroups. We introduce $W\!$-graph…