Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 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

Membership problems in nilpotent groups (2401.15504v2)

Published 27 Jan 2024 in math.GR, cs.DM, and cs.FL

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. “On the complexity of some extended word problems defined by cancellation rules” In Information Processing Letters 23.5, 1986, pp. 281–287 DOI: https://doi.org/10.1016/0020-0190(86)90087-6
  2. Corentin Bodart, Laura Ciobanu and George Metcalfe “Ordering nilpotent groups”, In preparation
  3. “On Reachability Problems for Low-Dimensional Matrix Semigroups” In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) 132, Leibniz International Proceedings in Informatics (LIPIcs), 2019, pp. 44:1–44:15
  4. Max Dehn “Über die Topologie des dreidimensionalen Raumes” In Mathematische Annalen 69, 1910, pp. 137–168
  5. Ruiwen Dong “Recent Advances in Algorithmic Problems for Semigroups” In ACM SIGLOG News 10.4, 2023, pp. 3–23
  6. “Rational sets in commutative monoids” In Journal of Algebra 13.2, 1969, pp. 173–191 DOI: https://doi.org/10.1016/0021-8693(69)90070-2
  7. Robert H. Gilman “Groups with a rational cross-section” In Combinatorial Group Theory and Topology Princeton University Press, 1987, pp. 175–184 DOI: doi:10.1515/9781400882083-011
  8. Oleg N. Golovin and N.P. Gol’dina “Subgroups of free metabelian groups” In Matematicheskii Sbornik 79.2, 1955, pp. 323–336
  9. “On the integer solutions of quadratic equations” In Journal für die reine und angewandte Mathematik 2004.569, 2004, pp. 13–45 DOI: doi:10.1515/crll.2004.023
  10. Zephian Grunschlag “Algorithms in Geometric Group Theory”, 1999
  11. Daniel König, Markus Lohrey and Georg Zetzsche “Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups” In Algebra and Computer Sciences, 2016, pp. 129–144 DOI: 10.1090/conm/677/13625
  12. Markus Lohrey “Rational subsets of unitriangular groups” In International Journal of Algebra and Computation 25.01n02, 2015, pp. 113–121
  13. Markus Lohrey “The rational subset membership problem for groups: a survey” In Groups St Andrews 2013, London Mathematical Society Lecture Note Series Cambridge University Press, 2015, pp. 368–389 DOI: 10.1017/CBO9781316227343.024
  14. “The submonoid and rational subset membership problems for graph groups” Computational Algebra In Journal of Algebra 320.2, 2008, pp. 728–755
  15. “Submonoids and rational subsets of groups with infinitely many ends” Computational Algebra In Journal of Algebra 324.5, 2010, pp. 970–983
  16. “Logspace and compressed-word computations in nilpotent groups” In Transactions of the American Math. Soc. 375, 2022, pp. 5425–5459
  17. Anatolii Malcev “On homomorphisms onto finite groups” In Transl., Ser. 2, Am. Math. Soc. 119, 1983, pp. 67–79
  18. Yuri V. Matiyasevich “Hilbert’s tenth problem” Cambridge, MA, USA: MIT Press, 1993
  19. K. A. Mihailova “The occurrence problem for direct products of groups” In Doklady Akad. Nauk SSRR 119, 1958, pp. 1103–1105
  20. “Knapsack problem for nilpotent groups” In Groups Complexity Cryptology 9.1, 2017, pp. 87–98 DOI: doi:10.1515/gcc-2017-0006
  21. Alexei G. Myasnikov, Andrey Nikolaev and Alexander Ushakov “Knapsack problems in groups” In Mathematics of Computation 84, 2013, pp. 987–1016
  22. M. O. Rabin and D. Scott “Finite Automata and Their Decision Problems” In IBM Journal of Research and Development 3.2, 1959, pp. 114–125
  23. Vitaly Roman’kov “Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group” Preprint available at www.arxiv.org/abs/2209.14786, 2022
  24. Vladimir I. Trofimov “Growth functions of some classes of languages” In Cybernetics 17, 1981, pp. 727–731
  25. Günter M. Ziegler “Lectures on Polytopes”, Graduate Texts in Mathematics Springer New York, 1994
Citations (5)

Summary

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

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