A Combinatorial Analog of a Theorem of F.J.Dyson

Details A Combinatorial Analog of a Theorem of F.J.Dyson A Combinatorial Analog of a Theorem of F.J.Dyson

2006-08-08

arxiv.org/abs/math/0608204v3

Mathematics

Combinatorics

Original version: 7 pages, 2 figures. Revised version: 12 pages, 4 figures, revised proofs. Final revised version: 9 pages, 2

Scientific paper

Tucker's Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n=2 was proposed by Tucker in 1945. Numerous generalizations and applications of the Lemma have appeared since then. In 2006 Meunier proved the Lemma in its full generality in his Ph.D. thesis. There are generalizations and extensions of the Borsuk-Ulam theorem that do not yet have combinatorial analogs. In this note, we give a combinatorial analog of a result of Freeman J. Dyson and show that our result is equivalent to Dyson's theorem. As with Tucker's Lemma, we hope that this will lead to generalizations and applications and ultimately a combinatorial analog of Yang's theorem of which both Borsuk-Ulam and Dyson are special cases.

Affiliated with

Also associated with

No associations

Rating

A Combinatorial Analog of a Theorem of F.J.Dyson 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 A Combinatorial Analog of a Theorem of F.J.Dyson, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Analog of a Theorem of F.J.Dyson will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248065