<?xml version="1.0" encoding="UTF-8" standalone="yes"?><oembed><version><![CDATA[1.0]]></version><provider_name><![CDATA[Geometry and the imagination]]></provider_name><provider_url><![CDATA[https://lamington.wordpress.com]]></provider_url><author_name><![CDATA[Danny Calegari]]></author_name><author_url><![CDATA[https://lamington.wordpress.com/author/dannycaltech/]]></author_url><title><![CDATA[Polygonal words]]></title><type><![CDATA[link]]></type><html><![CDATA[<p>Last Friday, Henry Wilton gave a talk at Caltech about his recent <a href="http://arxiv.org/abs/0910.4709">joint work</a> with Sang-hyun Kim on polygonal words in free groups. Their work is motivated by the following well-known question of Gromov:</p>
<p><strong><a href="http://www.math.utah.edu/~bestvina/eprints/questions-updated.pdf">Question(Gromov):</a></strong> Let <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> be a one-ended word-hyperbolic group. Does <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> contain a subgroup isomorphic to the fundamental group of a closed hyperbolic surface?</p>
<p>Let me briefly say what &#8220;one-ended&#8221; and &#8220;word-hyperbolic&#8221; mean.</p>
<p>A group is said to be word-hyperbolic if it acts properly and cocompactly by isometries on a proper <img src="https://s0.wp.com/latex.php?latex=%5Cdelta&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;delta" title="&#92;delta" class="latex" />-hyperbolic path metric space &#8212; i.e. a path metric space in which there is a constant <img src="https://s0.wp.com/latex.php?latex=%5Cdelta&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;delta" title="&#92;delta" class="latex" /> so that geodesic triangles in the metric space have the property that each side of the triangle is contained in the <img src="https://s0.wp.com/latex.php?latex=%5Cdelta&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;delta" title="&#92;delta" class="latex" />-neighborhood of the union of the other two sides (colloquially, triangles are <em>thin</em>). This condition distills the essence of negative curvature in the large, and was <a href="http://www.ams.org/mathscinet-getitem?mr=919829">shown</a> by Gromov to be equivalent to several other conditions (eg. that the group satisfies a linear isoperimetric inequality; that every ultralimit of the group is an <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{R}" title="&#92;mathbb{R}" class="latex" />-tree). Free groups are hyperbolic; fundamental groups of closed manifolds with negative sectional curvature (eg surfaces with negative Euler characteristic) are word-hyperbolic; &#8220;random&#8221; groups are hyperbolic &#8212; and so on. In fact, it is an open question whether a group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> that admits a finite <img src="https://s0.wp.com/latex.php?latex=K%28G%2C1%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="K(G,1)" title="K(G,1)" class="latex" /> is word hyperbolic if and only if it does not contain a copy of a Baumslag-Solitar group <img src="https://s0.wp.com/latex.php?latex=BS%28m%2Cn%29%3A%3D%5Clangle+x%2Cy+%5C%3B+%7C+%5C%3B+x%5E%7B-1%7Dy%5E%7Bm%7Dx+%3D+y%5En+%5Crangle&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="BS(m,n):=&#92;langle x,y &#92;; | &#92;; x^{-1}y^{m}x = y^n &#92;rangle" title="BS(m,n):=&#92;langle x,y &#92;; | &#92;; x^{-1}y^{m}x = y^n &#92;rangle" class="latex" /> for <img src="https://s0.wp.com/latex.php?latex=m%2Cn+%5Cne+0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m,n &#92;ne 0" title="m,n &#92;ne 0" class="latex" /> (note that the group <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5Coplus+%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z}&#92;oplus &#92;mathbb{Z}" title="&#92;mathbb{Z}&#92;oplus &#92;mathbb{Z}" class="latex" /> is the special case <img src="https://s0.wp.com/latex.php?latex=m%3Dn%3D1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m=n=1" title="m=n=1" class="latex" />); in any case, this is a very good heuristic for identifying the word-hyperbolic groups one typically meets in examples.</p>
<p>If <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is a finitely generated group, the <em>ends</em> of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> really means the ends (as defined by <a href="http://www.ams.org/mathscinet-getitem?mr=6504">Freudenthal</a>) of the Cayley graph of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> with respect to some finite generating set. Given a proper topological space <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" />, the set of compact subsets of <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> gives rise to an inverse system of inclusions, where <img src="https://s0.wp.com/latex.php?latex=X-K%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X-K&#039;" title="X-K&#039;" class="latex" /> includes into <img src="https://s0.wp.com/latex.php?latex=X-K&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X-K" title="X-K" class="latex" /> whenever <img src="https://s0.wp.com/latex.php?latex=K&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="K" title="K" class="latex" /> is a subset of <img src="https://s0.wp.com/latex.php?latex=K%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="K&#039;" title="K&#039;" class="latex" />. This inverse system defines an inverse system of maps of discrete spaces <img src="https://s0.wp.com/latex.php?latex=%5Cpi_0%28X-K%27%29+%5Cto+%5Cpi_0%28X-K%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;pi_0(X-K&#039;) &#92;to &#92;pi_0(X-K)" title="&#92;pi_0(X-K&#039;) &#92;to &#92;pi_0(X-K)" class="latex" />, and the inverse limit of this system is a compact, totally disconnected space <img src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BE%7D%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathcal{E}(X)" title="&#92;mathcal{E}(X)" class="latex" />, called the <em>space of ends</em> of <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" />. A proper topological space is canonically compactified by its set of ends; in fact, the compactification <img src="https://s0.wp.com/latex.php?latex=X+%5Ccup+%5Cmathcal%7BE%7D%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X &#92;cup &#92;mathcal{E}(X)" title="X &#92;cup &#92;mathcal{E}(X)" class="latex" /> is the &#8220;biggest&#8221; compactification of <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> by a totally disconnected space, in the sense that for any other compactification <img src="https://s0.wp.com/latex.php?latex=X+%5Csubset+Y&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X &#92;subset Y" title="X &#92;subset Y" class="latex" /> where <img src="https://s0.wp.com/latex.php?latex=Y-X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Y-X" title="Y-X" class="latex" /> is zero dimensional, there is a continuous map <img src="https://s0.wp.com/latex.php?latex=X+%5Ccup+%5Cmathcal%7BE%7D%28X%29+%5Cto+Y&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X &#92;cup &#92;mathcal{E}(X) &#92;to Y" title="X &#92;cup &#92;mathcal{E}(X) &#92;to Y" class="latex" /> which is the identity on <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" />.</p>
<p>For a word-hyperbolic group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />, the Cayley graph can be compactified by adding the <em>ideal boundary</em> <img src="https://s0.wp.com/latex.php?latex=%5Cpartial_%5Cinfty+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;partial_&#92;infty G" title="&#92;partial_&#92;infty G" class="latex" />, but this is typically not totally disconnected. In this case, the ends of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> can be recovered as the components of <img src="https://s0.wp.com/latex.php?latex=%5Cpartial_%5Cinfty+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;partial_&#92;infty G" title="&#92;partial_&#92;infty G" class="latex" />.</p>
<p>A group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> acts on its own ends <img src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BE%7D%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathcal{E}(G)" title="&#92;mathcal{E}(G)" class="latex" />. An elementary argument shows that the cardinality of <img src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BE%7D%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathcal{E}(G)" title="&#92;mathcal{E}(G)" class="latex" /> is one of <img src="https://s0.wp.com/latex.php?latex=0%2C1%2C2%2C%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="0,1,2,&#92;infty" title="0,1,2,&#92;infty" class="latex" /> (if a compact set <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> disconnects <img src="https://s0.wp.com/latex.php?latex=e_1%2Ce_2%2Ce_3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="e_1,e_2,e_3" title="e_1,e_2,e_3" class="latex" /> then infinitely many translates of <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> converging to <img src="https://s0.wp.com/latex.php?latex=e_1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="e_1" title="e_1" class="latex" /> separate <img src="https://s0.wp.com/latex.php?latex=e_3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="e_3" title="e_3" class="latex" /> from infinitely many other ends accumulating on <img src="https://s0.wp.com/latex.php?latex=e_1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="e_1" title="e_1" class="latex" />). A group has no ends if and only if it is finite. Stallings famously <a href="http://www.ams.org/mathscinet-getitem?mr=415622">showed</a> that a (finitely generated) group has at least <img src="https://s0.wp.com/latex.php?latex=2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2" title="2" class="latex" /> ends if and only if it admits a nontrivial description as an HNN extension or amalgamated free product over a finite group. One version of the argument proceeds more or less as follows, at least when <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is finitely presented. Let <img src="https://s0.wp.com/latex.php?latex=M&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="M" title="M" class="latex" /> be an <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />-dimensional Riemannian manifold with fundamental group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />, and let <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BM%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{M}" title="&#92;tilde{M}" class="latex" /> denote the universal cover. We can identify the ends of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> with the ends of <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BM%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{M}" title="&#92;tilde{M}" class="latex" />. Let <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> be a least (<img src="https://s0.wp.com/latex.php?latex=n-1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n-1" title="n-1" class="latex" />-dimensional) area hypersurface in <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BM%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{M}" title="&#92;tilde{M}" class="latex" /> amongst all hypersurfaces that separate some end from some other (here the hypothesis that <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> has at least two ends is used). Then every translate of <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> by an element of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is either equal to <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> or disjoint from it, or else one could use the Meeks-Yau &#8220;roundoff trick&#8221; to find a new <img src="https://s0.wp.com/latex.php?latex=V%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V&#039;" title="V&#039;" class="latex" /> with strictly lower area than <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" />. The translates of <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> decompose <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BM%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{M}" title="&#92;tilde{M}" class="latex" /> into pieces, and one can build a tree <img src="https://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="T" title="T" class="latex" /> whose vertices correspond to to components of <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BM%7D+-+G%5Ccdot+V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{M} - G&#92;cdot V" title="&#92;tilde{M} - G&#92;cdot V" class="latex" />, and whose edges correspond to the translates <img src="https://s0.wp.com/latex.php?latex=G%5Ccdot+V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G&#92;cdot V" title="G&#92;cdot V" class="latex" />. The group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> acts on this tree, with finite edge stabilizers (by the compactness of <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" />), exhibiting <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> either as an HNN extension or an amalgamated product over the edge stabilizers. Note that the special case <img src="https://s0.wp.com/latex.php?latex=%7C%5Cmathcal%7BE%7D%28G%29%7C%3D2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|&#92;mathcal{E}(G)|=2" title="|&#92;mathcal{E}(G)|=2" class="latex" /> occurs if and only if <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> has a finite index subgroup which is isomorphic to <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z}" title="&#92;mathbb{Z}" class="latex" />.</p>
<p>Free groups and virtually free groups do not contain closed surface subgroups; Gromov&#8217;s question more or less asks whether these are the only examples of word-hyperbolic groups with this property.</p>
<p>Kim and Wilton study Gromov&#8217;s question in a very, very concrete case, namely that case that <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is the double of a free group <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> along a word <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" />; i.e. <img src="https://s0.wp.com/latex.php?latex=G+%3D+F+%2A_%7B%5Clangle+w+%5Crangle+%7D+F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G = F *_{&#92;langle w &#92;rangle } F" title="G = F *_{&#92;langle w &#92;rangle } F" class="latex" /> (hereafter denoted <img src="https://s0.wp.com/latex.php?latex=D%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w)" title="D(w)" class="latex" />). Such groups are known to be one-ended if and only if <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is not contained in a proper free factor of <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> (it is clear that this condition is necessary), and to be hyperbolic if and only if <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is not a proper power, by a <a href="http://www.ams.org/mathscinet-getitem?mr=1152226">result</a> of Bestvina-Feighn. To see that this condition is necessary, observe that the double <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D+%2A_%7Bp%5Cmathbb%7BZ%7D%7D+%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z} *_{p&#92;mathbb{Z}} &#92;mathbb{Z}" title="&#92;mathbb{Z} *_{p&#92;mathbb{Z}} &#92;mathbb{Z}" class="latex" /> is isomorphic to the fundamental group of a Seifert fiber space, with base space a disk with two orbifold points of order <img src="https://s0.wp.com/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p" title="p" class="latex" />; such a group contains a <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5Coplus+%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z}&#92;oplus &#92;mathbb{Z}" title="&#92;mathbb{Z}&#92;oplus &#92;mathbb{Z}" class="latex" />. One might think that such groups are too simple to give an insight into Gromov&#8217;s question. However, these groups (or perhaps the slightly larger class of graphs of free groups with cyclic edge groups) are a critical case for at least two reasons:</p>
<ol>
<li>The &#8220;smaller&#8221; a group is, the less room there is inside it for a surface group; thus the &#8220;simplest&#8221; groups should have the best chance of being a counterexample to Gromov&#8217;s question.</li>
<li>If <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is word-hyperbolic and one-ended, one can try to find a surface subgroup by first looking for a graph of free groups <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" /> in <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />, and then looking for a surface group in <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" />. Since a closed surface group is itself a graph of free groups, one cannot &#8220;miss&#8221; any surface groups this way.</li>
</ol>
<p>Not too long ago, I found an interesting construction of surface groups in certain graphs of free groups with cyclic edge groups. In fact, I <a href="http://www.ams.org/mathscinet-getitem?mr=2431013">showed</a> that every nontrivial element of <img src="https://s0.wp.com/latex.php?latex=H_2%28G%3B%5Cmathbb%7BQ%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H_2(G;&#92;mathbb{Q})" title="H_2(G;&#92;mathbb{Q})" class="latex" /> in such a group is virtually represented by a sum of surface subgroups. Such surface subgroups are obtained by finding maps of surface groups into <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> which minimize the Gromov norm in their (projective) homology class. I think it is useful to extend Gromov&#8217;s question by making the following</p>
<p><strong>Conjecture:</strong> Let <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> be a word-hyperbolic group, and let <img src="https://s0.wp.com/latex.php?latex=%5Calpha+%5Cin+H_2%28G%3B%5Cmathbb%7BQ%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha &#92;in H_2(G;&#92;mathbb{Q})" title="&#92;alpha &#92;in H_2(G;&#92;mathbb{Q})" class="latex" /> be nonzero. Then some multiple of <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> is represented by a norm-minimizing surface (which is necessarily <img src="https://s0.wp.com/latex.php?latex=%5Cpi_1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;pi_1" title="&#92;pi_1" class="latex" />-injective).</p>
<p>Note that this conjecture does not generalize to wider classes of groups. There are even examples of <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BCAT%7D%280%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{CAT}(0)" title="&#92;text{CAT}(0)" class="latex" /> groups <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> with nonzero homology classes <img src="https://s0.wp.com/latex.php?latex=%5Calpha+%5Cin+H_2%28G%3B%5Cmathbb%7BQ%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha &#92;in H_2(G;&#92;mathbb{Q})" title="&#92;alpha &#92;in H_2(G;&#92;mathbb{Q})" class="latex" /> with positive, rational Gromov norm, for which there are no <img src="https://s0.wp.com/latex.php?latex=%5Cpi_1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;pi_1" title="&#92;pi_1" class="latex" />-injective surfaces representing a multiple of <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" /> at all.</p>
<p>It is time to define polygonal words in free groups.</p>
<p><strong>Definition:</strong> Let <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> be free. Let <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> be a wedge of circles whose edges are free generators for <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" />. A cyclically reduced word <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> in these generators is <em>polygonal</em> if there exists a van-Kampen graph <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> on a surface <img src="https://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S" title="S" class="latex" /> such that:</p>
<ol>
<li>every complementary region is a disk whose boundary is a nontrivial (possibly negative) power of <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" />;</li>
<li>the (labelled) graph <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> immerses in <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> in a label preserving way;</li>
<li>the Euler characteristic of <img src="https://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S" title="S" class="latex" /> is strictly less than the number of disks.</li>
</ol>
<p>The last condition rules out trivial examples; for example, the double of a single disk whose boundary is labeled by <img src="https://s0.wp.com/latex.php?latex=w%5En&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w^n" title="w^n" class="latex" />. Notice that it is very important to allow both positive and negative powers of <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> as boundaries of complementary regions. In fact, if <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is not in the commutator subgroup, then the sum of the powers over all complementary regions is necessarily zero (and if <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is in the commutator subgroup, then <img src="https://s0.wp.com/latex.php?latex=D%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w)" title="D(w)" class="latex" /> has nontrivial <img src="https://s0.wp.com/latex.php?latex=H_2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H_2" title="H_2" class="latex" />, so one already knows that there is a surface subgroup).</p>
<p>Condition 2. means that at each vertex of <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" />, there is at most one oriented label corresponding to each generator of <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> or its inverse. This is really the crucial geometric property. If <img src="https://s0.wp.com/latex.php?latex=%5CGamma%2CS&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma,S" title="&#92;Gamma,S" class="latex" /> is a van-Kampen graph as above, then a theorem of Marshall Hall implies that there is a finite cover of <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> into which <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> embeds (in fact, this observation underlies Stallings&#8217;s <a href="http://www.ams.org/mathscinet-getitem?mr=695906">work</a> on foldings of graphs). If we build a <img src="https://s0.wp.com/latex.php?latex=2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2" title="2" class="latex" />-complex <img src="https://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Y" title="Y" class="latex" /> with <img src="https://s0.wp.com/latex.php?latex=%5Cpi_1%28Y%29%3DD%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;pi_1(Y)=D(w)" title="&#92;pi_1(Y)=D(w)" class="latex" /> by attaching two ends of a cylinder to suitable loops in two copies of <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" />, then a tubular neighborhood of <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> in <img src="https://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S" title="S" class="latex" /> (i.e. what is sometimes called a &#8220;fatgraph&#8221; ) embeds in a finite cover <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BY%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{Y}" title="&#92;tilde{Y}" class="latex" /> of <img src="https://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Y" title="Y" class="latex" />, and its double &#8212; a surface of strictly negative Euler characteristic &#8212; embeds as a closed surface in <img src="https://s0.wp.com/latex.php?latex=%5Ctilde%7BY%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;tilde{Y}" title="&#92;tilde{Y}" class="latex" />, and is therefore <img src="https://s0.wp.com/latex.php?latex=%5Cpi_1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;pi_1" title="&#92;pi_1" class="latex" />-injective. Hence if <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is polygonal, <img src="https://s0.wp.com/latex.php?latex=D%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w)" title="D(w)" class="latex" /> contains a surface subgroup.</p>
<p>Not every word is polygonal. Kim-Wilton discuss some interesting examples in their paper, including:</p>
<ol>
<li>suppose <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is a cyclically reduced product of proper powers of the generators or their inverses (e.g a word like <img src="https://s0.wp.com/latex.php?latex=a%5E3b%5E7a%5E%7B-2%7Dc%5E%7B13%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a^3b^7a^{-2}c^{13}" title="a^3b^7a^{-2}c^{13}" class="latex" /> but not a word like <img src="https://s0.wp.com/latex.php?latex=a%5E3bc%5E%7B-1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a^3bc^{-1}" title="a^3bc^{-1}" class="latex" />); then <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is polygonal;</li>
<li>a word of the form <img src="https://s0.wp.com/latex.php?latex=%5Cprod_i+a%5E%7Bp_%7B2i-1%7D%7D%28a%5E%7Bp_%7B2i%7D%7D%29%5Eb&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;prod_i a^{p_{2i-1}}(a^{p_{2i}})^b" title="&#92;prod_i a^{p_{2i-1}}(a^{p_{2i}})^b" class="latex" /> is polygonal if <img src="https://s0.wp.com/latex.php?latex=%7Cp_i%7C%3E1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|p_i|&gt;1" title="|p_i|&gt;1" class="latex" /> for each <img src="https://s0.wp.com/latex.php?latex=i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="i" title="i" class="latex" />;</li>
<li>the word <img src="https://s0.wp.com/latex.php?latex=abab%5E2ab%5E3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="abab^2ab^3" title="abab^2ab^3" class="latex" /> is <em>not</em> polygonal.</li>
</ol>
<p>To see 3, suppose there were a van-Kampen diagram with more disks than Euler characteristic. Then there must be some vertex of valence at least <img src="https://s0.wp.com/latex.php?latex=3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="3" title="3" class="latex" />. Since <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is positive, the complementary regions must have boundaries which alternate between positive and negative powers of <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" />, so the degree of the vertex must be even. On the other hand, since <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> must immerse in a wedge of two circles, the degree of every vertex must be at most <img src="https://s0.wp.com/latex.php?latex=4&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="4" title="4" class="latex" />, so there is consequently some vertex of degree exactly <img src="https://s0.wp.com/latex.php?latex=4&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="4" title="4" class="latex" />. Since each <img src="https://s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" /> is isolated, at least <img src="https://s0.wp.com/latex.php?latex=2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2" title="2" class="latex" /> edges must be labelled <img src="https://s0.wp.com/latex.php?latex=b&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="b" title="b" class="latex" />; hence exactly two. Hence exactly two edges are labelled <img src="https://s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" />. But one of these must be incoming and one outgoing, and therefore these are adjacent, contrary to the fact that <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> does not contain a <img src="https://s0.wp.com/latex.php?latex=a%5E%7B%5Cpm+2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a^{&#92;pm 2}" title="a^{&#92;pm 2}" class="latex" />.</p>
<p>1 above is quite striking to me. When <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is in the commutator subgroup, one can consider van-Kampen diagrams as above without the injectivity property, but with the property that every power of <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> on the boundary of a disk is <em>positive</em>; call such a van-Kampen diagram <em>monotone</em>. It turns out that monotone van-Kampen diagrams always exist when <img src="https://s0.wp.com/latex.php?latex=w+%5Cin+%5BF%2CF%5D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w &#92;in [F,F]" title="w &#92;in [F,F]" class="latex" />, and in fact that norm-minimizing surfaces representing powers of the generator of <img src="https://s0.wp.com/latex.php?latex=H_2%28D%28w%29%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H_2(D(w))" title="H_2(D(w))" class="latex" /> are associated to certain monotone diagrams. The construction of such surfaces is an important step in the argument that stable commutator length (a kind of relative Gromov norm) is rational in free groups. In my paper <a href="http://arxiv.org/abs/0907.3541">scl, sails and surgery</a> I showed that monomorphisms of free groups that send every generator to a power of that generator induce isometries of the <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7Bscl%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{scl}" title="&#92;text{scl}" class="latex" /> norm; in other words, there is a natural correspondence between certain equivalence classes of monotone surfaces for an arbitrary word in <img src="https://s0.wp.com/latex.php?latex=%5BF%2CF%5D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="[F,F]" title="[F,F]" class="latex" /> and for a word of the kind that Kim-Wilton show is polygonal (Note: Henry Wilton tells me that Brady, Forester and Martinez-Pedroza have independently shown that <img src="https://s0.wp.com/latex.php?latex=D%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w)" title="D(w)" class="latex" /> contains a surface group for such <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" />, but I have not seen their preprint (though I would be very grateful to get a copy!)).</p>
<p>In any case, if not every word is polygonal, all is not lost. To show that <img src="https://s0.wp.com/latex.php?latex=D%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w)" title="D(w)" class="latex" /> contains a surface subgroup is suffices to show that <img src="https://s0.wp.com/latex.php?latex=D%28w%27%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w&#039;)" title="D(w&#039;)" class="latex" /> contains a surface subgroup, where <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=w%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w&#039;" title="w&#039;" class="latex" /> differ by an automorphism of <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" />. Kim-Wilton conjecture that one can always find an automorphism <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> so that <img src="https://s0.wp.com/latex.php?latex=%5Cphi%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi(w)" title="&#92;phi(w)" class="latex" /> is polygonal. In fact, they make the following:</p>
<p><strong>Conjecture (Kim-Wilton; tiling conjecture):</strong> A word <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> not contained in a proper free factor of shortest length (in a given generating set) in its orbit under <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BAut%7D%28F%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{Aut}(F)" title="&#92;text{Aut}(F)" class="latex" /> is polygonal.</p>
<p>If true, this would give a positive answer to Gromov&#8217;s question for groups of the form <img src="https://s0.wp.com/latex.php?latex=D%28w%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(w)" title="D(w)" class="latex" />.</p>
]]></html></oembed>