Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) Graphs, ALgorithms and Combinatorics
Binary pattern of length greater than 14 are abelian-2-avoidable
Matthieu Rosenfeld

25 May 2018, 14:30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Combinatorics

Résumé :
Two words u and v are abelian equivalent if they are permutation of each other ("aabc" and "baca" are abelian equivalent). Let w be a word and P= P1...Pn (where the Pi are the letters of P) a pattern (a word over another alphabet), we say that w contains an abelian occurrence of P if there exist non-empty words w1,...,wn such that w1...wn is a factor of w and for all i and j, Pi =Pj implies that wi and wj are abelian equivalent. A pattern is avoidable if there is an infinite word that does not contain it.
In 1992 Keränen answered a question from Erdös and showed that there is an infinite word over 4 letters that avoids the pattern AA in the abelian sens. More recently it was showed that every binary pattern of length greater than 118 is avoided in the abelian sens by a binary word. Here we improve the 118 to 14 with a computer assisted proof.

Pour en savoir plus :
Séminaires
Resilient PDE solving approaches for exascale comp
High-performance computing
Tuesday 29 May 2018 - 10:30
Salle : 465 - PCRI-N
Paul Mycek .............................................

Binary pattern of length greater than 14 are abeli
Combinatorics
Friday 25 May 2018 - 14:30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

TBA
Distributed algorithms
Wednesday 02 May 2018 - 10:30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Mariage stable auto-stabilisant et distribué
Graph Theory
Friday 13 April 2018 - 14:30
Salle : 445 - PCRI-N
Marie Laveau .............................................

Modélisation et implémentation du produit de matri
High-performance computing
Wednesday 11 April 2018 - 10:30
Salle : 465 - PCRI-N
Thomas Lambert .............................................