Related papers: Clones from Creatures
An ideal on a set $X$ is a collection of subsets of $X$ closed under the operations of taking finite unions and subsets of its elements. Ideals are a very useful notion in topology and set theory and have been studied for a long time. We…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
In this paper, we show that a result precisely analogous to the traditional quantum no-cloning theorem holds in classical mechanics. This classical no-cloning theorem does not prohibit classical cloning, we argue, because it is based on a…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…
A unital $\ell$-group $(G,u)$ is an abelian group $G$ equipped with a translation-invariant lattice-order and a distinguished element $u$, called order-unit, whose positive integer multiples eventually dominate each element of $G$. We…
The optimal N to M ($M>N$) quantum cloning machines for the d-level system are presented. The unitary cloning transformations achieve the bound of the fidelity.
Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…
A topologized semilattice $X$ is called complete if each non-empty chain $C\subset X$ has $\inf C$ and $\sup C$ that belong to the closure $C$ of the chain $C$ in $X$. In this paper, we introduce various concepts of completeness of…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
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…
A relation algebra is measurable if the identity element is a sum of atoms, and the square x;1;x of each subidentity atom x is a sum of non-zero functional elements. These functional elements form a group Gx. We prove that a measurable…
We characterize minimal clones generated by a majority function containing at most seven ternary operations.
Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…
Ontologies order and interconnect knowledge of a certain field in a formal and semantic way so that they are machine-parsable. They try to define allwhere acceptable definition of concepts and objects, classify them, provide properties as…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We study the problem of universal quantum cloning -- taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well…
To convert a fractional solution to an instance of a constraint satisfaction problem into a solution, a rounding scheme is needed, which can be described by a collection of symmetric operations with one of each arity. An intriguing…