Metabelian groups: full-rank presentations, randomness and Diophantine problems
DOI10.1515/jgth-2020-0091zbMath1482.20024arXiv2006.06371OpenAlexW3116942974MaRDI QIDQ831196
Leire Legarreta, Denis Ovchinnikov, Albert Garreta, Alexei G. Myasnikov
Publication date: 11 May 2021
Published in: Journal of Group Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.06371
metabelian groupFreiheitssatzvariety of groupsasymptotic propertydiophantine problem\(e\)-interpretabilityfull-rank presentation
Generators, relations, and presentations of groups (20F05) Asymptotic properties of groups (20F69) Probabilistic methods in group theory (20P05) Algebraic geometry over groups; equations over groups (20F70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On group-theoretic models of randomness and genericity.
- The decision problem for exponential diophantine equations
- Free subgroups of finitely presented groups
- The class of groups all of whose subgroups with lesser number of generators are free is generic
- Random nilpotent groups, polycyclic presentations, and Diophantine problems
- Statistical properties of finitely presented groups
- Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity
- ALMOST EVERY GROUP IS HYPERBOLIC
- Random Nilpotent Groups I
- Model Theory
- Diophantine problems in solvable groups
- The Diophantine problem in some metabelian groups
- A Matrix Model for Random Nilpotent Groups
- Varieties of groups
This page was built for publication: Metabelian groups: full-rank presentations, randomness and Diophantine problems