On lattices with a smallest set of aggregation functions

Abstract

Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set ${\mathsf{Pol}}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The main aim of this paper is to characterize all finite lattices $L$ for which these two classes coincide, i.e. when the set $\mathsf{C}(L)$ is as small as possible. These lattices are shown to be completely determined by their tolerances, also several sufficient purely lattice-theoretical conditions are presented. In particular, all simple relatively complemented lattices or simple lattices for which the join (meet) of atoms (coatoms) is $1$ ($0$) are of this kind.

arXiv comment18 pages

Cited by in corpus (5)

• Congruences and the discrete Sugeno integrals on bounded distributive lattices
• On generating of idempotent aggregation functions on finite lattices
• Generators of aggregation functions and fuzzy connectives
• Description of sup- and inf-preserving aggregation functions via families of clusters in data tables
• Generalized comonotonicity and new axiomatizations of Sugeno integrals on bounded distributive lattices