The growth of number of discrete Lipschitzian functions under growing dimensions of the domain of their definition (Q5950865)

The author estimates the number of functions which satisfy the discrete version of the Lipschitz condition. Let \(F_n(l,r)\) be a set of functions mapping the Boolean cube of dimension \(n\) into the set \(\{0,\dots,l-1\}\) so that the values on any two neighborhood sets are different by at most \(r\). Let \(F_n^k(l,r)\) be the set of functions mapping the \(k\)-valued cube \((k>2)\) of dimensions \(n\) into the set \(\{0,\dots,l-1\}\) so that the values on any two sets, differing only in one coordinate by 1, are different by at most \(r\). It is shown that \[ \lim_{n\to\infty} \root 2^n\of{|F_n(l,r)|} = \lim_{n\to\infty} \root k^n\of{|F_n^k(l,r)|} = r+1 \] for \(l>r\).