Highly nonrepetitive sequences: winning strategies from the local lemma

Details Highly nonrepetitive sequences: winning strategies from the local lemma Highly nonrepetitive sequences: winning strategies from the local lemma

2010-10-27

arxiv.org/abs/1010.5772v1

Mathematics

Combinatorics

Scientific paper

We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Lov\'asz Local Lemma which can dramatically reduce the number of edges needed in a dependency graph when there is an ordering underlying the significant dependencies of events. This appears to represent the first successful application of a Local Lemma to games.

Affiliated with

Also associated with

No associations

Rating

Highly nonrepetitive sequences: winning strategies from the local lemma 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 Highly nonrepetitive sequences: winning strategies from the local lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly nonrepetitive sequences: winning strategies from the local lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486169