English

Submonoid Membership in n-dimensional lamplighter groups and S-unit equations

Group Theory 2025-05-29 v4 Formal Languages and Automata Theory Number Theory

Abstract

We show that Submonoid Membership is decidable in n-dimensional lamplighter groups (Z/pZ)Zn(\mathbb{Z}/p\mathbb{Z}) \wr \mathbb{Z}^n for any prime pp and integer nn. More generally, we show decidability of Submonoid Membership in semidirect products of the form YZn\mathcal{Y} \rtimes \mathbb{Z}^n, where Y\mathcal{Y} is any finitely presented module over the Laurent polynomial ring Fp[X1±,,Xn±]\mathbb{F}_p[X_1^{\pm}, \ldots, X_n^{\pm}]. Combined with a result of Shafrir (2024), this gives the first example of a group GG and a finite index subgroup G~G\widetilde{G} \leq G, such that Submonoid Membership is decidable in G~\widetilde{G} but undecidable in GG. To obtain our decidability result, we reduce Submonoid Membership in YZn\mathcal{Y} \rtimes \mathbb{Z}^n to solving S-unit equations over Fp[X1±,,Xn±]\mathbb{F}_p[X_1^{\pm}, \ldots, X_n^{\pm}]-modules. We show that the solution set of such equations is effectively pp-automatic, extending a result of Adamczewski and Bell (2012). As an intermediate result, we also obtain that the solution set of the Knapsack Problem in YZn\mathcal{Y} \rtimes \mathbb{Z}^n is effectively pp-automatic.

Keywords

Cite

@article{arxiv.2409.07077,
  title  = {Submonoid Membership in n-dimensional lamplighter groups and S-unit equations},
  author = {Ruiwen Dong},
  journal= {arXiv preprint arXiv:2409.07077},
  year   = {2025}
}

Comments

Full version of conference paper at ICALP'25

R2 v1 2026-06-28T18:40:50.040Z