Ramsey theory for infinite words
 
 
Description:  We will discuss several ramsey-type results in combinatorics on words. In one of the results, it is proved that the existence of powers or anti-powers is an unavoidable regularity for sufficiently long words. An abelian version, where we count the frequency of each letter, is conjectured to be true and reveals a surprising connection with the factor complexity function of infinite word.
Date:  2022-07-06
Start Time:   14:00
Speaker:  Manuel Silva (Univ. Nova de Lisboa)
Institution:  Universidade Nova de Lisboa
Place:  Room 2.5 (DM)
Research Groups: -Algebra and Combinatorics
See more:   <Main>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Powered by: rdOnWeb v1.4 | technical support