Gill Barequet
Skip Abstract Section
Skip Supplemental Material SectionAbstract
The universal constant λ, the growth constant of polyominoes (think Tetris pieces), is rigorously proved to be greater than 4.
Supplemental Material
Available for Download
pdf
p88-barequet-supp.pdf (277.7 KB)
Supplemental material.
- 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).Google Scholar
- Avigad, J. and Harrison, J. Formally verified mathematics. Commun. ACM 57, 4 (April 2014), 66--75. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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 Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- Derrida, B. and Herrmann, H.J. Collapse of branched polymers. Journal de Physique 44, 12 (Dec. 1983), 1365--1376.Google ScholarCross Ref
- 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.Google Scholar
- 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.Google Scholar
- Golomb, S.W. Polyominoes, Second Edition. Princeton University Press, Princeton, NJ, 1994.Google Scholar
- Gonthier, G. Formal proof---The four color theorem. Notices of the AMS 55, 11 (Dec. 2008), 1382--1393.Google Scholar
- Guttmann, A.J., Ed. Polygons, Polyominoes and Polycubes, Lecture Notes in Physics 775. Springer, Heidelberg, Germany, 2009. Google ScholarDigital Library
- Hales, T., Solovyev, A., and Le Truong, H. The Flyspeck Project: Announcement of Completion, Aug. 10, 2014; https://code.google.com/p/fyspeck/wiki/AnnouncingCompletionGoogle Scholar
- Hopcroft, J.E. and Tarjan, R.E. Dividing a graph into triconnected components. SIAM Journal of Computing 2, 3 (Sept. 1973), 135--158.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Klarner, D.A. Cell growth problems. Canadian Journal of Mathematics 19, 4 (1967), 851--863.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- Lagarias, J.C., Ed. The Kepler Conjecture: The Hales-Ferguson Proof. Springer, New York, 2011.Google ScholarCross Ref
- Lubensky, T.C. and Isaacson, J. Statistics of lattice animals and dilute branched polymers. Physical Review A 20, 5 (Nov. 1979), 2130--2146.Google ScholarCross Ref
- Madras, N. A pattern theorem for lattice clusters. Annals of Combinatorics 3, 2-4 (June 1999), 357--384.Google ScholarCross Ref
- 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.Google Scholar
- McConnell, R.M., Mehlhorn, K., Näher, S., and Schweitzer, P. Certifying algorithms. Computer Science Review 5, 2 (May 2011), 119--161. Google ScholarDigital Library
- Mertens, S. and Lautenbacher, M.E. Counting lattice animals: A parallel attack. Journal of Statistical Physics 66, 1--2 (Jan. 1992), 669--678.Google ScholarCross Ref
- Redelmeier, D.H. Counting polyominoes: Yet another attack. Discrete Mathematics 36, 3 (Dec. 1981), 191--203. Google ScholarDigital Library
- Schmidt, J.M. Contractions, removals and certifying 3-connectivity in linear time, SIAM Journal on Computing 42, 2 (Mar. 2013), 494--535.Google ScholarCross Ref
- 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.Google Scholar
- Tucker, W. A rigorous ODE solver and Smale's 14th problem. Foundations of Computational Mathematics 2, 1 (Jan. 2002), 53--117. Google ScholarDigital Library
Index Terms
- λ > 4: an improved lower bound on the growth constant of polyominoes
Recommendations
A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax
GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary ComputationUnderstanding how crossover works is still one of the big challenges in evolutionary computation research, and making our understanding precise and proven by mathematical means might be an even bigger one. As one of few examples where crossover provably ...
Algorithms for testing occurrences of length 4 patterns in permutations
In this paper linear time sequential and optimal parallel algorithms for testing pattern involvement for all length 4 permutations are described. This is an improvement as the previous best sequential algorithms, for most of these pattern require $$O(n\...
Comments