Related papers: Minimal clones generated by majority operations
We investigate the structure of the currencies (systems of coins) for which the greedy change-making algorithm always finds an optimal solution (that is, a one with minimum number of coins). We present a series of necessary conditions that…
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…
In this paper, a new kind of soft sets related with some common decision making problems in real life called central soft sets is introduced. Properties of some basic operations on central soft sets are shown. It is investigated that some…
We used deep observations collected with ACS@HST to derive the fraction of binary systems in a sample of thirteen low-density Galactic globular clusters. By analysing the color distribution of Main Sequence stars we derived the minimum…
This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of "elementary operations" on positive integral sequences is introduced. Our main theorem answers the question of…
Given an algebra $F[H]^G$ of polynomial invariants of an action of the group $G$ over the vector space $H$, a subset $S$ of $F[H]^G$ is called separating if $S$ separates all orbits that can be separated by $F[H]^G$. A minimal separating…
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…
The properties of small clusters can differ dramatically from the bulk phases of the same constituents. In equilibrium, cluster assembly has been recently explored, whereas out of equilibrium, the physical principles of clustering remain…
Associated to each simplicial complex is a binary hierarchical model. We classify the simplicial complexes that yield unimodular binary hierarchical models. Our main theorem provides both a construction of all unimodular binary hierarchical…
We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent…
We report on the first experimental demonstration of majority logic operation using spin waves in a scaled device with an in-line input and output layout. The device operation is based on the interference of spin waves generated and…
A basic belief assignment can have up to 2^n focal elements, and combining them with a simple conjunctive operator will need O(2^2n) operations. This article proposes some techniques to limit the size of the focal sets of the bbas to be…
An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.
A minimal model of polychronous groups in neural networks is presented. The model is computationally efficient and allows the study of polychronous groups independent of specific neuron models. Computational experiments were performed with…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…
This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…
As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…
We consider finitary relations (also known as crosses) that are definable via finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite parameter set $\Gamma$. We prove that whenever $\Gamma$ contains at least one…
A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…