Talk:Packing problems

message: This article was nominated for deletion. The result was no consensus, but some merging/redirecting might be in order. For details, please see Wikipedia:Votes for deletion/MoreKarlScherer. -- BD2412 talk 00:36, July 14, 2005 (UTC)
This article was nominated for deletion a second time, this time kept outright, See Wikipedia:Votes for deletion/KarlSchererRevisited1. Sjakkalle (Check!) 09:16, 27 July 2005 (UTC)
thread_title:  VfD results 

message: Could someone with a large (by number of edits, not by time) edit history (so that it is obviously not Karl Scherer or friends) verify the maths examples in this article. They strike me as inaccurate and/or non-noteworthy and/or presented with Weasel words
~~~~ 21:15, 20 July 2005 (UTC)
replies: text: Why are you disputing these? Weren't they there a long time ago? Charles Matthews 10:05, 27 July 2005 (UTC)

text: Maybe I did not find the best packing but the first box I could put an extra disc is 2x238 after that each extra 238 gives me extra two balls...
This is very different from numbers in the article, could anyone provide a ref?  Tosha 23:24, 18 October 2005 (UTC)
thread_title:  Dubious-ness 

message: Where did the fact about Walter Stromquist proving something come from? I can't find it in the sources given. Leon math 23:44, 14 December 2006 (UTC)
thread_title:  Walter Stromquist 

message: Not a single reference or proof for any of these.  —Preceding unsigned comment added by 84.92.32.151 (talk) 21:09, 26 November 2007 (UTC)
thread_title:  Other known results 

message: After noticing some interest at the RD/M I have added a short description about the case of packing few balls into a ball (of whom I don't have references)... I thought it could be nice to have a complete description of an easy packing problem. NOw I wonder if maybe it should better be shortened...--pma (talk) 09:12, 30 April 2009 (UTC)
thread_title: balls inside a ball?

message: De Brujin's theorem, as stated,
de Bruijn's theorem: A box can be packed with a harmonic brick a × a b × a b c if the box has dimensions a p × a b q × a b c r for some natural numbers p, q, r (i.e., the box is a multiple of the brick.)
is obvious. Perhaps what is really meant is "if and only if?"  —Preceding unsigned comment added by 92.193.118.17 (talk) 09:59, 4 October 2009 (UTC)
thread_title:  de Bruijn's theorem: neccessary condition? 

message: The article says:
:Klarner's theorem: An a × b rectangle can be packed with 1 × n strips iff n | a or n | b.
No cite is given for the name "Klarner's theorem".  Is "Klarner" David A. Klarner?  
I added a citation of this theorem: .  But Wagon does not refer to the theorem as Klarner's; he cites it as a special case of a theorem of N. G. de Bruijn which may be the de Bruijn's theorem mentioned in this wikipedia article just after "Klarner's".
() cites to a book by Ross Honsberger.  Can someone confirm that this book really calls the theorem "Klarner's"?  Or is this just another Mathworld oddity?
—Dominus (talk) 16:19, 6 January 2010 (UTC)
replies: text: The cited source () does not bear out the attribution.  Honsberger credits Klarner, but does not refer to the result as "Klarner's theorem". I think this is a Mathworld neologism.  Klarner is indeed David A. Klarner.  Honsberger's cite is:  —Mark Dominus (talk) 07:16, 5 January 2012 (UTC)
thread_title:  "Klarner's" theorem 

message: Does wikipedia have any references to this same problem in 3d, and for arbitrary shapes?
Is there any algorithm to solve these problems, other than just "try all possibilities"? 87.194.84.113 (talk) 23:35, 9 May 2010 (UTC)
replies: text: Tetrahedron packing is one article I know of.  I know a lot about binary sphere packing (in Euclidean space), but haven't written anything for wiki.  What shapes are you interested in? --99of9 (talk) 05:54, 10 May 2010 (UTC)
thread_title:  Same problem in 3D 

message: This section is particularly sparse, and only talks about one special case. Could it possibly be fleshed out?Samineru (talk) 22:01, 1 March 2011 (UTC)
thread_title:  Rectangle Packing 

message: I believe the topic is important to have a wiki article on.
I also believe the implementation is unsatisfactory in part because: 1) no word in it of how the packings
presented were found;2) how they were proven (if at all).
Both items, especially, 2 are hard to present fully and they may be connected. (The article has some names of people
who prove optimalitry of some packings).
I would not expect any complete description on these,
but no word at all... that is too much
to not have (or too little to have) in a good article.
As to how some of the packings were found, I may suggest
an item
on which I've just written a wiki article Lubachevsky-Stillinger algorithm. This is certainly not the only one in existence, so go ahead and put a list of other
techniques.
But, as a matter of fact, I know that many of the 
optimal (proven or conjectured) packings,
e.g., of 91 congruent circles in a circle, were found first
with this very algorithm (and then confirmed
with other algorithms, which is usually much easier,
than to discover; some recent proof techniques are based on knowing the packing with high precision,
so discovering the packing numerically becomes, essentially, a first step of the proof). See
Curved Hexagonal Packings of Equal Disks in a Circle
http://www.math.ucsd.edu/~ronspubs/95_02_dense_packings.pdf
It was also fun to read a comment and its resolution
above on packing more than
2n unit diam circles in 2 times n rectangles.
That problem was one of many by Erdos. Does this article
mention that name?  Yes, but not emphatically
enough for a math genius of the 20th century.
(Remember notability requirement of wiki).
The mentioned above algorithm produces
the required packings (for some smaller n of course).
If I remember it correctly, for n=1000 you can exceed
2n by 7.
Lsalgo (talk) 04:18, 23 May 2011 (UTC)
thread_title:  No techniques, no proofs 

message: There does not seem to be any discussion of uniform 3D sphere packing on the English Wikipedia; as "sited" here it is only discussed on the German Wikipedia here, even though there is an English summary of research as of 1999 by Conway and Sloane here. Mark Hurd (talk) 07:54, 28 August 2012 (UTC)
replies: text: Sphere packing? Close-packing of equal spheres? —Tamfang (talk) 08:01, 28 August 2012 (UTC)
replies: text:  Yeah "not ... any" is a little strong. Specifically nothing seems to mention the "sausage collapse" after 55 spheres. Mark Hurd (talk) 13:00, 28 August 2012 (UTC)
thread_title:  Finite uniform 3D sphere packing 

message: What is unequal-sphere dimmer? Where I can read about it? Jumpow (talk) 13:11, 8 June 2016 (UTC)
thread_title:  unequal-sphere dimmers  

message: The first line of the article reads
"Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers."
Given the technical nature of the article, is it appropriate to have a template with links such as Optical illusion and Thinking outside the box?
104.228.101.152 (talk) 05:04, 16 March 2017 (UTC)
thread_title:  Is the puzzle template appropriate? 

message: O(a7/11) is not consistent with Wikipedia's other pages. It changed several decades ago. Thanks Paul Erdös  — Preceding unsigned comment added by 1.136.109.183 (talk) 09:22, 20 October 2021 (UTC)
thread_title: Untitled