Do you want to publish a course? Click here

Automorphisms of Higher Rank Lamplighter Groups

159   0   0.0 ( 0 )
 Added by Jennifer Taback
 Publication date 2014
  fields
and research's language is English




Ask ChatGPT about the research

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$.



rate research

Read More

We show that the higher rank lamplighter groups, or Diestel-Leader groups $Gamma_d(q)$ for $d geq 3$, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.
We describe a family of finitely presented groups which are quasi-isometric but not bilipschitz equivalent. The first such examples were described by the first author and are the lamplighter groups $F wr mathbb{Z}$ where $F$ is a finite group; these groups are finitely generated but not finitely presented. The examples presented in this paper are higher rank generalizations of these lamplighter groups and include groups that are of type $F_n$ for any $n$.
We classify a large class of small groups of finite Morley rank: $N_circ^circ$-groups which are the infinite analogues of Thompsons $N$-groups. More precisely, we constrain the $2$-structure of groups of finite Morley rank containing a definable, normal, non-soluble, $N_circ^circ$-subgroup.
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.
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.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا