For what $n$ is $W_n$ finite?












6












$begingroup$


Suppose, $W_n$ is the set of all words formed by letters '$a$' and '$b$', that do not contain $n$ same consecutive nonempty subwords (that means that for any nonempty word $u$, the word $u^n$ is not a subword of words from $W_n$) For example "$bababab$" is not in $W_3$, as it contains three consecutive "$ba$" subwords, but it obviously is in $W_4$.
For what $n$ is $W_n$ finite?



It is easy to see, that $W_n subset W_{n+1}$ and thus the sequence of cardinals ${|W_n|}_{n=1}^{infty}$ is monotonously non-decreasing.
Thus either $W_n$ is finite for all $n$, or it is infinite for all $n$, or there exists $n_0$, such that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$.



One can also see, that $W_2 = {a, b, ab, ba, aba, bab}$ is finite. One can prove that just by looking at all 16 words of length 4 and seeing that none of them lies in $W_2$.



However, $W_{665}$ is already infinite. Suppose $G$ is an infinite $2$-generated group of exponent $665$ (such group exists according to Adyan-Novikov theorem). Then any element of it can be expressed as a multiple product of those two generators (which can be written as a word formed by letters '$a$' and '$b$' (that denote the first and the second generator respectively). Due to the group having exponent $665$, any such word can be "reduced" to a word from $W_{665}$. One can see that two elements that can be written as the same word are equal. And in $G$ there is infinitely many pairwise not equal elements. Thus $W_{665}$ is infinite by pigeonhole principle.



So we can say that there exists such $n_0$, that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$. And that aforementioned $n_0$ satisfies the inequality $2 < n_0 leq 665$. However I failed to determine anything else about that number.



Any help will be appreciated.






combinatorics group-theory dynamical-systems formal-languages combinatorics-on-words







share|cite|improve this question











$endgroup$












  • $begingroup$
    The main subject of the question is symbolic dynamics.
    $endgroup$
    – YCor
    Dec 13 '18 at 22:59
















6












$begingroup$


Suppose, $W_n$ is the set of all words formed by letters '$a$' and '$b$', that do not contain $n$ same consecutive nonempty subwords (that means that for any nonempty word $u$, the word $u^n$ is not a subword of words from $W_n$) For example "$bababab$" is not in $W_3$, as it contains three consecutive "$ba$" subwords, but it obviously is in $W_4$.
For what $n$ is $W_n$ finite?



It is easy to see, that $W_n subset W_{n+1}$ and thus the sequence of cardinals ${|W_n|}_{n=1}^{infty}$ is monotonously non-decreasing.
Thus either $W_n$ is finite for all $n$, or it is infinite for all $n$, or there exists $n_0$, such that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$.



One can also see, that $W_2 = {a, b, ab, ba, aba, bab}$ is finite. One can prove that just by looking at all 16 words of length 4 and seeing that none of them lies in $W_2$.



However, $W_{665}$ is already infinite. Suppose $G$ is an infinite $2$-generated group of exponent $665$ (such group exists according to Adyan-Novikov theorem). Then any element of it can be expressed as a multiple product of those two generators (which can be written as a word formed by letters '$a$' and '$b$' (that denote the first and the second generator respectively). Due to the group having exponent $665$, any such word can be "reduced" to a word from $W_{665}$. One can see that two elements that can be written as the same word are equal. And in $G$ there is infinitely many pairwise not equal elements. Thus $W_{665}$ is infinite by pigeonhole principle.



So we can say that there exists such $n_0$, that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$. And that aforementioned $n_0$ satisfies the inequality $2 < n_0 leq 665$. However I failed to determine anything else about that number.



Any help will be appreciated.






combinatorics group-theory dynamical-systems formal-languages combinatorics-on-words







share|cite|improve this question











$endgroup$












  • $begingroup$
    The main subject of the question is symbolic dynamics.
    $endgroup$
    – YCor
    Dec 13 '18 at 22:59














6












6








6


0



$begingroup$


Suppose, $W_n$ is the set of all words formed by letters '$a$' and '$b$', that do not contain $n$ same consecutive nonempty subwords (that means that for any nonempty word $u$, the word $u^n$ is not a subword of words from $W_n$) For example "$bababab$" is not in $W_3$, as it contains three consecutive "$ba$" subwords, but it obviously is in $W_4$.
For what $n$ is $W_n$ finite?



It is easy to see, that $W_n subset W_{n+1}$ and thus the sequence of cardinals ${|W_n|}_{n=1}^{infty}$ is monotonously non-decreasing.
Thus either $W_n$ is finite for all $n$, or it is infinite for all $n$, or there exists $n_0$, such that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$.



One can also see, that $W_2 = {a, b, ab, ba, aba, bab}$ is finite. One can prove that just by looking at all 16 words of length 4 and seeing that none of them lies in $W_2$.



However, $W_{665}$ is already infinite. Suppose $G$ is an infinite $2$-generated group of exponent $665$ (such group exists according to Adyan-Novikov theorem). Then any element of it can be expressed as a multiple product of those two generators (which can be written as a word formed by letters '$a$' and '$b$' (that denote the first and the second generator respectively). Due to the group having exponent $665$, any such word can be "reduced" to a word from $W_{665}$. One can see that two elements that can be written as the same word are equal. And in $G$ there is infinitely many pairwise not equal elements. Thus $W_{665}$ is infinite by pigeonhole principle.



So we can say that there exists such $n_0$, that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$. And that aforementioned $n_0$ satisfies the inequality $2 < n_0 leq 665$. However I failed to determine anything else about that number.



Any help will be appreciated.






combinatorics group-theory dynamical-systems formal-languages combinatorics-on-words







share|cite|improve this question











$endgroup$




Suppose, $W_n$ is the set of all words formed by letters '$a$' and '$b$', that do not contain $n$ same consecutive nonempty subwords (that means that for any nonempty word $u$, the word $u^n$ is not a subword of words from $W_n$) For example "$bababab$" is not in $W_3$, as it contains three consecutive "$ba$" subwords, but it obviously is in $W_4$.
For what $n$ is $W_n$ finite?



It is easy to see, that $W_n subset W_{n+1}$ and thus the sequence of cardinals ${|W_n|}_{n=1}^{infty}$ is monotonously non-decreasing.
Thus either $W_n$ is finite for all $n$, or it is infinite for all $n$, or there exists $n_0$, such that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$.



One can also see, that $W_2 = {a, b, ab, ba, aba, bab}$ is finite. One can prove that just by looking at all 16 words of length 4 and seeing that none of them lies in $W_2$.



However, $W_{665}$ is already infinite. Suppose $G$ is an infinite $2$-generated group of exponent $665$ (such group exists according to Adyan-Novikov theorem). Then any element of it can be expressed as a multiple product of those two generators (which can be written as a word formed by letters '$a$' and '$b$' (that denote the first and the second generator respectively). Due to the group having exponent $665$, any such word can be "reduced" to a word from $W_{665}$. One can see that two elements that can be written as the same word are equal. And in $G$ there is infinitely many pairwise not equal elements. Thus $W_{665}$ is infinite by pigeonhole principle.



So we can say that there exists such $n_0$, that $W_n$ is finite for all $n < n_0$ and infinite for all $n geq n_0$. And that aforementioned $n_0$ satisfies the inequality $2 < n_0 leq 665$. However I failed to determine anything else about that number.



Any help will be appreciated.






combinatorics group-theory dynamical-systems formal-languages combinatorics-on-words




combinatorics group-theory dynamical-systems formal-languages combinatorics-on-words






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 13 '18 at 22:58









YCor

7,788929




7,788929










asked Dec 13 '18 at 8:39









Yanior WegYanior Weg

2,34711144




2,34711144












  • $begingroup$
    The main subject of the question is symbolic dynamics.
    $endgroup$
    – YCor
    Dec 13 '18 at 22:59


















  • $begingroup$
    The main subject of the question is symbolic dynamics.
    $endgroup$
    – YCor
    Dec 13 '18 at 22:59
















$begingroup$
The main subject of the question is symbolic dynamics.
$endgroup$
– YCor
Dec 13 '18 at 22:59




$begingroup$
The main subject of the question is symbolic dynamics.
$endgroup$
– YCor
Dec 13 '18 at 22:59










1 Answer
1






active

oldest

votes


















5












$begingroup$

$W_n$ is infinite for all $n geq 3$.



There is an infinite binary word called the Thue–Morse sequence which is cube-free (among other properties). It can be constructed recursively as follows:




  • $w_1 = a$


  • $w_{n+1} = w_n overline{w_n}$ where for word $w in { a,b }^*$ by $overline{w}$ we denote the "Boolean complement" of $w$ (e.g., $overline{a} = b$, $overline{ab} = ba$, $overline{aabaa} = bbabb$).


The Thue–Morse sequence is the natural limit of these finite words.






share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037764%2ffor-what-n-is-w-n-finite%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    5












    $begingroup$

    $W_n$ is infinite for all $n geq 3$.



    There is an infinite binary word called the Thue–Morse sequence which is cube-free (among other properties). It can be constructed recursively as follows:




    • $w_1 = a$


    • $w_{n+1} = w_n overline{w_n}$ where for word $w in { a,b }^*$ by $overline{w}$ we denote the "Boolean complement" of $w$ (e.g., $overline{a} = b$, $overline{ab} = ba$, $overline{aabaa} = bbabb$).


    The Thue–Morse sequence is the natural limit of these finite words.






    share|cite|improve this answer









    $endgroup$


















      5












      $begingroup$

      $W_n$ is infinite for all $n geq 3$.



      There is an infinite binary word called the Thue–Morse sequence which is cube-free (among other properties). It can be constructed recursively as follows:




      • $w_1 = a$


      • $w_{n+1} = w_n overline{w_n}$ where for word $w in { a,b }^*$ by $overline{w}$ we denote the "Boolean complement" of $w$ (e.g., $overline{a} = b$, $overline{ab} = ba$, $overline{aabaa} = bbabb$).


      The Thue–Morse sequence is the natural limit of these finite words.






      share|cite|improve this answer









      $endgroup$
















        5












        5








        5





        $begingroup$

        $W_n$ is infinite for all $n geq 3$.



        There is an infinite binary word called the Thue–Morse sequence which is cube-free (among other properties). It can be constructed recursively as follows:




        • $w_1 = a$


        • $w_{n+1} = w_n overline{w_n}$ where for word $w in { a,b }^*$ by $overline{w}$ we denote the "Boolean complement" of $w$ (e.g., $overline{a} = b$, $overline{ab} = ba$, $overline{aabaa} = bbabb$).


        The Thue–Morse sequence is the natural limit of these finite words.






        share|cite|improve this answer









        $endgroup$



        $W_n$ is infinite for all $n geq 3$.



        There is an infinite binary word called the Thue–Morse sequence which is cube-free (among other properties). It can be constructed recursively as follows:




        • $w_1 = a$


        • $w_{n+1} = w_n overline{w_n}$ where for word $w in { a,b }^*$ by $overline{w}$ we denote the "Boolean complement" of $w$ (e.g., $overline{a} = b$, $overline{ab} = ba$, $overline{aabaa} = bbabb$).


        The Thue–Morse sequence is the natural limit of these finite words.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 13 '18 at 9:09









        Meta-мета-μετα-meta-мета-μεταMeta-мета-μετα-meta-мета-μετα

        4,705927




        4,705927






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037764%2ffor-what-n-is-w-n-finite%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Bundesstraße 106

            Image
            Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück
            Read more

            Verónica Boquete

            Image
            Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl
            Read more

            Ida-Boy-Ed-Garten

            Image
            Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
            Read more