Whitehead Graphs and Separability in Rank Two
نویسندگان
چکیده
By applying an algorithm of Stallings regarding separability of elements in a free group, we give an alternative approach to that of Osborne and Zieschang in describing all primitive elements in the free group of rank 2. As a result, we give a proof of a classical result of Nielsen, used by Osborne and Zieschang in their work, that the only automorphisms of F2 that act trivially on the abelianization are those defined by conjugation. Finally, we compute the probability that a Whitehead graph in rank 2 contains a cut vertex. We show that this probability is approximately 1/` where ` is the number of edges in the graph.
منابع مشابه
Ideal Whitehead graphs in Out(Fr). I. Some unachieved graphs
Masur and Smillie, 1993, proved precisely which singularity index lists arise from pseudo-Anosov mapping classes. In search of an analogous theorem for outer automorphisms of free groups, Handel and Mosher, 2011, ask: Is each connected, simplicial, (2r − 1)-vertex graph the ideal Whitehead graph of a fully irreducible φ ∈ Out(Fr)? We answer this question in the negative by exhibiting, for each ...
متن کاملHyperbolic Surface Subgroups of One-ended Doubles of Free Groups
Gromov asked whether every one-ended word-hyperbolic group contains a hyperbolic surface group. We prove that every one-ended double of a free group contains a hyperbolic surface group if the free group has rank two, or every generator is used the same number of times in the list of amalgamating words. Our method is based on formulating a stronger conjecture on tilings of closed surfaces combin...
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملSeparability of Density Matrices of Graphs for Multipartite Systems
We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of...
متن کاملOn the Path Separability of Planar Graphs
It is known that every weighted planar graph with n vertices contains three shortest paths whose removal halves the graph into connected components of at most n/2 vertices. Whether this property remains true with the use of two shortest paths only is an open problem. We show that two shortest paths are enough for a large family of planar graphs, called face-separable, composed of graphs for whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012