Searcharxiv⌕ Search

arXiv subjects

James Belk

Publications and source records attributed to James Belk.

31 records · Page 2Linked to original sources

Recognizing topological polynomials by lifting trees

We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the canonical obstruction. Our approach is rooted in geometric group theory, using iteration on a simplicial complex of trees, and building on work of Nekrashevych. As one application of our methods, we resolve the polynomial case of Pilgrim's finite global attractor conjecture. We also give a new solution to Hubbard's twisted rabbit problem, and we state and solve several generalizations of Hubbard's problem where the number of post-critical points is arbitrarily large.

math.DS↗

Automorphisms of shift spaces and the Higman-Thompson groups: the two-sided case

In this article, we further explore the nature of a connection between the groups of automorphisms of full shift spaces and the groups of outer automorphisms of the Higman--Thompson groups $\{G_{n,r}\}$. We show that the quotient of the group of automorphisms of the (two-sided) shift dynamical system $\mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n})$ by its centre embeds as a particular subgroup $\mathcal{L}_{n}$ of the outer automorphism group $\mathop{\mathrm{Out}}(G_{n,n-1})$ of $G_{n,n-1}$. It follows by a result of Ryan that we have the following central extension: $$\langle σ_{n}\rangle \hookrightarrow \mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n}) \twoheadrightarrow \mathcal{L}_{n}$$ where here, $\langle σ_{n} \rangle \cong \mathbb{Z}$. We prove that this short exact sequence splits if and only if $n$ is not a proper power, and, in all cases, we compute the 2-cocycles and 2-coboundaries for the extension. We also use this central extension to prove that for $1 \le r < n$, the groups $\mathop{\mathrm{Out}}(G_{n,r})$ are centreless and have undecidable order problem. Note that the group $\mathop{\mathrm{Out}}(G_{n,n-1})$ consists of finite transducers (combinatorial objects arising in automata theory), and elements of the group $\mathcal{L}_{n}$ are easily characterised within $\mathop{\mathrm{Out}}(G_{n,n-1})$ by a simple combinatorial property. In particular, the short exact sequence allows us to determine a new and efficient purely combinatorial representation of elements of $\mathrm{Aut}(X_n^{\mathbb{N}}, σ_{n})$, and we demonstrate how to compute products using this new representation.

math.GR↗

Twisted Brin-Thompson groups

We construct a family of infinite simple groups that we call \emph{twisted Brin-Thompson groups}, generalizing Brin's higher-dimensional Thompson groups $sV$ ($s\in\mathbb{N}$). We use twisted Brin-Thompson groups to prove a variety of results regarding simple groups. For example, we prove that every finitely generated group embeds quasi-isometrically as a subgroup of a two-generated simple group, strengthening a result of Bridson. We also produce examples of simple groups that contain every $sV$ and hence every right-angled Artin group, including examples of type $\textrm{F}_\infty$ and a family of examples of type $\textrm{F}_{n-1}$ but not of type $\textrm{F}_n$, for arbitrary $n\in\mathbb{N}$. This provides the second known infinite family of simple groups distinguished by their finiteness properties.

math.GR↗

Stabilizers in Higman-Thompson groups

We investigate stabilizers of finite sets of rational points in Cantor space for the Higman-Thompson groups $V_{n,r}$. We prove that the pointwise stabilizer is an iterated ascending HNN extension of $V_{n,q}$ for any $q\geq 1$. We also prove that the commutator subgroup of the pointwise stabilizer is simple, and we compute the abelianization. Finally, for each $n$ we classify such pointwise stabilizers up to isomorphism.

math.GR↗

Conjugacy and Dynamics in Thompson's Groups

We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand diagrams are closely related to piecewise-linear functions for elements of Thompson's groups, and we use this correspondence to investigate the dynamics of elements of F. Though many of the results in this paper are known, our approach is new, and it yields elegant proofs of several old results.

math.GR↗

Rational embeddings of hyperbolic groups

We prove that all Gromov hyperbolic groups embed into the asynchronous rational group defined by Grigorchuk, Nekrashevych and Sushchanskiĭ. The proof involves assigning a system of binary addresses to points in the Gromov boundary of $G$, and proving that elements of $G$ act on these addresses by transducers. These addresses derive from a certain self-similar tree of subsets of $G$, whose boundary is naturally homeomorphic to the horofunction boundary of $G$.

math.GR↗

On the asynchronous rational group

We prove that the asynchronous rational group defined by Grigorchuk, Nekrashevych, and Sushchanskii is simple and not finitely generated. Our proofs also apply to certain subgroups of the rational group, such as the group of all rational bilipschitz homeomorphisms.

math.GR↗

Embedding Right-Angled Artin Groups into Brin-Thompson Groups

We prove that every finitely-generated right-angled Artin group can be embedded into some Brin-Thompson group $nV$. It follows that many other groups can be embedded into some $nV$ (e.g., any finite extension of any of Haglund and Wise's special groups), and that various decision problems involving subgroups of $nV$ are unsolvable.

math.GR↗

Röver's Simple Group is of Type $F_\infty$

We prove that Claas Röver's Thompson-Grigorchuk simple group $V\mathcal{G}$ has type $F_\infty$. The proof involves constructing two complexes on which $V\mathcal{G}$ acts: a simplicial complex analogous to the Stein complex for $V$, and a polysimiplical complex analogous to the Farley complex for $V$. We then analyze the descending links of the polysimplicial complex, using a theorem of Belk and Forrest to prove increasing connectivity.

math.GR↗

Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational group R of Grigorchuk, Nekrashevich, and Sushchanskii has finite order. A modification of the construction gives other undecidability results about the dynamics of the action of elements of 2V on Cantor Space. Arzhantseva, Lafont, and Minasyanin prove in 2012 that there exists a finitely presented group with solvable word problem and unsolvable torsion problem. To our knowledge, 2V furnishes the first concrete example of such a group, and gives an example of a direct undecidability result in the extended family of R. Thompson type groups.

math.GR↗

Dynamics in Thompson's Group F

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 functions can be described by a Mather-type invariant.

math.GR↗

Thompson's Group F

We introduce forest diagrams and strand diagrams for elements of Thompson's group F. A forest diagram is a pair of infinite, bounded binary forests together with an order-preserving bijection of the leaves. Using forest diagrams, we derive a simple length formula for elements of F, and we discuss applications to the geometry of the Cayley graph, including a new upper bound on the isoperimetric constant (a.k.a. Cheeger constant) of F. Strand diagrams are similar to tree diagrams, but they can be concatenated like braids. Motivated by the fact that configuration spaces are classifying spaces for braid groups, we present a classifying space for F that is the ``configuration space'' of finitely many points on a line, with the points allowed to split and merge in pairs. Strand diagrams are related to a description of F as a groupoid, which we use to derive presentations for F, T, V, and the braided Thompson group BV. In addition to the new results, we include a thorough exposition of the basic theory of the group F. Highlights include a simplified proof that the commutator subgroup of F is simple, a discussion of open problems (with a focus on amenability), and a simplified derivation of the standard presentation and normal forms for F using forest diagrams.

math.GR↗

Thompson's Group F is not Minimally Almost Convex

We prove that Richard Thompson's group F is not minimally almost convex with respect to the two standard generators. This improves upon a recent result of S. Cleary and J. Taback. We make use of the forest diagrams for elements of F introduced by J. Belk and K. Brown. These diagrams seem particularly well-suited for understanding the Cayley graph for the two standard generators.

math.GR↗