Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity

DOI10.1016/J.JALGEBRA.2020.01.030zbMATH Open1471.20023arXiv1612.01242OpenAlexW3014828091MaRDI QIDQ2178495FDOQ2178495

Authors: Albert Garreta, Denis Ovchinnikov, Alexei Myasnikov 

Publication date: 11 May 2020

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: We study finitely generated nilpotent groups $G$ given by full rank finite presentations $langleAmidRangle$ in the variety $mathcal{N}_c$ of nilpotent groups of class at most $c$, where $cgeq2$. We prove that if the deficiency $|A|-|R|$ is at least $2$ then the group $G$ is virtually free nilpotent, it is quasi finitely axiomatizable (in particular, first-order rigid), and it is almost (up to finite factors) directly indecomposable. One of the main results of the paper is that the Diophantine problem in nilpotent groups given by full rank finite presentations $langleAmidRangle$ is undecidable if $|A|-|R|geq2$ and decidable otherwise. We show that this class of groups is rather large since finite presentations asymptotically almost surely have full rank, so a random nilpotent group in the few relators model has a full rank presentation asymptotically almost surely. Full rank presentations give one a useful tool to approach random nilpotent groups and study their properties. Note, that the results above significantly improve our understanding of the Diophantine problem in finitely generated nilpotent groups: from a few special examples of groups with undecidable Diophantine problem we got to the place where we know that the Diophantine problem in all "typical" nilpotent groups is also undecidable.

Full work available at URL: https://arxiv.org/abs/1612.01242

Recommendations

• Metabelian groups: full-rank presentations, randomness and Diophantine problems
• Equations with one unknown in nilpotent groups
• Random nilpotent groups, polycyclic presentations, and Diophantine problems
• Diophantine questions in the class of finitely generated nilpotent groups
• Random nilpotent groups. I

zbMATH Keywords

nilpotent groupsisomorphismrelative presentationelementary equivalencefull rank presentation

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18)

Cites Work

• Random walk: A modern introduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Words. Notes on verbal width in groups.
• The decision problem for exponential diophantine equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random walk in random groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quasi-finitely axiomatizable nilpotent groups
• Random nilpotent groups, polycyclic presentations, and Diophantine problems
• Equations in nilpotent groups
• Random Nilpotent Groups I
• A Matrix Model for Random Nilpotent Groups
• Undecidability of existential theories of rings and fields: A survey
• Diophantine Sets over Some Rings of Algebraic Integers
• Centroids of groups
• Diophantine problems in solvable groups
• A generalized theorem on freedom for pro-p-groups
• Title not available (Why is that?)
• Tarski-type problems for free associative algebras
• ω-STABILITY AND MORLEY RANK OF BILINEAR MAPS, RINGS AND NILPOTENT GROUPS

Cited In (2)

• Metabelian groups: full-rank presentations, randomness and Diophantine problems
• The Diophantine problem in the classical matrix groups

This page was built for publication: Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178495)