Covering rectangles by few monotonous polyominoes

DOI10.1007/s10474-023-01308-8OpenAlexW4322739076MaRDI QIDQ2694864

Yanyan Li

Publication date: 4 April 2023

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.09323

zbMATH Keywords

coveringpolyominorim hookminimal cardinalitylattice rectangleribbon tile

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50)

Related Items (2)

On enumeration and entropy of ribbon tilings ⋮ Piercing the Chessboard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Schensted algorithm for rim hook tableaux
• Quantum multiplication of Schur polynomials
• Ribbon tilings and multidimensional height functions
• Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
• Ribbon tile invariants
• How (Not) to Cut Your Cheese
• Covering Paths and Trees for Planar Grids

This page was built for publication: Covering rectangles by few monotonous polyominoes