Related papers: A user's guide to cloning systems
Though the no-cloning theorem [1] prohibits exact replication of arbitrary quantum states, there are many instances in quantum information processing and entanglement measurement in which a weaker form of cloning may be useful. Here, I…
Working in the soft-element (classical) viewpoint, we introduce \emph{soft bitopological groups}: soft groups endowed with two soft topologies such that the induced topologies on the set of soft elements make the soft-element group into a…
Let F be the Thompson's group. We study the structure of F-limit groups. Consider a sequence of groups marked by three elements, each isomorphic to F. Assume that the this sequence is convergent in the space of marked groups. We prove that…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
In this second article, we continue to study classes of groups constructed from a functorial method due to Vaughan Jones. A key observation of the author shows that these groups have remarkable diagrammatic properties that can be used to…
We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We…
We show that the \s{\phi}-labeled Thompson groups and the twisted Brin--Thompson groups are boundedly acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically…
We review the results of several of our papers about the procedure of extension of Hamiltonians, allowing the construction of families of superintegrable systems with non-trivial polynomial first integrals (or symmetry operators) of…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
Dualities are hidden symmetries that map seemingly unrelated physical systems onto each other. The goal of this work is to systematically construct families of Hamiltonians endowed with a given duality and to provide a universal description…
We introduce "braided" versions of self-similar groups and R\"over--Nekrashevych groups, and study their finiteness properties. This generalizes work of Aroca and Cumplido, and the first author and Wu, who considered the case when the…
We study a family of Thompson-like groups built as rearrangement groups of fractals from [BF19], each acting on a Wa\.zewski dendrite. Each of these is a finitely generated group that is dense in the full group of homeomorphisms of the…
We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…
We describe how to define observables analogous to quantum fields for the semicontinuous limit recently introduced by Jones in the study of unitary representations of Thompson's groups $F$ and $T$. We find that, in terms of correlation…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…