Related papers: A user's guide to cloning systems
We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…
We provide a new method for constructing equiangular tight frames (ETFs). The construction is valid in both the real and complex settings, and shows that many of the few previously-known examples of ETFs are but the first representatives of…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
This dissertation is about rearrangement groups: a class of groups of homeomorphisms of fractal topological spaces. Introduced in 2019 by J. Belk and B. Forrest, this class generalizes the famous trio of Thompson groups $F$, $T$ and $V$ and…
This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…
The aim of this work is to provide further insight into the qualitative behavior of mechanical systems that are well described by Lennard-Jones type interactions on an atomistic scale. By means of $\Gamma$-convergence techniques, we study…
This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…
We review recent developments in the theory of Thompson group representations related to knot theory.
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. For the first time, the article proposes for arbitrary Hamiltonians similar integrators,…
A lot of well-known functors such as group homology, cyclic homology of algebras can be described as limits of certain simply defined functors over categories of presentations. In this paper, we develop technique for the description of the…
We construct rearrangement groups for edge replacement systems, an infinite class of groups that generalize Richard Thompson's groups F, T, and V . Rearrangement groups act by piecewise-defined homeomorphisms on many self-similar…
It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…
Finite-temperature magnetism gives rise to many phenomena in alloy materials, such as magnetic phase transformations, short or medium range order in magnetic alloys, spin waves, critical phenomena, and the magnetocaloric effect. Lattice…
We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group $V$, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations analogous to…
Proximity complexes and filtrations are central constructions in topological data analysis. Built using distance functions, or more generally metrics, they are often used to infer connectivity information from point clouds. Here we…
Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…