Polynomial functions over bounded distributive lattices

Abstract

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> 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.

Cited by in corpus (8)

• Associative polynomial functions over bounded distributive lattices
• Axiomatizations of quasi-Lovász extensions of pseudo-Boolean functions
• Axiomatizations of Lovász extensions of pseudo-Boolean functions
• Discrete integrals based on comonotonic modularity
• Hypomorphic Sperner systems and nonreconstructible functions
• Pivotal decompositions of functions
• Axiomatizations and factorizations of Sugeno utility functions
• Pivotal decomposition schemes inducing clones of operations