中文
相关论文

相关论文: The lattice of monomial clones on finite fields

200 篇论文

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…

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

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 investigate finitary functions from $\mathbb{Z}_{n}$ to $\mathbb{Z}_{n}$ for a squarefree number $n$. We show that the lattice of all clones on the squarefree set $\mathbb{Z}_{p_1\cdots p_m}$ which contain the addition of…

环与代数 · 数学 2023-10-04 Stefano Fioravanti

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

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

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

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 study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…

环与代数 · 数学 2020-01-15 Endre Tóth , Tamás Waldhauser

We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids…

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

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

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

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…

范畴论 · 数学 2025-01-28 Antonio Bucciarelli , Pierre-Louis Curien , Antonino Salibra

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

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

We prove that a commutative parasemifield S is additively idempotent provided that it is finitely generated as a semiring. Consequently, every proper commutative semifield T that is finitely generated as a semiring is either additively…

交换代数 · 数学 2019-10-08 Vítězslav Kala , Miroslav Korbelář

This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…

组合数学 · 数学 2019-01-04 Peng He , Xue-ping Wang

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

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
‹ 上一页 1 2 3 10 下一页 ›