相关论文: Thompson's Group F

Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups $\mathbb{Z}\wr \mathbb{Z},$ the lamplighter group, $(\mathbb{Z}\wr \mathbb{Z})\wr \mathbb{Z}$ and the Navas-Brin group $B.$ We have also given…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

There is a map, defined and studied by Jones, from Thompson's group $F$ to knots. Jones proved that every knot is in the image of this map -- that is, that every knot can be seen as the "knot closure" of a Thompson group element. We…

A spanning subgraph $F$ of a graph $G$ is called {\em perfect} if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. Alex Scott (Graphs \& Combin., 2001) proved that…

Tree-graded spaces are a generalization of $\mathbb{R}$-trees and play an important role in describing the large-scale geometry of relatively hyperbolic groups. We consider a subclass of tree-graded spaces that we call "disjointly…

We propose a new unifying framework for Thompson-like groups using a well-known device called operads and category theory as language. We discuss examples of operad groups which have appeared in the literature before. As a first…

We describe a family of words in Thompson's group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

Hassler Whitney's theorem of 1931 reduces the task of finding proper, vertex 4-colorings of triangulations of the 2-sphere to finding such colorings for the class \(\mathfrak H\) of triangulations of the 2-sphere that have a Hamiltonian…

We show that the \s{\phi}-labeled Thompson groups and the twisted Brin--Thompson groups are boundedly acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically…

For any tangle $T$ (up to isotopy) and integer $k\geq 1$ we construct a group $F(T)$ (up to isomorphism). It is the fundamental group of the configuration space of $k$ points in a horizontal plane avoiding the tangle, provided the tangle is…

The goal of this paper is to construct quasi-isometrically embedded subgroups of Thompson's group $F$ which are isomorphic to $\fz^n$ for all $n$. A result estimating the norm of an element of Thompson's group is found. As a corollary,…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

A ternary complex tree related to the golden ratio is used to show how the theory of complex trees works. We use the topological set of this tree to obtain a parametric family of trees in one complex variable. Even though some real ferns…

We consider all spanning trees of a complete simple graph $\Gamma$ on $n$ vertices that contain a given $m-$forest $F$. We show that the number of such spanning trees, $\tau(F)$, doesn't depend on the structure of $F$ and is completely…

We show that a large class of languages in the standard finite generating set X = {$x_0, x_1, x_0^{-1}, x_1^{-1}$} cannot be part of an automatic structure for Thompson's Group F. These languages are ones that accept at least one…

In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…

In this paper we consider the $T$- and $V$- versions, $T_{\tau}$ and $V_{\tau}$ , of the irrational slope Thompson group $F_{\tau}$ considered in [3]. We give infinite presentations for these groups and show how they can be represented by…

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…