Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Last revisionBoth sides next revision
shorttalksmarch2021 [2022/10/30 23:01] – old revision restored (2021/03/22 22:45) 139.124.146.3shorttalksmarch2021 [2022/10/30 23:01] – old revision restored (2021/03/16 20:31) 139.124.146.3
Line 3: Line 3:
 This second mini-event, organized by [[start|One World Combinatorics on Words Seminar]], is designed to take the place of a small and very informal conference in our field, since many of us miss direct communication of this kind. The page of the first Day of short talks is [[shorttalksfebruary2021|here]]. This second mini-event, organized by [[start|One World Combinatorics on Words Seminar]], is designed to take the place of a small and very informal conference in our field, since many of us miss direct communication of this kind. The page of the first Day of short talks is [[shorttalksfebruary2021|here]].
  
-The event consisted of short talks in 25-minute slots, including your new results, discussions, and open questions.+The event will consist of short talks in 25-minute slots, including your new results, discussions, and open questions. 
 + 
 +The abstracts (with eventual references to arxiv.org), slides and some videos of talks will be published at this page.
  
 The deadline for submissions was January 24, 2021. The deadline for submissions was January 24, 2021.
Line 10: Line 12:
  
 **15:00 Jane D. Palacio** //Coverable bi-infinite substitution shifts// **15:00 Jane D. Palacio** //Coverable bi-infinite substitution shifts//
- 
-{{seminar2021:20210322palacio.pdf|slides}} 
- 
-{{ seminar2021:20210322palacio.mp4 |Video of the talk}} 
  
 A finite or infinite word $w$ is said to be coverable if it can be formed by A finite or infinite word $w$ is said to be coverable if it can be formed by