Related papers: Generating clones with conservative near-unanimity…

The trade-offs among various output fidelities of asymmetric universal cloning machines are investigated. First we find out all the attainable optimal output fidelities for the 1 to 3 asymmetric universal cloning machine and it turns out…

We study the existence of free subalgebras in division algebras, and prove the following general result: if $A$ is a noetherian domain which is countably generated over an uncountable algebraically closed field $k$ of characteristic 0, then…

Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A if and only if each one is a substitution instance of the other using operations from C. We study the…

We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…

A brick is a $3$-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair of edges $\alpha$ and $\beta$ such that $G-\{\alpha,\beta\}$…

In this work the dynamic descriptive complexity of the k-clique query is studied. It is shown that when edges may only be inserted then k-clique can be maintained by a quantifier-free update program of arity k-1, but it cannot be maintained…

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…

Special relativity forbids superluminal influences. Using only the no-signaling principle and an assumption about the form of the Schmidt decomposition, we show that for "any" allowed fidelity there is a "unique" approximate qubit cloner…

We investigate finitary functions from $\mathbb{Z}_{n}$ to $\mathbb{Z}_{n}$ for a squarefree number $n$. We show that the lattice of all clones on the squarefree set $\mathbb{Z}_{p_1\cdots p_m}$ which contain the addition of…

Alon and Shikhelman initiated the systematic study of a generalization of the extremal function. Motivated by algorithmic applications, the study of the extremal function $\text{ex}(n, K_k, K_t\text{-minor})$, i.e., the number of cliques of…

We establish upper bounds for the smallest height of a generator of a number field $k$ over the rational field $\Q$. Our first bound applies to all number fields $k$ having at least one real embedding. We also give a second conditional…

We study the fundamental group of an open $n$-manifold $M$ of nonnegative Ricci curvature. We show that if there is an integer $k$ such that any tangent cone at infinity of the Riemannian universal cover of $M$ is a metric cone, whose…

We consider clones on countable sets. If such a clone has quasigroup operations, is locally closed and countable, then there is a function $f : \mathbb{N} \to \mathbb{N}$ such that the $n$-ary part of $C$ is equal to the $n$-ary part of…

We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution…

A recent article introduced a hierarchy of quantities called $k$-fidelities that approximate the quantum process fidelity with increasing accuracy. The lowest approximation in this hiearchy is the $0$-fidelity. The authors gave a protocol…

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

We extend the decomposition theorem for numerically $K$-trivial varieties with log terminal singularities to the K\"ahler setting. Along the way we prove that all such varieties admit a strong locally trivial algebraic approximation, thus…

Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…