Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees

References

• C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, and D. Gouyou-Beauchamps, Generating functions for generating trees, Discrete Math. 246(1–3) (2000), pp. 29–55. doi: 10.1016/S0012-365X(01)00250-3
   Web of Science ®Google Scholar
• E. Barcucci, A. Del Lungo, E. Pergola, and R. Pinzani, ECO: a methodology for the enumeration of combinatorial objects, J. Differ. Equ. Appl. 5 (1999), pp. 435–490. doi: 10.1080/10236199908808200
   Web of Science ®Google Scholar
• E. Barcucci, A. Frosini, and S. Rinaldi, Direct-convex polyominoes: ECO method and bijective results, in Proceedings of Formal Power Series and Algebraic Combinatorics 2002, R. Brak, O. Foda, C. Greenhill, T. Guttman, and A. Owczarek, eds., Melbourne, 2002.
   Google Scholar
• E.A. Bender, Convex n-ominoes, Discrete Math. 8 (1974), pp. 219–226. doi: 10.1016/0012-365X(74)90134-4
   Google Scholar
• M. Bousquet-Mèlou, A method for the enumeration of various classes of column-convex polygons, Discrete Math. 154 (1996), pp. 1–25. doi: 10.1016/0012-365X(95)00003-F
   Web of Science ®Google Scholar
• M. Bousquet-Mèlou, R. Brak, Polygons, Polyominoes and Polycubes, Springer, Netherlands, 2009, pp. 43–78.
   Google Scholar
• M. Bousquet-Mèlou and J.M. Fedou, The generating function of convex polyominoes: the resolution of a q-differential system, Discrete Math. 137 (1995), pp. 53–75. doi: 10.1016/0012-365X(93)E0161-V
   Web of Science ®Google Scholar
• M. Bousquet-Mèlou and A.J. Guttmann, Enumeration of three-dimensional convex polygons, Ann. Combin. 1 (1997), pp. 27–53. doi: 10.1007/BF02558462
   Google Scholar
• M. Bousquet-Mélou and A. Rechnitzer, The site-perimeter of bargraphs, Adv. Appl. Math. 31 (2003), pp. 86–112. doi: 10.1016/S0196-8858(02)00553-5
   Web of Science ®Google Scholar
• S.R. Broadbent and J.M. Hammersley, Percolation processes: I. crystals and mazes, Math. Proc. Camb Philos. Soc. 53(3) (1957), pp. 629–641. doi: 10.1017/S0305004100032680
   Google Scholar
• K. Buchin, M.-K. Chiu, S. Felsner, G. Rote, and A. Schulz, The number of convex polyominoes with given height and width, Available at https://arxiv.org/abs/1903.01095.
   Google Scholar
• A.R. Conway and A.J. Guttmann, On two-dimensional percolation, J. Phys. A: Math. General 28(4) (1995), pp. 891. doi: 10.1088/0305-4470/28/4/015
   Google Scholar
• M.P. Delest and S. Dulucq, Enumeration of directed column–convex animals with given perimeter and area, Croatica Chem. Acta 66 (1993), pp. 59–80.
   Web of Science ®Google Scholar
• M.P. Delest and G. Viennot, Algebraic languages and polyominoes enumeration, Theoret. Comput. Sci. 34 (1984), pp. 169–206. doi: 10.1016/0304-3975(84)90116-6
   Web of Science ®Google Scholar
• A. Del Lungo, E. Duchi, A. Frosini, and S. Rinaldi, Enumeration of convex polyominoes using the ECO method, Discrete Math. Theor. Comput. Sci. (2003), pp. 103–116. AB(DMCS).
   Web of Science ®Google Scholar
• M. Eden, A two-dimensional growth process, Dyn. Fract. Surf. 4 (1961), pp. 223–239.
   Google Scholar
• S. Feretić, A new way of counting the column-convex polyominoes by perimeter, Discrete Math.180 (1998), pp. 173–184. doi: 10.1016/S0012-365X(97)00114-3
   Web of Science ®Google Scholar
• P. Flajolet, R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, 2009.
   Google Scholar
• S.W. Golomb, Checker boards and polyominoes, Am. Math. Mon. 61 (1954), pp. 675–682. doi: 10.1080/00029890.1954.11988548
   Google Scholar
• A.J. Guttmann, Polygons, Polyominoes and Polycubes, Springer, Netherlands, 2009. Lecture Notes in PhysicsVol. 775.
   Google Scholar
• F. Harary, Unsolved problems in the enumeration of graphs, Publ. Math. Inst. Hungarian Acad. Sci.5 (1960), pp. 1–20.
   Google Scholar
• W. Hochstättler, M. Loebl, and C. Moll, Generating convex polyominoes at random, Discrete Math. 153 (1996), pp. 165–176. doi: 10.1016/0012-365X(95)00134-I
   Web of Science ®Google Scholar
• D. Kim, The number of convex polyominos with given perimeter, Discrete Math. 70(1) (1988), pp. 47–51. doi: 10.1016/0012-365X(88)90079-9
   Web of Science ®Google Scholar
• D.A. Klarner, Cell growth problems, Can. J. Math. 19 (1967), pp. 851–863. doi: 10.4153/CJM-1967-080-4
   Google Scholar
• P. Leroux, E. Rassart, and A. Robitaille, Enumeration of symmetry classes of convex polyominoes in the square lattice, Adv. Appl. Math. 21 (1998), pp. 343–380. doi: 10.1006/aama.1998.0601
   Web of Science ®Google Scholar
• L. Lipshitz, The diagonal of a D-finite power series is D-finite, J. Algebra 113(2) (1988), pp. 373–378. doi: 10.1016/0021-8693(88)90166-4
   Web of Science ®Google Scholar
• L. Lipshitz, D-finite power series, J. Algebra 122 (1989), pp. 353–373. doi: 10.1016/0021-8693(89)90222-6
   Web of Science ®Google Scholar
• K.Y. Lin and S.J. Chang, Rigorous results for the number of convex polygons on the square and honeycomb lattices, J. Phys. A: Math. Gen. 21 (1988), pp. 2635–2642. doi: 10.1088/0305-4470/21/11/020
   Google Scholar
• P.J. Peard and D.S. Gaunt, 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer, J. Phys. A: Math. Gen. 28(21) (1995), p. 6109. doi: 10.1088/0305-4470/28/21/015
   Google Scholar
• R.C. Read, Contributions to the cell growth problem, Can. J. Math. 14 (1962), pp. 1–20. doi: 10.4153/CJM-1962-001-2
   Google Scholar
• R.P. Stanley, Differentiably finite power series, Eur. J. Combin. 1 (1980), pp. 175–188. doi: 10.1016/S0195-6698(80)80051-5
   Google Scholar
• H.N.V. Temperley, Combinatorial problems suggested by the statistical mechanics of domains and of rubber-like molecules, Phys. Rev. 103 (1956), pp. 1–16. doi: 10.1103/PhysRev.103.1
   Web of Science ®Google Scholar
• X.G. Viennot, A survey of polyominoes enumeration, in 4th FPSAC Proc., Publications du LACIM, Institut Mittag-Leffler, Vol. 11, 1992, pp. 399–420.
   Google Scholar
• D. Zeilberger, The umbral transfer-matrix method: I. foundations, J. Comb. Theory Ser. A 91 (2000), pp. 451–463. doi: 10.1006/jcta.2000.3110
   Web of Science ®Google Scholar
• D. Zeilberger, The umbral transfer-matrix method. IV. counting self-avoiding polygons and walks, Electron. J. Comb. 8(1) (2001), p. R28. doi: 10.37236/1572
   Google Scholar
• D. Zeilberger, The umbral transfer-matrix method. III. counting animals, N. Y. J. Math. 7 (2001), pp. 223–231.
   Google Scholar