中文
相关论文

相关论文: Clones containing all almost unary functions

200 篇论文

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

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

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 X be a linearly ordered set of arbitrary size (finite or infinite). Natural functions on such a set one can define using the linear order include maximum, minimum and median functions. While it is clear what the clone generated by the…

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

Let c be the cardinality of the continuum. We give a family of pairwise incomparable clones (on a countable base set) 2^c members, all with the same unary fragment, namely the set of all unary operations. We also give, for each n, a family…

环与代数 · 数学 2011-08-16 Martin Goldstern , Gábor Sági , Saharon Shelah

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…

环与代数 · 数学 2016-09-07 Michael Pinsker

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

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

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…

逻辑 · 数学 2022-10-13 Mike Behrisch , Edith Vargas-García , Dmitriy Zhuk

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

A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…

环与代数 · 数学 2019-09-20 Athena Sparks

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

We investigate finitary functions from $\mathbb{Z}_{pq}$ to $\mathbb{Z}_{pq}$ for two distinct prime numbers $p$ and $q$. We show that the lattice of all clones on the set $\mathbb{Z}_{pq}$ which contain the addition of $\mathbb{Z}_{pq}$ is…

环与代数 · 数学 2020-06-02 Stefano Fioravanti

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

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

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

The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with 2^X compact elements. We show that every algebraic lattice with at most 2^X compact elements is a complete sublattice of Cl(X).

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

We investigate the lattice of clones that are generated by a set of functions that are induced on a finite field $\mathbb{F}$ by monomials. We study the atoms and coatoms of this lattice and investigate whether this lattice contains…

环与代数 · 数学 2021-09-03 Sebastian Kreinecker

Extending Sparks's theorem, we determine the cardinality of the lattice of $(C_1,C_2)$-clonoids of Boolean functions for certain pairs $(C_1,C_2)$ of clones of essentially unary, linear, or $0$- or $1$-separating functions or semilattice…

组合数学 · 数学 2024-12-03 Erkko Lehtonen
‹ 上一页 1 2 3 10 下一页 ›