The main result of this paper is the algorithmic proof of n-dimensional Steinhaus’ chessboard theorem (as formulated in [12]). Our theorem implies Poincar´e Theorem [8] [7] which is equivalent to the Brouwer Fixed-Point Theorem
Research Article
The game of Hex, n-dimensional chessboard and Fixed Point Theorem
https://doi.org/10.21203/rs.3.rs-2374989/v1
This work is licensed under a CC BY 4.0 License
posted
You are reading this latest preprint version
The main result of this paper is the algorithmic proof of n-dimensional Steinhaus’ chessboard theorem (as formulated in [12]). Our theorem implies Poincar´e Theorem [8] [7] which is equivalent to the Brouwer Fixed-Point Theorem
No competing interests reported.
posted
You are reading this latest preprint version