Clumsy Packing of Polyominoes in Finite Space

Emma Miller; Mitchel O'Connor; Nathan Shank

REVIEW

Clumsy Packing of Polyominoes in Finite Space

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.06675 v1 pith:EM2JHDH3 submitted 2022-03-13 math.CO math.GN

Emma Miller , Mitchel O'Connor , Nathan Shank This is my paper · ORCID

classification math.COmath.GN

keywords packingclumsypolyominoesconsiderfiniteobjectobjectspack

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so that we can not fit another object. In this paper we consider clumsy packing of polyominoes in a finite spaces which must consider boundary conditions. We examine rectangle, $L$, $T$, and plus polyominoes of various sizes.

Discussion (0). Continue with ORCID to comment.

Pith tools