A method for cutting squares into distinct squares

DOI10.1016/S0166-218X(99)00158-4MaRDI QIDQ1961234zbMATH OpenWikidataFDO

Authors I. Gambini

Publication date 26 April 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00158-4

zbMATH Keywords

perfect squaressquaring squares

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Review text

Two algorithms are proposed to deal with the problem for cutting squares into distinct squares of integer sizes. The author also discusses some aspects of the solutions produced.

Cites work

• A Census of Planar Maps
• A lowest order simple perfect 2 X 1 squared rectangle
• A procedure for dissecting a rectangle into squares, and an example for the rectangle whose sides are in the ratio 2:1
• Compound Perfect Squares
• Counting non-isomorphic three-connected planar maps
• Simple perfect square-cylinders of low order
• Simple perfect squared square of lowest order

Cited in

(3)

• Which pivot to solve linear systems?
• POSSIBILITIES AND IMPOSSIBILITIES IN SQUARE-TILING
• An algorithm for deciding if a polyomino tiles the plane

This page was built for publication: A method for cutting squares into distinct squares

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