Skip to main content

Consistency of Multidimensional Combinatorial Substitutions

  • Conference paper

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

Abstract

Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in ℤd. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of the way they are glued together in the image by a substitution. Two problems can arise when defining a substitution in such a way: it can fail to be consistent, and the patterns in an image by the substitution might overlap.

We prove that it is undecidable whether a two-dimensional substitution is consistent or overlapping, and we provide practical algorithms to decide these properties in some particular cases.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pytheas Fogg, N.: Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics, vol. 1794. Springer, Berlin (2002)

    CrossRef  MATH  Google Scholar 

  2. Frank, N.P.: A primer of substitution tilings of the Euclidean plane. Expo. Math. 26, 295–326 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Fernique, T.: Local rule substitutions and stepped surfaces. Theoret. Comput. Sci. 380, 317–329 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Arnoux, P., Berthé, V., Siegel, A.: Two-dimensional iterated morphisms and discrete planes. Theoret. Comput. Sci. 319, 145–176 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Frank, N.P.: Detecting combinatorial hierarchy in tilings using derived Voronoï tesselations. Discrete Comput. Geom. 29, 459–476 (2003)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Jolivet, T., Kari, J.: Consistency of multidimensional combinatorial substitutions. Theoret. Comput. Sci. (to appear, 2012)

    Google Scholar 

  7. Kari, J.: Infinite Snake Tiling Problems. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 67–77. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jolivet, T., Kari, J. (2012). Consistency of Multidimensional Combinatorial Substitutions. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30642-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30641-9

  • Online ISBN: 978-3-642-30642-6

  • eBook Packages: Computer ScienceComputer Science (R0)