Dissecting brick into bars

Details Dissecting brick into bars Dissecting brick into bars

2008-09-10

arxiv.org/abs/0809.1883v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dissecting brick into bars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dissecting brick into bars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dissecting brick into bars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473287