Generating functions for straight polyomino tilings of narrow rectangles

From MaRDI portal



Abstract: Let m,k be fixed positive integers. Determining the generating function for the number of tilings of an mimesn rectangle by kimes1 rectangles is a long-standing open problem to which the answer is only known in certain special cases. We give an explicit formula for this generating function in the case where m<2k. This result is used to obtain the generating function for the number of tilings of an mimesnimesk box with kimeskimes1 bricks.





Describes a project that uses

Uses Software






This page was built for publication: Generating functions for straight polyomino tilings of narrow rectangles

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