Related papers: Minimal clones with many majority operations
We study the minimal input sets which can determine completely the universal and the phase-covariant quantum cloning machines. We find that the universal quantum cloning machine, which can copy arbitrary input qubit equally well, however…
We consider the following special case of minimizing makespan. A set of jobs $J$ and a set of machines $M$ are given. Each job $j \in J$ can be scheduled on a machine from a subset $M_j$ of $M$. The processing time of $j$ is the same on all…
In the present paper we bring together minimality conditions proposed in previous two papers and present some new minimality conditions for classical and virtual knots and links.
We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the…
We introduce the notion of minimal inversion sequences for a pattern $\rho$, which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of $\rho$ for inversion sequences. We give a characterization of…
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
In the present paper we continue the programme of systematic construction of invariant differential operators on the example of the non-compact groups Sp(n,R). Earlier in arXiv:1205.5521 we gave the main multiplets and the main reduced…
We show that there is a fermionic minimal model, i.e. a 1+1d conformal field theory which contains operators of half-integral spins in its spectrum, for each $c=1-6/m(m+1)$, $m\ge 3$. This generalizes the Majorana fermion for $c=1/2$, $m=3$…
For totally ergodic Z^2-actions a collection of weak limits provide the set {2,4, ..., 2 ^ n} of spectral multiplicities for their tensor product. Our conditions allow to obtain a similar result for mixing actions via some limit procedure.
Let rho and sigma be two central relations on a finite set A. It is known that the clones Pol(rho) and Pol(sigma) which consists of all operations on A that preserve rho respectively sigma are among the maximal clones on A. In this paper,…
We study the role of interference in the process of quantum cloning. We show that in order to achieve better than classical cloning of a qubit no interference is needed. In particular, a large class of symmetric universal 1$\to$ 2 qubit…
In this paper, we prove that for any $k\ge 3$, there exist infinitely many minimal asymmetric $k$-uniform hypergraphs. This is in a striking contrast to $k=2$, where it has been proved recently that there are exactly $18$ minimal asymmetric…
We show that encrypted cloning of unknown quantum states is possible. Any number of encrypted clones of a qubit can be created through a unitary transformation, and each of the encrypted clones can be decrypted through a unitary…
Clustering with submodular functions has been of interest over the last few years. Symmetric submodular functions are of particular interest as minimizing them is significantly more efficient and they include many commonly used functions in…
We show that the number of partial triangulations of a set of $n$ points on the plane is at least the $(n-2)$-nd Catalan number. This is tight for convex $n$-gons. We also describe all the equality cases.
Via (C,F)-construction we produce a 2-fold simple mixing transformation which has uncountably many non-trivial proper factors and all of them are prime.
It is known that a minimal teaching set of any threshold function on the twodimensional rectangular grid consists of 3 or 4 points. We derive exact formulae for the numbers of functions corresponding to these values and further refine them…
It is known that there are only finitely many mutation-equivalence classes with a given singularity content, and each of these equivalence classes contains only finitely many minimal polygons. We describe an efficient algorithm to classify…
In joint work of the author with Stefan Witzel, a procedure was developed for building new examples of groups in the extended family of R. Thompson's groups, using what we termed \emph{cloning systems}. These new Thompson-like groups can be…
An algorithm counting the number of ones in a binary word is presented running in time $O(\log\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication.