Skip to main content
SpringerLink
Log in

Partially Directed Animals with a Bounded Number of Holes

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2021)

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

  • 291 Accesses

Abstract

We address the problem of the exhaustive generation of a particular class of polyominoes, corresponding to partially directed animals with a bounded number of holes. We apply an approach based on discrete dynamical systems to develop an algorithm that generates each polyomino in constant amortized time and space O(n). By implementing the algorithm in C++ we have obtained new sequences that do not appear in the On-Line Encyclopedia of Integer Sequences.

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 EPUB and 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

References

  1. Barcucci, E., Lungo, A.D., Pergola, E., Pinzani, R.: Directed animals, forests and permutations. Discrete Math. 204(1–3), 41–71 (1999)

    Article  MathSciNet  Google Scholar 

  2. Barequet, G., Golomb, S.W., Klarner, D.A.: Polyominoes. In: Handbook of Discrete and Computational Geometry, 3rd edn., pp. 359–380. Chapman and Hall/CRC Press (2017)

    Google Scholar 

  3. Bousquet-Mélou, M.: A method for the enumeration of various classes of column-convex polygons. Discrete Math. 154(1–3), 1–25 (1996)

    Article  MathSciNet  Google Scholar 

  4. Brocchi, S., Castiglione, G., Massazza, P.: On the exhaustive generation of k-convex polyominoes. Theor. Comput. Sci. 664, 54–66 (2017)

    Article  MathSciNet  Google Scholar 

  5. Castiglione, G., Massazza, P.: An efficient algorithm for the generation of Z-convex polyominoes. In: Barneva, R.P., Brimkov, V.E., Šlapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 51–61. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07148-0_6

    Chapter  Google Scholar 

  6. Castiglione, G., Restivo, A.: Reconstruction of L-convex polyominoes. Electron. Notes Discrete Math. 12, 290–301 (2003)

    Article  MathSciNet  Google Scholar 

  7. Del Lungo, A., Duchi, E., Frosini, A., Rinaldi, S.: On the generation and enumeration of some classes of convex polyominoes. Electron. J. Comb. 11(1) (2004)

    Google Scholar 

  8. Delest, M.P., Viennot, G.: Algebraic languages and polyominoes enumeration. Theor. Comput. Sci. 34(1–2), 169–206 (1984)

    Article  MathSciNet  Google Scholar 

  9. Duchi, E., Rinaldi, S., Schaeffer, G.: The number of Z-convex polyominoes. Adv. Appl. Math. 40(1), 54–72 (2008)

    Article  MathSciNet  Google Scholar 

  10. Formenti, E., Massazza, P.: From tetris to polyominoes generation. Electron. Notes Discrete Math. 59, 79–98 (2017)

    Article  MathSciNet  Google Scholar 

  11. Formenti, E., Massazza, P.: On the Generation of 2-Polyominoes. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 101–113. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94631-3_9

    Chapter  MATH  Google Scholar 

  12. Golomb, S.W.: Checker boards and polyominoes. Amer. Math. Monthly 61, 675–682 (1954)

    Article  MathSciNet  Google Scholar 

  13. Jensen, I.: Enumerations of lattice animals and trees. J. Stat. Phys. 102(3), 865–881 (2001)

    Article  MathSciNet  Google Scholar 

  14. Mantaci, R., Massazza, P.: From linear partitions to parallelogram polyominoes. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 350–361. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22321-1_30

    Chapter  Google Scholar 

  15. Massazza, P.: A dynamical system approach to polyominoes generation (2020 submitted)

    Google Scholar 

  16. Massazza, P.: On the generation of convex polyominoes. Discrete Appl. Math. 183, 78–89 (2015)

    Article  MathSciNet  Google Scholar 

  17. Massazza, P.: Hole-free partially directed animals. In: Hofman, P., Skrzypczak, M. (eds.) DLT 2019. LNCS, vol. 11647, pp. 221–233. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24886-4_16

    Chapter  Google Scholar 

  18. Privman, V., Barma, M.: Radii of gyration of fully and partially directed lattice animals. Zeitschrift für Physik B Condensed Matter 57(1), 59–63 (1984)

    Article  Google Scholar 

  19. Redner, S., Yang, Z.R.: Size and shape of directed lattice animals. J. Phys. A: Math. Gen. 15(4), L177–L187 (1982)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical and Applied Sciences, University of Insubria, Varese, Italy

    Valentina Dorigatti & Paolo Massazza

Authors
  1. Valentina Dorigatti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Massazza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Valentina Dorigatti .

Editor information

Editors and Affiliations

  1. University of Milano-Bicocca, Milan, Italy

    Alberto Leporati

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

  4. University of Milano-Bicocca, Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dorigatti, V., Massazza, P. (2021). Partially Directed Animals with a Bounded Number of Holes. In: Leporati, A., Martín-Vide, C., Shapira, D., Zandron, C. (eds) Language and Automata Theory and Applications. LATA 2021. Lecture Notes in Computer Science(), vol 12638. Springer, Cham. https://doi.org/10.1007/978-3-030-68195-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68195-1_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68194-4

  • Online ISBN: 978-3-030-68195-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation