We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that every vertex is an element of the integer lattice and each simplex of the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies some property that replaces continuity. Under this property and some boundary condition the function has a zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The standard technique of applying a fixed point theorem to a piecewise linear approximation cannot be applied, because the `continuity property' is too weak to assure that a zero point of the piecewise linear approximation induces a zero point of the function itself. We apply the main existence result to prove the existence of a pure Cournot-Nash equilibrium in a Cournot oligopoly model. We further obtain a discrete analogue of the well-known Borsuk-Ulam theorem and a theorem for the existence of a solution for the discrete nonlinear complementarity problem. Classification-JEL: C61, C62, C68, C72, C58 Keywords: Discrete system of equations, triangulation, simplicial algorithm, fixed point, zero point File-Url: http://papers.tinbergen.nl/09062.pdf File-Format: application/pdf File-Size: 270718 bytes Handle: RePEc:tin:wpaper:20090062