General interpolation by polynomial functions of distributive lattices

Publication Type:
Conference Proceeding
Advances in Computational Intelligence 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2012, 299 CCIS (PART 3), pp. 347 - 355
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007837OK.pdf Published version330.43 kB
Adobe PDF
For a distributive lattice L, we consider the problem of interpolating functions f: D→L defined on a finite set DL n , by means of lattice polynomial functions of L. Two instances of this problem have already been solved. In the case when L is a distributive lattice with least and greatest elements 0 and 1, Goodstein proved that a function f: {0,1} n →L can be interpolated by a lattice polynomial function p: L n →L if and only if f is monotone; in this case, the interpolating polynomial p was shown to be unique. The interpolation problem was also considered in the more general setting where L is a distributive lattice, not necessarily bounded, and where DL n is allowed to range over cuboids with a i ,b i L and a i < b i . In this case, the class of such partial functions that can be interpolated by lattice polynomial functions was completely described. In this paper, we extend these results by completely characterizing the class of lattice functions that can be interpolated by polynomial functions on arbitrary finite subsets DL n . As in the latter setting, interpolating polynomials are not necessarily unique. We provide explicit descriptions of all possible lattice polynomial functions that interpolate these lattice functions, when such an interpolation is available. © 2012 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: