Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 26, 2015, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Raúl Penaguião

Non-repetitive sequences and games in paths and graphs

A non-repetitive sequence is a sequence of symbols in which no two consecutive blocks of the same size are equal. 123132123 is nonrepetitive. With two symbols it's impossible to write an infinite non-repetitive sequence, but a remarkable result due to Thue asserts that such is possible using only three distinct symbols. This paper introduces a more general problem, where one is only allowed to use a symbol from a previously given list L_i on the position i. It's always possible to construct in such settings a non-repetitive infinite sequence when the given lists are of size four, and it's still a conjecture weather for lists of size three still holds. This is proven using a randomized algorithm. In this context, a games is introduced. The erase-repetition game is a game played by two people where a sequence is constructed alternately according to the symbols in the lists L_i, and player A tries to build an arbitrary long nonrepetitive sequence, whereas player B tries to keep the sequence on a small size. We are able to prove that the player A has a strategy, provided that the lists are big enough.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login