Related papers: Minimal clones with few majority operations
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 planar graph $G$ is called a pentagulation of an $n$-gon ($n\geq$ is an integer) if all faces of $G$ are pentagons, except one, which is an $n$-gon. A $3$-connected pentagulation $G$ of an $n$-gon is called minimal if it has the smallest…
We prove that minimal Dirac operators on the half-line are self-modeling, which means that such an operator is determined by its arbitrary unitary copy uniquely up to a transformation (shape equivalence) which changes its potential by a…
An executable binary typically contains a large number of machine instructions. Although the statistics of popular instructions is well known, the distribution of non-popular instructions has been relatively under explored. Our finding…
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…
We investigate the problem whether a function of several arguments can be reconstructed from its identification minors. We focus on functions with a unique identification minor, and we establish some positive and negative results on the…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
Khan and Miller proved that for every computable non decreasing unbounded function $h\in \omega^\omega$ (henceforth order function), if $h$ is sufficiently large, then there exists a $DNR_h$ that is of minimal degree. Where $h$ has to…
Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.
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 present the complete classification of the subgroup of the classical knot concordance group generated by knots with eight or fewer crossings. Proofs are presented in summary. We also describe extensions of this work to the case of nine…
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 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$…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
It is shown that a piecewise linear function can be represented as a Max-Min polynomial of its linear components.
The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by…
Using Verlinde formula and the symmetry of the modular matrix we describe an algorithm to find all conformal field theories with low number of primary fields. We employ the algorithm on up to eight primary fields. Four new conformal field…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.
We obtain recurrences for smallest parts functions which resemble Euler's recurrence for the ordinary partition function. The proofs involve the holomorphic projection of non-holomorphic modular forms of weight 2.