中文
相关论文

相关论文: Clones from Creatures

200 篇论文

In this article, we prove infinitary version of one to one correspondence theorem between clones and relational clones on a fixed possibly infinite set. We also characterize the relational clone corresponding to the clone of all finitary…

逻辑 · 数学 2013-10-08 Shohei Izawa

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

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

环与代数 · 数学 2016-11-22 Erkko Lehtonen , Agnes Szendrei

Let A be a finite set with at least two elements. The composition of two classes I and J of operations on A, is defined as the set of all compositions of functions in I with functions in J. This binary operation gives a monoid structure to…

组合数学 · 数学 2011-05-18 Miguel Couceiro

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…

环与代数 · 数学 2011-12-06 Martin Goldstern , Michael Pinsker , Saharon Shelah

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

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

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

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…

环与代数 · 数学 2016-11-22 Erkko Lehtonen , Ágnes Szendrei

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 Boolean functions. Namely, when $C_1$ is a subclone (a proper subclone, resp.)…

组合数学 · 数学 2025-04-14 Erkko Lehtonen

The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.

环与代数 · 数学 2016-05-17 Erkko Lehtonen

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

For each clone C on a set A there is an associated equivalence relation, called C-equivalence, on the set of all operations on A, which relates two operations iff each one is a substitution instance of the other using operations from C. In…

环与代数 · 数学 2016-11-22 Erkko Lehtonen , Agnes Szendrei

In 1986, the second author classified the minimal clones on a finite universe into five types. We extend this classification to infinite universes and to multiclones. We show that every non-trivial clone contains a "small" clone of one of…

逻辑 · 数学 2007-05-23 Maurice Pouzet , Ivo G. Rosenberg

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

We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…

环与代数 · 数学 2008-01-17 Michael Pinsker

We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…

环与代数 · 数学 2011-05-31 Erhard Aichinger , Peter Mayr , Ralph McKenzie

We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…

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

We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We…

计算复杂性 · 计算机科学 2023-04-25 Miriam Backens , Leslie Ann Goldberg