Dissecting brick into bars
| dc.creator | Feshchenko, Ivan | |
| dc.creator | Radchenko, Danylo | |
| dc.creator | Radzivilovsky, Lev | |
| dc.creator | Tantsiura, Maksym | |
| dc.date | 2008-09-10 | |
| dc.date.accessioned | 2026-07-07T10:02:11Z | |
| dc.date.available | 2026-07-07T10:02:11Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0809.1883 | |
| dc.identifier | http://arxiv.org/abs/0809.1883 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168881 | |
| dc.subject | Combinatorics | |
| dc.title | Dissecting brick into bars | |
| dc.type | text |