Combinatorics on Words: Christoffel Words and Repetitions in Words

More documents

Recommendations

Info

$Math 223 â Vector Calculus Practice Exam 1 Instructor: Arlo Caine ...$

$Math 212 Review Problems for Test 2$

BIBLIOGRAPHY 175[Dic1930] L. E. Dickson. Studies in the theory of numbers. U. Chicago Press, 1930.Reprinted as Introduction to the theory of numbers, Dover Publications (1957).↑68, 69[DB1937] H. L. Dorwart and O. E. Brown. The Tarry-Escott Problem. Amer. Math.Monthly 44 (10):613–626, 1937. ↑86[DGB1990] S. Dulucq and D. Gouyou-Beauchamps. Sur les facteurs des suites deSturm. Theoret. Comput. Sci. 71 (3):381–400, 1990. ↑50[Duv1983] J.-P. Duval. Factorizing words over an ordered alphabet. J. Algorithms4 (4):363–381, 1983. ↑51[Erd1961] P. Erdős. Some unsolved problems. Magyar Tud. Akad. Mat. Kutató Int.Közl. 6:221–254, 1961. ↑160[Evd1968] A. A. Evdokimov. Strongly asymmetric sequences generated by a finitenumber of symbols. Dokl. Akad. Nauk SSSR 179:1268–1271, 1968. Englishtranslation in Soviet Math. Dokl. 9 (1968), 536–539. ↑161[FM1997] S. Ferenczi and C. Mauduit. Transcendence of numbers with a low complexityexpansion. J. Number Theory 67 (2):146–161, 1997. ↑169[FS1998] A. S. Fraenkel and J. Simpson. How many squares can a string contain?.J. Combin. Theory Ser. A 82 (1):112–120, 1998. ↑136, 137, 138[Fro1913] F. G. Frobenius. Über die Markoffschen Zahlen. Sitzungsberichte derKöniglich Preussischen Akademie der Wissenschaften, Berlin, 1913. Also in:Frobenius, F.G., Gesammelte Abhandlungen, Springer-Verlag, 1968, vol. 3, 598–627, ed. J.-P. Serre. ↑69, 71[Fur1967] H. Furstenberg. Algebraic functions over finite fields. J. Algebra 7:271–277, 1967. ↑97[Gau1986] C. F. Gauss. Disquisitiones arithmeticae. Springer-Verlag, New York,1986. Translated and with a preface by Arthur A. Clarke, revised by WilliamC. Waterhouse, Cornelius Greither and A. W. Grootendorst and with a prefaceby Waterhouse. ↑68[GR1993] I. M. Gessel and C. Reutenauer. Counting permutations with given cyclestructure and descent set. J. Combin. Theory Ser. A 64 (2):189–215, 1993. ↑48[GLS2008] A. Glen, A. Lauve, and F. V. Saliola. A note on the Markoff conditionand central words. Inform. Process. Lett. 105 (6):241–244, 2008. ↑74, 79[GV1991] P. Goralčík and T. Vanicek. Binary patterns in binary words. Internat.J. Algebra Comput. 1 (3):387–391, 1991. ↑130[GKP1994] R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete mathematics:a foundation for computer science. Addison-Wesley Longman Publishing Co.,Inc., Boston, MA, USA, 1994. ↑57, 65
176 BIBLIOGRAPHY[Gus1997] D. Gusfield. Algorithms on strings, trees, and sequences. Cambridge UniversityPress, Cambridge, 1997. Computer science and computational biology.↑146, 149, 153[GS2002] D. Gusfield and J. Stoye. Simple and flexible detection of contiguousrepeats using a suffix tree (preliminary version). Theoret. Comput. Sci. 270 (1-2):843–856, 2002. ↑154[Hal1964] M. Jr. Hall. Generators and relations in groups—The Burnside problem.In Lectures on modern mathematics, vol. ii, pages 42–92. 1964. ↑121[HYY2003] H. K. Hsiao, Y. T. Yeh, and S. S. Yu. Square-free-preserving andprimitive-preserving homomorphisms. Acta Math. Hungar. 101 (1-2):113–130,2003. ↑125[Ili2007] L. Ilie. A note on the number of squares in a word. Theoretical ComputerScience 380 (3):373–376, 2007. ↑137[Jac1956] N. Jacobson. Structure of rings. American Mathematical Society, ColloquiumPublications, vol. 37. American Mathematical Society, 190 Hope Street,Prov., R. I., 1956. ↑168[JZ2004] O. Jenkinson and L. Q. Zamboni. Characterisations of balanced words viaorderings. Theoret. Comput. Sci. 310 (1-3):247–271, 2004. ↑52[Jus2005] J. Justin. Episturmian morphisms and a Galois theorem on continuedfractions. Theor. Inform. Appl. 39 (1):207–215, 2005. ↑30, 36[KR2007] C. Kassel and C. Reutenauer. Sturmian morphisms, the braid group B 4 ,Christoffel words and bases of F 2 . Ann. Mat. Pura Appl. (4) 186 (2):317–339,2007. ↑43[Ker1986] V. Keränen. On the k-freeness of morphisms on free monoids. Ann. Acad.Sci. Fenn. Ser. A I Math. Dissertationes 61:55, 1986. ↑130[Ker1987] V. Keränen. On the k-freeness of morphisms on free monoids. In STACS87 (Passau, 1987), pages 180–188. 1987. ↑130[Ker1992] V. Keränen. Abelian squares are avoidable on 4 letters. In Automata,languages and programming (Vienna, 1992), pages 41–52. 1992. ↑161[KK1999a] R. Kolpakov and G. Kucherov. Finding maximal repetitions in a wordin linear time. In 40th annual symposium on foundations of computer science(New York, 1999), pages 596–604. 1999. ↑158[KK1999b] R. Kolpakov and G. Kucherov. On maximal repetitions in words. InFundamentals of computation theory (Iaşi, 1999), pages 374–385. 1999. ↑158[KZ1873] A. Korkine and G. Zolotareff. Sur les formes quadratiques. Math. Ann. 6(3):366–389, 1873. ↑67[LS1993] G. M. Landau and J. P. Schmidt. An algorithm for approximate tandemrepeats. In Proc. 4th annual symposium on comb. pattern matching, pages 120–133. 1993. ↑154
Page 1 and 2: Combinatorics on W
Page 3 and 4: 172 BIBLIOGRAPHY[Aus2006] P. Auster
Page 5: 174 BIBLIOGRAPHY[Cro1982] M. Croche
Page 9 and 10: 178 BIBLIOGRAPHY[Man2001] G. Manzin
Page 11 and 12: 180 BIBLIOGRAPHY[Ser1985] C. Series

Combinatorics on Words: Christoffel Words and Repetitions in Words

Create successful ePaper yourself

Delete template?

Save as template?