Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bounded Generation of Submonoids of Heisenberg Groups (2405.05939v1)

Published 9 May 2024 in math.GR, cs.DM, and cs.FL

Abstract: If $G$ is a nilpotent group and $[G,G]$ has Hirsch length $1$, then every f.g. submonoid of $G$ is boundedly generated, i.e. a product of cyclic submonoids. Using a reduction of Bodart, this implies the decidability of the submonoid membership problem for nilpotent groups $G$ where $[G,G]$ has Hirsch length $2$.

Summary

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

X Twitter Logo Streamline Icon: https://streamlinehq.com