Let L be a bounded distributive lattice. We give several characterizations of those Ln → L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and meets. Moreover, we discuss the disjunctive normal form representations of these polynomial functions.
In this paper we are interested in functionals defined on completely distributive lattices and which...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
International audienceIn this document, we consider a median-based calculus for efficiently represen...
peer reviewedLet $L$ be a bounded distributive lattice. We give several characterizations of those $...
We are interested in representations and characteriza- tions of lattice polynomial functions f : Ln...
We are interested in representations and characterizations of lattice polynomial functions f : Ln → ...
We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, a...
The associativity property, usually defined for binary functions, can be generalized to functions of...
For a distributive lattice L, we consider the problem of interpolating functions f: D→L defined on a...
International audienceFor a distributive lattice $L$, we consider the problem of interpolating funct...
Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B i...
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : X n → X...
peer reviewedWe define the concept of weighted lattice polynomial functions as lattice polynomial fu...
AbstractWe define the concept of weighted lattice polynomial functions as lattice polynomial functio...
Référence ArXiV indiquée ci-dessous sous le titre : "A generalization of Goodstein's theorem: interp...
In this paper we are interested in functionals defined on completely distributive lattices and which...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
International audienceIn this document, we consider a median-based calculus for efficiently represen...
peer reviewedLet $L$ be a bounded distributive lattice. We give several characterizations of those $...
We are interested in representations and characteriza- tions of lattice polynomial functions f : Ln...
We are interested in representations and characterizations of lattice polynomial functions f : Ln → ...
We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, a...
The associativity property, usually defined for binary functions, can be generalized to functions of...
For a distributive lattice L, we consider the problem of interpolating functions f: D→L defined on a...
International audienceFor a distributive lattice $L$, we consider the problem of interpolating funct...
Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B i...
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : X n → X...
peer reviewedWe define the concept of weighted lattice polynomial functions as lattice polynomial fu...
AbstractWe define the concept of weighted lattice polynomial functions as lattice polynomial functio...
Référence ArXiV indiquée ci-dessous sous le titre : "A generalization of Goodstein's theorem: interp...
In this paper we are interested in functionals defined on completely distributive lattices and which...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
International audienceIn this document, we consider a median-based calculus for efficiently represen...