Related papers: A user's guide to cloning systems
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…
Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…
We develop a theory of \emph{Katetov functors} which provide a uniform way of constructing Fraisse limits. Among applications, we present short proofs and improvements of several recent results on the structure of the group of automorphisms…
The author and Nakano recently proved that multiplicities in a Specht filtration of a symmetric group module are well-defined precisely when the characteristic is at least five. This result suggested the possibility of a symmetric group…
In this work, we revisit the problem of finding an admissible region of fidelities obtained after an application of an arbitrary $1 \rightarrow N$ universal quantum cloner which has been recently solved in [A. Kay et al., Quant. Inf. Comput…
We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in the momenta, for…
Symmetry is a guiding principle in physics that allows to generalize conclusions between many physical systems. In the ongoing search for new topological phases of matter, symmetry plays a crucial role because it protects topological…
Various spaces of symmetries of a structure are naturally endowed with both an algebraic and a topological structure. For example, the automorphism group of a structure is, on top of being a group, a topological group when equipped with the…
The automorphism groups of several of Thompson's countable groups of piecewise linear homeomorphisms of the line and circle are computed and it is shown that the outer automorphism groups of these groups are relatively small. These results…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
In this work we present a principle which says that quasimorphisms can be obtained via "local data" of the group action on certain appropriate spaces. In a rough manner the principle says that instead of starting with a given group and try…
We establish direct isomorphisms between different versions of tiling cohomology. The first version is the direct limit of the cohomologies of the approximants in the Anderson-Putnam-G\"ahler complex, the second is the recently introduced…
We introduce semaphore codes associated to a Turing machine via resets. Semaphore codes provide an approximation theory for resets. In this paper we generalize the set-up of our previous paper "Random walks on semaphore codes and delay de…
Clustering is a fundamental task in machine learning and data analysis, but it frequently fails to provide fair representation for various marginalized communities defined by multiple protected attributes -- a shortcoming often caused by…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…
Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
Hughes has defined a class of groups, which we call FSS (finite similarity structure) groups. Each FSS group acts on a compact ultrametric space by local similarities. The best-known example is Thompson's group V. Guided by previous work on…
We study subgroups of Thompson's group $F$ by means of an automaton associated with them. We prove that every maximal subgroup of $F$ of infinite index is closed, that is, it coincides with the subgroup of $F$ accepted by the automaton…