Covering rectangles by few monotonous polyominoes
type: Item
instance of: scholarly article
title: Covering rectangles by few monotonous polyominoes
author: Yanyan Li
published in: Acta Mathematica Hungarica
publication date: 2023-04-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/2203.09323
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 05B50
Mathematics Subject Classification ID: 52B20
zbMATH DE Number: 7672139
zbMATH Keywords: polyomino
zbMATH Keywords: ribbon tile
zbMATH Keywords: rim hook
zbMATH Keywords: lattice rectangle
zbMATH Keywords: covering
zbMATH Keywords: minimal cardinality
MaRDI profile type: Publication
OpenAlex ID: W4322739076
cites work: How (Not) to Cut Your Cheese
cites work: Quantum multiplication of Schur polynomials
cites work: Q4313096
cites work: Q3735714
cites work: Q3952291
cites work: Covering Paths and Trees for Planar Grids
cites work: Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
cites work: Q4305245
cites work: Ribbon tile invariants
cites work: Ribbon tilings and multidimensional height functions
cites work: A Schensted algorithm for rim hook tableaux
DOI: 10.1007/S10474-023-01308-8
description: scientific article; zbMATH DE number 7672139