Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Thin_group_(combinatorial_group_theory)> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Thin_group_(combinatorial_group_theory) abstract "In mathematics, in the realm of group theory, a group is said to be thin if there is a finite upper bound on the girth of the Cayley graph induced by any finite generating set. The group is called fat if it is not thin.Given any generating set of the group, we can consider a graph whose vertices are elements of the group with two vertices adjacent if their ratio is in the generating set. The graph is connected and vertex transitive. paths in the graph correspond to words in the generators.If the graph has a cycle of a given length, it has a cycle of the same length containing the identity element. Thus, the girth of the graph corresponds to the minimum length of a nontrivial word that reduces to the identity. A nontrivial word is a word that, if viewed as a word in the free group, does not reduce to the identity.If the graph has no cycles, its girth is set to be infinity.The girth depends on the choice of generating set. A thin group is a group where the girth has an upper bound for all finite generating sets.Some facts about thin and fat groups and about girths: Every finite group is thin. Every free group is fat. The girth of a cyclic group equals its order. The girth of a noncyclic abelian group is at most 4, because any two elements commute and the commutation relation gives a nontrivial word. The girth of the dihedral group is 2. Every nilpotent group, and more generally, every solvable group, is thin.".
- Thin_group_(combinatorial_group_theory) wikiPageExternalLink girth.pdf.
- Thin_group_(combinatorial_group_theory) wikiPageID "5739383".
- Thin_group_(combinatorial_group_theory) wikiPageLength "1985".
- Thin_group_(combinatorial_group_theory) wikiPageOutDegree "19".
- Thin_group_(combinatorial_group_theory) wikiPageRevisionID "702636903".
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Abelian_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Category:Properties_of_groups.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Cayley_graph.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Connectivity_(graph_theory).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Cycle_(graph_theory).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Cyclic_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Dihedral_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Finite_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Free_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Generating_set_of_a_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Girth_(graph_theory).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Graph_(discrete_mathematics).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Group_(mathematics).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Group_theory.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Mathematics.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Nilpotent_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Path_(graph_theory).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink Solvable_group.
- Thin_group_(combinatorial_group_theory) wikiPageWikiLink String_(computer_science).
- Thin_group_(combinatorial_group_theory) wikiPageWikiLinkText "Thin group (combinatorial group theory)".
- Thin_group_(combinatorial_group_theory) wikiPageUsesTemplate Template:For.
- Thin_group_(combinatorial_group_theory) subject Category:Properties_of_groups.
- Thin_group_(combinatorial_group_theory) comment "In mathematics, in the realm of group theory, a group is said to be thin if there is a finite upper bound on the girth of the Cayley graph induced by any finite generating set. The group is called fat if it is not thin.Given any generating set of the group, we can consider a graph whose vertices are elements of the group with two vertices adjacent if their ratio is in the generating set. The graph is connected and vertex transitive.".
- Thin_group_(combinatorial_group_theory) label "Thin group (combinatorial group theory)".
- Thin_group_(combinatorial_group_theory) sameAs Q7784285.
- Thin_group_(combinatorial_group_theory) sameAs m.0f23nf.
- Thin_group_(combinatorial_group_theory) sameAs Q7784285.
- Thin_group_(combinatorial_group_theory) wasDerivedFrom Thin_group_(combinatorial_group_theory)?oldid=702636903.
- Thin_group_(combinatorial_group_theory) isPrimaryTopicOf Thin_group_(combinatorial_group_theory).