Related papers: Minimal clones generated by majority operations
We discuss the relative log minimal model theory for log surfaces in the analytic setting. More precisely, we show that the minimal model program, the abundance theorem, and the finite generation of log canonical rings hold for log pairs of…
We study the entanglement properties of the output state of a universal cloning machine. We analyse in particular bipartite and tripartite entanglement of the clones, and discuss the ``classical limit'' of infinitely many output copies.
We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
Transformations which convert between Fermionic modes and qubit operations have become a ubiquitous tool in quantum algorithms for simulating systems. Similarly, collections of Pauli operators might be obtained from solutions of non-local…
Given an infinite set X and an ideal I of subsets of X, the set of all finitary operations on X which map all (powers of) I-small sets to I-small sets is a clone. In a 2001 article, G. Czedli and L. Heindorf asked whether or not for two…
We provide new general kernel selection rules thanks to penalized least-squares criteria. We derive optimal oracle inequalities using adequate concentration tools. We also investigate the problem of minimal penalty as described in [BM07].
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…
We consider databases in which each attribute takes values from a partially ordered set (poset). This allows one to model a number of interesting scenarios arising in different applications, including quantitative databases, taxonomies, and…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
We show that several versions of Floyd and Rivest's algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+o(n)$ comparisons on average and with high probability. This rectifies the analysis of…
The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.
We address the problem of creating entire and complete maps of software code clones (copy features in data) in a corpus of binary artifacts of unknown provenance. We report on a practical methodology, which employs enhanced suffix data…
We define computational atoms named "actions" equipped primarily with three operations: reduction, collection, and inspection. We show how actions can be used for decision-making algorithms from simple axioms. We describe the encodings of…
Detecting code clones is relevant to software maintenance and code refactoring. This challenge still presents unresolved cases, mainly when structural similarity does not reflect functional equivalence, though recent code models show…
For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
In this short note we give and discuss a general multilinear expression of the structure function of an arbitrary semicoherent system in terms of its minimal path and cut sets. We also examine the link between the number of minimal path and…