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

09 February 2018, 14h30
Salle/Bat : 455/PCRI-N
Contact :

Activités de recherche : Combinatoire

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
Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 09 February 2018 - 14h30
Salle : 455 - PCRI-N
Matthieu Rosenfeld .............................................

Computing the growth rate of the number of pattern
Combinatoire
Friday 22 December 2017 - 14h30
Salle : 455 - PCRI-N
Benjamin Hellouin .............................................

Portable vectorization and parallelization of C++
Calcul à haute performance
Tuesday 19 December 2017 - 10h30
Salle : 465 - PCRI-N
Laurent Plagne .............................................

Approximate Bayesian Computation and Random Forest
Thursday 14 December 2017 - 14h30
Salle : 465 - PCRI-N
Valentin Thouzeau .............................................

Cycles dans les produits cartésiens de graphes
Théorie des graphes
Friday 01 December 2017 - 14h30
Salle : 455 - PCRI-N
Evelyne Flandrin .............................................