Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 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

Effective equation solving, constraints and growth in virtually abelian groups (2309.00475v2)

Published 1 Sep 2023 in math.GR, cs.DM, and cs.FL

Abstract: In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic order, abelianisation or context-free constraints added, can be effectively produced in finitely generated virtually abelian groups. Crucially, we translate each of the constraints above into a rational set in an effective way, and so reduce each problem to solving equations with rational constraints, which is decidable and well understood in virtually abelian groups. A byproduct of our results is that the growth series of a virtually abelian group, with respect to any generating set and any weight, is effectively computable. This series is known to be rational by a result of Benson, but his proof is non-constructive.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. String constraints for verification. In Armin Biere and Roderick Bloem, editors, Computer Aided Verification, pages 150–166, Cham, 2014. Springer International Publishing.
  2. Roberto Amadini. A survey on string constraint solving. ACM Comput. Surv., 55(1), nov 2021.
  3. Regular left-orders on groups. J. Comb. Algebra, 6(3-4):265–314, 2022.
  4. M. Benson. Growth series of finite extensions of 𝐙nsuperscript𝐙𝑛{\bf Z}^{n}bold_Z start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT are rational. Invent. Math., 73(2):251–269, 1983.
  5. Jean Berstel. Transductions and context-free languages. B. G. Teubner, Stuttgart, 1979.
  6. A. Bishop. Geodesic growth in virtually abelian groups. J. Algebra, 573:760–786, 2021.
  7. Definability in the existential theory of concatenation and undecidable extensions of this theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik, 34(4):337–342, 1988.
  8. A. Carvahlo. Algebraic and context-free subsets of subgroups. 2022. https://arxiv.org/abs/2210.10001.
  9. L. Ciobanu and M. Elder. The complexity of solution sets to equations in hyperbolic groups. Israel J. Math., 245(2):869–920, 2021.
  10. L. Ciobanu and A. Evetts. Rational sets in virtually abelian groups: languages and growth. L’Enseignement mathématique, 2023. https://arxiv.org/abs/2205.05621.
  11. L. Ciobanu and A. Garrett. Group equations with abelian predicates. Int. Math. Res. Notices, 2023+. https://arxiv.org/abs/2204.13946.
  12. L. Ciobanu and A. Levine. Languages, groups and equations. 2023. https://arxiv.org/abs/2303.07825.
  13. F. Dahmani. Existential questions in (relatively) hyperbolic groups. Israel J. Math., 173:91–124, 2009.
  14. Foliations for solving equations in groups: free, virtually free, and hyperbolic groups. J. Topol., 3(2):343–404, 2010.
  15. Quasi-polynomials, linear Diophantine equations and semi-linear sets. Theoret. Comput. Sci., 416:1–16, 2012.
  16. The satisfiability of word equations: Decidable and undecidable theories. In International Conference on Reachability Problems, pages 15–29. Springer, 2018.
  17. Leonard Eugene Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n𝑛nitalic_n Distinct Prime Factors. Amer. J. Math., 35(4):413–422, 1913.
  18. S. Eilenberg and M. P. Schützenberger. Rational sets in commutative monoids. J. Algebra, 13:173–191, 1969.
  19. Parikh’s theorem: a simple and direct automaton construction. Inform. Process. Lett., 111(12):614–619, 2011.
  20. A. Evetts. Rational growth in virtually abelian groups. Illinois J. Math., 63(4):513–549, 2019.
  21. A. Evetts and A. Levine. Equations in virtually abelian groups: Languages and growth. Internat. J. Algebra Comput., 32(3):411–442, 2022.
  22. On equations and first-order theory of one-relator monoids. Inform. and Comput., 281, December 2021.
  23. Bounded ALGOLALGOL{\rm ALGOL}roman_ALGOL-like languages. Trans. Amer. Math. Soc., 113:333–368, 1964.
  24. Z. Grunschlag. Algorithms in geometric group theory. PhD thesis, University of California, Berkeley, 1999.
  25. Thomas Herbst. On a subclass of context-free groups. RAIRO Inform. Théor. Appl., 25(3):255–272, 1991.
  26. Group presentations, formal languages and characterizations of one-counter groups. Theoret. Comput. Sci., 112(2):187–213, 1993.
  27. Groups, languages and automata, volume 88 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 2017.
  28. On the rational subset problem for groups. J. Algebra, 309(2):622–639, 2007.
  29. Alex Levine. EDT0L solutions to equations in group extensions. J. Algebra, 619:860–899, 2023.
  30. Markus Lohrey. The rational subset membership problem for groups: a survey. In Groups St Andrews 2013, volume 422 of London Math. Soc. Lecture Note Ser., pages 368–389. Cambridge Univ. Press, Cambridge, 2015.
  31. K. A. Mihaĭlova. The occurrence problem for direct products of groups. Mat. Sb. (N.S.), 70 (112):241–251, 1966.
  32. W. D. Neumann and M. Shapiro. Automatic structures, rational growth, and geometrically finite hyperbolic groups. Invent. Math., 120(2):259–287, 1995.
  33. W. D. Neumann and M. Shapiro. Regular geodesic normal forms in virtually abelian groups. Bull. Austral. Math. Soc., 55(3):517–519, 1997.
Citations (3)
View on Semantic Scholar

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now