Minimum product sets sizes in nonabelian groups.

From MaRDI portal
Publication:448221

DOI10.1016/J.JNT.2012.04.011zbMATH Open1278.20028arXiv1006.4853OpenAlexW2067626030MaRDI QIDQ448221FDOQ448221


Authors: Yakov Berchenko-Kogan Edit this on Wikidata


Publication date: 30 August 2012

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: The ellipticity graph of a free group F was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of F, 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 F and equivalence classes of proper free product decompositions of the form F=A*B. A conjugacy class is joined by an edge to a free product decomposition A*B whenever the conjugacy class has a representative in either A or B. This paper uses Stallings subgroup X-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.


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




Recommendations




Cites Work


Cited In (3)





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)