Skip to main content

Z-Tilings of Polyominoes and Standard Basis

  • Conference paper
Combinatorial Image Analysis (IWCIA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3322))

Included in the following conference series:

Abstract

In this paper, we prove that for every set E of polyominoes (for us, a polyomino is a finite union of unit squares of a square lattice), we have an algorithm which decides in polynomial time, for every polyomino P, whether P has or not a ℤ-tiling (signed tiling) by translated copies of elements of E. Moreover, if P is ℤ-tilable, we can build a ℤ-tiling of P. We use for this the theory of standard basis on ℤ[X 1,...,X n ]. In application, we algorithmically extend results of Conway and Lagarias on ℤ-tiling problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Barnes, F.W.: Best packing of rods into boxes. Discrete Mathematics 142, 271–275 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bodini, O.: Pavage des polyominos et Bases de Grobner, Rapport de recherche No RR2001-51, LIP (2001)

    Google Scholar 

  3. Buchberger, B.: Introduction to Grobner basis. In: Logic of computation (Marktoberdorf 95). NATO Adv. Sci. Inst. Ser. F Comput. Systems Sci., vol. 157, pp. 35–66. Springer, Berlin (1997)

    Google Scholar 

  4. Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. J.C.T. Series A 53, 183–208 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cox, D., Little, J., O’Shea, D.: Ideals,varieties and algorithms, 2nd edn. Undergraduate Text in Mathematics, vol. XV, p. 536. Springer, New York (1997)

    Google Scholar 

  6. Faugére, J.-C.: A new efficient algorithm for computing Grobner basis. Journal of Pure and Applied Algebra 139, 61–88 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Golomb, S.W.: Tiling with polyominoes. J.C.T. Series A 1, 280–296 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  8. Golomb, S.W.: Polyominoes which tile rectangles. J.C.T. Series A 51, 117–124 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kenyon, R.: Sur la dynamique, la combinatoire et la statistique des pavages, Habilitation (1999)

    Google Scholar 

  10. Klarner, D.A.: Packing a rectangle with congruent n-ominoes. J.C.T. Series A 7, 107–115 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  11. Thurston, W.P.: Conway’s tiling groups. Amer. Math. Monthly 97(8), 757–773 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodini, O., Nouvel, B. (2004). Z-Tilings of Polyominoes and Standard Basis. In: Klette, R., Žunić, J. (eds) Combinatorial Image Analysis. IWCIA 2004. Lecture Notes in Computer Science, vol 3322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30503-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30503-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23942-0

  • Online ISBN: 978-3-540-30503-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics