Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAutomorphisms of odd Coxeter groups
142
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
An odd Coxeter group $W$ is one which admits a Coxeter system $(W,S)$ for which all the exponents $m_{ij}$ are either odd or infinity. The paper investigates the family of odd Coxeter groups whose associated labeled graphs $mathcal{V}_{(W,S)}$ are trees. It is known that two Coxeter groups in this family are isomorphic if and only if they admit Coxeter systems having the same rank and the same multiset of finite exponents. In particular, each group in this family is isomorphic to a group that admits a Coxeter system whose associated labeled graph is a star shaped tree. We give the complete description of the automorphism group of this group, and derive a sufficient condition for the splitting of the automorphism group as a semi-direct product of the inner and the outer automorphism groups. As applications, we prove that Coxeter groups in this family satisfy the $R_infty$-property and are (co)-Hopfian. We compare structural properties, automorphism groups, $R_infty$-property and (co)-Hopfianity of a special odd Coxeter group whose only finite exponent is three with the braid group and the twin group.
rate research
Read More
We use probabilistic methods to prove that many Coxeter groups are incoherent. In particular, this holds for Coxeter groups of uniform exponent > 2 with sufficiently many generators.
Let $G$ be a finite group admitting a coprime automorphism $alpha$ of order $e$. Denote by $I_G(alpha)$ the set of commutators $g^{-1}g^alpha$, where $gin G$, and by $[G,alpha]$ the subgroup generated by $I_G(alpha)$. We study the impact of $I_G(alpha)$ on the structure of $[G,alpha]$. Suppose that each subgroup generated by a subset of $I_G(alpha)$ can be generated by at most $r$ elements. We show that the rank of $[G,alpha]$ is $(e,r)$-bounded. Along the way, we establish several results of independent interest. In particular, we prove that if every element of $I_G(alpha)$ has odd order, then $[G,alpha]$ has odd order too. Further, if every pair of elements from $I_G(alpha)$ generates a soluble, or nilpotent, subgroup, then $[G,alpha]$ is soluble, or respectively nilpotent.
Let $Gamma_d(q)$ denote the group whose Cayley graph with respect to a particular generating set is the Diestel-Leader graph $DL_d(q)$, as described by Bartholdi, Neuhauser and Woess. We compute both $Aut(Gamma_d(q))$ and $Out(Gamma_d(q))$ for $d geq 2$, and apply our results to count twisted conjugacy classes in these groups when $d geq 3$. Specifically, we show that when $d geq 3$, the groups $Gamma_d(q)$ have property $R_{infty}$, that is, every automorphism has an infinite number of twisted conjugacy classes. In contrast, when $d=2$ the lamplighter groups $Gamma_2(q)=L_q = {mathbb Z}_q wr {mathbb Z}$ have property $R_{infty}$ if and only if $(q,6) eq 1$.
It is known that every finite group can be represented as the full group of automorphisms of a suitable compact dessin denfant. In this paper, we give a constructive and easy proof that the same holds for any countable group by considering non-compact dessins. Moreover, we show that any tame action of a countable group is so realizable.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
