scientific article; zbMATH DE number 3664976

MaRDI QIDQ3863906zbMATH OpenFDO

Authors Ronald C. Read

Publication date 1980

zbMATH Keywords

cell-growth problemchessboardcominoesdimer problem

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Combinatorial aspects of tessellation and tiling problems (05B45)

Cited in

(6)

• The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions
• Generating functions for straight polyomino tilings of narrow rectangles
• The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams
• Mutually-recursive formulas for enumerating partitions of the rectangle
• An algorithm for counting domino tilings of a rectangular chessboard
• A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863906)