Related papers: Minimal clones with many majority operations

Action operads and cloning systems are, respectively, the main ingredients in two approaches for axiomatically constructing Thompson-like groups due to Thumann and Witzel-Zaremsky. In this paper, we prove that action operads are equivalent…

These notes present an approach to obtaining the basic operations of addition and multiplication on the natural numbers in terms of elementary results about commutative monoids.

We study pivotal decomposition schemes and investigate classes of pivotally decomposable operations. We provide sufficient conditions on pivotal operations that guarantee that the corresponding classes of pivotally decomposable operations…

We determine whether each known generating set of arbitrary oriented Reidemeister moves is minimal. We then provide a complete classification of minimal generating sets that include a coherent Reidemeister move of type II. We also classify…

We present the first experimental implementation of a multifunctional device for the optimal cloning of one to two qubits. Previous implementations have always been designed to optimize the cloning procedure with respect to one single type…

A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…

As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…

After proving a general no-cloning theorem for black boxes, we derive the optimal universal cloning of unitary transformations, from one to two copies. The optimal cloner is realized by quantum channels with memory, and greately outperforms…

Not all unitary operations upon a set of qubits can be implemented by sequential interactions between each qubit and an ancillary system. We analyze the specific case of sequential quantum cloning 1->M and prove that the minimal dimension D…

We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.

We compare the minimal model of a log canonical pair with the minimal model of its reduced boundary. These results are then used to study the existence of the minimal model of a semi-log-canonical pair using its normalization.

Code clones are pairs of code snippets that implement similar functionality. Clone detection is a fundamental branch of automatic source code comprehension, having many applications in refactoring recommendation, plagiarism detection, and…

We show that there are exactly eight MMIK (minor minimal intrinsically knotted) graphs of order nine.

It is shown that no signaling constraint generates the whole class of 1 $\rightarrow$ 2 optimal quantum cloning machines of single qubits.

We show the finiteness of log pluricanonical representations under the assumption of the existence of a good minimal model.

We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.

We propose the construction of entire functions with a given random collection of zeros. There are considered two particular cases. In the first one we are dealing with simple zeros. And the second corresponds to random zeros with random…

We consider the minimal model program for varieties that are not Q-factorial. We show that, in many cases, its steps are simpler than expected. In particular, all flips are 1-complemented. The main applications are to log terminal…

The study of partial clones on $\mathbf{2}:=\{0,1\}$ was initiated by R. V. Freivald. In his fundamental paper published in 1966, Freivald showed, among other things, that the set of all monotone partial functions and the set of all…

We address the problem of creating entire and complete maps of software code clones (copy features in data) in a corpus of binary artifacts of unknown provenance. We report on a practical methodology, which employs enhanced suffix data…