How many letters suffice to construct words with no repetition? The 2019 Stack Overflow Developer Survey Results Are InFormula for sub and super sequence length given 2 stringsThe number of sequences with k elements, containing a given elementMaximal Hamming distance$4$-element subsets of the set $1,2,3,ldots,10$ that do not contain any pair of consecutive numbersAn example showing that van der Waerden's theorem is not true for infinite arithmetic progressionsCounting the number of words made of $2n$ lettersThe number of procedures needed to make an arbitrary permutation to the identityIs there a string of all words without repetition?Recurrence for Number of Words of Length $r$ over $[n]$ with no three consecutive letters the sameCombinatorics - Sequences with repetition and restrictions

Do these rules for Critical Successes and Critical Failures seem Fair?

Is three citations per paragraph excessive for undergraduate research paper?

Why do we hear so much about the Trump administration deciding to impose and then remove tariffs?

Aging parents with no investments

Landlord wants to switch my lease to a "Land contract" to "get back at the city"

How technical should a Scrum Master be to effectively remove impediments?

Why isn't the circumferential light around the M87 black hole's event horizon symmetric?

What to do when moving next to a bird sanctuary with a loosely-domesticated cat?

Is this app Icon Browser Safe/Legit?

Have you ever entered Singapore using a different passport or name?

What is the most effective way of iterating a std::vector and why?

What is the meaning of Triage in Cybersec world?

What does Linus Torvalds mean when he says that Git "never ever" tracks a file?

What are the motivations for publishing new editions of an existing textbook, beyond new discoveries in a field?

Did Section 31 appear in Star Trek: The Next Generation?

Can we generate random numbers using irrational numbers like π and e?

What does ひと匙 mean in this manga and has it been used colloquially?

Delete all lines which don't have n characters before delimiter

Is an up-to-date browser secure on an out-of-date OS?

"as much details as you can remember"

How to notate time signature switching consistently every measure

Earliest use of the term "Galois extension"?

Why did Acorn's A3000 have red function keys?

Can a flute soloist sit?



How many letters suffice to construct words with no repetition?



The 2019 Stack Overflow Developer Survey Results Are InFormula for sub and super sequence length given 2 stringsThe number of sequences with k elements, containing a given elementMaximal Hamming distance$4$-element subsets of the set $1,2,3,ldots,10$ that do not contain any pair of consecutive numbersAn example showing that van der Waerden's theorem is not true for infinite arithmetic progressionsCounting the number of words made of $2n$ lettersThe number of procedures needed to make an arbitrary permutation to the identityIs there a string of all words without repetition?Recurrence for Number of Words of Length $r$ over $[n]$ with no three consecutive letters the sameCombinatorics - Sequences with repetition and restrictions










9












$begingroup$


Given a finite set $A=a_1,ldots , a_k$, consider the sequences of any length that can be constructed using the elements of $A$ and which contain no repetition, a repetition being a pair of consecutive subsequences (of any length) that are equal. Is it true that $k = 4$ is the minimum number of elements in $A$ that allows the construction of sequences of any length containing no repetition? Can anyone indicate a reference for this result, if true?










share|cite|improve this question











$endgroup$



migrated from mathoverflow.net 2 days ago


This question came from our site for professional mathematicians.






















    9












    $begingroup$


    Given a finite set $A=a_1,ldots , a_k$, consider the sequences of any length that can be constructed using the elements of $A$ and which contain no repetition, a repetition being a pair of consecutive subsequences (of any length) that are equal. Is it true that $k = 4$ is the minimum number of elements in $A$ that allows the construction of sequences of any length containing no repetition? Can anyone indicate a reference for this result, if true?










    share|cite|improve this question











    $endgroup$



    migrated from mathoverflow.net 2 days ago


    This question came from our site for professional mathematicians.




















      9












      9








      9





      $begingroup$


      Given a finite set $A=a_1,ldots , a_k$, consider the sequences of any length that can be constructed using the elements of $A$ and which contain no repetition, a repetition being a pair of consecutive subsequences (of any length) that are equal. Is it true that $k = 4$ is the minimum number of elements in $A$ that allows the construction of sequences of any length containing no repetition? Can anyone indicate a reference for this result, if true?










      share|cite|improve this question











      $endgroup$




      Given a finite set $A=a_1,ldots , a_k$, consider the sequences of any length that can be constructed using the elements of $A$ and which contain no repetition, a repetition being a pair of consecutive subsequences (of any length) that are equal. Is it true that $k = 4$ is the minimum number of elements in $A$ that allows the construction of sequences of any length containing no repetition? Can anyone indicate a reference for this result, if true?







      combinatorics combinatorics-on-words






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 2 days ago









      Andrés E. Caicedo

      65.9k8160252




      65.9k8160252










      asked 2 days ago







      PiCo











      migrated from mathoverflow.net 2 days ago


      This question came from our site for professional mathematicians.









      migrated from mathoverflow.net 2 days ago


      This question came from our site for professional mathematicians.






















          1 Answer
          1






          active

          oldest

          votes


















          16












          $begingroup$

          Wikipedia has some examples of square-free sequences of infinite length (and therefore square-free words of arbitrary length) over alphabets with 3 letters.
          https://en.wikipedia.org/wiki/Square-free_word




          One example of an infinite square-free word over an alphabet of size 3 is the word over the alphabet 0,±1 obtained by taking the first difference of the Thue–Morse sequence.[6][7] That is, from the Thue–Morse sequence



          0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, ...



          one forms a new sequence in which each term is the difference of two consecutive terms of the Thue–Morse sequence. The resulting square-free word is



          1, 0, −1, 1, −1, 0, 1, 0, −1, 0, 1, −1, 1, 0, −1, ... (sequence A029883 in the OEIS).







          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%2f3180466%2fhow-many-letters-suffice-to-construct-words-with-no-repetition%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









            16












            $begingroup$

            Wikipedia has some examples of square-free sequences of infinite length (and therefore square-free words of arbitrary length) over alphabets with 3 letters.
            https://en.wikipedia.org/wiki/Square-free_word




            One example of an infinite square-free word over an alphabet of size 3 is the word over the alphabet 0,±1 obtained by taking the first difference of the Thue–Morse sequence.[6][7] That is, from the Thue–Morse sequence



            0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, ...



            one forms a new sequence in which each term is the difference of two consecutive terms of the Thue–Morse sequence. The resulting square-free word is



            1, 0, −1, 1, −1, 0, 1, 0, −1, 0, 1, −1, 1, 0, −1, ... (sequence A029883 in the OEIS).







            share|cite|improve this answer









            $endgroup$

















              16












              $begingroup$

              Wikipedia has some examples of square-free sequences of infinite length (and therefore square-free words of arbitrary length) over alphabets with 3 letters.
              https://en.wikipedia.org/wiki/Square-free_word




              One example of an infinite square-free word over an alphabet of size 3 is the word over the alphabet 0,±1 obtained by taking the first difference of the Thue–Morse sequence.[6][7] That is, from the Thue–Morse sequence



              0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, ...



              one forms a new sequence in which each term is the difference of two consecutive terms of the Thue–Morse sequence. The resulting square-free word is



              1, 0, −1, 1, −1, 0, 1, 0, −1, 0, 1, −1, 1, 0, −1, ... (sequence A029883 in the OEIS).







              share|cite|improve this answer









              $endgroup$















                16












                16








                16





                $begingroup$

                Wikipedia has some examples of square-free sequences of infinite length (and therefore square-free words of arbitrary length) over alphabets with 3 letters.
                https://en.wikipedia.org/wiki/Square-free_word




                One example of an infinite square-free word over an alphabet of size 3 is the word over the alphabet 0,±1 obtained by taking the first difference of the Thue–Morse sequence.[6][7] That is, from the Thue–Morse sequence



                0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, ...



                one forms a new sequence in which each term is the difference of two consecutive terms of the Thue–Morse sequence. The resulting square-free word is



                1, 0, −1, 1, −1, 0, 1, 0, −1, 0, 1, −1, 1, 0, −1, ... (sequence A029883 in the OEIS).







                share|cite|improve this answer









                $endgroup$



                Wikipedia has some examples of square-free sequences of infinite length (and therefore square-free words of arbitrary length) over alphabets with 3 letters.
                https://en.wikipedia.org/wiki/Square-free_word




                One example of an infinite square-free word over an alphabet of size 3 is the word over the alphabet 0,±1 obtained by taking the first difference of the Thue–Morse sequence.[6][7] That is, from the Thue–Morse sequence



                0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, ...



                one forms a new sequence in which each term is the difference of two consecutive terms of the Thue–Morse sequence. The resulting square-free word is



                1, 0, −1, 1, −1, 0, 1, 0, −1, 0, 1, −1, 1, 0, −1, ... (sequence A029883 in the OEIS).








                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 2 days ago









                user44191user44191

                26114




                26114



























                    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%2f3180466%2fhow-many-letters-suffice-to-construct-words-with-no-repetition%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







                    -combinatorics, combinatorics-on-words

                    Popular posts from this blog

                    Frič See also Navigation menuinternal link

                    Identify plant with long narrow paired leaves and reddish stems Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?What is this plant with long sharp leaves? Is it a weed?What is this 3ft high, stalky plant, with mid sized narrow leaves?What is this young shrub with opposite ovate, crenate leaves and reddish stems?What is this plant with large broad serrated leaves?Identify this upright branching weed with long leaves and reddish stemsPlease help me identify this bulbous plant with long, broad leaves and white flowersWhat is this small annual with narrow gray/green leaves and rust colored daisy-type flowers?What is this chilli plant?Does anyone know what type of chilli plant this is?Help identify this plant

                    fontconfig warning: “/etc/fonts/fonts.conf”, line 100: unknown “element blank” The 2019 Stack Overflow Developer Survey Results Are In“tar: unrecognized option --warning” during 'apt-get install'How to fix Fontconfig errorHow do I figure out which font file is chosen for a system generic font alias?Why are some apt-get-installed fonts being ignored by fc-list, xfontsel, etc?Reload settings in /etc/fonts/conf.dTaking 30 seconds longer to boot after upgrade from jessie to stretchHow to match multiple font names with a single <match> element?Adding a custom font to fontconfigRemoving fonts from fontconfig <match> resultsBroken fonts after upgrading Firefox ESR to latest Firefox