dc.contributor |
Centre de Recerca Matemàtica |
dc.contributor.author |
Arzhantseva, Goulnara N. |
dc.contributor.author |
Guba, Víctor S. |
dc.contributor.author |
Lustig, Martin |
dc.contributor.author |
Préaux, Jean-Philippe |
dc.date.accessioned |
2006-05-19T11:07:09Z |
dc.date.available |
2006-05-19T11:07:09Z |
dc.date.issued |
2006-02 |
dc.identifier.uri |
http://hdl.handle.net/2072/2025 |
dc.format.extent |
1450025 bytes |
dc.format.mimetype |
application/pdf |
dc.language.iso |
eng |
dc.publisher |
Centre de Recerca Matemàtica |
dc.relation.ispartofseries |
Prepublicacions del Centre de Recerca Matemàtica;666 |
dc.rights |
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (http://creativecommons.org/licenses/by-nc-nd/2.5/es/) |
dc.subject |
Grafs, Teoria dels |
dc.title |
Testing Cayley graph densities |
dc.type |
info:eu-repo/semantics/preprint |
dc.description.abstract |
We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group
with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group
is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F. |