2000 character limit reached
Sigma invariants for partial orders on nilpotent groups (2311.00620v1)
Published 1 Nov 2023 in math.GR
Abstract: We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$ is abelian, we recover the classical theorem that $N$ is finitely generated if and only if $S(G,N) \subseteq \Sigma1(G)$. Furthermore, we provide a way to construct all such orders on nilpotent groups. A key step is to translate the classical setting based on characters into a language of orders on $G$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.