Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 162 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 38 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 164 tok/s Pro
GPT OSS 120B 426 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Automorphisms of Higher Rank Lamplighter Groups (1412.2271v2)

Published 6 Dec 2014 in math.GR

Abstract: 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) \neq 1$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.