On the generation and enumeration of some classes of convex polyominoes

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages 1-46

  Del Lungo, A ^c   Duchi, E ^a   Frosini, A ^b   Rinaldi, S ^b  

^a ÉCOLE DES HAUTES ÉTUDES EN SCIENCES SOCIALES   (France)

^b UNIVERSITY OF SIENA   (Italy)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 5344234101     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1813     Document Type: Review

References (32)

1. D. Avis, K. Fukuda, Reverse search for enumeration, Discrete Appl. Math. 65 (1996) 21-46.
2. S. Bacchelli, E. Barcucci, E. Grazzini, E. Pergola, Exhaustive generation of combinatorial objects by ECO, Acta Informatica 40 (2004) 585-602.
3. 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)(2002) 29-55.
4. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, ECO: a methodology for the Enumeration of Combinatorial Objects, J. of Diff. Eq. and App. 5 (1999) 435-490.
5. D. Beauquier, M. Nivat, On translating one polyomino to tile the plane, Disc. Comput. Geom. 6 (1991) 575-592.
6. M. Bousquet-Mèlou, A method for the enumeration of various classes of column-convex polygons, Discrete Math. 154 (1996) 1-25.
7. M. Bousquet-Mèlou, A. J. Guttmann, Enumeration of three dimensional convex polygons, Ann. of Comb. 1 (1997) 27-53.
8. R. Brak, A. J. Guttmann, I. G. Enting, Exact solution of the row-convex polygon perimeter generating function, J. Phys. A 23 (1990) L2319-L2326.
9. S. Chaiken, D. J. Kleitman, M. Saks and J. Shearer, Covering regions by rectangles, SIAM J. Discr. and Alg. Meth. 2 (1981) 394-410.
10. S. J. Chang, K. Y. Lin, Rigorous results for the number of convex polygons on the square and honeycomb lattices, J. Phys. A: Math. Gen. 21 (1988) 2635-2642.
11. F. R. K. Chung, R. L. Graham, V. E. Hoggatt, M. Kleimann, The number of Baxter permutations, J. Comb. Th. A 24 (1978) 382-394.
12. J. H. Conway, J. C. Lagarias, Tiling with polyominoes and combinatorial group theory, J. Comb. Th. A, 53 (1990) 183-208.
13. M. Delest, Generating functions for column-convex polyominoes, J. Comb. Th. Ser. A, 48 (1988) 12-31.
14. M. Delest, X. Viennot, Algebraic languages and polyominoes enumeration, Theor. Comp. Sci., 34 (1984) 169-206.
15. E. Duchi, A. Frosini, S. Rinaldi, R. Pinzani, A note on rational succession rules, J. Int. Seq. 6 (2003) Article 03.1.7.
16. I. Dutour, J. M. Fédou, Object grammars and random generation, Disc. Math. and Theor. Comp. Sci., 2 (1998) 47-61.
17. J. M. Fedou, C. Garcia, Algebraic succession rules, Proc. of 14th FPSAC (2002) n.27.
18. L. Ferrari, E. Pergola, R. Pinzani, S. Rinaldi, An algebraic characterization of the set of succession rules, Theor. Comp. Sci., 281(1-2) (2002) 351-367.
19. L. Ferrari, E. Pergola, R. Pinzani, S. Rinaldi, Jumping succession rules and their generating functions, Discrete Math., 271 (2003) 29-50.
20. S. Feretić, A new way of counting the column-convex polyominoes by perimeter, Discrete Math., 180 (1998) 173-184.
21. I. Gessel, On the number of convex polyominoes, Annales des Sciences Mathemathiques du Quebec, 24 (2000) 63-66.
22. S. W. Golomb, Checker boards and polyominoes, Amer. Math. Monthly, vol. 61, n. 10 (1954) 675-682.
23. J. M. Hammersley, Percolation processes II: the connective constant, Proc. Cambridge. Philos. Soc., 53 (1957) 642-645.
24. D. Kim, The number of convex polyominoes with given perimeter, Discrete Math. 70 (1988) 47-51.
25. B. D. McKay, Isomorph-free exhaustive generation, J. Algorithms 26 (1998) 306-324.
26. D. H. Redelmeier, Counting polyominoes: yet another attack, Discrete Math., 36 (1981) 191-203.
27. S. Rinaldi and D. G. Rogers, How the odd terms in the Fibonacci sequence stack up, Math. Gaz., to appear.
28. N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, published electronically at http://www.research.att.com/~njas/sequences/.
29. H. N. V. Temperley, Combinatorial problems suggested by the statistical mechanics of domains and of rubber-like molecules, Phys. review 2 103 (1956) 1-16.
30. J. West, Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1996) 247-262.
31. J. West, Generating trees and fordibben subsequences, Discrete Math. 157 (1996) 363-374.
32. n-2, Amer. Math. Monthly 104 (1997) 926-931.