Random equations in nilpotent groups.

DOI10.1016/j.jalgebra.2011.11.007zbMath1283.20074arXiv1105.2234OpenAlexW2963232273MaRDI QIDQ435936

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

Publication date: 13 July 2012

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

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

zbMATH Keywords

free groupsfinitely generated nilpotent groupsasymptotic densitiesfree nilpotent groupsfree Abelian groupsrandom equations

Mathematics Subject Classification ID

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

Related Items

On the asymptotics of visible elements and homogeneous equations in surface groups. ⋮ Random systems of equations in free abelian groups. ⋮ RANDOM EQUATIONS OVER FREE SEMILATTICES

Cites Work

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