Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
From MaRDI portal
Publication:2685328
DOI10.1016/j.disc.2022.113293OpenAlexW4313216067MaRDI QIDQ2685328
Publication date: 21 February 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.15216
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Perfect packing of \(d\)-cubes
- An algorithm for packing squares
- Perfect packings of squares using the stack-pack strategy
- Compactness theorems for geometric packings
- A note on three Moser's problems and two Paulhus' lemmas
- Perfect packing of cubes
- Perfect square packings
- A note on perfect packing of squares and cubes
- A note on perfect packing of \(d\)-dimensional cubes
- The Difference Between Consecutive Primes, II
- On packing of squares and cubes
This page was built for publication: Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)