Related papers: Minimal clones generated by majority operations

The purpose of this article is to give, for any commutative ring A, an explicit minimal set of generators for the ring of multisymmetric functions TS^d_A(A[x_1,...,x_r]) as an A-algebra. In characteristic zero, i.e. when A is an algebra…

Action operads and cloning systems are, respectively, the main ingredients in two approaches for axiomatically constructing Thompson-like groups due to Thumann and Witzel-Zaremsky. In this paper, we prove that action operads are equivalent…

We compute for reflection groups of type $A,B,D,F_4,H_3$ and for dihedral groups a statistic counting the maximal cardinality of a set of elements in the group whose generalized inversions yield the full set of inversions and which are…

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 study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…

Let $k_r(n,\delta)$ be the minimum number of $r$-cliques in graphs with $n$ vertices and minimum degree $\delta$. We evaluate $k_r(n,\delta)$ for $\delta \leq 4n/5$ and some other cases. Moreover, we give a construction, which we conjecture…

In this paper we bring together results about the density of subsemigroups of abelian Lie groups, the minimal number of topological generators of abelian Lie groups and a result about actions of algebraic groups. We find the minimal number…

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure of a boolean relation (a set of boolean vectors) by…

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

In this paper, we determine minimal generating sets for several well-known monoids of matrices over semirings. In particular, we find minimal generating sets for the monoids consisting of: all $n\times n$ boolean matrices when $n\leq 8$;…

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 iff each one is a substitution instance of the other using operations from C. We study the clones for…

For a class C of operations on a nonempty base set A, an operation f is called a C-subfunction of an operation g, if f = g(h_1, ..., h_n), where all the inner functions h_i are members of C. Two operations are C-equivalent if they are…

The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of the network is either in this set or is adjacent to at least…

Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of…

For photoproduction reactions with final states consisting of two pseudoscalar mesons and a spin-1/2 baryon, 8 complex amplitudes need to be determined uniquely. A modified version of Moravcsik's theorem is employed for these reactions,…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

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 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.

The block count of an equivalence $\mu\in$ Equ$(A)$ is the number blnum$(\mu)$ of blocks of (the partition corresponding to) $\mu$. We say that $X=\{\mu_1,\mu_2,\mu_3,\mu_4\}$ is a four-element generating set of Equ$(A)$ with consecutive…