Sciweavers

4 search results - page 1 / 1
» Counting polyominoes with minimum perimeter
Sort
View
COMBINATORICS
2006
122views more  COMBINATORICS 2006»
14 years 10 months ago
Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter
In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the ...
Winston C. Yang
DM
1998
66views more  DM 1998»
14 years 9 months ago
Steep polyominoes, q-Motzkin numbers and q-Bessel functions
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou...
IANDC
2008
76views more  IANDC 2008»
14 years 10 months ago
The number of convex permutominoes
Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this ...
Paolo Boldi, Violetta Lonati, Roberto Radicioni, M...