Related papers: Centralizers in $\widetilde A_2$ groups

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

A group $G$ is said to be $n$-centralizer if its number of element centralizers $\mid \Cent(G)\mid=n$, an F-group if every non-central element centralizer contains no other element centralizer and a CA-group if all non-central element…

In this paper, we classify conjugacy classes of centralizers of irreducible subgroups in $PSL(n,\mathbb{C})$ using alternate modules a.k.a. finite abelian groups with an alternate bilinear form. When $n$ is squarefree, we prove that these…

In the study of the local dynamics of a germ of diffeomorphism fixing the origin in C, an important problem is to determine the centralizer of the germ in the group Diff(C,0) of germs of diffeomorphisms fixing the origin. When the germ is…

We provide a detailed analysis of atomic *-representations of rank 2 graphs on a single vertex. They are completely classified up to unitary equivalence, and decomposed into a direct sum or direct integral of irreducible atomic…

We prove that the centralizer of a Coxeter element in an irreducible Coxeter group is the cyclic group generated by that Coxeter element.

We study the set of critical exponents of discrete groups acting on regular trees. We prove that for every real number $\delta$ between $0$ and $\frac{1}{2}\log q$, there is a discrete subgroup $\Gamma$ acting without inversion on a…

We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…

Let $X=S\times E \times B$ be the metric product of a symmetric space $S$ of noncompact type, a Euclidean space $E$ and a product $B$ of Euclidean buildings. Let $\Gamma$ be a discrete group acting isometrically and cocompactly on $X$. We…

For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…

In this article, given two finite simplicial graphs $\Gamma_1$ and $\Gamma_2$, we state and prove a complete description of the possible morphisms $C(\Gamma_1) \to C(\Gamma_2)$ between the right-angled Coxeter groups $C(\Gamma_1)$ and…

Given a ribbon graph $\Gamma$ with some extra structure, we define, using constructible sheaves, a dg category $CPM(\Gamma)$ meant to model the Fukaya category of a Riemann surface in the cell of Teichm\"uller space described by $\Gamma.$…

We show that if $\Gamma = \Gamma_1\times\dotsb\times \Gamma_n$ is a product of $n\geq 2$ non-elementary ICC hyperbolic groups then any discrete group $\Lambda$ which is $W^*$-equivalent to $\Gamma$ decomposes as a $k$-fold direct sum…

The coprime commutators $\gamma_j^*$ and $\delta_j^*$ were recently introduced as a tool to study properties of finite groups that can be expressed in terms of commutators of elements of coprime orders. They are defined as follows. Let $G$…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

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…

Let G be a connected, reductive group over an algebraically closed field of good characteristic. For u in G unipotent, we describe the conjugacy classes in the component group A(u) of the centralizer of u. Our results extend work of the…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…

A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…