General interpolation by polynomial functions of distributive lattices

Publication Type:
Conference Proceeding
Citation:
Communications in Computer and Information Science, 2012, 299 CCIS (PART 3), pp. 347 - 355
Issue Date:
2012-11-05
Metrics:
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 DLn, 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: Ln→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 DLnis allowed to range over cuboids with ai,biL and ai
Please use this identifier to cite or link to this item: