Topics
distributive latticeArchitectural structure
peer reviewedLet $L$ be a bounded distributive lattice. We give several characterizations of those $L^n \to 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.F1R-MTH-PUL-12RDO2 > MRDO2 > 01/02/2012 - 31/01/2015 > MARICHAL Jean-Lu
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
In this paper we are interested in functionals defined on completely distributive lattices and which...
International audienceIn this document, we consider a median-based calculus for efficiently represen...
Let L be a bounded distributive lattice. We give several characterizations of those Ln → L mappings ...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
peer reviewedWe discuss several characterizations of discrete Sugeno integrals over bounded distribu...
The associativity property, usually defined for binary functions, can be generalized to functions of...
International audienceFor a distributive lattice $L$, we consider the problem of interpolating funct...
For a distributive lattice L, we consider the problem of interpolating functions f: D→L defined on a...
peer reviewedWe define the concept of weighted lattice polynomial functions as lattice polynomial fu...
Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B i...
AbstractWe define the concept of weighted lattice polynomial functions as lattice polynomial functio...
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : X n → X...
Référence ArXiV indiquée ci-dessous sous le titre : "A generalization of Goodstein's theorem: interp...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
In this paper we are interested in functionals defined on completely distributive lattices and which...
International audienceIn this document, we consider a median-based calculus for efficiently represen...
Let L be a bounded distributive lattice. We give several characterizations of those Ln → L mappings ...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
peer reviewedWe are interested in representations and characterizations of lattice polynomial functi...
peer reviewedWe discuss several characterizations of discrete Sugeno integrals over bounded distribu...
The associativity property, usually defined for binary functions, can be generalized to functions of...
International audienceFor a distributive lattice $L$, we consider the problem of interpolating funct...
For a distributive lattice L, we consider the problem of interpolating functions f: D→L defined on a...
peer reviewedWe define the concept of weighted lattice polynomial functions as lattice polynomial fu...
Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B i...
AbstractWe define the concept of weighted lattice polynomial functions as lattice polynomial functio...
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : X n → X...
Référence ArXiV indiquée ci-dessous sous le titre : "A generalization of Goodstein's theorem: interp...
International audienceWe describe which pairs of distributive lattice polynomial operationscommute
In this paper we are interested in functionals defined on completely distributive lattices and which...
International audienceIn this document, we consider a median-based calculus for efficiently represen...
Add to ORKG