Dissecting a brick into bars

DOI10.1007/S10711-009-9413-YMaRDI QIDQ964201zbMATH OpenOpenAlexFDO

Authors Lev Radzivilovsky, Maksym Tantsiura, I. S. Feshchenko, Danylo V. Radchenko

Publication date 15 April 2010

Published in Geometriae Dedicata (Search for Journal in Brave)

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

zbMATH Keywords

dissections of parallelepipeds

Mathematics Subject Classification ID

Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Abstract: An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into finite number of bars iff the lengths of sides of the parallelepiped span a linear space of dimension no more than $k$ over $QQ$. This extends and generalizes a well-known theorem of Max Dehn about partition of rectangles into squares. Several other results about dissections of parallelepipeds are obtained.

Recommendations

• Dissecting Cuboids into Cuboids
• Concerning bricks
• Generating bricks
• Building reverse plane partitions with rim-hook-shaped bricks
• Brick partition problems in three dimensions
• Decomposing cubes into smaller cubes

Cites work

• Filling Boxes with Bricks
• Fourteen Proofs of a Result About Tiling a Rectangle
• scientific article; zbMATH DE number 637070 (Why is no real title available?)
• The dissection of rectangles into squares
• Tiling a square with similar rectangles
• Vorlesungen über Inhalt, Oberfläche und Isoperimetrie

Cited in

(5)

• Linear relations in dissections into \(n\)-dimensional parallelepipeds
• Trisecting a parallelogram
• Cutting polygons composed of equal rectangles into similar rectangles
• scientific article; zbMATH DE number 1752718 (Why is no real title available?)
• POSSIBILITIES AND IMPOSSIBILITIES IN SQUARE-TILING

This page was built for publication: Dissecting a brick into bars

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