CombinatoricsOnWords Seminar
CombinatoricsOnWords Seminar
  • 107
  • 9 527
Jamie Simpson, Palindromic Periodicities
Talk at One World Seminar on Combinatorics on words, July 9 2024.
Seminar pages:
www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/
researchseminars.org/seminar/CombinatoricsOnWords
zhlédnutí: 43

Video

Julien Cassaigne, The Heinis spectrum1:03:39Julien Cassaigne, The Heinis spectrum
Julien Cassaigne, The Heinis spectrum
zhlédnutí 41Před 2 měsíci
Talk at One World Seminar on Combinatorics on words, June 25 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Markus Whiteland, What I know about Parikh-collinear morphisms59:20Markus Whiteland, What I know about Parikh-collinear morphisms
Markus Whiteland, What I know about Parikh-collinear morphisms
zhlédnutí 55Před 2 měsíci
Talk at One World Seminar on Combinatorics on words, June 11 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Pascal Ochem, Characterization of morphic words58:27Pascal Ochem, Characterization of morphic words
Pascal Ochem, Characterization of morphic words
zhlédnutí 95Před 3 měsíci
Talk at One World Seminar on Combinatorics on words, May 28 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Josef Rukavicka, Restivo Salemi property for α-power free languages with α≥5 and k≥3 letters53:19Josef Rukavicka, Restivo Salemi property for α-power free languages with α≥5 and k≥3 letters
Josef Rukavicka, Restivo Salemi property for α-power free languages with α≥5 and k≥3 letters
zhlédnutí 46Před 3 měsíci
Talk at One World Seminar on Combinatorics on words, May 14 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Michael Baake, Hats, CAPs and Spectres50:29Michael Baake, Hats, CAPs and Spectres
Michael Baake, Hats, CAPs and Spectres
zhlédnutí 70Před 4 měsíci
Talk at One World Seminar on Combinatorics on words, April 30 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Radosław Piórkowski, Universal quantification in automatic structures-an ExpSpace-hard nut to crack49:25Radosław Piórkowski, Universal quantification in automatic structures-an ExpSpace-hard nut to crack
Radosław Piórkowski, Universal quantification in automatic structures-an ExpSpace-hard nut to crack
zhlédnutí 60Před 4 měsíci
Talk at One World Seminar on Combinatorics on words, April 16 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
John Campbell, On the evaluation of infinite products involving automatic sequences52:09John Campbell, On the evaluation of infinite products involving automatic sequences
John Campbell, On the evaluation of infinite products involving automatic sequences
zhlédnutí 99Před 5 měsíci
Talk at One World Seminar on Combinatorics on words, April 02 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Cor Kraaikamp, An introduction to N-expansions with a finite set of digits50:47Cor Kraaikamp, An introduction to N-expansions with a finite set of digits
Cor Kraaikamp, An introduction to N-expansions with a finite set of digits
zhlédnutí 41Před 5 měsíci
Talk at One World Seminar on Combinatorics on words, March 19 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Finn Lidbetter, Improved bound for the Gerver-Ramsey collinearity problem54:52Finn Lidbetter, Improved bound for the Gerver-Ramsey collinearity problem
Finn Lidbetter, Improved bound for the Gerver-Ramsey collinearity problem
zhlédnutí 52Před 6 měsíci
Talk at One World Seminar on Combinatorics on words, March 05 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Christopher Cabezas, Large normalizer of odometers and higher-dimensional automatic sequences46:24Christopher Cabezas, Large normalizer of odometers and higher-dimensional automatic sequences
Christopher Cabezas, Large normalizer of odometers and higher-dimensional automatic sequences
zhlédnutí 26Před 6 měsíci
Talk at One World Seminar on Combinatorics on words, February 20 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Eric Rowland, Algebraic power series and their automatic complexity52:33Eric Rowland, Algebraic power series and their automatic complexity
Eric Rowland, Algebraic power series and their automatic complexity
zhlédnutí 122Před 7 měsíci
Talk at One World Seminar on Combinatorics on words, February 06 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Jakub Konieczny, Arithmetical subword complexity of automatic sequences56:17Jakub Konieczny, Arithmetical subword complexity of automatic sequences
Jakub Konieczny, Arithmetical subword complexity of automatic sequences
zhlédnutí 48Před 7 měsíci
Talk at One World Seminar on Combinatorics on words, January 23 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Clemens Müllner, Synchronizing automatic sequences along Piatetski-Shapiro sequences54:45Clemens Müllner, Synchronizing automatic sequences along Piatetski-Shapiro sequences
Clemens Müllner, Synchronizing automatic sequences along Piatetski-Shapiro sequences
zhlédnutí 82Před 7 měsíci
Talk at One World Seminar on Combinatorics on words, January 9 2024. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
P Béaur, All I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language49:34P Béaur, All I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language
P Béaur, All I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language
zhlédnutí 48Před 8 měsíci
Talk at One World Seminar on Combinatorics on words, December 19 2023. Seminar pages: www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ researchseminars.org/seminar/CombinatoricsOnWords
Matthieu Rosenfeld, Word reconstruction using queries on subwords or factors54:17Matthieu Rosenfeld, Word reconstruction using queries on subwords or factors
Matthieu Rosenfeld, Word reconstruction using queries on subwords or factors
zhlédnutí 46Před 9 měsíci
Matthieu Rosenfeld, Word reconstruction using queries on subwords or factors
Seda Albayrak, Quantitative estimates for the size of an intersection of sparse automatic sets46:57Seda Albayrak, Quantitative estimates for the size of an intersection of sparse automatic sets
Seda Albayrak, Quantitative estimates for the size of an intersection of sparse automatic sets
zhlédnutí 43Před 9 měsíci
Seda Albayrak, Quantitative estimates for the size of an intersection of sparse automatic sets
Svetlana Puzynina, Well distributed occurrences property in infinite words47:07Svetlana Puzynina, Well distributed occurrences property in infinite words
Svetlana Puzynina, Well distributed occurrences property in infinite words
zhlédnutí 34Před 9 měsíci
Svetlana Puzynina, Well distributed occurrences property in infinite words
Herman Goulet-Ouellet, Density of rational languages under invariant measures1:06:00Herman Goulet-Ouellet, Density of rational languages under invariant measures
Herman Goulet-Ouellet, Density of rational languages under invariant measures
zhlédnutí 47Před 10 měsíci
Herman Goulet-Ouellet, Density of rational languages under invariant measures
Ľubomíra Dvořáková, String attractors and pseudopalindromic closures1:02:18Ľubomíra Dvořáková, String attractors and pseudopalindromic closures
Ľubomíra Dvořáková, String attractors and pseudopalindromic closures
zhlédnutí 68Před 10 měsíci
Ľubomíra Dvořáková, String attractors and pseudopalindromic closures
James Currie, The analogs of overlap-freeness for the period-doubling and the Fibonacci morphisms45:27James Currie, The analogs of overlap-freeness for the period-doubling and the Fibonacci morphisms
James Currie, The analogs of overlap-freeness for the period-doubling and the Fibonacci morphisms
zhlédnutí 41Před 11 měsíci
James Currie, The analogs of overlap-freeness for the period-doubling and the Fibonacci morphisms
Bastián Espinoza, An S-adic characterization of linear-growth complexity subshifts49:14Bastián Espinoza, An S-adic characterization of linear-growth complexity subshifts
Bastián Espinoza, An S-adic characterization of linear-growth complexity subshifts
zhlédnutí 54Před 11 měsíci
Bastián Espinoza, An S-adic characterization of linear-growth complexity subshifts
Craig Kaplan, An aperiodic monotile1:19:40Craig Kaplan, An aperiodic monotile
Craig Kaplan, An aperiodic monotile
zhlédnutí 1,6KPřed rokem
Craig Kaplan, An aperiodic monotile
Mélodie Lapointe, Perfectly clustering words: Induction and morphisms53:57Mélodie Lapointe, Perfectly clustering words: Induction and morphisms
Mélodie Lapointe, Perfectly clustering words: Induction and morphisms
zhlédnutí 73Před rokem
Mélodie Lapointe, Perfectly clustering words: Induction and morphisms
Jeffrey Shallit, New Results in Additive Number Theory via Combinatorics on Words55:09Jeffrey Shallit, New Results in Additive Number Theory via Combinatorics on Words
Jeffrey Shallit, New Results in Additive Number Theory via Combinatorics on Words
zhlédnutí 380Před rokem
Jeffrey Shallit, New Results in Additive Number Theory via Combinatorics on Words
Štěpán Starosta, On a faithful representation of Sturmian morphisms56:37Štěpán Starosta, On a faithful representation of Sturmian morphisms
Štěpán Starosta, On a faithful representation of Sturmian morphisms
zhlédnutí 71Před rokem
Štěpán Starosta, On a faithful representation of Sturmian morphisms
Léo Poirier and Wolfgang Steiner, Factor-balanced S -adic languages42:04Léo Poirier and Wolfgang Steiner, Factor-balanced S -adic languages
Léo Poirier and Wolfgang Steiner, Factor-balanced S -adic languages
zhlédnutí 118Před rokem
Léo Poirier and Wolfgang Steiner, Factor-balanced S -adic languages
Aline Parreau and Eric Duchêne, Taking and merging games as rewrite games58:35Aline Parreau and Eric Duchêne, Taking and merging games as rewrite games
Aline Parreau and Eric Duchêne, Taking and merging games as rewrite games
zhlédnutí 43Před rokem
Aline Parreau and Eric Duchêne, Taking and merging games as rewrite games
Matthew Konefal, Examining the Class of Formal Languages which are Expressible via Word Equations55:34Matthew Konefal, Examining the Class of Formal Languages which are Expressible via Word Equations
Matthew Konefal, Examining the Class of Formal Languages which are Expressible via Word Equations
zhlédnutí 95Před rokem
Matthew Konefal, Examining the Class of Formal Languages which are Expressible via Word Equations
Lubomíra Dvořáková, Repetitive threshold and asymptotic repetitive threshold of balanced sequences59:31Lubomíra Dvořáková, Repetitive threshold and asymptotic repetitive threshold of balanced sequences
Lubomíra Dvořáková, Repetitive threshold and asymptotic repetitive threshold of balanced sequences
zhlédnutí 71Před rokem
Lubomíra Dvořáková, Repetitive threshold and asymptotic repetitive threshold of balanced sequences

Komentáře

  • @irahartleib2722
    @irahartleib2722 Před 6 měsíci

    P R O M O S M 🌸

  • @aprilchase871
    @aprilchase871 Před 7 měsíci

    *PromoSM* 😊

  • @C-Llama
    @C-Llama Před rokem

    Watching this while I procrastinate for the final of her linear algebra class