Sperner and KKM-type theorems on trees and cycles

Details Sperner and KKM-type theorems on trees and cycles Sperner and KKM-type theorems on trees and cycles

2009-09-02

arxiv.org/abs/0909.0339v1

Mathematics

Combinatorics

18 pages, 4 figures. See also related work at http://www.math.hmc.edu/~su/papers.html

Scientific paper

In this paper we prove a new combinatorial theorem for labellings of trees, and show that it is equivalent to a KKM-type theorem for finite covers of trees and to discrete and continuous fixed point theorems on finite trees. This is in analogy with the equivalence of the classical Sperner's lemma, KKM lemma, and the Brouwer fixed point theorem on simplices. Furthermore, we use these ideas to develop new KKM and fixed point theorems for infinite covers and infinite trees. Finally, we extend the KKM theorem on trees to an entirely new KKM theorem for cycles, and discuss interesting social consequences, including an application in voting theory.

Affiliated with

Also associated with

No associations

Rating

Sperner and KKM-type theorems on trees and cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sperner and KKM-type theorems on trees and cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sperner and KKM-type theorems on trees and cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-12061