Related papers: A user's guide to cloning systems
The purpose of this work is to bound sofic topological entropy of Toeplitz systems over residually finite groups and to prove the Krieger Theorem about attaining arbitrary entropy by the Toeplitz systems. To achieve these results, we…
We show that labelled Thompson groups and twisted Brin--Thompson groups are all acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically as a subgroup of an…
We describe standard forms for elements of the higher-dimensional Thompson groups $nV$ arising from gridding subdivision processes. These processes lead to standard normal form descriptions for elements in these groups, and sizes of these…
We present an abstract framework for asymptotic analysis of convergence based on the notions of eventual families of sets that we define. A family of subsets of a given set is called here an "eventual family" if it is upper hereditary with…
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…
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…
We define a family of groups that generalises Thompson's groups $T$ and $G$ and also those of Higman, Stein and Brin. For groups in this family we descrine centralisers of finite subgroups and show, that for a given finite subgroup $Q$,…
This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
I show that one can explicitly construct topologically/geometrically distinguishable data which provide isomorphic copies (i.e. \emph{isomorphs}) of the tempered fundamental group of a geometrically connected, smooth, quasi-projective…
A procedure to extend a superintegrable system into a new superintegrable one is systematically tested for the known systems on $\mathbb E^2$ and $\mathbb S^2$ and for a family of systems defined on constant curvature manifolds. The…
Symmetric cohomology of groups, defined by M. Staic in [2], is similar to the way one defines the cyclic cohomology for algebras. We show that there is a well-defined restriction, conjugation and transfer map in symmetric cohomology, which…
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols…
We show how to approximate diffeomorphisms of the closed interval and the circle by elements of Thompson's groups $F$ and $T$, respectively. This is relevant in the context of Jones' continuum limit of discrete multipartite systems and its…
We describe efficient methods for screening clone libraries, based on pooling schemes which we call ``random $k$-sets designs''. In these designs, the pools in which any clone occurs are equally likely to be any possible selection of $k$…
We study the entanglement properties of the output state of a universal cloning machine. We analyse in particular bipartite and tripartite entanglement of the clones, and discuss the ``classical limit'' of infinitely many output copies.
We present (with proof) a new family of decomposable Specht modules for the symmetric group in characteristic 2. These Specht modules are labelled by partitions of the form $(a,3,1^b)$, and are the first new examples found for thirty years.…
In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For…
We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…
Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…