We characterize idempotent uninorms on a complete chain in terms of decreasing unary
functions with a symmetry-related property. As a particular case, we retrieve and simplify a …

Binary operations have many applications in fuzzy set theory. One of them is uninorms. In
this paper, we study some properties of idempotent uninorms on bounded lattices. It is …

We give several characterizations of discrete Sugeno integrals over bounded distributive
lattices, as particular cases of lattice polynomial functions, that is, functions which can be …

In this paper we provide an axiomatic characterization of the idempotent discrete uninorms
by means of three conditions only: conservativeness, symmetry, and nondecreasing …

Abstract In [25], a discrete homotopy theory for reflexive digraphs was developed. In the
present paper, we prove that if a finite, connected reflexive digraph X has non-trivial …

Świerczkowski's lemma–as it is usually formulated–asserts that if f: An→ A is an operation
on a finite set A, n≥ 4, and every operation obtained from f by identifying a pair of variables …

We are interested in representations and characterizations of lattice polynomial functions f:
L^ n-> L, where L is a given bounded distributive lattice. In companion papers [arxiv …

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 …

Corominas (1990) introduced the following notion for posets: P is projective if every map F:
P× P→ P which is order-preserving and idempotent is one of the two projections. Since then …

We observe that if R:=(I, ρ, J) is an incidence structure, viewed as a matrix, then the
topological closure of the set of columns is the Stone space of the Boolean algebra …