Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Thue–Morse sequence
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== {{refbegin}} * {{cite news |last=Abrahams |first=Marc |title=How to pour the perfect cup of coffee |url=https://www.theguardian.com/education/2010/jul/13/perfect-coffee-improbable-research |newspaper=The Guardian |date=12 July 2010}} * {{cite book |last=Arndt |first=Jörg |title=Matters Computational: Ideas, Algorithms, Source Code |publisher=Springer |date=2011 |chapter-url=http://jjj.de/fxt/fxtbook.pdf |page=44 |chapter=1.16.4 The Thue–Morse sequence}} * {{cite book |last1=Allouche |first1=Jean-Paul |last2=Shallit |first2=Jeffrey |author2-link=Jeffrey Shallit |isbn=978-0-521-82332-6 |publisher=[[Cambridge University Press]] |title=Automatic Sequences: Theory, Applications, Generalizations |date=2003 |zbl=1086.11015}} * {{cite journal |last1=Barrow |first1=John D. |title=Rowing and the Same-Sum Problem Have Their Moments |journal=[[American Journal of Physics]] |date=2010 |volume=78 |issue=7 |pages=728–732 |doi=10.1119/1.3318808 |arxiv=0911.3551 |bibcode=2010AmJPh..78..728B|s2cid=119207447 }} * {{cite book |last1=Berstel |first1=Jean |last2=Lauve |first2=Aaron |last3=Reutenauer |first3=Christophe |last4=Saliola |first4=Franco V. |title=Combinatorics on words. Christoffel words and repetitions in words |series=CRM Monograph Series |volume=27 |location=Providence, RI, USA |publisher=[[American Mathematical Society]] |date=2009 |isbn=978-0-8218-4480-9 |url=http://www.ams.org/bookpages/crmm-27 |zbl=1161.68043}} * {{cite book |editor1-last=Berthé |editor1-first=Valérie |editor-link=Valérie Berthé |editor2-last=Rigo |editor2-first=Michel |title=Combinatorics, automata, and number theory |series=Encyclopedia of Mathematics and its Applications |volume=135 |location=Cambridge |publisher=[[Cambridge University Press]] |date=2010 |isbn=978-0-521-51597-9 |zbl=1197.68006 |page=7}} * {{cite journal |last1=Bolker |first1=Ethan |last2=Offner |first2=Carl |last3=Richman |first3=Robert |last4=Zara |first4=Catalin |title=The Prouhet–Tarry–Escott problem and generalized Thue–Morse sequences |journal=Journal of Combinatorics |date=2016 |volume=7 |issue=1|pages=117–133 |doi=10.4310/JOC.2016.v7.n1.a5 |arxiv=1304.6756|s2cid=118040795 }}} * {{cite book |title=The Win-Win Solution: Guaranteeing Fair Shares to Everybody |last1=Brams |first1=Steven J. |last2=Taylor |first2=Alan D. |pages=[https://archive.org/details/winwinsolutiongu00stev/page/36 36–44] |isbn=978-0-393-04729-5 |publisher=W. W. Norton & Co., Inc. |date=1999 |url-access=registration |url=https://archive.org/details/winwinsolutiongu00stev/page/36}} *{{cite journal |last=Brlek |first=Srećko |title=Enumeration of Factors in the Thue-Morse Word |journal=[[Discrete Applied Mathematics]] |date=1989 |volume=24 |issue=1–3 |pages=83–96 |doi=10.1016/0166-218x(92)90274-e|doi-access= }} *{{cite journal |last1=Cohen-Zada |first1=Danny |last2=Krumer |first2=Alex |last3=Shapir |first3=Offer Moshe |title=Testing the effect of serve order in tennis tiebreak |journal=[[Journal of Economic Behavior and Organization]] |date=2018 |volume=146 |pages=106–115 |doi=10.1016/j.jebo.2017.12.012 |s2cid=89610106 |url=https://www.sciencedirect.com/science/article/pii/S0167268117303530}} *{{cite journal |last1=Cooper |first1=Joshua |last2=Dutle |first2=Aaron |title=Greedy Galois Games |journal=[[American Mathematical Monthly]] |date=2013 |volume=120 |issue=5 |pages=441–451 |url=http://www.math.sc.edu/~cooper/ThueMorseDueling.pdf |doi=10.4169/amer.math.monthly.120.05.441 |arxiv=1110.1137|s2cid=1291901 }} * {{cite book |title=Developments in Language Theory: Proceedings 10th International Conference, DLT 2006, Santa Barbara, California, USA, June 26-29, 2006 |volume=4036 |series=Lecture Notes in Computer Science |editor1-first=Oscar H. |editor1-last=Ibarra |editor2-first=Zhe |editor2-last=Dang |publisher=[[Springer-Verlag]] |date=2006 |isbn=978-3-540-35428-4 |first=Dalia |last=Krieger |chapter=On critical exponents in fixed points of non-erasing morphisms |pages=280–291 |zbl=1227.68074}} * {{cite journal |last1=Levine |first1=Lionel |last2=Stange |first2=Katherine E. |title=How to Make the Most of a Shared Meal: Plan the Last Bite First |journal=[[American Mathematical Monthly]] |date=2012 |volume=119 |issue=7 |pages=550–565 |url=http://math.colorado.edu/~kstange/papers/EthiopianDinner.pdf |doi=10.4169/amer.math.monthly.119.07.550 |arxiv=1104.0961|s2cid=14537479 }} * {{cite book |last=Lothaire |first=M. |author-link=M. Lothaire |title=Algebraic combinatorics on words |others=With preface by Jean Berstel and Dominique Perrin |edition=Reprint of the 2002 hardback |series=Encyclopedia of Mathematics and Its Applications |volume=90 |publisher=Cambridge University Press |date=2011 |isbn=978-0-521-18071-9 |zbl=1221.68183}} * {{cite journal |last1=Ma |first1=Jun |last2=Holdener |first2=Judy |author2-link=Judy A. Holdener |doi=10.1142/S0218348X05002908 |issue=3 |journal=[[Fractals (journal)|Fractals]] |mr=2166279 |pages=191–206 |title=When Thue-Morse meets Koch |url=http://www2.kenyon.edu/people/holdenerj/StudentResearch/WhenThueMorsemeetsKochJan222005.pdf |volume=13 |date=2005}} * {{cite journal |last=Palacios-Huerta |first=Ignacio |title=Tournaments, fairness and the Prouhet–Thue–Morse sequence |journal=Economic Inquiry |date=2012 |volume=50 |issue=3 |pages=848–849 |url=http://www.palacios-huerta.com/docs/EI-Tournaments_and_PTM_sequence.pdf |doi=10.1111/j.1465-7295.2011.00435.x|s2cid=54036493 }} * {{cite book |title=Beautiful Game Theory |last=Palacios-Huerta |first=Ignacio |isbn=978-0691144023 |publisher=Princeton University Press |date=2014 }} * {{cite book |author-last=Pytheas Fogg |author-first=N. |editor-last1=Berthé |editor-first1=Valérie |editor-last2=Ferenczi |editor-first2=Sébastien |editor-last3=Mauduit |editor-first3=Christian |editor-last4=Siegel |editor-first4=A. |title=Substitutions in dynamics, arithmetics and combinatorics |series=Lecture Notes in Mathematics |volume=1794 |location=Berlin, Germany |publisher=[[Springer-Verlag]] |date=2002 |isbn=978-3-540-44141-0 |zbl=1014.11015}} *{{cite journal |last=Richman |first=Robert |title=Recursive Binary Sequences of Differences |journal=[[Complex Systems (journal)|Complex Systems]] |date=2001 |volume=13 |issue=4 |pages=381–392 |url=http://www.complex-systems.com/pdf/13-4-3.pdf}} {{refend}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)