Minimum product sets sizes in nonabelian groups.
From MaRDI portal
(Redirected from Publication:448221)
Abstract: The ellipticity graph of a free group was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of , which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface. It is a bipartite graph, whose vertices are conjugacy classes of nontrivial elements of and equivalence classes of proper free product decompositions of the form . A conjugacy class is joined by an edge to a free product decomposition whenever the conjugacy class has a representative in either or . This paper uses Stallings subgroup -digraphs and Whitehead automorphisms to construct algorithms that determine when the distance between two vertices of the ellipticity graph is two, for both types of vertices.
Recommendations
Cites work
- scientific article; zbMATH DE number 3120863 (Why is no real title available?)
- scientific article; zbMATH DE number 3207391 (Why is no real title available?)
- A generalisation to noncommutative groups of a theorem of Mann
- BOUNDS ON THE MINIMAL SUMSET SIZE FUNCTION IN GROUPS
- Minimal sumsets in finite solvable groups.
- Minimum product set sizes in nonabelian groups of order \(pq\).
- On the Addition of Residue Classes
- Optimally small sumsets in finite abelian groups.
- Some extensions of the Cauchy-Davenport theorem
- Some results on minimal sumset sizes in finite non-Abelian groups.
- The Critical Pairs of Subsets of a Group of Prime Order
- The small sumsets property for solvable finite groups
Cited in
(4)
This page was built for publication: Minimum product sets sizes in nonabelian groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448221)