Related papers: Minimal clones with many majority operations
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,…
For each k greater than or equal to 5, we construct a modular operad of "k-log-canonically embedded" curves.
In this paper, we enumerate the number of oriented rational knots and the number of oriented rational links with any given crossing number and minimum genus. This allows us to obtain a precise formula for the average minimal genus of…
Code cloning plays a very important role in open-source software engineering. The presence of clones within a project may indicate a need for refactoring, and clones between projects are even more interesting, since code migration takes…
Let k_r(n,m) denote the minimum number of r-cliques in graphs with n vertices and m edges. For r=3,4 we give a lower bound on k_r(n,m) that approximates k_r(n,m) with an error smaller than n^r/(n^2-2m). The solution is based on a constraint…
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing…
We present a practical algorithm to compute models of rational functions with minimal resultant under conjugation by fractional linear transformations. We also report on a search for rational functions of degrees 2 and 3 with rational…
We show that a doubly minimal system $X$ has the property that for every minimal system $Y$ the orbit closure of any pair $(y,x) \in Y \times X$ is either $Y \times X$ or it has the form $\Gamma_\pi = \{(\pi(x),x) : x \in X\}$ for some…
In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…
We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…
One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the assumption behind this problem, that there is indeed some k…
In this paper, we prove the existence of minimizers of a class of multi-constrained variational problems. We consider systems involving a nonlinearity that does not satisfy compactness, monotonicity, neither symmetry properties. Our…
Clone detection plays an important role in software engineering. Finding clones within a single project introduces possible refactoring opportunities, and between different projects it could be used for detecting code reuse or possible…
We used deep wide field photometric observations to derive the fraction of binary systems in a sample of five high-latitude Galactic open clusters. By analysing the color distribution of Main Sequence stars we derived the minimum fraction…
We present an overview of some of our recent results on the existence of rays of minimal growth for elliptic cone operators and two new results concerning the necessity of certain conditions for the existence of such rays.
We produce minimal integrity bases for both isotropic and hemitropic invariant algebras (and more generally covariant algebras) of most common bidimensional constitutive tensors and -- possibly coupled -- laws, including piezoelectricity…
We explore the relative percentages of binary systems and higher-order multiples that are formed by pure stellar dynamics, within a small subcluster of $N$ stars. The subcluster is intended to represent the fragmentation products of a…
An optimal universal cloning transformation is derived that produces M copies of an unknown qubit from a pair of orthogonal qubits. For M>6, the corresponding cloning fidelity is higher than that of the optimal copying of a pair of…
We extend some results on even sets of nodes which have been proved for surfaces up to degree 6 to surfaces up to degree 10. In particular, we give a formula for the minimal cardinality of a nonempty even set of nodes.
In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765