Thin group (combinatorial group theory)
id:
thin-group-combinatorial-group-theory-313-8644596
title:
Thin group (combinatorial group theory)
text:
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 t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Thin_group_(combinatorial_group_theory)
date created:
date modified:
2023-08-12T23:47:00Z
main entity:
{"identifier":"Q7784285","url":"https://www.wikidata.org/entity/Q7784285"}
image:
fields total:
13
integrity:
13