Pick's Blocks

Geometry Level 5

Let a unit block polyhedron be a polyhedron made entirely out of unit cubes, in which all of its border (exterior) edges are connected to exactly two faces, and in which there are no topological holes or hollow parts.

For example, the polyhedron that is a 2 2 x 2 2 x 2 2 cube with additional unit blocks attached on the top, left front wall, and right front wall, as pictured at right, would be one example of a unit block polyhedron.

This particular unit block polyhedron has 11 11 unit cubes, 72 72 border edges, 6 6 interior edges, and 1 1 interior point.

If the relationship between the volume V V , the number of border edges B e B_e , the number of interior edges I e I_e , and the number of interior points I p I_p for any unit block polyhedron is V = a B e + b I e + c I p + d , V = aB_e + bI_e + cI_p + d, find a + b + c + d a + b + c + d .


Bonus: Prove this relationship for all unit block polyhedra.


The answer is -0.375.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

David Vreken
Feb 14, 2018

Since we are solving for 4 4 variables a a , b b , c c , and d d , we can use 4 4 equations to solve the system. With the given example, since V = 11 V = 11 , B e = 72 B_e = 72 , I e = 6 I_e = 6 , and I p = 1 I_p = 1 , we have 1 1 equation 11 = 72 a + 6 b + c + d 11 = 72a + 6b + c + d . An additional 3 3 equations are needed, and differently sized cubes are sufficient examples.

A unit cube has V = 1 V = 1 , B e = 12 B_e = 12 , I e = 0 I_e = 0 , and I p = 0 I_p = 0 , and so 1 = 12 a + d 1 = 12a + d ; a 2 2 x 2 2 x 2 2 cube has V = 8 V = 8 , B e = 48 B_e = 48 , I e = 6 I_e = 6 , and I p = 1 I_p = 1 , and so 8 = 48 a + 6 b + c + d 8 = 48a + 6b + c + d ; and a 3 3 x 3 3 x 3 3 cube has V = 27 V = 27 , B e = 108 B_e = 108 , I e = 36 I_e = 36 , and I p = 8 I_p = 8 , and so 27 = 108 a + 36 b + 8 c + d 27 = 108a + 36b + 8c + d . Solving this system of 4 4 equations gives a = 1 8 a = \frac{1}{8} , b = 1 2 b = \frac{1}{2} , c = 1 2 c = -\frac{1}{2} , and d = 1 2 d = -\frac{1}{2} , and a + b + c + d = 1 8 + 1 2 1 2 1 2 = 3 8 = 0.375 a + b + c + d = \frac{1}{8} + \frac{1}{2} - \frac{1}{2} - \frac{1}{2} = -\frac{3}{8} = \boxed{-0.375} .


This relationship V = 1 8 B e + 1 2 I e 1 2 I p 1 2 V = \frac{1}{8}B_e + \frac{1}{2}I_e - \frac{1}{2}I_p - \frac{1}{2} can be proved inductively for all unit block polyhedra. If we assume the relationship is true for one unit block polyhedra, then all the possible ways of adding 1 1 unit block will result in changes to the number of border edges B e B_e , the number of interior edges I e I_e , and the number of interior points I p I_p in such a way that according to the formula, the volume V V will always increase by 1 1 .

There are 6 6 cases to examine:

(1) Adding 1 1 unit block so that 1 1 face is shared. Then B e B_e would increase by 8 8 , so V V would increase by 1 8 8 + 1 2 0 1 2 0 = 1 \frac{1}{8} \cdot 8 + \frac{1}{2} \cdot 0 - \frac{1}{2} \cdot 0 = 1 .

(2) Adding 1 1 unit block so that 2 2 adjacent faces are shared. Then B e B_e would increase by 4 4 and I e I_e would increase by 1 1 , so V V would increase by 1 8 4 + 1 2 1 1 2 0 = 1 \frac{1}{8} \cdot 4 + \frac{1}{2} \cdot 1 - \frac{1}{2} \cdot 0 = 1 .

(3) Adding 1 1 unit block so that 3 3 adjacent faces around a corner are shared. Then I e I_e would increase by 3 3 and I p I_p would increase by 1 1 , so V V would increase by 1 8 0 + 1 2 3 1 2 1 = 1 \frac{1}{8} \cdot 0 + \frac{1}{2} \cdot 3 - \frac{1}{2} \cdot 1 = 1 .

(4) Adding 1 1 unit block so that 3 3 adjacent faces in a row are shared. Then I e I_e would increase by 2 2 , so V V would increase by 1 8 0 + 1 2 2 1 2 0 = 1 \frac{1}{8} \cdot 0 + \frac{1}{2} \cdot 2 - \frac{1}{2} \cdot 0 = 1 .

(5) Adding 1 1 unit block so that 4 4 adjacent faces around 2 2 corners are shared. Then B e B_e would decrease by 4 4 , I e I_e would increase by 5 5 , and I p I_p would increase by 2 2 , so V V would increase by 1 8 ( 4 ) + 1 2 5 1 2 2 = 1 \frac{1}{8} \cdot (-4) + \frac{1}{2} \cdot 5 - \frac{1}{2} \cdot 2 = 1 .

(6) Adding 1 1 unit block so that 5 5 faces are shared. Then B e B_e would decrease by 8 8 , I e I_e would increase by 8 8 , and I p I_p would increase by 4 4 , so V V would increase by 1 8 ( 8 ) + 1 2 8 1 2 4 = 1 \frac{1}{8} \cdot (-8) + \frac{1}{2} \cdot 8 - \frac{1}{2} \cdot 4 = 1 .

(Note that adding 1 1 unit block so that 2 2 opposite faces are shared is not allowed since it would form a polyhedron with a hole in it, adding 1 1 unit block so that 4 4 adjacent faces in a row are shared is not allowed since it either assumes a starting polyhedron with a hole in it or it would form a polyhedron that is hollow, and adding 1 1 unit block so that 6 6 faces are shared is not allowed because it assumes a starting polyhedron that is hollow.)

This is really interesting. So far you've found Pick's theorem for both the regular 2D tesselation consisting of triangles and the 3D tesselation consisting of cubes. I think Pick's theorem works also for the hexagonal tesselation of the euclidian plane with the relationship : 1 4 B + 1 2 I 1 2 = A \frac{1}{4}B+\frac{1}{2}I-\frac{1}{2} = A which can be derived from the triangular one. Sadly only cubes can tesselate the euclidian space but when wondering whether a generalized version of Pick's theorem existed for dimension n n I stumbled upon this discussion in which someone seems to have proved it (in 1993.)

Romain Bouchard - 3 years, 3 months ago

Log in to reply

I'm glad you're enjoying these variations of Pick's Theorem as much as I am! I hadn't thought about a hexagonal variation of Pick's Theorem but I did verify the relationship you came up inductively (considering the 5 cases of adding a hexagon that shares 1, 2, 3, 4, and 5 adjacent sides).

I also did not realize someone had already discussed Pick's Theorem for higher dimensions in 1993. I stumbled upon this on my own when I wrote a blog article about it in 2016. In this blog article I also discuss a variation of Pick's Theorem that deals with holes in the polygon, which I may feature in a future question.

David Vreken - 3 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...