Skip to main content
SpringerLink
Log in

Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2019)

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

Included in the following conference series:

Abstract

A polyomino is a set of edge-connected squares on the square lattice. We investigate the combinatorial and geometric properties of minimal-perimeter polyominoes. We explore the behavior of minimal-perimeter polyominoes when they are “inflated,” i.e., expanded by all empty cells neighboring them, and show that inflating all minimal-perimeter polyominoes of a given area create the set of all minimal-perimeter polyominoes of some larger area. We characterize the roots of the infinite chains of sets of minimal-perimeter polyominoes which are created by inflating polyominoes of another set of minimal-perimeter polyominoes, and show that inflating any polyomino for a sufficient amount of times results in a minimal-perimeter polyomino. In addition, we devise two efficient algorithms for counting the number of minimal-perimeter polyominoes of a given area, compare the algorithms and analyze their running times, and provide the counts of polyominoes which they produce.

Work on this paper by both authors has been supported in part by ISF Grant 575/15 and by BSF (joint with NSF) Grant 2017684.

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. Altshuler, Y., Yanovsky, V., Vainsencher, D., Wagner, I.A., Bruckstein, A.M.: On minimal perimeter polyminoes. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 17–28. Springer, Heidelberg (2006). https://doi.org/10.1007/11907350_2

    Chapter  Google Scholar 

  2. Asinowski, A., Barequet, G., Zheng, Y.: Enumerating polyominoes with fixed perimeter defect. In: Proceedings of 9th European Conference on Combinatorics, Graph Theory, and Applications, vol. 61, pp. 61–67. Elsevier, Vienna, August 2017

    Article  MATH  Google Scholar 

  3. Barequet, G., Ben-Shachar, G.: Properties of minimal-perimeter polyominoes. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 120–129. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94776-1_11

    Chapter  Google Scholar 

  4. Barequet, G., Rote, G., Shalah, M.: \(\lambda > 4\): an improved lower bound on the growth constant of polyominoes. Commun. ACM 59(7), 88–95 (2016)

    Google Scholar 

  5. Broadbent, S., Hammersley, J.: Percolation processes: I. Crystals and Mazes. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 53, pp. 629–641. Cambridge University Press, Cambridge (1957)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fülep, G., Sieben, N.: Polyiamonds and polyhexes with minimum site-perimeter and achievement games. Electron. J. Comb. 17(1), 65 (2010)

    MathSciNet  MATH  Google Scholar 

  7. Golomb, S.: Checker boards and polyominoes. Am. Math. Mon. 61(10), 675–682 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jensen, I.: Counting polyominoes: a parallel implementation for cluster computing. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2659, pp. 203–212. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44863-2_21

    Chapter  Google Scholar 

  9. Klarner, D.: Cell growth problems. Canad. J. Math. 19, 851–863 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  10. Klarner, D., Rivest, R.: A procedure for improving the upper bound for the number of n-ominoes. Canad. J. Math. 25(3), 585–602 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  11. Madras, N.: A pattern theorem for lattice clusters. Ann. Combin. 3(2), 357–384 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pergola, E., Pinzani, R., Rinaldi, S., Sulanke, R.: A bijective approach to the area of generalized Motzkin paths. Adv. Appl. Math. 28(3–4), 580–591 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Redelmeier, D.H.: Counting polyominoes: yet another attack. Discret. Math. 36(2), 191–203 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sieben, N.: Polyominoes with minimum site-perimeter and full set achievement games. Eur. J. Comb. 29(1), 108–117 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sulanke, R.A.: Moments of generalized Motzkin paths. J. Integer Seq. 3(001), 1 (2000)

    MathSciNet  MATH  Google Scholar 

  16. Sulanke, R.A.: Bijective recurrences for Motzkin paths. Adv. Appl. Math. 27(2–3), 627–640 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Wang, D.L., Wang, P.: Discrete isoperimetric problems. SIAM J. Appl. Math. 32(4), 860–870 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion—IIT, Haifa, Israel

    Gill Barequet & Gil Ben-Shachar

Authors
  1. Gill Barequet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gil Ben-Shachar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gil Ben-Shachar .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology, Kharagpur, India

    Sudebkumar Prasant Pal

  2. Cochin University of Science and Technology, Cochin, India

    Ambat Vijayakumar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Barequet, G., Ben-Shachar, G. (2019). Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-11509-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-11508-1

  • Online ISBN: 978-3-030-11509-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation