scholarly journals An irrational-slope Thompson’s group

2021 ◽  
Vol 65 ◽  
pp. 809-839
Author(s):  
José Burillo ◽  
Brita Nucinkis ◽  
Lawrence Reeves
Keyword(s):  
Thompson’S Group

Thompson’s Group F

2018 ◽  
pp. 37-66
Author(s):  
Marianna C. Bonanome ◽  
Margaret H. Dean ◽  
Judith Putnam Dean
Keyword(s):  
Thompson’S Group ◽  
Thompson's Group F

scholarly journals On the density of Cayley graphs of R.Thompson’s group F in symmetric generators

2021 ◽  
pp. 1-13
Author(s):  
V. S. Guba
Keyword(s):  
Cayley Graph ◽  
Cayley Graphs ◽  
Finite Graph ◽  
Vertex Degree ◽  
Doubling Property ◽  
Generating Set ◽  
Finite Set ◽  
Standard Set ◽  
Thompson’S Group ◽  
Average Vertex

By the density of a finite graph we mean its average vertex degree. For an [Formula: see text]-generated group, the density of its Cayley graph in a given set of generators, is the supremum of densities taken over all its finite subgraphs. It is known that a group with [Formula: see text] generators is amenable if and only if the density of the corresponding Cayley graph equals [Formula: see text]. A famous problem on the amenability of R. Thompson’s group [Formula: see text] is still open. Due to the result of Belk and Brown, it is known that the density of its Cayley graph in the standard set of group generators [Formula: see text], is at least [Formula: see text]. This estimate has not been exceeded so far. For the set of symmetric generators [Formula: see text], where [Formula: see text], the same example only gave an estimate of [Formula: see text]. There was a conjecture that for this generating set equality holds. If so, [Formula: see text] would be non-amenable, and the symmetric generating set would have the doubling property. This would mean that for any finite set [Formula: see text], the inequality [Formula: see text] holds. In this paper, we disprove this conjecture showing that the density of the Cayley graph of [Formula: see text] in symmetric generators [Formula: see text] strictly exceeds [Formula: see text]. Moreover, we show that even larger generating set [Formula: see text] does not have doubling property.

scholarly journals Cohomological finiteness conditions and centralisers in generalisations of Thompson’s group V

2016 ◽  
Vol 28 (5) ◽  
pp. 909-921 ◽  
Author(s):  
Conchita Martínez-Pérez ◽  
Francesco Matucci ◽  
Brita E. A. Nucinkis
Keyword(s):  
Automorphism Group ◽  
Finiteness Conditions ◽  
Group V ◽  
Full Automorphism Group ◽  
Finite Subgroups ◽  
Thompson’S Group

AbstractWe consider generalisations of Thompson’s group V, denoted by ${V_{r}(\Sigma)}$, which also include the groups of Higman, Stein and Brin. We show that, under some mild hypotheses, ${V_{r}(\Sigma)}$ is the full automorphism group of a Cantor algebra. Under some further minor restrictions, we prove that these groups are of type ${\operatorname{F}_{\infty}}$ and that this implies that also centralisers of finite subgroups are of type ${\operatorname{F}_{\infty}}$.

scholarly journals ON THE PROPERTIES OF THE CAYLEY GRAPH OF RICHARD THOMPSON'S GROUP F

2004 ◽  
Vol 14 (05n06) ◽  
pp. 677-702 ◽  
Author(s):  
V. S. GUBA
Keyword(s):  
Growth Rate ◽  
Lower Bound ◽  
Cayley Graph ◽  
Upper Bound ◽  
Growth Function ◽  
Vertex Degree ◽  
General Growth ◽  
Thompson’S Group ◽  
Average Vertex ◽  
Thompson's Group F

We study some properties of the Cayley graph of R. Thompson's group F in generators x0, x1. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3. It is known that a 2-generated group is not amenable if and only if the density of the corresponding Cayley graph is strictly less than 4. It is well known this is also equivalent to the existence of a doubling function on the Cayley graph. This means there exists a mapping from the set of vertices into itself such that for some constant K>0, each vertex moves by a distance at most K and each vertex has at least two preimages. We show that the density of the Cayley graph of a 2-generated group does not exceed 3 if and only if the group satisfies the above condition with K=1. Besides, we give a very easy formula to find the length (norm) of a given element of F in generators x0, x1. This simplifies the algorithm by Fordham. The length formula may be useful for finding the general growth function of F in generators x0, x1 and the growth rate of this function. In this paper, we show that the growth rate of F has a lower bound of [Formula: see text].

scholarly journals Graph polynomials and link invariants as positive type functions on Thompson’s group F

2019 ◽  
Vol 28 (02) ◽  
pp. 1950006 ◽  
Author(s):  
Valeriano Aiello ◽  
Roberto Conti
Keyword(s):  
Elementary Proof ◽  
Tutte Polynomial ◽  
Positive Type ◽  
Polynomial Invariants ◽  
Graph Polynomials ◽  
Link Invariants ◽  
Kauffman Bracket ◽  
Model Interpretation ◽  
Mechanics Model ◽  
Thompson’S Group

In a recent paper, Jones introduced a correspondence between elements of the Thompson group [Formula: see text] and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be reinterpreted as coefficients of certain unitary representations of [Formula: see text]. We give a somewhat different and elementary proof of this fact for the Kauffman bracket evaluated at certain roots of unity by means of a statistical mechanics model interpretation. Moreover, by similar methods we show that, for some particular specializations of the variables, other familiar link invariants and graph polynomials, namely the number of [Formula: see text]-colorings and the Tutte polynomial, can be viewed as positive definite functions on [Formula: see text].

scholarly journals Random subgroups of Thompson’s group F

2010 ◽  
pp. 91-126 ◽  
Author(s):  
Sean Cleary ◽  
Murray Elder ◽  
Andrew Rechnitzer ◽  
Jennifer Taback
Keyword(s):  
Thompson’S Group ◽  
Thompson's Group F
Sign in / Sign up

Export Citation Format

Share Document