Interpolation by polynomial functions of distributive lattices : a generalization of a theorem of R. L. Goodstein
Abstract
We consider the problem of interpolating functions partially defined over a distributive lattice by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive lattice L with least and greatest elements 0 and 1, respectively: given a function f : {0, 1} n → L , there exists a lattice polynomial function p:Ln→L such that p| {0,1} n = f if and only if f is monotone; in this case, the interpolating polynomial p is unique. We extend Goodstein’s theorem to a wider class of partial functions f:D→L over a distributive lattice L, not necessarily bounded, and where D⊆Ln is allowed to range over n-dimensional rectangular boxes D={a1,b1}×...×{an,bn} with ai,bi∈L and ai
Domains
Mathematics [math]Origin | Files produced by the author(s) |
---|
Loading...
Miguel Couceiro : Connect in order to contact the contributor
https://hal.science/hal-01090572
Submitted on : Saturday, February 18, 2017-3:09:02 PM
Last modification on : Friday, April 19, 2024-4:18:54 PM
Long-term archiving on: Friday, May 19, 2017-2:51:14 PM
Cite
Miguel Couceiro, Tamas Waldhauser. Interpolation by polynomial functions of distributive lattices : a generalization of a theorem of R. L. Goodstein. Algebra Universalis, 2013, 69 (3), pp.13. ⟨10.1007/s00012-013-0231-6⟩. ⟨hal-01090572⟩
Collections
321
View
107
Download