Both the hexagonal and square lattices of spheres, when laminated, yield the FCC lattice, which is the unique optimal lattice packing of spheres. I think that it was recently proved that it is optimal amongst all packings, although there are 2^aleph-null optimal packings. (Proof: In the hexagonal lattice, there are two sets of `deep holes' in which we can rest another layer. Hence, a countably infinite string over the alphabet {1,2} can be encoded in an optimal lattice packing; there are 2^aleph-null such possibilities. Consequently, it is a lower bound on the number of optimal packings. Also, it is an upper bound, since it is the total number of arrangements of countably many spheres.) Sincerely, Adam P. Goucher http://cp4space.wordpress.com
----- Original Message ----- From: Bill Gosper Sent: 06/21/13 11:43 AM To: math-fun@mailman.xmission.com Subject: [math-fun] how to make a rhombic dodecahedon
I asked Neil if Kepler's sphere-stacking conjecture was about tetrahedral or square pyramids of cannonballs. He fooled with Mathematica briefly and said it doesn't matter <http://gosper.org/kepvor.png>. --rwg _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun