Membership problems in nilpotent groups

We study both the Submonoid Membership problem and the Rational Subset Membership problem in finitely generated nilpotent groups. We give two reductions with important applications. First, Submonoid Membership in any nilpotent group can be reduced to Rational Subset Membership in smaller groups. As a corollary, we prove the existence of a group with decidable Submonoid Membership and undecidable Rational Subset Membership, confirming a conjecture of Lohrey and Steinberg. Second, the Rational Subset Membership problem in $H_3(\mathbb Z)$ can be reduced to the Knapsack problem in the same group, and is therefore decidable. Combining both results, we deduce that the filiform $3$-step nilpotent group has decidable Submonoid Membership. Comment: v6. 25 pages, 5 figures. Published in the journal of Groups, Complexity, Cryptology

Authors

Institutions

Publication Details

Journal
journal of Groups complexity cryptology
Published
2025-04-25
DOI
https://doi.org/10.46298/jgcc.2025.17.1.13954
Citations
2
Primary Topic
Regional Socio-Economic Development Trends
Type
article
Field-Weighted Citation Impact
11.18

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Membership problems in nilpotent groups

Corentin Bodart
2 citations
journal of Groups complexity cryptology
Regional Socio-Economic Development Trends
11.18
article

Membership problems in nilpotent groups

Corentin Bodart
article en
2 citations

Abstract

We study both the Submonoid Membership problem and the Rational Subset Membership problem in finitely generated nilpotent groups. We give two reductions with important applications. First, Submonoid Membership in any nilpotent group can be reduced to Rational Subset Membership in smaller groups. As a corollary, we prove the existence of a group with decidable Submonoid Membership and undecidable Rational Subset Membership, confirming a conjecture of Lohrey and Steinberg. Second, the Rational Subset Membership problem in $H_3(\mathbb Z)$ can be reduced to the Knapsack problem in the same group, and is therefore decidable. Combining both results, we deduce that the filiform $3$-step nilpotent group has decidable Submonoid Membership. Comment: v6. 25 pages, 5 figures. Published in the journal of Groups, Complexity, Cryptology

journal of Groups complexity cryptologyVol. Volume 17, Issue 1
Berlin Mathematical School (DE)
National Science Foundation
Openalex Percentile: Top 2%
Regional Socio-Economic Development Trends
11.18
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.