SearcharxivSearch

arXiv subjects

Tom Kaiser

Publications and source records attributed to Tom Kaiser.

6 recordsLinked to original sources

On arithmetic properties of solvable Baumslag-Solitar groups

For $0<\alpha\le 1$, we say that a sequence $(X_k)_{k>0}$ of $d$-regular graphs has property $D_\alpha$ if there exists a constant $C>0$ such that $\mathrm{diam}(X_k)\ge C\cdot|X_k|^\alpha$. We investigate property $D_\alpha$ for arithmetic box spaces of the solvable Baumslag-Solitar groups $BS(1,m)$ (with $m\geq 2$): those are box spaces obtained by embedding $BS(1,m)$ into the upper triangular matrices in $GL_2(\mathbb{Z}[1/m])$ and intersecting with a family $M_{N_k}$ of congruence subgroups of $GL_2(\mathbb{Z}[1/m])$, where the levels $N_k$ are coprime with $m$ and $N_k|N_{k+1}$. We prove: - if an arithmetic box space has $D_\alpha$, then $\alpha\le\frac{1}{2}$~; - if the family $(N_k)_k$ of levels is supported on finitely many primes, the corresponding arithmetic box space has $D_{1/2}$~; - if the family $(N_k)_k$ of levels is supported on a family of primes with positive analytic primitive density, then the corresponding arithmetic box space does not have $D_\alpha$, for every $\alpha>0$. Moreover, we prove that if we embed $BS(1,m)$ in the group of invertible upper-triangular matrices $T_n(\mathbb{Z}[1/m])$, then every finite index subgroup of the embedding contains a congruence subgroup. This is a version of the congruence subgroup property (CSP).

math.GR

A closer look at the non-Hopfianness of $BS(2,3)$

The Baumslag-Solitar group $BS(2,3)$, is a so-called non-Hopfian group, meaning that it has an epimorphism $\phi$ onto itself, that is not injective. In particular this is equivalent to saying that $BS(2,3)$ has a non-trivial quotient that is isomorphic to itself. As a consequence the Cayley graph of $BS(2,3)$ has a quotient that is isomorphic to itself up to change of generators. We describe this quotient on the graph-level and take a closer look at the most common epimorphism $\phi$. We show its kernel is a free group of infinite rank with an explicit set of generators. Finally we show how $\phi$ appears as a morphism on fundamental groups induced by some continuous map. This point of view was communicated to the author by Gilbert Levitt.

math.GR

Magnitude Homology, Diagonality, Medianness, K\"unneth and Mayer-Vietoris

Magnitude homology of graphs is introduced by Hepworth and Willerton in arXiv:1505.04125 . Magnitude homology of arbitrary metric spaces by Leinster and Shulman in arXiv:1711.00802v2 . We verify that the K\"unneth and Mayer-Vietoris formulas proved in arXiv:1505.04125 for graphs extend naturally to the metric setting. The same is done for the notion of diagonality, also originating from arXiv:1505.04125 . Stability of this notion under products, retracts, filtrations is verified, and as an application, it is shown that median spaces are diagonal; in particular, any Menger convex median space has vanishing magnitude homology. Finally, we argue for a definition of magnitude homology in the context of "betweenness spaces" and develop some of its properties.

math.CO

The first uniformly finite homology group with coefficients in $\mathbb{Z}$ and a characterisation of its vanishing in the transitive case

We study the first uniformly finite homology group of Block and Weinberger for uniformly locally finite graphs, with coefficients in $\mathbb{Z}$ and $\mathbb{Z}_2$. When the graph is a tree, or coefficients are in $\mathbb{Z}_2$, a characterisation of the group is obtained. In the general case, we describe three phenomena that entail non-vanishing of the group; their disjunction is shown to also be necessary for non-vanishing in the case of transitive graphs.

math.CO

Combinatorial cost: a coarse setting

The main inspiration for this paper is a paper by Elek where he introduces combinatorial cost for graph sequences. We show that having cost equal to 1 and hyperfiniteness are coarse invariants. We also show `cost-1' for box spaces behaves multiplicatively when taking subgroups. We show that graph sequences coming from Farber sequences of a group have property A if and only if the group is amenable. The same is true for hyperfiniteness. This generalises a theorem by Elek. Furthermore we optimise this result when Farber sequences are replaced by sofic approximations. In doing so we introduce a new concept: property almost-A.

math.GR

The Reidemeister spectra of low dimensional crystallographic groups

In this paper we study the number of twisted conjugacy classes (the Reidemeister number) for automorphisms of crystallographic groups. We present two main algorithms for crystallographic groups whose holonomy group has finite normaliser in $\operatorname{GL}_n(\mathbb{Z})$. The first algorithm calculates whether a group has the $R_\infty$-property; the second calculates the Reidemeister spectrum. We apply these algorithms to crystallographic groups up to dimension $6$.

math.GR