Skip to main content
SpringerLink
Log in

Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms

  • Conference paper
Book cover Language and Automata Theory and Applications (LATA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8370))

  • 1049 Accesses

Abstract

Based on the original approach of Eugène Prouhet, using composition of morphism-like array-words mappings, we provide a construction of solutions to the multi-dimensional Prouhet-Tarry-Escott problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allouche, J.P., Shallit, J.O.: Automatic sequences - theory, applications, generalizations. Cambridge University Press (2003)

    Google Scholar 

  2. Alpers, A., Tijdeman, R.: The two-dimensional Prouhet-Tarry-Escott problem. J. Number Theory 123(2), 403–412 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Comb. 28(3), 996–1022 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Černý, A., Gruska, J.: Modular trellises. In: The Book of L, pp. 45–61. Springer, Heidelberg (1986)

    Google Scholar 

  5. Černý, A.: Generalizations of Parikh mappings. RAIRO Theor. Inform. Appl. 44(2), 209–228 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  6. Černý, A.: On Prouhet’s solution to the equal powers problem. Theoretical Computer Science 491(17), 33–46 (2013)

    MATH  MathSciNet  Google Scholar 

  7. Černý, A., Gruska, J.: Modular real-time trellis automata. Fundamenta Informaticae IX, 253–282 (1986)

    Google Scholar 

  8. Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 329–438. Springer (1997)

    Google Scholar 

  9. Dudík, M., Schulman, L.J.: Reconstruction from subsequences. J. Comb. Theory Ser. A 103, 337–348 (2003)

    Article  MATH  Google Scholar 

  10. Frougny, C., Vuillon, L.: Coding of two-dimensional constraints of finite type by substitutions. Journal of Automata, Languages and Combinatorics 10(4), 465–482 (2005)

    MATH  MathSciNet  Google Scholar 

  11. Kalashnik, L.: The reconstruction of a word from fragments. In: Numerical Mathematics and Computer Technology. Akad. Nauk Ukrain. SSR Inst. Mat., pp. 56–57 (1973) (in Russian)

    Google Scholar 

  12. Knuth, D.E.: The art of computer programming, 2nd edn. Seminumerical algorithms, vol. 2. Addison-Wesley (1981)

    Google Scholar 

  13. Krasikov, I., Roditty, Y.: On a reconstruction problem for sequences. J. Comb. Theory, Ser. A 77(2), 344–348 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lehmer, D.H.: The Tarry-Escott problem. Scripta Mathematica 13, 37–41 (1947)

    MATH  MathSciNet  Google Scholar 

  15. Lothaire, M.: Combinatorics on words. Cambridge University Press (1997)

    Google Scholar 

  16. Milner, R.: The spectra of words. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 1–5. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Mozes, S.: Tilings, substitution systems and dynamical systems generated by them. Journal d’Analyse Mathamatique 53, 139–186 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. Prouhet, E.: Mėmoire sur quelques relations entre les puissances des nombres. C.R. Acad. Sci. Paris 33, 255 (1851)

    Google Scholar 

  19. Rigo, M., Maes, A.: More on generalized automatic sequences. Journal of Automata, Languages and Combinatorics 7(3), 351–376 (2002)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, College of Computing Sciences and Engineering, Kuwait University, Kuwait

    Anton Černý

Authors
  1. Anton Černý
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. School of Computer Science, Department of Software Engineering and Artificial Intelligence, Complutense University of Madrid, Professor José Garcia Santesmases, 9, 28040, Madrid, Spain

    José-Luis Sierra-Rodríguez

  3. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Černý, A. (2014). Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04921-2_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04920-5

  • Online ISBN: 978-3-319-04921-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation