RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP

DOI10.1142/S0218196708004482zbMath1193.05017arXiv0707.3185MaRDI QIDQ3520365

Cyril Nicaud, Frédérique Bassino, Pascal Weil

Publication date: 26 August 2008

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

random generation; subgroups of free groups

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

20E05: Free nonabelian groups

05A16: Asymptotic enumeration

20P05: Probabilistic methods in group theory

Related Items

Statistical properties of subgroups of free groups, Realizable ranks of joins and intersections of subgroups in free groups, Subset currents on free groups., Generic properties of subgroups of free groups and finite presentations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average-case complexity and decision problems in group theory.
• Topology of finite graphs
• Uniform random generation of decomposable structures using floating-point arithmetic
• A calculus for the random generation of labelled combinatorial structures
• Generic-case complexity, decision problems in group theory, and random walks.
• Stallings foldings and subgroups of free groups
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• Asymptotic Methods in Enumeration
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• Malnormality is undecidable in hyperbolic groups