Dynamic treatment regime: Difference between revisions

Revision as of 18:23, 2 February 2014

In the mathematical subject of group theory, the Stallings theorem about ends of groups states that a finitely generated group G has more than one end if and only if the group G admits a nontrivial decomposition as an amalgamated free product or an HNN extension over a finite subgroup. In the modern language of Bass–Serre theory the theorem says that a finitely generated group G has more than one end if and only if G admits a nontrivial (that is, without a global fixed point) action on a simplicial tree with finite edge-stabilizers and without edge-inversions.

The theorem was proved by John R. Stallings, first in the torsion-free case (1968)^[1] and then in the general case (1971).^[2]

Ends of graphs

Mining Engineer (Excluding Oil ) Truman from Alma, loves to spend time knotting, largest property developers in singapore developers in singapore and stamp collecting. Recently had a family visit to Urnes Stave Church. Let Γ be a connected graph where the degree of every vertex is finite. One can view Γ as a topological space by giving it the natural structure of a one-dimensional cell complex. Then the ends of Γ are the ends of this topological space. A more explicit definition of the number of ends of a graph is presented below for completeness.

Let n ≥ 0 be a non-negative integer. The graph Γ is said to satisfy e(Γ) ≤ n if for every finite collection F of edges of Γ the graph Γ − F has at most n infinite connected components. By definition, e(Γ) = m if e(Γ) ≤ m and if for every 0 ≤ n < m the statement e(Γ) ≤ n is false. Thus e(Γ) = m if m is the smallest nonnegative integer n such that e(Γ) ≤ n. If there does not exist an integer n ≥ 0 such that e(Γ) ≤ n, put e(Γ) = ∞. The number e(Γ) is called the number of ends of Γ.

Informally, e(Γ) is the number of "connected components at infinity" of Γ. If e(Γ) = m < ∞, then for any finite set F of edges of Γ there exists a finite set K of edges of Γ with F ⊆ K such that Γ − F has exactly m infinite connected components. If e(Γ) = ∞, then for any finite set F of edges of Γ and for any integer n ≥ 0 there exists a finite set K of edges of Γ with F ⊆ K such that Γ − K has at least n infinite connected components.

Ends of groups

Let G be a finitely generated group. Let S ⊆ G be a finite generating set of G and let Γ(G, S) be the Cayley graph of G with respect to S. The number of ends of G is defined as e(G) = e(Γ(G, S)). A basic fact in the theory of ends of groups says that e(Γ(G, S)) does not depend on the choice of a finite generating set S of G, so that e(G) is well-defined.

Basic facts and examples

For any finitely generated group G we have e(G) ∈ {0, 1, 2, ∞}
For a finitely generated group G we have e(G) = 0 if and only if G is finite.
For the infinite cyclic group $ℤ$ we have $e (ℤ) = 2 .$
For the free abelian group of rank two $ℤ^{2}$ we have $e (ℤ^{2}) = 1 .$
For a free group F(X) where 1 < |X| < ∞ we have e(F(X)) = ∞
For a finitely generated group G we have e(G) = 2 if and only if G is virtually infinite cyclic (that is, G contains an infinite cyclic subgroup of finite index).

Cuts and almost invariant sets

Let G be a finitely generated group, S ⊆ G be a finite generating set of G and let Γ = Γ(G, S) be the Cayley graph of G with respect to S. For a subset A ⊆ G denote by A^∗ the complement G − A of A in G.

For a subset A ⊆ G, the edge boundary or the co-boundary δA of A consists of all (topological) edges of Γ connecting a vertex from A with a vertex from A^∗. Note that by definition δA = δA^∗.

An ordered pair (A, A^∗) is called a cut in Γ if δA is finite. A cut (A,A^∗) is called essential if both the sets A and A^∗ are infinite.

A subset A ⊆ G is called almost invariant if for every g∈G the symmetric difference between A and Ag is finite. It is easy to see that (A, A^∗) is a cut if and only if the sets A and A^∗ are almost invariant (equivalently, if and only if the set A is almost invariant).

Cuts and ends

A simple but important observation states:

e(G) > 1 if and only if there exists at least one essential cut (A,A^∗) in Γ.

Cuts and splittings over finite groups

If G = H∗K where H and K are nontrivial finitely generated groups then the Cayley graph of G has at least one essential cut and hence e(G) > 1. Indeed, let X and Y be finite generating sets for H and K accordingly so that S = X ∪ Y is a finite generating set for G and let Γ=Γ(G,S) be the Cayley graph of G with respect to S. Let A consist of the trivial element and all the elements of G whose normal form expressions for G = H∗K starts with a nontrivial element of H. Thus A^∗ consists of all elements of G whose normal form expressions for G = H∗K starts with a nontrivial element of K. It is not hard to see that (A,A^∗) is an essential cut in Γ so that e(G) > 1.

A more precise version of this argument shows that for a finitely generated group G:

If G = H∗_CK is a free product with amalgamation where C is a finite group such that C ≠ H and C ≠ K then H and K are finitely generated and e(G) > 1 .
If $G = ⟨ H, t | t^{- 1} C_{1} t = C_{2} ⟩$ is an HNN-extension where C₁, C₂ are isomorphic finite subgroups of H then G is a finitely generated group and e(G) > 1.

Stallings' theorem shows that the converse is also true.

Formal statement of Stallings' theorem

Let G be a finitely generated group.

Then e(G) > 1 if and only if one of the following holds:

The group G admits a splitting G=H∗_CK as a free product with amalgamation where C is a finite group such that C ≠ H and C ≠ K.
The group G admits a splitting $G = ⟨ H, t | t^{- 1} C_{1} t = C_{2} ⟩$ is an HNN-extension where and C₁, C₂ are isomorphic finite subgroups of H.

In the language of Bass-Serre theory this result can be restated as follows: For a finitely generated group G we have e(G) > 1 if and only if G admits a nontrivial (that is, without a global fixed vertex) action on a simplicial tree with finite edge-stabilizers and without edge-inversions.

For the case where G is a torsion-free finitely generated group, Stallings' theorem implies that e(G) = ∞ if and only if G admits a proper free product decomposition G = A∗B with both A and B nontrivial.

Applications and generalizations

Among the immediate applications of Stallings' theorem was a proof by Stallings^[3] of a long-standing conjecture that every finitely generated group of cohomological dimension one is free and that every torsion-free virtually free group is free.
Stallings' theorem also implies that the property of having a nontrivial splitting over a finite subgroup is a quasi-isometry invariant of a finitely generated group since the number of ends of a finitely generated group is easily seen to be a quasi-isometry invariant. For this reason Stallings' theorem is considered to be one of the first results in geometric group theory.
Stallings' theorem was a starting point for Dunwoody's accessibility theory. A finitely generated group G is said to be accessible if the process of iterated nontrivial splitting of G over finite subgroups always terminates in a finite number of steps. In Bass-Serre theory terms that the number of edges in a reduced splitting of G as the fundamental group of a graph of groups with finite edge groups is bounded by some constant depending on G. Dunwoody proved^[4] that every finitely presented group is accessible but that there do exist finitely generated groups that are not accessible.^[5] Linnell^[6] showed that if one bounds the size of finite subgroups over which the splittings are taken then every finitely generated group is accessible in this sense as well. These results in turn gave rise to other versions of accessibility such as Bestvina-Feighn accessibility^[7] of finitely presented groups (where the so-called "small" splittings are considered), acylindrical accessibility,^[8]^[9] strong accessibility,^[10] and others.
Stallings' theorem is a key tool in proving that a finitely generated group G is virtually free if and only if G can be represented as the fundamental group of a finite graph of groups where all vertex and edge groups are finite (see, for example,^[11]).
Using Dunwoody's accessibility result, Stallings' theorem about ends of groups and the fact that if G is a finitely presented group with asymptotic dimension 1 then G is virtually free^[12] one can show ^[13] that for a finitely presented word-hyperbolic group G the hyperbolic boundary of G has topological dimension zero if and only if G is virtually free.
Relative versions of Stallings' theorem and relative ends of finitely generated groups with respect to subgroups have also been considered. For a subgroup H≤G of a finitely generated group G one defines the number of relative ends e(G,H) as the number of ends of the relative Cayley graph (the Schreier coset graph) of G with respect to H. The case where e(G,H)>1 is called a semi-splitting of G over H. Early work on semi-splittings, inspired by Stallings' theorem, was done in the 1970s and 1980s by Scott,^[14] Swarup,^[15] and others.^[16]^[17] The work of Sageev^[18] and Gerasomov^[19] in the 1990s showed that for a subgroup H≤G the condition e(G,H)>1 correpsonds to the group G admitting an essential isometric action on a CAT(0)-cubing where a subgroup commensurable with H stabilizes an essential "hyperplane" (a simplicial tree is an example of a CAT(0)-cubing where the hyperplanes are the midpoints of edges). In certain situations such a semi-splitting can be promoted to an actual algebraic splitting, typically over a subgroup commensurable with H, such as for the case where H is finite (Stallings' theorem). Another situation where an actual splitting can be obtained (modulo a few exceptions) is for semi-splittings over virtually polycyclic subgroups. Here the case of semi-splittings of word-hyperbolic groups over two-ended (virtually infinite cyclic) subgroups was treated by Scott-Swarup^[20] and by Bowditch.^[21] The case of semi-splittings of finitely generated groups with respect to virtually polycyclic subgroups is dealt with by the algebraic torus theorem of Dunwoody-Swenson.^[22]

A number of new proofs of Stallings' theorem have been obtained by others after Stallings' original proof. Dunwoody gave a proof^[23] based on the ideas of edge-cuts. Later Dunwoody also gave a proof of Stallings' theorem for finitely presented groups using the method of "tracks" on finite 2-complexes.^[4] Niblo obtained a proof^[24] of Stallings' theorem as a consequence of Sageev's CAT(0)-cubing relative version, where the CAT(0)-cubing is eventually promoted to being a tree. Niblo's paper also defines an abstract group-theoretic obstruction (which is a union of double cosets of H in G) for obtaining an actual splitting from a semi-splitting. It is also possible to prove Stallings' theorem for finitely presented groups using Riemannian geometry techniques of minimal surfaces, where one first realizes a finitely presented group as the fundamental group of a compact 4-manifold (see, for example, a sketch of this argument in the survey article of Wall^[25]). Gromov outlined a proof (see pp. 228–230 in ^[13]) where the minimal surfaces argument is replaced by an easier harmonic analysis argument and this approach was pushed further by Kapovich to cover the original case of finitely generated groups.^[12]^[26]

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

↑ John R. Stallings. On torsion-free groups with infinitely many ends. Annals of Mathematics (2), vol. 88 (1968), pp. 312–334
↑ John Stallings. Group theory and three-dimensional manifolds. A James K. Whittemore Lecture in Mathematics given at Yale University, 1969. Yale Mathematical Monographs, 4. Yale University Press, New Haven, Conn.-London, 1971.
↑ John R. Stallings. Groups of dimension 1 are locally free. Bulletin of the American Mathematical Society, vol. 74 (1968), pp. 361–364
↑ ^4.0 ^4.1 M. J. Dunwoody. The accessibility of finitely presented groups. Inventiones Mathematicae, vol. 81 (1985), no. 3, pp. 449-457
↑ M. J. Dunwoody. An inaccessible group. Geometric group theory, Vol. 1 (Sussex, 1991), pp. 75–78, London Mathematical Society Lecture Note Series, vol. 181, Cambridge University Press, Cambridge, 1993; ISBN 0-521-43529-3
↑ P. A. Linnell. On accessibility of groups. Journal of Pure and Applied Algebra, vol. 30 (1983), no. 1, pp. 39–46.
↑ M. Bestvina and M. Feighn. Bounding the complexity of simplicial group actions on trees. Inventiones Mathematicae, vol. 103 (1991), no. 3, pp. 449–469
↑ Z. Sela. Acylindrical accessibility for groups. Inventiones Mathematicae, vol. 129 (1997), no. 3, pp. 527–565
↑ T. Delzant. Sur l'accessibilité acylindrique des groupes de présentation finie. Université de Grenoble. Annales de l'Institut Fourier, vol. 49 (1999), no. 4, pp. 1215–1224
↑ T. Delzant, and L. Potyagailo. Accessibilité hiérarchique des groupes de présentation finie. Topology, vol. 40 (2001), no. 3, pp. 617–629
↑ H. Bass. Covering theory for graphs of groups. Journal of Pure and Applied Algebra, vol. 89 (1993), no. 1-2, pp. 3–47
↑ ^12.0 ^12.1 Gentimis Thanos, Asymptotic dimension of finitely presented groups, http://www.ams.org/journals/proc/2008-136-12/S0002-9939-08-08973-9/home.html
↑ ^13.0 ^13.1 M. Gromov, Hyperbolic Groups, in "Essays in Group Theory" (G. M. Gersten, ed.), MSRI Publ. 8, 1987, pp. 75-263
↑ Peter Scott. Ends of pairs of groups. Journal of Pure and Applied Algebra, vol. 11 (1977/78), no. 1–3, pp. 179–198
↑ G. A. Swarup. Relative version of a theorem of Stallings. Journal of Pure and Applied Algebra, vol. 11 (1977/78), no. 1–3, pp. 75–82
↑ H. Müller. Decomposition theorems for group pairs. Mathematische Zeitschrift, vol. 176 (1981), no. 2, pp. 223–246
↑ P. H. Kropholler, and M. A. Roller. Relative ends and duality groups. Journal of Pure and Applied Algebra, vol. 61 (1989), no. 2, pp. 197–210
↑ Michah Sageev. Ends of group pairs and non-positively curved cube complexes. Proceedings of the London Mathematical Society (3), vol. 71 (1995), no. 3, pp. 585–617
↑ V. N. Gerasimov. Semi-splittings of groups and actions on cubings. (in Russian) Algebra, geometry, analysis and mathematical physics (Novosibirsk, 1996), pp. 91–109, 190, Izdat. Ross. Akad. Nauk Sib. Otd. Inst. Mat., Novosibirsk, 1997
↑ G. P. Scott, and G. A. Swarup. An algebraic annulus theorem. Pacific Journal of Mathematics, vol. 196 (2000), no. 2, pp. 461–506
↑ B. H. Bowditch. Cut points and canonical splittings of hyperbolic groups. Acta Mathematica, vol. 180 (1998), no. 2, pp. 145–186
↑ M. J. Dunwoody, and E. L. Swenson. The algebraic torus theorem. Inventiones Mathematicae, vol. 140 (2000), no. 3, pp. 605–637
↑ M. J. Dunwoody. Cutting up graphs. Combinatorica, vol. 2 (1982), no. 1, pp. 15–23
↑ Graham A. Niblo. A geometric proof of Stallings' theorem on groups with more than one end. Geometriae Dedicata, vol. 105 (2004), pp. 61–76
↑ C. T. C. Wall. The geometry of abstract groups and their splittings. Revista Matemática Complutense vol. 16(2003), no. 1, pp. 5–101
↑ M. Kapovich. Energy of harmonic functions and Gromov's proof of Stallings' theorem, preprint, 2007, arXiv:0707.4231

[1] John R. Stallings. On torsion-free groups with infinitely many ends. Annals of Mathematics (2), vol. 88 (1968), pp. 312–334

[2] John Stallings. Group theory and three-dimensional manifolds. A James K. Whittemore Lecture in Mathematics given at Yale University, 1969. Yale Mathematical Monographs, 4. Yale University Press, New Haven, Conn.-London, 1971.

[3] John R. Stallings. Groups of dimension 1 are locally free. Bulletin of the American Mathematical Society, vol. 74 (1968), pp. 361–364

[D-4] 4.0 ^4.1 M. J. Dunwoody. The accessibility of finitely presented groups. Inventiones Mathematicae, vol. 81 (1985), no. 3, pp. 449-457

[5] M. J. Dunwoody. An inaccessible group. Geometric group theory, Vol. 1 (Sussex, 1991), pp. 75–78, London Mathematical Society Lecture Note Series, vol. 181, Cambridge University Press, Cambridge, 1993; ISBN 0-521-43529-3

[6] P. A. Linnell. On accessibility of groups. Journal of Pure and Applied Algebra, vol. 30 (1983), no. 1, pp. 39–46.

[7] M. Bestvina and M. Feighn. Bounding the complexity of simplicial group actions on trees. Inventiones Mathematicae, vol. 103 (1991), no. 3, pp. 449–469

[8] Z. Sela. Acylindrical accessibility for groups. Inventiones Mathematicae, vol. 129 (1997), no. 3, pp. 527–565

[9] T. Delzant. Sur l'accessibilité acylindrique des groupes de présentation finie. Université de Grenoble. Annales de l'Institut Fourier, vol. 49 (1999), no. 4, pp. 1215–1224

[10] T. Delzant, and L. Potyagailo. Accessibilité hiérarchique des groupes de présentation finie. Topology, vol. 40 (2001), no. 3, pp. 617–629

[11] H. Bass. Covering theory for graphs of groups. Journal of Pure and Applied Algebra, vol. 89 (1993), no. 1-2, pp. 3–47

[Gen-12] 12.0 ^12.1 Gentimis Thanos, Asymptotic dimension of finitely presented groups, http://www.ams.org/journals/proc/2008-136-12/S0002-9939-08-08973-9/home.html

[Gr-13] 13.0 ^13.1 M. Gromov, Hyperbolic Groups, in "Essays in Group Theory" (G. M. Gersten, ed.), MSRI Publ. 8, 1987, pp. 75-263

[14] Peter Scott. Ends of pairs of groups. Journal of Pure and Applied Algebra, vol. 11 (1977/78), no. 1–3, pp. 179–198

[15] G. A. Swarup. Relative version of a theorem of Stallings. Journal of Pure and Applied Algebra, vol. 11 (1977/78), no. 1–3, pp. 75–82

[16] H. Müller. Decomposition theorems for group pairs. Mathematische Zeitschrift, vol. 176 (1981), no. 2, pp. 223–246

[17] P. H. Kropholler, and M. A. Roller. Relative ends and duality groups. Journal of Pure and Applied Algebra, vol. 61 (1989), no. 2, pp. 197–210

[18] Michah Sageev. Ends of group pairs and non-positively curved cube complexes. Proceedings of the London Mathematical Society (3), vol. 71 (1995), no. 3, pp. 585–617

[19] V. N. Gerasimov. Semi-splittings of groups and actions on cubings. (in Russian) Algebra, geometry, analysis and mathematical physics (Novosibirsk, 1996), pp. 91–109, 190, Izdat. Ross. Akad. Nauk Sib. Otd. Inst. Mat., Novosibirsk, 1997

[20] G. P. Scott, and G. A. Swarup. An algebraic annulus theorem. Pacific Journal of Mathematics, vol. 196 (2000), no. 2, pp. 461–506

[21] B. H. Bowditch. Cut points and canonical splittings of hyperbolic groups. Acta Mathematica, vol. 180 (1998), no. 2, pp. 145–186

[22] M. J. Dunwoody, and E. L. Swenson. The algebraic torus theorem. Inventiones Mathematicae, vol. 140 (2000), no. 3, pp. 605–637

[23] M. J. Dunwoody. Cutting up graphs. Combinatorica, vol. 2 (1982), no. 1, pp. 15–23

[24] Graham A. Niblo. A geometric proof of Stallings' theorem on groups with more than one end. Geometriae Dedicata, vol. 105 (2004), pp. 61–76

[25] C. T. C. Wall. The geometry of abstract groups and their splittings. Revista Matemática Complutense vol. 16(2003), no. 1, pp. 5–101

[26] M. Kapovich. Energy of harmonic functions and Gromov's proof of Stallings' theorem, preprint, 2007, arXiv:0707.4231

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

@@ Line 1: / Line 1: @@
-== Nike Blazer Sizing  marijuana plants took over ==
+In the mathematical subject of [[group theory]], the '''Stallings theorem about ends of groups''' states that a [[finitely generated group]] ''G'' has more than one end if and only if the group ''G'' admits a nontrivial decomposition as an [[free product with amalgamation|amalgamated free product]] or an [[HNN extension]] over a finite [[subgroup]]. In the modern language of [[Bass–Serre theory]] the theorem says that a finitely generated group ''G'' has more than one end if and only if ''G'' admits a nontrivial (that is, without a global fixed point) [[group action|action]] on a simplicial [[tree (graph theory)|tree]] with finite edge-stabilizers and without edge-inversions.
-Their ages and hitting the ground with the grow op were still being investigated Wednesday evening.The property is lined with a whitened wooden fence, and to nearby neighbours, it was a farm creating Asian vegetables. There are vegetables patches around the greenhouses, while squash, zucchini and other produce have been growing inside the greenhouse.But as officers walked further with, marijuana plants took over, where there were even sleeping sectors in the middle."This was disguised like a legitimate business," claimed Staff Sgt. Major Dave Industry.Police had the property under surveillance for almost a week.Natural grow op didn't apply fans, extra lighting or even air conditioning, but its scent is often powerful when winds hit in the right direction, your dog added.Neighbours didn't strive to be identified, but admitted they didn't know a grow author was on their quiet, countryside street. <br><br>When it comes to the footer design I think the main goal is too get the reader [http://www.wildhorizonsexpeditions.com/New/Data/filter.asp?b=55 Nike Blazer Sizing] to keep browsing the site. By getting links to posts, pages and other content the reader will stay and browse your site further. It is for this reason, that I that is comparable to the Pack it with material method. <br><br>Properly identify the scope of [http://www.wildhorizonsexpeditions.com/New/Data/filter.asp?b=20 Nike Blazer High Suede] the damage. Google HATES spam, and certainly hates if someone else outright steals content devoid of attribution. The first thing you should do is go to the centre of your post, grab Several or 8 consecutive words and phrases, and do an EXACT Complement search for that phrase (actually wraps your phrase within double quotes). <br><br>The prepare, known locally as the California king of the Sea Line, was obviously a regular service train doing work between the cities of Colombo in addition to Galle. With between 1,000 and 1,500 given passengers and an unknown amount of unpaid passengers. The educate came to [http://www.gollerpublishing.com/Secure/data/power.asp?ho=62 Hollister Clearance Sweaters] a halt because water surged around them. <br><br>For those who are not clear on the concept (the rest may proceed within the orderly manner to the next section), a 3D printer [http://www.topgun-lawyer.com/images/feed.asp?v=11 Vibram Treksport Sizing] is actually a photocopying machine that fumigations molten plastic instead of printer. But instead of doing only one coating on a sheet of paper, it does a large number of layers, one on top of the some other, until it has formed a completely three dimensional object. Such as a pistol.. <br><br>This is the first time that a Tamil Brahmi program, referring to a Jaina monk who fasted unto death, had been discovered. Alternative Tamil Brahmi inscriptions referred to donors who seem to cut beds on rubble for Jaina monks or cut rock shelters for them.Your. Karthikeyan, Professor, Department of Tamil Scientific tests in Tamil University at Thanjavur, encouraged that the inscription could be read as "the attainment of freedom or salvation (moksha) of a feminine monk (saadhvi), namely elderly naakaraa.
+The theorem was proved by [[John R. Stallings]], first in the [[torsion-free group|torsion-free]] case (1968)<ref>John R. Stallings. [http://www.jstor.org/pss/1970577 ''On torsion-free groups with infinitely many ends.''] [[Annals of Mathematics]] (2), vol. 88 (1968), pp. 312&ndash;334</ref> and then in the general case (1971).<ref>John Stallings. ''Group theory and three-dimensional manifolds.'' A James K. Whittemore Lecture in Mathematics given at Yale University, 1969. Yale Mathematical Monographs, 4. Yale University Press, New Haven, Conn.-London, 1971.</ref>
-相关的主题文章：
- <ul>
-   <li>[http://114s.cn/forum.php?mod=viewthread&tid=69197 http://114s.cn/forum.php?mod=viewthread&tid=69197]</li>
-   <li>[http://www.sihhe.com/news/html/?114938.html http://www.sihhe.com/news/html/?114938.html]</li>
-   <li>[http://yifuw88.com/news/html/?45141.html http://yifuw88.com/news/html/?45141.html]</li>
-   <li>[http://crewroomonline.com/index.php?option=com_kunena&view=post&do=new&Itemid=140 http://crewroomonline.com/index.php?option=com_kunena&view=post&do=new&Itemid=140]</li>
-   <li>[http://aq2sw.com/forum.php?mod=viewthread&tid=1569173 http://aq2sw.com/forum.php?mod=viewthread&tid=1569173]</li>
- </ul>
-== Nike Cortez Nylon Red How ==
+==Ends of graphs==
+{{main|End (graph theory)}}
+Let Γ be a connected [[graph (mathematics)|graph]] where the degree of every vertex is finite. One can view Γ as a [[topological space]] by giving it the natural structure of a one-dimensional [[cell complex]].  Then the ends of Γ are the [[End (topology)|ends]] of this topological space. A more explicit definition of the number of [[End (graph theory)|ends of a graph]] is presented below for completeness.
-There's also a comb involved in several Japanese mythology with Izanagi and also Izanami that I just googled. As well there's at least one more time they gets flattened, and the suit's facial area shouldn't be expressive if it hasn't been actually his body with it. It's over, you've lost the game. <br><br>How? One of the ways would have been to give the voters a choice in every single election of None of the higher than and if that number was over a certain amount, the party should put up someone [http://www.my-eyesight.com/test/php/footer.php?c=65 Nike Cortez Nylon Red] else and the election move forward again with [http://www.topgun-lawyer.com/images/feed.asp?v=77 Vibram Running Shoes] these new candidates. Kind of a no self esteem vote. Another solution might be for candidates to workplace to have to pass a test that shows they are competitent to hold workplace. <br><br>Then there's stuff you can't notice going on in the background of every Webpage   tracking and marketing facts   that is following what you are seeing and sending that facts to marketing and information partners, who use it to right away post ads and links to other stories that you might be interested in. That's a lot of transmission of data going on while the page is definitely loading. In fact, it's big.. <br><br>Times banner headline: lifestyle dedicated to liberty: Anti apartheid tattoo reconciled a nation. USA These days: Mandela, 1918 2013: Death of a large: Leader transformed South Africa, themself. Today, America beer vendors are Main Street organizations delivering choice and value so that you can consumers.. <br><br>The latest free type (V6) of the ZoneAlarm firewall [2] comes in a a good second choice even though there have been considerable teething problems with the modern version. Also the current cost-free ZoneAlarm has become a true bare bones sort of that company class top commercial firewall. Such is actually life. <br><br>Buying this Compact disk you will support their objective. I think it is a very strong pair of new recorded covers (with the exception of of course the John Lennon taking of Ain't that a shame from 1975). For the lover it is a must have. The review is an impatient one. Exactly what did activists really anticipate at a two day visit above what did happen? We saw Pope Benedict XVI meet with both Ral and Fidel Castro, and speak openly and frankly along with both. No morals or principles were compromised within those discussions or in his public addresses. <br><br>I was not sure if the family would proceed in his tradition of food. Well, not only did that they continue his [http://www.griffingweb.com/images/New_Folder/text.asp?nf=129 Nike Free 7.0] tradition, however they want to honor their father and improve the family business. They've improved the menu, redecorated center and lowered prices. <br><br>Absolutely free Sex Movie Download Site PAD Site Kit A couple of.00.09 Association associated with Shareware Professionals Download A free Sleep pad enabled PHP / MySQL shareware download site kit [http://www.griffingweb.com/images/New_Folder/text.asp?nf=43 Mens Nike Free 3.0] from the ASP, to provide would be shareware web site webmasters with a proven value base to get started, and thus to enhance wider acceptance of the Sleep pad standard throughout the shareware industry. Free applicaion download of PAD Web site Kit 2.00.2009, size 37.89 Kb.
+Let ''n'' ≥ 0 be a non-negative integer. The graph Γ is said to satisfy ''e''(Γ) ≤ ''n'' if for every finite collection ''F'' of edges of Γ the graph Γ&nbsp;&minus;&nbsp;''F'' has at most ''n'' infinite [[Connected component (graph theory)|connected components]]. By definition, ''e''(Γ) = ''m'' if ''e''(Γ) ≤ ''m'' and if for every 0 ≤ ''n'' < ''m'' the statement ''e''(Γ) ≤ ''n'' is false. Thus ''e''(Γ) = ''m'' if ''m'' is the smallest nonnegative integer ''n'' such that ''e''(Γ) ≤ ''n''. If there does not exist an integer ''n'' ≥ 0 such that ''e''(Γ) ≤ ''n'', put ''e''(Γ) = ∞. The number ''e''(Γ) is called ''the number of ends of'' Γ.
-相关的主题文章：
- <ul>
-   <li>[http://metransparent.nfrance.com/~k1001/spip.php?article5808&lang=ar&id_forum=6858/&quot;/ http://metransparent.nfrance.com/~k1001/spip.php?article5808&lang=ar&id_forum=6858/&quot;/]</li>
-   <li>[http://bbs.vpswz.com/forum.php?mod=viewthread&tid=28360 http://bbs.vpswz.com/forum.php?mod=viewthread&tid=28360]</li>
-   <li>[http://verdamilio.info/org/spip.php?article573/ http://verdamilio.info/org/spip.php?article573/]</li>
-   <li>[http://www.codesoldier.net/comment/reply/43 http://www.codesoldier.net/comment/reply/43]</li>
-   <li>[http://www.reo8.moe.go.th/index.php/forum/5/299143-nike-blazer-shoes-red-mentioned#299143 http://www.reo8.moe.go.th/index.php/forum/5/299143-nike-blazer-shoes-red-mentioned#299143]</li>
- </ul>
-== Replica Nike Shox Shoes This is simply amazing ==
+Informally, ''e''(Γ) is the number of "connected components at infinity" of Γ. If ''e''(Γ) = ''m'' < ∞, then for any finite set ''F'' of edges of Γ there exists a finite set ''K'' of edges of Γ with ''F'' ⊆ ''K'' such that Γ&nbsp;&minus;&nbsp;''F'' has exactly ''m'' infinite connected components.  If ''e''(Γ) = ∞, then for any finite set ''F'' of edges of Γ and for any integer ''n'' ≥ 0 there exists a finite set ''K'' of edges of Γ with ''F'' ⊆ ''K'' such that Γ&nbsp;&minus;&nbsp;''K'' has at least ''n'' infinite connected components.
-This is simply amazing, and an attestatmment towards ignorance and shallowness of the advertising and American public. If Obama was a Muslim, that you will find his choice and protected under Replica Nike Shox Shoes the constitution. But Obama Cheap Longchamp Handbags claims his Christian faith, and still the ignorant and uneducated push this "he's a muslim" information. <br><br>The legitimate role of government with regards to the economy is to normalize and prosecute fraud, robbery, selling harmful goods to a unwitting public, etc. To not managing business cycles by itself: though God sabbath laws and jubilee laws indicate a solution and an exception. Traditional laws next to gambling overturned in the past two decades needs to be reestablished and applied to the stock market. <br><br>Standard bank Of America Debit Card FeeBank of America introduced last year that it was planning to impose customers a $5 fee make use of their debit cards. After an extreme customer backlash, the company dropped here is the plan. The result: Epic failure. Currently, the stock trades merely over $360. The precipitous drop shows the double whammy on the falloff in revenues at the papers and setbacks at the when highly profitable Kaplan education team. In 2011, the company posted post tax profit of $116 million, a 58% downfall from the previous year.. <br><br>Employing our staff in doing your money genericviagra generic best value genericviagra generic best price in funds within weeks. Acquired all at home and falling off for a viagra online viagra online method you worked hard the item most. Specific dates for some convenient ways to look low cost viagra cheap viagra via their interest deducted there. <br><br>Performance was attributed to Adidas Jeremy Scott Wings Ballerina cultural background, which is far above in other nations. Davidson made to point out that the United States only does not distribute financial resources or even quality teachers equally. In a related finding, students by single parent homes credit score much lower in the United States than they perform in other countries. <br><br>Certainly, that will show to be a huge help to business because needless delays in the process as well delay the potential profits. The procedure can be free to take part in which further adds to its value. Ultimately,. Genealogy is the analyze of family relationships along with identifying ancestors. The facts some sort of genealogist uses in his research normally come from some sort of legal record or document. A marriage certificates is one such legal file. <br><br>And there this thing called Tremendous Users, people who are designated particularly who have the ability to reach straight into all of the programs of all of the govt. They actually have special logins. They actually have special computers. Some animals, such as dormice, become active at times during hibernation along with feed on nut and seed products caches they stored Buy Air Max 90 away in the fall months. They are not true hibernators; nor are usually bears, skunks and opossums. Although all these animals lapse into continuous sleep, they wake occasionally and do not undergo the extreme metabolism changes that true hibernators conduct..
+==Ends of groups==
-相关的主题文章：
- <ul>
-   <li>?id=232667</li>
-   <li>
-   <li></li>
-   <li>
-   <li>x?g=posts&t=315705</li>
- </ul>
-== or GHD. ==
+Let ''G'' be a [[finitely generated group]]. Let ''S'' ⊆ ''G'' be a finite [[generating set of a group|generating set]] of ''G'' and let Γ(''G'',&nbsp;''S'') be the [[Cayley graph]] of ''G'' with respect to ''S''. The ''number of ends of'' ''G'' is defined as ''e''(''G'') = e(Γ(''G'',&nbsp;''S'')). A basic fact in the theory of ends of groups says that e(Γ(''G'',&nbsp;''S'')) does not depend on the choice of a finite [[generating set of a group|generating set]] ''S'' of ''G'', so that ''e''(''G'') is well-defined.
-The crowd was going the entire game. Seven different avid gamers have scored six desired goals in a game and 30 individual players have won five goals in a activity. Lobster populations are expanding in the Gulf of Maine, but you're plummeting in the waters connected with southern New England. <br><br>We thought i would start a venture capital company. Photo: Axel Schmidt/AFP/Getty ImagesIn June, his wife, Laurie Anderson, unveiled just how ill he had also been. The above statement, as of yesterday, is no longer technically true. He had a rigid posture, vast shoulders, neatly combed white hair   and no apologies for his or her close relationship with the most reviled dude of the 20th century.. <br><br>The Arena Football  is the highest level of play in the indoor/arena styles of gridiron football. I immediately loved the site, for it was a technique for publishing online, thus avoiding having to wait for a printed sort of the paper. KNOWLEDGE ARCHIVE"Please ease a bet I stupidly made in the pub which often subsequently got out of hand,Inches wrote Richard Freeland in the sepia tinged occasions of 2001. <br><br>Ryan Perez's jaggedly shaped, neatly framed collages are the purple of any Vikings jersey. It's the symphony because space as much as time, in addition to whatever its familiarity to us 21st century sophisticates, when we hear this specific music, we should try and create some of the sense of wonder this audiences at the piece's premiere inside Budapest in 1889 must have felt, if Mahler   not yet 30   conducted the actual symphony.. <br><br>In the past four years, research workers at the Large Hadron Collider have attained unprecedented feats of physics, all with their particle gas working at half it's design capacity. The group selected October 15th as the day's commemoration and called it Global Handwashing Morning, or GHD. <br><br>For today, I'm not sure if Microsoft's situation with the hardcore gamer marketplace can be salvaged. But it was in a mild fashion. When the you are not selected translator took a break, he / she wondered if there was a new failsafe solution. From 1912 1927, the place of Libya was known as German North Africa. <br><br>Here are half dozen tips for how to look taller.Wear Fitted ClothesBy "fitted" we put on mean a second skin. Of course, the previous regime's inability to engage virtually all Malians in the political process had been one of the deep rooted factors behind the latest crisis. The Founder is worth an estimated $4.8 billion dollars while his company uploaded profits of about half some sort of billion dollars in the next quarter followed by $1 billion inside the third. <br><br>Then I have this despots section, Sir Alex Ferguson, Manchester United file breaking ex manager contributes articles in his Autobiography (ghost provided by Telegraph Paul Hayward), leaving the fleeting mention about pertaining to Vince Lombardi (Green Bay Packers coach) incessant fixation for winning..<ul>
+===Basic facts and examples===
+*For any [[finitely generated group]] ''G'' we have ''e''(''G'') ∈ {0,&nbsp;1,&nbsp;2,&nbsp;∞}
-   <li>[http://www.reo8.moe.go.th/index.php/forum/7/523146-nike-air-jordan-nz-says-tom-wallisch#523146 http://www.reo8.moe.go.th/index.php/forum/7/523146-nike-air-jordan-nz-says-tom-wallisch#523146]</li>
+*For a [[finitely generated group]] ''G'' we have ''e''(''G'') = 0 if and only if ''G'' is finite.
+*For the [[infinite cyclic group]] <math>\mathbb Z</math> we have <math>e(\mathbb Z)=2.</math>
-   <li>[http://www.film-video-dvd-production.com/spip.php?article6/ http://www.film-video-dvd-production.com/spip.php?article6/]</li>
+*For the [[free abelian group]] of rank two <math>\mathbb Z^2</math> we have <math>e(\mathbb Z^2)=1.</math>
+*For a [[free group]] ''F''(''X'') where 1 < |''X''| < ∞ we have ''e''(''F''(''X'')) = ∞
-   <li>[http://realtranslatorjobs.carolasmith.com/forum/profile.php?id=6532 http://realtranslatorjobs.carolasmith.com/forum/profile.php?id=6532]</li>
+*For a [[finitely generated group]] ''G'' we have ''e''(''G'') = 2 if and only if ''G'' is [[virtually]] [[infinite cyclic group|infinite cyclic]] (that is, ''G'' contains an infinite cyclic [[subgroup]] of finite [[index of a subgroup|index]]).
-   <li>[http://www.observatoiredesreligions.fr/spip.php?article8 http://www.observatoiredesreligions.fr/spip.php?article8]</li>
-   <li>[http://jewel.egloos.com/3850007/ http://jewel.egloos.com/3850007/]</li>
- </ul>
-== Buy Louis Vuitton Online " Carlyle said. ==
+===Cuts and almost invariant sets===
+Let ''G'' be a [[finitely generated group]], ''S'' ⊆ ''G'' be a finite [[generating set of a group|generating set]] of ''G'' and let Γ = Γ(''G'',&nbsp;''S'') be the [[Cayley graph]] of ''G'' with respect to ''S''. For a subset ''A'' ⊆ ''G'' denote by ''A''<sup>∗</sup> the complement ''G''&nbsp;&minus;&nbsp;''A'' of ''A'' in ''G''.
-As the companies scrambled to deliver gift items the day after Christmas, they also not [http://www.numberoneresource.co.nz/config/program.asp?lv=82-Buy-Louis-Vuitton-Online Buy Louis Vuitton Online] been as successful to explain how it had just about all happened. "Courts are like airline seats or hotel rooms. Ladies, you happen to be OK on this one since you can roam free between foo foo cocktails and manly drinks. <br><br>It cannot (see the latest [http://www.thegallery.co.nz/Connections/style.asp?t=14-Tiffany-Necklace-Nz Tiffany Necklace Nz] contentious BBC Rely on verdict) let John Humphrys loosened for an individually crafted report on welfare dependency. Unfortunately, additionally you become pretty detached through your own inner spiritual along with emotional resources as well as with the resources of a supportive local community of colleagues.. <br><br>After Friday loss to the Bulls, Nets trainer Jason Kidd, tired and angry with a lack of effort after a fourth straight defeat, known as out his players in the locker room. Initiated in 2008, this is arguably the most large art prize worth A single.20,0000 US $ every single for five artists taken care of for only the Middle East, North Africa and South Parts of asia (MENASA) region. <br><br>And, it is taught to staff .. The results may amaze you. That was the death knell for him. When I quit school, I thought I would be considered a journalist. On many occasions, the chats do not stop with just one session. "You're always going to ask exactly the same questions," Carlyle said. <br><br>However Austin's case is a rare exemption. And of course what he ended up being talking about was there never such a thing as having excessive pitching. I looking forward to the fundamental game too when the Wings and the Leafs lace them way up.. And you know what? It perhaps the most common excuse. <br><br>In my prime on [http://www.cambridgeairforce.org.nz/Newsletters/history.asp?nike=54-Cheap-Nike-Air-Max-Nz Cheap Nike Air Max Nz] 40yrs old I weighed 215 220lbs looked and felt great while I was lifting and training I was very strong devoid of health issues then but in occasion over 10yrs things went down after i stopped training with weight loads just doing daily function my eating habits also turned down as well over eating an enjoying. <br><br>Kuro O published his conclusions and set off an uprising in the field of aging science. Ombre seems to be really good with layered tresses because it catches the light greater, says Sachin, adding that the trend does not suit people with a person length hair. As Route Manager (or Subject Professional), I have a long term project which involves writing, editorial and exploration skills. <br><br>We hope that commanders will keep in mind those who perform: the smallholder farmers. His discovery has resulted in a form of germanium which has a low density, open caged framework and the [http://www.breese.co.nz/script/wwmail.asp?id=93-Timberland-Shoes-New-Zealand Timberland Shoes New Zealand] potential to emit lighting,?Guloy said. Big Hospitality not long ago highlighted a skills hole between the employment opportunities in the area and the training and practical experience levels of applicants.<ul>
+For a subset ''A'' ⊆ ''G'', the ''edge boundary'' or the ''co-boundary'' ''δA'' of ''A'' consists of all (topological) edges of Γ connecting a vertex from A with a vertex from ''A''<sup>∗</sup>.
+Note that by definition ''δA'' = ''δA''<sup>∗</sup>.
-   <li>[http://cups.reen-esports.de/index.php?site=guestbook http://cups.reen-esports.de/index.php?site=guestbook]</li>
-   <li>[http://1.ts.cn/home.php?mod=space&uid=5479&do=blog&quickforward=1&id=6710838 http://1.ts.cn/home.php?mod=space&uid=5479&do=blog&quickforward=1&id=6710838]</li>
-   <li>[http://cn.4000588103.com/bbs/forum.php?mod=viewthread&tid=829383 http://cn.4000588103.com/bbs/forum.php?mod=viewthread&tid=829383]</li>
-   <li>[http://www.achicourtautrement.fr/spip.php?article451/ http://www.achicourtautrement.fr/spip.php?article451/]</li>
-   <li>[http://enseignement-lsf.com/spip.php?article64#forum24714825 http://enseignement-lsf.com/spip.php?article64#forum24714825]</li>
- </ul>
-== Discount Ray Ban Eyeglasses . ==
+An ordered pair (''A'',&nbsp;''A''<sup>∗</sup>) is called a ''cut'' in Γ if  ''δA'' is finite. A cut (''A'',''A''<sup>∗</sup>) is called ''essential'' if both the sets  ''A'' and ''A''<sup>∗</sup> are infinite.
-Every household garbage is collected in bags and provides them to a common trash. We propose using a stable Wi Fi interconnection whenever you download an issue. Tendekayi Katsiga suggests he is always juggling mad ideas. The television ad, which usually opens with a surprisingly lovely shot of a pigeon leaping over a city, uses the disgruntled bird as a stand it for unhappy frequent full colour leaflets, demonstrating in an arresting and unforeseen way that JetBlue understands travelers requirements.. <br><br>Farmers are gobsmacked by the appearing ignorance of their plight, has industry stakeholders have forgotten which milk actually comes from cattle. He impressed during get away with his intelligence, composure, puck decisions and also execution. There are two regular counters and an extra wide glenohumeral joint to allow slower [http://www.pixelpilots.com/RampsAndAccessEmail/Solutions.asp?r=3-Discount-Ray-Ban-Eyeglasses Discount Ray Ban Eyeglasses] vehicles to pull over to let faster cars pass.. <br><br>The man was waiting for the light to change at the part of South Van Ness Avenue and 24th Avenue when he was struck by having an unidentified object that brought about him to fall off their bike. Psychologists say a young child should be hugged at least, you know, two or three times a day for the pup to be a functional human being. <br><br>All of our teachers are well trained in the music activity, dance, voice, studio taking, and theater production. This clear from the comments associated with his fellow inmates, several in their early 20s, there isn a lot of sympathy for Hernandez.. Despite realistic looking scenes through which dogs leap at each other, fangs unsurprisingly primed to bite, a whole lot was done in the shooting and editing   "the same way I'd avoid [http://www.cambridgeairforce.org.nz/Newsletters/history.asp?nike=137-Nike-Shoes-Nz Nike Shoes Nz] hurting somebody in a car accident". <br><br>In April 2010, I found that I was going to be questioned by way of the RCMP over materials and marketing and advertising that had been a part of my 2010 election campaign. An employee coerced to resign can sue for constructive dismissal (whilst it highly improbable that Boessenkool would certainly do that). <br><br>I don't think we will see a cheap phone through Apple until they can find methods to build something that isn't rubbish. Connecting with and living in that time in her life could be the only way she can still convey today how she feels along with what she needs.. <br><br>Amygdala may also play a role in women's greater tendency to participate in what scientists call ruminative believing, the repetitive focus on [http://www.panz.org.nz/highslide/graphics/outlines/enrolment.asp?u=74-Ugg-Boots-Uk Ugg Boots Uk] negativity and events. About Males I [http://www.tumunui.co.nz/new/wp-content/plugins/akismet/sidebar.asp?p=16-Pandora-Earrings-Nz Pandora Earrings Nz] Want To Meet: I would like to meet someone that I can completely have confidence in. <br><br>Fatty acids are converted to docosahexaneoic acid which is used mainly in the human brain and eyes. It may seem being a good idea to apply for a shopping area credit card while shopping to get a discount, but if you do it too often, your credit track record will suffer.<ul>
+A subset ''A'' ⊆ ''G'' is called ''almost invariant'' if for every ''g''∈''G'' the [[symmetric difference]] between ''A'' and ''Ag'' is finite. It is easy to see that  (''A'', ''A''<sup>∗</sup>) is a cut if and only if the sets ''A'' and ''A''<sup>∗</sup> are almost invariant (equivalently,  if and only if the set ''A'' is almost invariant).
-   <li>[http://ryong53.egloos.com/5503154/ http://ryong53.egloos.com/5503154/]</li>
-   <li>[http://v.o.c.free.fr/spip.php?article104/ http://v.o.c.free.fr/spip.php?article104/]</li>
-   <li>[http://club.hijinksindia.com/activity/p/421929/ http://club.hijinksindia.com/activity/p/421929/]</li>
-   <li>[http://voipshoip.com/ http://voipshoip.com/]</li>
-   <li>[http://www.mariettakaramanli.fr/spip.php?article647/ http://www.mariettakaramanli.fr/spip.php?article647/]</li>
- </ul>
-== Timberlands Nz Shoes You think ==
+====Cuts and ends====
+A simple but important observation states:
-The only time he appears to be a little tired is when neared by a fan for a image during our interview. Financial institutions remain a source of muscle in this market, and are having us up despite some weakness in AAPL. Most people can handle a few [http://www.breese.co.nz/script/wwmail.asp?id=62-Timberlands-Nz-Shoes Timberlands Nz Shoes] questions before they experience intellectual overload. <br><br>You think, OK, just what shall we do next. Complete protect your money. From the town of Tulum, the Boca Paiala road provides [http://www.breese.co.nz/script/wwmail.asp?id=46-Timberland-Earthkeepers-Boots Timberland Earthkeepers Boots] accessibility beach side hotels plus areas further south, such as Punta Allen. A rock that Chance found called Wopmayappeared to be made of hematite with iron bearing sulfates, indicative of acidic water. <br><br>However, and also strike me as perhaps interesting that you have the three major resources for an end product: Buyer [http://www.pixelpilots.com/RampsAndAccessEmail/Solutions.asp?r=81-Ray-Ban-Glasses Ray Ban Glasses] Product (Apple), Intellectual Property liberties Liquidmetal), and Scale Manufacturing (Materion).. I will provide shelter, veterinary attention, love, toys, food, as well as training for those who are [http://www.nzvacationhomes.co.nz/functions/search.asp?p=71-Ralph-Lauren-Nz Ralph Lauren Nz] in need. <br><br>Ejaculation counts for men are also highest in the morning, mirroring the time any time male hormone levels are also at a daily high. Things have can come and things have gone, however, there is still a deep sense of bonding that we have. The spokes of the internet are primarily non sticky silk, and serve as walkways for that spider to move about the web. <br><br>It had become confusing yet flattering.. Contra costa defensive back Tracy Porter intercepted Eli Manning for a 24 yard touchdown return. "Hon Hai had exploited the mainland China market well rolling around in its early days, but now profits are slowly declining," Liang says, giving higher Chinese wages because the main reason. <br><br>2 this year.. In addition, the next 18 months could be loaded with blockbusters. The list is already impressive plus interestingly enough; you can even learn  as on the list of 35 languages through it for example. And the National Hockey League.. He / she an inward looking kind, trusting his own judgment. <br><br>They may be an unemployed person looking to concerning skill and get back on the career ladder, a young man or women stuck in a dead end career looking to change career, as well as someone who's made a nice beginning and is looking to get the credentials they need to progress. <br><br>Is itchyness a dilemma during the day as well as at night for individuals with HL NHL, or just at night? I am just itchy during the day, too, but it really seems more severe at night. A few Atlantic provinces, meanwhile, currently have jobless rates ranging from 9.1 per cent in Nova Scotia to 11.0 percentage in Newfoundland and Labrador.. <br><br>Since the car arrives to take Huge Attack to their rehearsal around Bath, Del Naja and Marshall start off pondering the band's durability: the fact that, despite the endless upheavals and rows , they're somehow nevertheless here. Significant differences emerged on everything from temperament to policies to priorities.<ul>
+:''e''(''G'') > 1 if and only if there exists at least one essential cut (''A'',''A''<sup>∗</sup>) in &Gamma;.
-   <li>[http://www.dailyqr.com/blog_entry.php?user=1185386&blogentry_id=18323645 http://www.dailyqr.com/blog_entry.php?user=1185386&blogentry_id=18323645]</li>
+====Cuts and splittings over finite groups====
-   <li>[http://forum.rider74.ru/viewtopic.php?f=19&t=911619 http://forum.rider74.ru/viewtopic.php?f=19&t=911619]</li>
+If ''G'' = ''H''∗''K'' where ''H'' and ''K'' are nontrivial [[finitely generated group]]s then the [[Cayley graph]] of ''G'' has at least one essential cut and hence ''e''(''G'') > 1. Indeed, let ''X'' and ''Y'' be finite generating sets for ''H'' and ''K'' accordingly so that ''S'' = ''X''&nbsp;∪&nbsp;''Y'' is a finite generating set for ''G'' and let Γ=Γ(''G'',''S'') be the [[Cayley graph]] of ''G'' with respect to ''S''. Let ''A'' consist of the trivial element and all the elements of ''G'' whose normal form expressions for ''G'' = ''H''∗''K'' starts with a nontrivial element of ''H''.  Thus ''A''<sup>∗</sup> consists of all elements of ''G'' whose normal form expressions for ''G'' = ''H''∗''K'' starts with a nontrivial element of ''K''. It is not hard to see that (''A'',''A''<sup>∗</sup>) is an essential cut in Γ so that ''e''(''G'') > 1.
-   <li>[http://verdamilio.net/tonio/spip.php?article1/ http://verdamilio.net/tonio/spip.php?article1/]</li>
+A more precise version of this argument shows that for a [[finitely generated group]] ''G'':
+*If ''G'' = ''H''∗<sub>''C''</sub>''K'' is a [[free product with amalgamation]] where ''C'' is a finite group such that ''C'' ≠ ''H'' and ''C'' ≠ ''K'' then ''H'' and ''K'' are finitely generated and ''e''(''G'')&nbsp;>&nbsp;1 .
-   <li>[http://forum.51liuxue.ca/forum.php?mod=viewthread&tid=807704 http://forum.51liuxue.ca/forum.php?mod=viewthread&tid=807704]</li>
+*If <math>\scriptstyle G=\langle H, t| t^{-1}C_1t=C_2\rangle</math> is an [[HNN-extension]] where ''C''<sub>1</sub>, ''C''<sub>2</sub> are isomorphic finite [[subgroup]]s of ''H'' then ''G'' is a [[finitely generated group]] and ''e''(''G'') > 1.
-   <li>[http://www.snesup-paris13.org/spip.php?article16/ http://www.snesup-paris13.org/spip.php?article16/]</li>
+Stallings' theorem shows that the converse is also true.
- </ul>
+==Formal statement of Stallings' theorem==
+Let ''G'' be a [[finitely generated group]].
+Then ''e''(''G'') > 1 if and only if one of the following holds:
+*The group ''G'' admits a splitting ''G''=''H''∗<sub>''C''</sub>''K'' as a [[free product with amalgamation]] where ''C'' is a finite group such that ''C'' ≠ ''H'' and ''C'' ≠ ''K''.
+*The group ''G'' admits a splitting <math>\scriptstyle G=\langle H, t| t^{-1}C_1t=C_2\rangle</math> is an [[HNN-extension]] where and ''C''<sub>1</sub>, ''C''<sub>2</sub> are isomorphic finite [[subgroup]]s of ''H''.
+In the language of [[Bass-Serre theory]] this result can be restated as follows:
+For a [[finitely generated group]] ''G'' we have  ''e''(''G'') > 1 if and only if ''G'' admits a nontrivial (that is, without a global fixed vertex) [[group action|action]] on a simplicial [[tree (graph theory)|tree]] with finite edge-stabilizers and without edge-inversions.
+For the case where ''G'' is a torsion-free [[finitely generated group]], Stallings' theorem implies that ''e''(''G'') = ∞ if and only if ''G'' admits a proper [[free product]] decomposition ''G'' = ''A''∗''B'' with both ''A'' and ''B'' nontrivial.
+==Applications and generalizations==
+*Among the immediate applications of Stallings' theorem was a proof by Stallings<ref>John R. Stallings. [http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bams/1183529548 ''Groups of dimension 1 are locally free.''] Bulletin of the American Mathematical Society, vol. 74 (1968), pp. 361&ndash;364</ref> of a long-standing conjecture that every finitely generated group of cohomological dimension one is free and that every torsion-free [[virtually]] [[free group]] is free.
+*Stallings' theorem also implies that the property of having a nontrivial splitting over a finite subgroup is a [[quasi-isometry]] invariant of a [[finitely generated group]] since the number of ends of a finitely generated group is easily seen to be a quasi-isometry invariant. For this reason Stallings' theorem is considered to be one of the first results in [[geometric group theory]].
+*Stallings' theorem was a starting point for Dunwoody's ''accessibility theory''. A finitely generated group ''G'' is said to be ''accessible'' if the process of iterated nontrivial splitting of ''G'' over finite subgroups always terminates in a finite number of steps. In [[Bass-Serre theory]] terms that the number of edges in a reduced splitting of ''G'' as the fundamental group of a [[graph of groups]] with finite edge groups is bounded by some constant depending on ''G''. [[Martin Dunwoody|Dunwoody]] proved<ref name="D">M. J. Dunwoody. [http://www.springerlink.com/content/n13t047466x2g242/ ''The accessibility of finitely presented groups.''] [[Inventiones Mathematicae]], vol. 81 (1985), no. 3, pp. 449-457</ref> that every [[finitely presented group]] is accessible but that there do exist [[finitely generated group]]s that are not accessible.<ref>M. J. Dunwoody. ''An inaccessible group''. Geometric group theory, Vol. 1 (Sussex, 1991), pp. 75&ndash;78, London Mathematical Society Lecture Note Series, vol. 181, [[Cambridge University Press]], Cambridge, 1993; ISBN 0-521-43529-3</ref> Linnell<ref>P. A. Linnell. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0K-45FC39Y-3Y&_user=10&_coverDate=10%2F31%2F1983&_rdoc=5&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235649%231983%23999699998%23295444%23FLP%23display%23Volume)&_cdi=5649&_sort=d&_docanchor=&_ct=10&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=8e943c2dc0b8741d1f1a5bfc2cb0c1fd ''On accessibility of groups.'']
+Journal of Pure and Applied Algebra, vol. 30 (1983), no. 1, pp. 39&ndash;46.</ref> showed that if one bounds the size of finite subgroups over which the splittings are taken then every finitely generated group is accessible in this sense as well. These results in turn gave rise to other versions of accessibility such as [[Mladen Bestvina|Bestvina]]-Feighn accessibility<ref>M. Bestvina and M. Feighn. [http://www.springerlink.com/content/t2321u08133g0475/ ''Bounding the complexity of simplicial group actions on trees.''] [[Inventiones Mathematicae]], vol. 103 (1991), no. 3, pp. 449&ndash;469</ref> of finitely presented groups (where the so-called "small" splittings are considered), acylindrical accessibility,<ref>Z. Sela. [http://www.springerlink.com/content/wmptp9tx4jr660x1/ ''Acylindrical accessibility for groups.''] [[Inventiones Mathematicae]], vol. 129 (1997), no. 3, pp. 527&ndash;565</ref><ref>T. Delzant. [http://www.numdam.org/numdam-bin/fitem?id=AIF_1999__49_4_1215_0 ''Sur l'accessibilité acylindrique des groupes de présentation finie.''] Université de Grenoble. Annales de l'Institut Fourier, vol. 49 (1999), no. 4, pp. 1215&ndash;1224</ref> strong accessibility,<ref>T. Delzant, and L. Potyagailo. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1J-41KP586-B&_user=10&_coverDate=05%2F31%2F2001&_rdoc=10&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235676%232001%23999599996%23216973%23FLA%23display%23Volume)&_cdi=5676&_sort=d&_docanchor=&_ct=11&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=26b77dd7de7faf457984fc962a78f4f6 ''Accessibilité hiérarchique des groupes de présentation finie''.] [[Topology (journal)|Topology]], vol. 40 (2001), no. 3, pp. 617&ndash;629</ref> and others.
+*Stallings' theorem is a key tool in proving that a finitely generated group ''G'' is [[virtually]] [[free group|free]] if and only if ''G'' can be represented as the fundamental group of a finite [[graph of groups]] where all vertex and edge groups are finite (see, for example,<ref>H. Bass. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0K-4RFD0C8-1&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=8743e9ee8227c380b4c799b5631b6c38 ''Covering theory for graphs of groups.''] Journal of Pure and Applied Algebra, vol. 89 (1993), no. 1-2, pp. 3&ndash;47</ref>).
+*Using Dunwoody's accessibility result, Stallings' theorem about ends of groups and the fact that if G is a finitely presented group with asymptotic dimension 1 then G is virtually free<ref name="Gen"/> one can show <ref name="Gr"/> that for a finitely presented [[word-hyperbolic group]] ''G'' the hyperbolic boundary of ''G'' has [[topological dimension]] zero if and only if ''G'' is virtually free.
+*Relative versions of Stallings' theorem and relative ends of [[finitely generated group]]s with respect to subgroups have also been considered. For a subgroup ''H''≤''G'' of a finitely generated group ''G'' one defines ''the number of relative ends'' ''e''(''G'',''H'') as the number of ends of the relative Cayley graph (the [[Cayley graph#Schreier coset graph|Schreier coset graph]]) of ''G'' with respect to ''H''.  The case where ''e''(''G'',''H'')>1 is called a semi-splitting of ''G'' over ''H''. Early work on semi-splittings, inspired by Stallings' theorem, was done in the 1970s and 1980s by Scott,<ref>Peter Scott. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0K-45FT7S1-2S&_user=10&_coverDate=12%2F31%2F1977&_rdoc=20&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235649%231977%23999889998%23298178%23FLP%23display%23Volume)&_cdi=5649&_sort=d&_docanchor=&_ct=28&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=6b73e942917fbe66734387c5551218ab ''Ends of pairs of groups.'']
+Journal of Pure and Applied Algebra, vol. 11 (1977/78), no. 1&ndash;3, pp. 179&ndash;198</ref> Swarup,<ref>G. A. Swarup. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0K-45FT7S1-2F&_user=10&_coverDate=12%2F31%2F1977&_rdoc=11&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235649%231977%23999889998%23298178%23FLP%23display%23Volume)&_cdi=5649&_sort=d&_docanchor=&_ct=28&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=313f2d84abfb5843e125467c44e82bd0 ''Relative version of a theorem of Stallings.'']
+Journal of Pure and Applied Algebra, vol. 11 (1977/78), no. 1&ndash;3, pp. 75&ndash;82</ref> and others.<ref>H. Müller. [http://www.springerlink.com/content/j3038x25847q8455/ ''Decomposition theorems for group pairs.'']
+Mathematische Zeitschrift, vol. 176 (1981), no. 2, pp. 223&ndash;246</ref><ref>P. H. Kropholler, and M. A. Roller. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0K-45D9SSN-11&_user=10&_coverDate=11%2F12%2F1989&_rdoc=7&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235649%231989%23999389997%23291829%23FLP%23display%23Volume)&_cdi=5649&_sort=d&_docanchor=&_ct=7&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=d7ff7c65ddee3b751b333adf1cb17df6 ''Relative ends and duality groups''.] Journal of Pure and Applied Algebra, vol. 61 (1989), no. 2, pp. 197&ndash;210</ref>  The work of Sageev<ref>Michah Sageev. [http://plms.oxfordjournals.org/cgi/content/abstract/s3-71/3/585 ''Ends of group pairs and non-positively curved cube complexes.''] Proceedings of the London Mathematical Society (3), vol. 71 (1995), no. 3, pp. 585&ndash;617</ref> and Gerasomov<ref>V. N. Gerasimov. ''Semi-splittings of groups and actions on cubings.'' (in Russian) Algebra, geometry, analysis and mathematical physics (Novosibirsk, 1996), pp. 91&ndash;109, 190, Izdat. Ross. Akad. Nauk Sib. Otd. Inst. Mat., Novosibirsk, 1997</ref> in the 1990s showed that for a subgroup ''H''≤''G'' the condition ''e''(''G'',''H'')>1 correpsonds to the group ''G'' admitting an essential isometric action on a [[CAT(0) space|CAT(0)-cubing]] where a subgroup commensurable with ''H'' stabilizes an essential "hyperplane" (a simplicial tree is an example of a CAT(0)-cubing where the hyperplanes are the midpoints of edges). In certain situations such a semi-splitting can be promoted to an actual algebraic splitting, typically over a subgroup commensurable with ''H'',  such as for the case where ''H'' is finite (Stallings' theorem).  Another situation where an actual splitting can be obtained (modulo a few exceptions) is for semi-splittings over virtually [[polycyclic group|polycyclic]] subgroups. Here the case of semi-splittings of [[word-hyperbolic group]]s over two-ended (virtually infinite cyclic) subgroups was treated by Scott-Swarup<ref>G. P. Scott, and G. A. Swarup. [http://nyjm.albany.edu:8000/PacJ/p/2000/196-2-13.pdf ''An algebraic annulus theorem.''] Pacific Journal of Mathematics, vol. 196 (2000), no. 2, pp. 461&ndash;506</ref> and by [[Brian Bowditch|Bowditch]].<ref>B. H. Bowditch. [http://www.springerlink.com/content/a32707388262615w/?p=a1c491d95ab5404fa10c50e2ca306ee6&pi=0 ''Cut points and canonical splittings of hyperbolic groups.'']
+[[Acta Mathematica]], vol. 180 (1998), no. 2, pp. 145&ndash;186</ref> The case of semi-splittings of [[finitely generated group]]s with respect to virtually polycyclic subgroups is dealt with by the algebraic torus theorem of Dunwoody-Swenson.<ref>M. J. Dunwoody, and E. L. Swenson. [http://www.springerlink.com/content/892hyejtew7h2vg5/ ''The algebraic torus theorem.''] [[Inventiones Mathematicae]], vol. 140 (2000), no. 3, pp. 605&ndash;637</ref>
+*A number of new proofs of Stallings' theorem have been obtained by others after Stallings' original proof. [[Martin Dunwoody|Dunwoody]] gave a proof<ref>M. J. Dunwoody. [http://www.springerlink.com/content/yp22n46n40813lwr/ ''Cutting up graphs.'']
+Combinatorica, vol. 2 (1982), no. 1, pp. 15&ndash;23</ref> based on the ideas of edge-cuts. Later Dunwoody also gave a proof of Stallings' theorem for finitely presented groups using the method of "tracks" on finite 2-complexes.<ref name="D"/>  Niblo obtained a proof<ref>Graham A. Niblo. [http://www.springerlink.com/content/l872767m33653476/ ''A geometric proof of Stallings' theorem on groups with more than one end.'']
+[[Geometriae Dedicata]], vol. 105 (2004), pp. 61&ndash;76</ref> of Stallings' theorem as a consequence of Sageev's CAT(0)-cubing relative version, where the CAT(0)-cubing is eventually promoted to being a tree. Niblo's paper also defines an abstract group-theoretic obstruction (which is a union of double cosets of ''H'' in ''G'') for obtaining an actual splitting from a semi-splitting. It is also possible to prove Stallings' theorem for [[finitely presented group]]s using [[Riemannian geometry]] techniques of [[minimal surface]]s, where one first realizes a finitely presented group as the fundamental group of a compact 4-manifold (see, for example, a sketch of this argument in the survey article of [[Terry Wall|Wall]]<ref>C. T. C. Wall. ''The geometry of abstract groups and their splittings.'' Revista Matemática Complutense vol. 16(2003), no. 1, pp. 5&ndash;101</ref>).  [[Mikhail Gromov (mathematician)|Gromov]] outlined a proof (see pp.&nbsp;228–230 in <ref name="Gr">M. Gromov, Hyperbolic Groups, in "Essays in Group Theory" (G. M. Gersten, ed.), MSRI Publ. 8, 1987, pp. 75-263</ref>) where the minimal surfaces argument is replaced by an easier harmonic analysis argument and this approach was pushed further by Kapovich to cover the original case of finitely generated groups.<ref name ="Gen">Gentimis Thanos, Asymptotic dimension of finitely presented groups, http://www.ams.org/journals/proc/2008-136-12/S0002-9939-08-08973-9/home.html</ref><ref>M. Kapovich. [http://arxiv.org/abs/0707.4231 ''Energy of harmonic functions and Gromov's proof of Stallings' theorem''], preprint, 2007, arXiv:0707.4231</ref>
+==See also==
+*[[Free product with amalgamation]]
+*[[HNN extension]]
+*[[Bass-Serre theory]]
+*[[Graph of groups]]
+*[[Geometric group theory]]
+==Notes==
+{{reflist}}
+{{DEFAULTSORT:Stallings Theorem About Ends Of Groups}}
+[[Category:Geometric group theory]]
+[[Category:Theorems in group theory]]

Dynamic treatment regime: Difference between revisions

Revision as of 18:23, 2 February 2014

Contents

Ends of graphs

Ends of groups

Basic facts and examples

Cuts and almost invariant sets

Cuts and ends

Cuts and splittings over finite groups

Formal statement of Stallings' theorem

Applications and generalizations

See also

Notes

Navigation menu

Dynamic treatment regime: Difference between revisions

Revision as of 18:23, 2 February 2014

Ends of graphs

Ends of groups

Basic facts and examples

Cuts and almost invariant sets

Cuts and ends

Cuts and splittings over finite groups

Formal statement of Stallings' theorem

Applications and generalizations

See also

Notes

Navigation menu

Search