Showing 1 - 10 of 22
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10011373836
Persistent link: https://www.econbiz.de/10011337990
In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Zn to the n-dimensional Euclidean space Rn. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a...
Persistent link: https://www.econbiz.de/10011346458
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...
Persistent link: https://www.econbiz.de/10011378347
We consider a slightly adapted version of the general equilibrium model with possibly nonconvex production technologies presented by Villar (1994). Typical for such models is that the behaviour of a producer is modelled by a pricing rule that relates market prices and production vectors - a...
Persistent link: https://www.econbiz.de/10005451387
We consider a slightly adapted version of the general equilibrium model with possibly nonconvex production technologies presented by Villar (1994). Typical for such models is that the behaviour of a producer is modelled by a pricing rule that relates market prices and production vectors - a...
Persistent link: https://www.econbiz.de/10010783271
AbstractSee document.
Persistent link: https://www.econbiz.de/10010325312
In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Zn to the n-dimensional Euclidean space Rn. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a...
Persistent link: https://www.econbiz.de/10010325314
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10010325373
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...
Persistent link: https://www.econbiz.de/10010325776