Related papers: Arborescence of positive Thompson links
We show how to construct unitary representations of the oriented Thompson group $\vec{F}$ from oriented link invariants. In particular we show that the suitably normalised HOMFLYPT polynomial defines a positive definite function of…
We present new results regarding automatic continuity, unifying some diagonalization concepts that have been developed over the years. For example, any homomorphism from a completely metrizable topological group to Thompson's group $F$ has…
Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…
We prove that the braided Thompson's groups $V_{\rm br}$ and $F_{\rm br}$ are of type $F_\infty$, confirming a conjecture by John Meier. The proof involves showing that matching complexes of arcs on surfaces are highly connected. In an…
A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…
We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…
The authors classify the finite index subgroups of R. Thompson's group $F$. All such groups that are not isomorphic to $F$ are non-split extensions of finite cyclic groups by $F$. The classification describes precisely which finite index…
A result about spanning forests for graphs yields a short proof of Krebes's theorem concerning embedded tangles in links.
This is a report on a talk to high school mathematics students. It gives some combinatorial connections for the entries of the boustrophedon triangle whose sides are the Taylor coefficients for the tangent and secant functions.
Almost a decade ago Vaughan Jones introduced a method to produce knots from elements of the Thompson groups $F$, which was later extended to the Brown-Thompson group $F_3$. In this article we define a way to produce permutations out of…
We describe an explicit relationship between strand diagrams and piecewise-linear functions for elements of Thompson's group F. Using this correspondence, we investigate the dynamics of elements of F, and we show that conjugacy of one-bump…
We show that if $T$ is a strongly $10^9k^6\log(2k)$-connected tournament, there exists a partition $A, B$ of $V(T)$ such that each of $T[A]$, $T[B]$ and $T[A,B]$ is strongly $k$-connected. This provides tournament analogues of two partition…
We introduce a class of links whose bracket polynomials admit an expansion over perfect matchings of a plane bipartite graph. This class includes 2-bridge links, pretzel links, and Montesinos links. Our first main result (Theorem A)…
We construct an action of the Thompson group F on a compact space built from pairs of infinite, binary rooted trees. The action arises as an F-equivariant compactification of the action of F by translations on one of its homogeneous spaces,…
We reveal that Thompson's group $F$ has a quandle refinement, and we establish some essential results about the originating quandle.
By showing the compatibility of folding almost positive roots and folding cluster categories, we prove that there is a one-to-one correspondence between seeds and tilting seeds in non-simply-laced finite cases.
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on…
Let $f$ be an automorphism of a group $G$. Two elements $x, y$ in $G$ are said to be in the same $f$-twisted conjugacy class if there exists an element $z$ in $G$ such that $y=z x f(z^{-1})$. This is an equivalence relation known as…
We introduce a comprehensive data structure, tangle structure trees, which simultaneously displays all the $\mathcal{F}$-tangles of an abstract separation system for very general obstruction sets $\mathcal{F}$. It simultaneously also…
Starting from the work by Jones on representations of Thompson's group $F$, subgroups of $F$ with interesting properties have been defined and studied. One of these subgroups is called the $3$-colorable subgroup $\mathcal{F}$, which…