arXiv math/04011022004-01-10math.RAmath.LO

Clones containing all almost unary functions

Michael Pinsker

备注：: 20 pages

英文摘要：

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 such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the clone lattice. This is especially interesting if X is countably infinite, in which case it is known that such a description cannot be obtained for the second maximal clone over the unary functions.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Clones above the unary clone

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 of 2^c clones all with the same n-ary fragment, and all containing the set of all unary operations.

2011-08-14math.LOmath.RA

The number of unary clones containing the permutations on an infinite set

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 lattice. Moreover we find that, with one exception, even the cardinalities of the intervals between the monoid of all permutations and the maximal submonoids of the full transformation monoid are as large. Whether or not the only exception is of the same cardinality as the other intervals depends on additional axioms of set theory.

2005-05-20math.LOmath.RA

The number of clones determined by disjunctions of unary relations

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 $Γ$. We prove that whenever $Γ$ contains at least one non-empty relation distinct from the full carrier set, there is a countably infinite number of polymorphism clones determined by relations that are disjunctively definable from $Γ$. Finally, we extend our result to finitely related polymorphism clones and countably infinite sets $Γ$.

2018-11-28math.LOmath.RA

Clones on regular cardinals

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) clones on a set of size kappa." The clones we construct here do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a strong negative partition theorem we show that for many cardinals kappa there are 2^2^kappa many such clones on a set of size kappa. Finally, we show that on a weakly compact cardinal there are e…

2000-09-05math.LOmath.RA

Maximal clones on uncountable sets that include all permutations

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 compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We then generalize a result of Gavrilov's to obtain on all infinite X a list of all maximal submonoids of the monoid of unary functions which contain the permutations.

2005-05-14math.LOmath.RA

Analytic clones

We use a method from descriptive set theory to investigate the two precomplete clones above the unary clone on a countable set.

2004-04-12math.RA

更多相关论文收起更多论文

A closed algebra with a non-Borel clone and an ideal with a Borel clone

Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is not Borel. Moreover, we provide an example of a coatom in the clone lattice whose obvious definition via an ideal of subsets of natural numbers would suggest that it is complete coanalytic, but which turns out to be a rather simple Borel set.

2011-12-04math.LOmath.RA

Clones on infinite sets

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 Cl(X) for infinite X. In the first chapter we prove the combinatorial result that if X is linearly ordered, then the median functions of different arity defined by that order all generate the same clone. The second chapter deals with clones containing the almost unary functions, that is, all functions whose value is determined by one of its variables up to a…

2004-07-09math.LOmath.RA

源克隆和目标克隆为本质一元、线性、半格或0-分离、1-分离的布尔函数的克隆类（clonoid）

Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones

Khalifa University of Science and Technology（哈利法大学）

本研究拓展Sparks定理，针对特定类型的克隆对(C₁,C₂)，确定了布尔函数的(C₁,C₂)-克隆类格的基数，分别处理了格不可数与有限的情形，并总结了该领域的已知结果。

2024-12-02math.COmath.RA

高维广义拟序

Higher-dimensional generalized quasiorders

TU Dresden（德累斯顿工业大学）

本文证明克隆对固定元数d满足类似一元决定性质当且仅当由d维高维广义拟序决定，并定义了相应的高维自反性与传递性。

2026-09-09math.LOmath.RA

On the clone of aggregation functions on bounded lattices

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 finite $n$-element lattice $L$ there is a set of at most $2n+2$ aggregation functions on $L$ from which the respective clone is generated. Namely, the set of generating aggregation functions consists only of at most $n$ unary functions, at most $n$ binary functions, and lattice operations $\wedge,\vee$, and all aggregation functions of $L$ are composed of them by…

2018-12-22math.RA

Precomplete clones on infinite sets which are closed under conjugation

We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the precomplete clones containing the permutations have been determined, this yields a complete list of the precomplete conjugation-closed clones in those cases. In addition, we show that there exist no precomplete submonoids of the full transformation monoid which are closed under conjugation except those which contain the permutations; the monoids of the latte…

2005-07-31math.LOmath.RA

Clones containing the Mal'cev operation of $\mathbb{Z}_{pq}$

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 finite. We provide an upper bound for the cardinality of this lattice through an injective function to the direct product of the lattice of all $(\mathbb{Z}_p,\mathbb{Z}_q)$-linearly closed clonoids to the $p+1$ power and the lattice of all $(\mathbb{Z}_q,\mathbb{Z}_p)$-linearly closed clonoids to the $q+1$ power. These lattices are studied in arXiv:1910.11…

2020-05-30math.RA

Minimal clones with few majority operations

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

2011-02-10math.RA

On generating of idempotent aggregation functions on finite lattices

In a recent paper we proposed the study of aggregation functions on lattices via clone theory approach. Observing that aggregation functions on lattices just correspond to $0,1$-monotone clones, we have shown that all aggregation functions on a finite lattice $L$ can be obtained as usual composition of lattice operations $\wedge,\vee$, and certain unary and binary aggregation functions. The aim of this paper is to present a generating set for the class of intermediate (or, equivalently, idempotent) aggregation functions. This set consists of lattice operations and certain ternary idempotent ag…

2018-12-22math.RA

Minimal clones with many majority operations

We present two minimal clones containing 26 and 78 majority operations respectively, more than any other previously known example.

2011-02-11math.RA

All centralising monoids with majority witnesses on a four-element set

We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion maximal proper submonoids of the full transformation monoid among them. This extends previous work by Goldstern, Machida and Rosenberg.

2020-10-31math.LOmath.RA

Majority-closed minions of Boolean functions

The 93 minions of Boolean functions stable under left composition with the clone of self-dual monotone functions are described. As an easy consequence, all $(C_1,C_2)$-stable classes of Boolean functions are determined for an arbitrary clone $C_1$ and for any clone $C_2$ containing the clone of self-dual monotone functions.

2021-02-03math.COmath.RA

Set-reconstructibility of Post classes

The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaing clones are not weakly reconstructible.

2013-10-29math.COmath.RA