Using Brouwer’s Fixed Point Theorem
From MaRDI portal
Publication:4604376
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.
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
Cites work
- scientific article; zbMATH DE number 5986254 (Why is no real title available?)
- scientific article; zbMATH DE number 412172 (Why is no real title available?)
- scientific article; zbMATH DE number 425858 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3896984 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3724683 (Why is no real title available?)
- scientific article; zbMATH DE number 3741420 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 48450 (Why is no real title available?)
- scientific article; zbMATH DE number 3460321 (Why is no real title available?)
- scientific article; zbMATH DE number 3557238 (Why is no real title available?)
- scientific article; zbMATH DE number 3581219 (Why is no real title available?)
- scientific article; zbMATH DE number 3617539 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 3343377 (Why is no real title available?)
- scientific article; zbMATH DE number 3390006 (Why is no real title available?)
- scientific article; zbMATH DE number 3090557 (Why is no real title available?)
- A Nobel prize for John Nash
- A counterexample to the generalized Aanderaa-Rosenberg conjecture
- A course in topological combinatorics
- A fixed-point farrago
- A topological approach to evasiveness
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Block partitions of sequences
- Borsuk-Ulam Implies Brouwer: A Direct Construction
- Covering a hypergraph of subgraphs
- Covering and coloring problems for relatives of intervals
- Efficient Planarity Testing
- Equipartition of mass distributions by hyperplanes
- Evasiveness of graph properties and topological fixed-point theorems
- Examples of \(\mathbb{Z}\)-acyclic and contractible vertex-homogeneous simplicial complexes
- Fixed points in partially ordered sets
- Fixed-point sets of group actions on finite acyclic complexes
- Further results on the Aanderaa-Rosenberg conjecture
- Generalized Kneser coloring theorems with combinatorial proofs
- Homotopy properties of the poset of nontrivial p-subgroups of a group
- Intersection properties of families of convex \((n,d)\)-bodies
- KKM -- a topological approach for trees
- Lower bounds on the transversal numbers of \(d\)-intervals
- Matroids and Sperner's lemma
- Maximum degree and fractional matchings in uniform hypergraphs
- Monotone Bipartite Graph Properties are Evasive
- On Periodic Maps and the Euler Characteristics of Associated Spaces
- On recognizing graph properties from adjacency matrices
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
- Packings of graphs and applications to computational complexity
- Piercing \(d\)-intervals
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Proofs from THE BOOK
- Regression depth and center points.
- Regularity and Positional Games
- Remarks on matroids and Sperner's lemma
- Shelling polyhedral 3-balls and 4-polytopes
- Solution of a covering problem related to labelled tournaments
- Spherical Designs via Brouwer Fixed Point Theorem
- The Game of Hex and the Brouwer Fixed-Point Theorem
- The Jordan-Schonflies Theorem and the Classification of Surface
- Transformations of finite period
- Transversals of 2-intervals, a topological approach
- Transversals of \(d\)-intervals
- Zwei kombinatorisch-geometrische Sätze vom Typus Sperner-Tucker-Ky Fan
Cited in
(5)- Fixed point and non-retract theorems -- classical circular tours
- Colorful versions of the Lebesgue, KKM, and Hex theorem
- Multilabeled and topological versions of the Hex theorem
- The complexity of Hex and the Jordan curve theorem
- The Brouwer fixed point theorem and periodic solutions of differential equations
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)
