| dbo: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. (en)
|
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 2029 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| rdf:type
| |
| rdfs: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. Paths in the graph correspond to words in the generators. If the graph has no cycles, its girth is set to be infinity. (en)
|
| rdfs:label
|
- Thin group (combinatorial group theory) (en)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
