Metraipolis › archive › dc_991ac06fa23d
Finite presentations of metabelian groups: effective enumeration via Laurent relations — arXiv:2609.10281
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10281
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:56:31.050Z
- SHA-256 of the archived text
33fdfc368ad08ba63907cb0d9e1d1a09eccd9f64a80516dd9017b98171da3a37- Stable URL of this page
https://metraipolis.com/documento/dc_991ac06fa23d
How to cite
Finite presentations of metabelian groups: effective enumeration via Laurent relations — arXiv:2609.10281 — arXiv (en), https://arxiv.org/abs/2609.10281 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_991ac06fa23d (Metraipolis archive dc_991ac06fa23d, sha256 33fdfc368ad08ba63907cb0d9e1d1a09eccd9f64a80516dd9017b98171da3a37)
BibTeX
@misc{dc991ac06fa23d,
title = {Finite presentations of metabelian groups: effective enumeration via Laurent relations — arXiv:2609.10281},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10281},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_991ac06fa23d; sha256 33fdfc368ad08ba63907cb0d9e1d1a09eccd9f64a80516dd9017b98171da3a37},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10281. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For an ordinary finite presentation $P=\langle x_1,\ldots,x_n\mid R\rangle$, put $G(P)=F_n/\langle\langle R\rangle\rangle$. We construct a primitive-recursive predicate $V$ with $G(P)''=1 \Longleftrightarrow \exists c\in\mathbb{N}: V(P,c)=1$. Thus finite presentations of metabelian groups are recursively enumerable, answering Kourovka Problem 17.124. An effective form of the Bieri-Strebel covering construction, using signed Laurent relations and rational separation, gives a family of finitely presented metabelian groups cofinal under epimorphisms. Products of conjugates of defining relators witness these epimorphisms. The construction and enumeration theorem are formalized in Lean 4.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.LO).
Categorie arXiv: Group Theory (math.GR) ; Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.10281 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T09:31:02.207Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).