Random equations in nilpotent groups.

DOI10.1016/J.JALGEBRA.2011.11.007zbMATH Open1283.20074arXiv1105.2234OpenAlexW2963232273MaRDI QIDQ435936FDOQ435936

Vitaliĭ Roman'kov, Robert H. Gilman, Alexei Myasnikov

Publication date: 13 July 2012

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

Abstract: In this paper we study satisfiability of random equations in an infinite finitely generated nilpotent group G. We show that the set SAT(G,k) of all equations in k > 1 variables over G which are satisfiable in G has an intermediate asymptotic density in the space of all equations in k variables over G. When G is a free abelian group of finite rank, we compute this density precisely; otherwise we give some non-trivial upper and lower bounds. For k = 1 the set SAT(G,k) is negligible. Usually the asymptotic densities of interesting sets in groups are either zero or one. The results of this paper provide new examples of algebraically significant sets of intermediate asymptotic density.

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

Recommendations

• Random equations in free groups.
• Random nilpotent groups. I
• Random systems of equations in free abelian groups.
• Solving random equations in Garside groups using length functions.
• Equations in nilpotent groups.
• Probabilistically nilpotent groups
• Random nilpotent groups of maximal step
• Fixed-point theorems for random groups.
• A matrix model for random nilpotent groups
• Random nilpotent groups, polycyclic presentations, and Diophantine problems

zbMATH Keywords

asymptotic densitiesfinitely generated nilpotent groupsfree groupsfree nilpotent groupsfree Abelian groupsrandom equations

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Generators, relations, and presentations of groups (20F05) Asymptotic properties of groups (20F69) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18) Algebraic geometry over groups; equations over groups (20F70) Probabilistic methods in group theory (20P05) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Cites Work

• Title not available (Why is that?)
• Random Walks on Infinite Graphs and Groups
• Statistical properties of finitely presented groups
• Algorithmically finite groups.
• Random subgroups of Thompson's group \(F\).
• Algebraic geometry over groups. I: Algebraic sets and ideal theory
• The space of finitely generated groups
• ALMOST EVERY GROUP IS HYPERBOLIC
• Title not available (Why is that?)
• Public Key Cryptography - PKC 2006
• Title not available (Why is that?)
• Cogrowth of groups and simple random walks
• Title not available (Why is that?)
• Title not available (Why is that?)
• On some problems of a statistical group-theory. I
• The probability of generating a finite simple group
• The probability of generating a finite classical group
• The probability of generating the symmetric group
• Random walk in random groups.
• On problems related to growth, entropy, and spectrum in group theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generic-case complexity, decision problems in group theory, and random walks.
• Local limit theorems for free groups
• The class of groups all of whose subgroups with lesser number of generators are free is generic
• Delzant's \(T\)-invariant, Kolmogorov complexity and one-relator groups.
• Random equations in free groups.
• Asymptotic growth of averaged Dehn functions for nilpotent groups
• Title not available (Why is that?)
• Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• Title not available (Why is that?)
• Critical densities for random quotients of hyperbolic groups.
• Counting primitive elements in free groups
• Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.
• Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms
• Random van Kampen diagrams and algorithmic problems in groups.
• Zariski Density and Genericity
• The Asymptotic Density of Some k-Dimensional Sets
• The mean Dehn functions of abelian groups
• Generic Subgroups of Group Amalgams
• Generic properties of finitely presented groups and howson's theorem
• Title not available (Why is that?)
• MULTIPLICATIVE MEASURES ON FREE GROUPS
• A property of subgroups of infinite index in a free group
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Residual properties of free groups and probabilistic methods
• GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS
• Quotient tests and random walks in computational group theory.
• Title not available (Why is that?)
• On the Cayley graph of a generic finitely presented group
• Regular sets and counting in free groups
• Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
• Average-case complexity and decision problems in group theory.
• Exponentially generic subsets of groups

Cited In (7)

• Random systems of equations in free abelian groups.
• On the generic complexity of solving equations over natural numbers with addition
• RANDOM EQUATIONS OVER FREE SEMILATTICES
• On the asymptotics of visible elements and homogeneous equations in surface groups.
• Random nilpotent groups of maximal step
• Random equations in free groups.
• Nielsen equivalence in a class of random groups

This page was built for publication: Random equations in nilpotent groups.

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