中文
相关论文

相关论文: The clone generated by the median functions

200 篇论文

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

环与代数 · 数学 2007-05-23 Michael Pinsker

A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…

环与代数 · 数学 2007-05-23 Michael Pinsker

A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…

环与代数 · 数学 2007-05-23 Martin Goldstern , Saharon Shelah

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…

环与代数 · 数学 2008-01-15 Martin Goldstern , Michael Pinsker

Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…

环与代数 · 数学 2009-11-03 Miguel Couceiro , Lucien Haddad

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…

环与代数 · 数学 2019-09-16 Sebastian Kreinecker

The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…

环与代数 · 数学 2018-12-27 Radomír Halaš , Jozef Pócs

On an infinite base set X, every ideal of subsets of X can be associated with the clone of those operations on X which map small sets to small sets. We continue earlier investigations on the position of such clones in the clone lattice.

环与代数 · 数学 2008-07-02 Mathias Beiglböck , Martin Goldstern , Lutz Heindorf , Michael Pinsker

We first determine the maximal clones on a set X of infinite regular cardinality which contain all permutations but not all unary functions, extending a result of Heindorf's for countably infinite X. If |X| is countably infinite or weakly…

环与代数 · 数学 2007-05-23 Michael Pinsker

We determine all majority operations on a four-element set that generate a minimal clone.

环与代数 · 数学 2011-02-09 Tamás Waldhauser

We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg's theorem: "there are 2^2^kappa many maximal (=precomplete)…

环与代数 · 数学 2016-09-07 Martin Goldstern , Saharon Shelah

We characterize minimal clones generated by a majority function containing at most seven ternary operations.

环与代数 · 数学 2011-02-11 Tamás Waldhauser

We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…

离散数学 · 计算机科学 2018-04-13 Andrei Bulatov , Leslie Ann Goldberg , Mark Jerrum , David Richerby , Stanislav Živný

We show that for an infinite set X, if L is a completely distributive algebraic lattice with not more completely join irreducible elements than the size of the power set of X, then there is a monoidal interval in the clone lattice on X…

环与代数 · 数学 2007-05-23 Michael Pinsker

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…

环与代数 · 数学 2008-06-20 Martin Goldstern , Michael Pinsker

We describe the ordering of a class of clones by minion homomorphisms, also known as minor preserving maps or height 1 clone homomorphisms. The class consists of all clones on finite sets determined by binary relations whose projections to…

组合数学 · 数学 2024-09-13 Libor Barto , Maryia Kapytka

We build networks of genetic similarity in which the nodes are organisms sampled from biological populations. The procedure is illustrated by constructing networks from genetic data of a marine clonal plant. An important feature in the…

种群与进化 · 定量生物学 2008-01-23 E. Hernandez-Garcia , A. F. Rozenfeld , V. M. Eguiluz , S. Arnaud-Haond , C. M. Duarte

A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…

计算机科学中的逻辑 · 计算机科学 2019-09-09 Matthew Moore

Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…

组合数学 · 数学 2026-04-08 Samuele Giraudo

Clonoids are sets of finitary functions from an algebra $\mathbb{A}$ to an algebra $\mathbb{B}$ that are closed under composition with term functions of $\mathbb{A}$ on the domain side and with term functions of $\mathbb{B}$ on the codomain…

环与代数 · 数学 2024-04-17 Peter Mayr , Patrick Wynne
‹ 上一页 1 2 3 10 下一页 ›