skip to main content
research-article
Free access

λ > 4: an improved lower bound on the growth constant of polyominoes

Published: 24 June 2016 Publication History

Abstract

The universal constant λ, the growth constant of polyominoes (think Tetris pieces), is rigorously proved to be greater than 4.

Supplementary Material

PDF File (p88-barequet-supp.pdf)
Supplemental material.

References

[1]
Appel, K. and Haken, W. Every planar map is four colorable. Illinois Journal of Mathematics 21, 3 (Sept. 1977), 429--490 (part I) and 491--567 (part II).
[2]
Avigad, J. and Harrison, J. Formally verified mathematics. Commun. ACM 57, 4 (April 2014), 66--75.
[3]
Aleksandrowicz, G., Asinowski, A., Barequet, G., and Barequet, R. Formulae for polyominoes on twisted cylinders. In Proceedings of the Eighth International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 8370 (Madrid, Spain, Mar. 10-14). Springer-Verlag, Heidelberg, New York, Dordrecht, London, 2014, 76--87.
[4]
Barequet, G. and Moffie, M. On the complexity of Jensen's algorithm for counting fixed polyominoes. Journal of Discrete Algorithms 5, 2 (June 2007), 348--355.
[5]
Barequet, G., Moffie, M., Ribó, A., and Rote, G. Counting polyominoes on twisted cylinders. INTEGERS: Electronic Journal of Combinatorial Number Theory 6 (Sept. 2006), #A22, 37.
[6]
Barequet, G., Rote, G., and Shalah, M. λ > 4. In Proceedings of the 23rd Annual European Symposium on Algorithms Lecture Notes in Computer Science 9294 (Patras, Greece, Sept. 14-16). Springer-Verlag, Berlin Heidelberg, Germany, 2015, 83--94.
[7]
Barequet, G. and Shalah, M. Polyominoes on twisted cylinders. In the Video Review at the 29th Annual Symposium on Computational Geometry (Rio de Janeiro, Brazil, June 17-20). ACM Press, New York, 2013, 339--340; http://www.computational-geometry.org/SoCG-videos/socg13video
[8]
Broadbent, S.R. and Hammersley, J.M. Percolation processes: I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society 53, 3 (July 1957), 629--641.
[9]
Conway, A. Enumerating 2D percolation series by the finite-lattice method: Theory. Journal of Physics, A: Mathematical and General 28, 2 (Jan. 1995), 335--349.
[10]
Derrida, B. and Herrmann, H.J. Collapse of branched polymers. Journal de Physique 44, 12 (Dec. 1983), 1365--1376.
[11]
Flesia, S., Gaunt, D.S., Soteros, C.E., and Whittington, S.G. Statistics of collapsing lattice animals. Journal of Physics, A: Mathematical and General 27, 17 (Sept. 1994), 5831--5846.
[12]
Gaunt, D.S., Sykes, M.F., and Ruskin, H. Percolation processes in d-dimensions. Journal of Physics A: Mathematical and General 9, 11 (Nov. 1976), 1899--1911.
[13]
Golomb, S.W. Polyominoes, Second Edition. Princeton University Press, Princeton, NJ, 1994.
[14]
Gonthier, G. Formal proof---The four color theorem. Notices of the AMS 55, 11 (Dec. 2008), 1382--1393.
[15]
Guttmann, A.J., Ed. Polygons, Polyominoes and Polycubes, Lecture Notes in Physics 775. Springer, Heidelberg, Germany, 2009.
[16]
Hales, T., Solovyev, A., and Le Truong, H. The Flyspeck Project: Announcement of Completion, Aug. 10, 2014; https://code.google.com/p/fyspeck/wiki/AnnouncingCompletion
[17]
Hopcroft, J.E. and Tarjan, R.E. Dividing a graph into triconnected components. SIAM Journal of Computing 2, 3 (Sept. 1973), 135--158.
[18]
Jensen, I. Counting polyominoes: A parallel implementation for cluster computing. In Proceedings of the International Conference on Computational Science, Part III, Lecture Notes in Computer Science, 2659 (Melbourne, Australia, and St. Petersburg, Russian Federation, June 2-4). Springer-Verlag, Berlin, Heidelberg, New York, 2003, 203--212.
[19]
Klarner, D.A. Cell growth problems. Canadian Journal of Mathematics 19, 4 (1967), 851--863.
[20]
Klarner, D.A. and Rivest, R.L. A procedure for improving the upper bound for the number of n-ominoes. Canadian Journal of Mathematics 25, 3 (Jan. 1973), 585--602.
[21]
Lagarias, J.C., Ed. The Kepler Conjecture: The Hales-Ferguson Proof. Springer, New York, 2011.
[22]
Lubensky, T.C. and Isaacson, J. Statistics of lattice animals and dilute branched polymers. Physical Review A 20, 5 (Nov. 1979), 2130--2146.
[23]
Madras, N. A pattern theorem for lattice clusters. Annals of Combinatorics 3, 2-4 (June 1999), 357--384.
[24]
Madras, N., Soteros, C.E., Whittington, S.G., Martin, J.L., Sykes, M.F., Flesia, S., and Gaunt, D.S. The free energy of a collapsing branched polymer. Journal of Physics, A: Mathematical and General 23, 22 (Nov. 1990), 5327--5350.
[25]
McConnell, R.M., Mehlhorn, K., Näher, S., and Schweitzer, P. Certifying algorithms. Computer Science Review 5, 2 (May 2011), 119--161.
[26]
Mertens, S. and Lautenbacher, M.E. Counting lattice animals: A parallel attack. Journal of Statistical Physics 66, 1--2 (Jan. 1992), 669--678.
[27]
Redelmeier, D.H. Counting polyominoes: Yet another attack. Discrete Mathematics 36, 3 (Dec. 1981), 191--203.
[28]
Schmidt, J.M. Contractions, removals and certifying 3-connectivity in linear time, SIAM Journal on Computing 42, 2 (Mar. 2013), 494--535.
[29]
Sykes, M.F. and Glen, M. Percolation processes in two dimensions: I. Low-density series expansions. Journal of Physics, A: Mathematical and General 9, 1 (Jan. 1976), 87--95.
[30]
Tucker, W. A rigorous ODE solver and Smale's 14th problem. Foundations of Computational Mathematics 2, 1 (Jan. 2002), 53--117.

Cited By

View all

Index Terms

  1. λ > 4: an improved lower bound on the growth constant of polyominoes

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image Communications of the ACM
        Communications of the ACM  Volume 59, Issue 7
        July 2016
        118 pages
        ISSN:0001-0782
        EISSN:1557-7317
        DOI:10.1145/2963119
        • Editor:
        • Moshe Y. Vardi
        Issue’s Table of Contents
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 24 June 2016
        Published in CACM Volume 59, Issue 7

        Permissions

        Request permissions for this article.

        Check for updates

        Qualifiers

        • Research-article
        • Popular
        • Refereed

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)235
        • Downloads (Last 6 weeks)23
        Reflects downloads up to 18 Jan 2025

        Other Metrics

        Citations

        Cited By

        View all

        View Options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Digital Edition

        View this article in digital edition.

        Digital Edition

        Magazine Site

        View this article on the magazine site (external)

        Magazine Site

        Login options

        Full Access

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media