Random equations in nilpotent groups.
asymptotic densitiesfinitely generated nilpotent groupsfree Abelian groupsfree groupsfree nilpotent groupsrandom equations
Asymptotic results on counting functions for algebraic and topological structures (11N45) Free nonabelian groups (20E05) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18) Asymptotic properties of groups (20F69) Algebraic geometry over groups; equations over groups (20F70) Probabilistic methods in group theory (20P05)
- 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
- A property of subgroups of infinite index in a free group
- Algebraic geometry over groups. I: Algebraic sets and ideal theory
- Algorithmically finite groups.
- ALMOST EVERY GROUP IS HYPERBOLIC
- Asymptotic growth of averaged Dehn functions for nilpotent groups
- Average-case complexity and decision problems in group theory.
- Cogrowth of groups and simple random walks
- Counting primitive elements in free groups
- Critical densities for random quotients of hyperbolic groups.
- Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
- Delzant's T-invariant, Kolmogorov complexity and one-relator groups.
- Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.
- Exponentially generic subsets of groups
- GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS
- Generic properties of finitely presented groups and howson's theorem
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- Generic Subgroups of Group Amalgams
- Generic-case complexity, decision problems in group theory, and random walks.
- Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.
- scientific article; zbMATH DE number 5152183 (Why is no real title available?)
- scientific article; zbMATH DE number 5380256 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 3746135 (Why is no real title available?)
- scientific article; zbMATH DE number 3787040 (Why is no real title available?)
- scientific article; zbMATH DE number 1283957 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 2010052 (Why is no real title available?)
- scientific article; zbMATH DE number 1795121 (Why is no real title available?)
- scientific article; zbMATH DE number 1836314 (Why is no real title available?)
- scientific article; zbMATH DE number 1836317 (Why is no real title available?)
- scientific article; zbMATH DE number 3266697 (Why is no real title available?)
- scientific article; zbMATH DE number 3335108 (Why is no real title available?)
- scientific article; zbMATH DE number 3051978 (Why is no real title available?)
- Local limit theorems for free groups
- MULTIPLICATIVE MEASURES ON FREE GROUPS
- On problems related to growth, entropy, and spectrum in group theory
- On some problems of a statistical group-theory. I
- On the Cayley graph of a generic finitely presented group
- Public Key Cryptography - PKC 2006
- Quotient tests and random walks in computational group theory.
- Random equations in free groups.
- Random subgroups of Thompson's group \(F\).
- Random van Kampen diagrams and algorithmic problems in groups.
- Random walk in random groups.
- Random Walks on Infinite Graphs and Groups
- Regular sets and counting in free groups.
- Residual properties of free groups and probabilistic methods
- Statistical properties of finitely presented groups
- The Asymptotic Density of Some k-Dimensional Sets
- The class of groups all of whose subgroups with lesser number of generators are free is generic
- The mean Dehn functions of abelian groups
- The probability of generating a finite classical group
- The probability of generating a finite simple group
- The probability of generating the symmetric group
- The space of finitely generated groups
- Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms
- Zariski density and genericity.
- On the asymptotics of visible elements and homogeneous equations in surface groups.
- Random nilpotent groups of maximal step
- Nielsen equivalence in a class of random groups
- Random equations in free groups.
- Random systems of equations in free abelian groups.
- RANDOM EQUATIONS OVER FREE SEMILATTICES
- On the generic complexity of solving equations over natural numbers with addition
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)