Tucker's Lemma

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, Tucker's lemma is a combinatorial analog of the Borsuk-Ulam theorem. ombinatorics is a branch of pure mathematics concerning the study of the enumeration of discrete, finite sets. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied subjects in computer science and statistical physics. Aspects of combinatorics include "counting" the objects satisfying certain criteria, deciding when the criteria can be met, and constructing and analyzing objects meeting the criteria as in combinatorial designs and matroid theory, finding "largest", "smallest", or "optimal" objects, and finding algebraic structures these objects may have.