Related papers: A user's guide to cloning systems
Large deviations for additive path functionals of stochastic dynamics and related numerical approaches have attracted significant recent research interest. We focus on the question of convergence properties for cloning algorithms in…
In this Letter, we use a general renormalization-group algorithm to implement Propp and Wilson's "coupling from the past" approach to complex physical systems. Our algorithm follows the evolution of the entire configuration space under the…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
We construct a finitely presented group with coNP-complete word problem, and a finitely generated simple group with coNP-complete word problem. These groups are represented as Thompson groups, hence as partial transformation groups of…
Programmers often reuse code from source code repositories to reduce the development effort. Code clones are candidates for reuse in exploratory or rapid development, as they represent often repeated functionality in software systems. To…
We show that Thompson's group F is the symmetry group of the "generic idempotent". That is, take the monoidal category freely generated by an object A and an isomorphism A \otimes A --> A; then F is the group of automorphisms of A.
A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…
A symmetric encryption method based on properties of quasicrystals is proposed. The advantages of the cipher are strict aperiodicity and everywhere discontinuous property as well as the speed of computation, simplicity of implementation and…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
We isolate the limit-stage filter construction needed for countable-support symmetric iterations built from standard successor-step symmetric systems. At successor stages we take the $\omega_1$-completion of the usual successor-stage…
This report presents a survey on how to group together in a static way planar nodes, that may belong to a wireless network (ad hoc or cellular). The aim is to identify appropriate methods that could also be applied for Point Processes.…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…
Clustering problems are fundamental to unsupervised learning. There is an increased emphasis on fairness in machine learning and AI; one representative notion of fairness is that no single demographic group should be over-represented among…
In the companion to this paper, we described a generalization of the deterministic quantum cloning process, called enscription, which utilizes entanglement in order to achieve the "copying" of (certain) sets of distinct quantum states which…
Approximate but reliable solutions of a quantum system with $N$ identical particles can be easily computed with the envelope theory, also known as the auxiliary field method. This technique has been developed for Hamiltonians with arbitrary…
The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…
We obtain new uniform bounds for the symmetric tensor rank of multiplication in finite extensions of any finite field Fp or Fp2 where p denotes a prime number greater or equal than 5. In this aim, we use the symmetric Chudnovsky-type…
We define a cell complex with an action of the even spin mapping class group, and use it to obtain a finite presentation. We also obtain a finite presentation with Dehn twist generators.