The eight-tetrahedra longest-edge partition and Kuhn triangulations
Computers & Mathematics with Applications
Geometric integration over irregular domains with application to level-set methods
Journal of Computational Physics
On discrete maximum principles for nonlinear elliptic problems
Mathematics and Computers in Simulation
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Diamond hierarchies of arbitrary dimension
SGP '09 Proceedings of the Symposium on Geometry Processing
IEEE Transactions on Circuits and Systems II: Express Briefs
Covering and packing with spheres by diagonal distortion in Rn
Rainbow of computer science
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
The strengthened cauchy-Bunyakowski-Schwarz inequality for n-simplicial linear finite elements
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
A HOL theory of euclidean space
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Parametric macromodeling based on amplitude and frequency scaled systems with guaranteed passivity
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
The HOL Light Theory of Euclidean Space
Journal of Automated Reasoning
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Hi-index | 0.02 |
For many years it has been known that a combinatorial result, called the Sperner Lemma, provides an elegant proof of the Brouwer Fixed Point Theorem. Although the proof is elementary, its complete formal exposition depends upon the somewhat complicated operation of subdividing a simplex. Also, the proof does not show whether the Sperner Lemma can be derived from the Brouwer Fixed Point Theorem. This central result of this paper is a combinatorial proposition, analogous to the Sperner Lemma, and applying to the n-cube, for which subdivision is a trivial operation. This Cubical Sperner Lemma follows immediately from the Brouwer Fixed Point Theorem and thus opens the possibility of other applications of topology to combinatorial problems. The question of such a topological proof is raised for another cubical analogue of the Sperner Lemma, due to Ky Fan, and for the Tucker Lemma, which is related to the antipodal point theorems. The Cubical Sperner Lemma of this paper implies the Tucker Lemma in 2-dimensions; this suggests that other connections joining these combinatorial results remain to be discovered.