Using Brouwer’s Fixed Point Theorem

DOI10.1007/978-3-319-44479-6_10zbMATH Open1382.91021arXiv1409.7890OpenAlexW2589399482MaRDI QIDQ4604376FDOQ4604376

Authors: Günter M. Ziegler, Anders Bjoerner, Jiří Matoušek 

Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

Abstract: Brouwer's fixed point theorem from 1911 is a basic result in topology - with a wealth of combinatorial and geometric consequences. In these lecture notes we present some of them, related to the game of HEX and to the piercing of multiple intervals. We also sketch stronger theorems, due to Oliver and others, and explain their applications to the fascinating (and still not fully solved) evasiveness problem.

Full work available at URL: https://arxiv.org/abs/1409.7890

Recommendations

• scientific article; zbMATH DE number 3905446
• scientific article; zbMATH DE number 2186694
• Browder’s Theorem through Brouwer’s Fixed Point Theorem
• scientific article; zbMATH DE number 2233164
• scientific article; zbMATH DE number 7568846
• On the Brouwer fixed point theorem
• Brouwer fixed point theorem in the general case
• The Brouwer fixed point theorem revisited
• The Brouwer fixed point theorem for some set mappings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Combinatorial games (91A46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Nobel prize for John Nash
• Title not available (Why is that?)
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Title not available (Why is that?)
• The Jordan-Schonflies Theorem and the Classification of Surface
• Efficient Planarity Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Packings of graphs and applications to computational complexity
• Homotopy properties of the poset of nontrivial p-subgroups of a group
• Regularity and Positional Games
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
• Title not available (Why is that?)
• Intersection properties of families of convex \((n,d)\)-bodies
• Transversals of \(d\)-intervals
• Piercing \(d\)-intervals
• Transversals of 2-intervals, a topological approach
• Covering a hypergraph of subgraphs
• KKM -- a topological approach for trees
• Lower bounds on the transversal numbers of \(d\)-intervals
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• On recognizing graph properties from adjacency matrices
• Generalized Kneser coloring theorems with combinatorial proofs
• Equipartition of mass distributions by hyperplanes
• Fixed-point sets of group actions on finite acyclic complexes
• Spherical Designs via Brouwer Fixed Point Theorem
• Title not available (Why is that?)
• Covering and coloring problems for relatives of intervals
• Fixed points in partially ordered sets
• Maximum degree and fractional matchings in uniform hypergraphs
• Shelling polyhedral 3-balls and 4-polytopes
• Transformations of finite period
• A topological approach to evasiveness
• On Periodic Maps and the Euler Characteristics of Associated Spaces
• Block partitions of sequences
• A course in topological combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
• Examples of \(\mathbb{Z}\)-acyclic and contractible vertex-homogeneous simplicial complexes
• Regression depth and center points.
• Monotone Bipartite Graph Properties are Evasive
• Proofs from THE BOOK
• Title not available (Why is that?)
• Borsuk-Ulam Implies Brouwer: A Direct Construction
• Evasiveness of graph properties and topological fixed-point theorems
• Matroids and Sperner's lemma
• Further results on the Aanderaa-Rosenberg conjecture
• Title not available (Why is that?)
• Remarks on matroids and Sperner's lemma
• Solution of a covering problem related to labelled tournaments
• Title not available (Why is that?)
• A fixed-point farrago
• Title not available (Why is that?)
• A counterexample to the generalized Aanderaa-Rosenberg conjecture
• Zwei kombinatorisch-geometrische Sätze vom Typus Sperner-Tucker-Ky Fan

Cited In (5)

• The Brouwer fixed point theorem and periodic solutions of differential equations
• The complexity of Hex and the Jordan curve theorem
• Colorful versions of the Lebesgue, KKM, and Hex theorem
• Fixed point and non-retract theorems -- classical circular tours
• Multilabeled and topological versions of the Hex theorem

This page was built for publication: Using Brouwer’s Fixed Point Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604376)