Показати простий запис статті

dc.contributor.author Brieussel, J.
dc.contributor.author Gournay, A.
dc.date.accessioned 2023-02-27T15:54:28Z
dc.date.available 2023-02-27T15:54:28Z
dc.date.issued 2018
dc.identifier.citation Connectedness of spheres in Cayley graphs / J. Brieussel, A. Gournay // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 190–246. — Бібліогр.: 40 назв. — англ. uk_UA
dc.identifier.issn 1726-3255
dc.identifier.other 2010 MSC: Primary 20F65; Secondary 20E22, 20F10.
dc.identifier.uri http://dspace.nbuv.gov.ua/handle/123456789/188410
dc.description.abstract We introduce the notion of connection thickness of spheres in a Cayley graph, related to dead-ends and their retreat depth. It was well-known that connection thickness is bounded for finitely presented one-ended groups. We compute that for natural generating sets of lamplighter groups on a line or on a tree, connection thickness is linear or logarithmic respectively. We show that it depends strongly on the generating set. We give an example where the metric induced at the (finite) thickness of connection gives diameter of order n² to the sphere of radius n. We also discuss the rarity of dead-ends and the relationships of connection thickness with cut sets in percolation theory and with almost-convexity. Finally, we present a list of open questions about spheres in Cayley graphs. uk_UA
dc.description.sponsorship Supported by the ERC-StG 277728 “GeomAnGroup”. uk_UA
dc.language.iso en uk_UA
dc.publisher Інститут прикладної математики і механіки НАН України uk_UA
dc.relation.ispartof Algebra and Discrete Mathematics
dc.title Connectedness of spheres in Cayley graphs uk_UA
dc.type Article uk_UA
dc.status published earlier uk_UA


Файли у цій статті

Ця стаття з'являється у наступних колекціях

Показати простий запис статті

Пошук


Розширений пошук

Перегляд

Мій обліковий запис