The size of maximal systems of brick islands

Details The size of maximal systems of brick islands The size of maximal systems of brick islands

2010-10-21

arxiv.org/abs/1010.4578v1

Mathematics

Combinatorics

12 pages

Scientific paper

For integers $m_1,...,m_d>0$ and a cuboid $M=[0,m_1]\times ... \times [0,m_d]\subset \mathbb{R}^d$, a brick of $M$ is a closed cuboid whose vertices have integer coordinates. A set $H$ of bricks in $M$ is a system of brick islands if for each pair of bricks in $H$ one contains the other or they are disjoint. Such a system is maximal if it cannot be extended to a larger system of brick islands. Extending the work of Lengv\'{a}rszky, we show that the minimum size of a maximal system of brick islands in $M$ is $\sum_{i=1}^d m_i - (d-1)$. Also, in a cube $C=[0,m]^d$ we define the corresponding notion of a system of cubic islands, and prove bounds on the sizes of maximal systems of cubic islands.

Affiliated with

Also associated with

No associations

Rating

The size of maximal systems of brick islands 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 The size of maximal systems of brick islands, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The size of maximal systems of brick islands will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658853