Search Sciweavers | Sciweavers

4 search results - page 1 / 1

» Counting polyominoes with minimum perimeter

click to vote

ARSCOM
2008

153views more ARSCOM 2008»

Counting polyominoes with minimum perimeter

13 years 5 months ago

Download www.mathe2.uni-bayreuth.de

Sascha Kurz

claim paper

Read More »

click to vote

COMBINATORICS
2006

122views more COMBINATORICS 2006»

Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter

13 years 5 months ago

Download www.combinatorics.org

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

claim paper

Read More »

click to vote

DM
1998

66views more DM 1998»

Steep polyominoes, q-Motzkin numbers and q-Bessel functions

13 years 5 months ago

Download www.dsi.unifi.it

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...

claim paper

Read More »

click to vote

IANDC
2008

76views more IANDC 2008»

The number of convex permutominoes

13 years 5 months ago

Download homes.dsi.unimi.it

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...

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers