Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2010), IEEE Computer Society, Los Alamitos, (2010), 113-116 http://dx.doi.org/10.1109/ISMVL.2010.29

Let $A$ and $B$ be arbitrary sets with at least two elements. The arity gap of a function $fcolon A^nto B$ is the minimum decrease in its essential arity when essential arguments of $f$ are identified. In this paper we study the arity gap of polynomial functions over bounded distributive lattices and present a complete classification of such functions in terms of their arity gap. To this extent, we present a characterization of the essential arguments of polynomial functions, which we then use to show that almost all lattice polynomial functions have arity gap 1, with the exception of truncated median functions, whose arity gap is 2.

CEMAT - Center for Computational and Stochastic Mathematics