Orange is three circles all touching each other (hexagonal close pack), or two circles touching each other and the outside (I have reedited this sentence for clarity).
Magenta is unconstrained.
Blue is special case that can only exist for N=2.
The rest are yellow.
The number of lines in the middle show the number of touchs (constraints, 0 to 6).
Not sure how multiple solutions are shown (e.g. N=6 has two solutions).
The pink ones are rattlers, that's all I could figure out. I thought orange vs yellow implied something about how tightly packed they were but that doesn't seem to hold up.
Maybe you're being facetious, but for a CNC operator they might find it useful in an unusual machining job- they probably stick with a hexagonal lattice and rectangular stock most of the time. Or a chip foundry might find it useful if they are maximize yields in a wafer of silicon.
It probably isn't immediately applicable to every single person's life but it might help some industries squeeze another 0.1% out of their production line. The free work presented here might cover a couple engineer's salaries once they find this website.
I find it most fascinating looking for the locally maximal densities. Starting from N=2, some arrangements always fall in a "satisfying" pattern and a locally optimal maximum density is achieved.
"The sequence of N's that establish density records" link leads to an empty page, but this sequence is also known as OEIS A084644 "Best packings of m>1 equal circles into a larger circle setting a new density record", and starts with 2, 3, 4, 7, 19, 37, 55, 85, 121, 147, 148, 150, 151, 187. https://oeis.org/A084644
Is there a proven bound so we know when the best known packing is the best possible packing? The lower numbers look very tidy and we've probably got the best possible packing for small N, but the larger numbers look like there may be room for improvement.
This is pretty important for modulation in digital communications. Interesting to see others than 2^N, and that 2^N are not square constellations, except for QPSK. Sometimes minimizing amplitude (envelope) variations is more important, or sometimes susceptibility to white noise or phase noise.
I remember learning about N-dimensional sphere packing for coding.
[+] [-] pavel_lishin|6 years ago|reply
http://hydra.nat.uni-magdeburg.de/packing/cci/d1.html
I see orange, blue, purple and yellow on the page; what do they signify?
[+] [-] robocat|6 years ago|reply
Magenta is unconstrained.
Blue is special case that can only exist for N=2.
The rest are yellow.
The number of lines in the middle show the number of touchs (constraints, 0 to 6).
Not sure how multiple solutions are shown (e.g. N=6 has two solutions).
[+] [-] Jabbles|6 years ago|reply
[+] [-] percentcer|6 years ago|reply
[+] [-] sizzzzlerz|6 years ago|reply
Legend:
N the number of circles; colors correspond to active researchers in the past, see "References" at the bottom of the page
[+] [-] lacker|6 years ago|reply
[+] [-] parsimo2010|6 years ago|reply
It probably isn't immediately applicable to every single person's life but it might help some industries squeeze another 0.1% out of their production line. The free work presented here might cover a couple engineer's salaries once they find this website.
[+] [-] H8crilA|6 years ago|reply
[+] [-] terminalhealth|6 years ago|reply
Also interesting that there are seemingly no solutions without loose circles beyond 91.
[+] [-] vesinisa|6 years ago|reply
"The sequence of N's that establish density records" link leads to an empty page, but this sequence is also known as OEIS A084644 "Best packings of m>1 equal circles into a larger circle setting a new density record", and starts with 2, 3, 4, 7, 19, 37, 55, 85, 121, 147, 148, 150, 151, 187. https://oeis.org/A084644
Look for example at N=1759: http://hydra.nat.uni-magdeburg.de/packing/cci/cci1759.html
Compare it with N=1758, which has a slight "imperfection": http://hydra.nat.uni-magdeburg.de/packing/cci/cci1758.html
Or with N=1760, which is too "tight" resulting in a worse density: http://hydra.nat.uni-magdeburg.de/packing/cci/cci1760.html
[+] [-] parsimo2010|6 years ago|reply
[+] [-] 1wd|6 years ago|reply
But the references section seems to be missing entry [24] for some reason.
[+] [-] sp332|6 years ago|reply
[+] [-] 2bitencryption|6 years ago|reply
First glance doesn't show anything obvious, but I'm no mathematician.
[+] [-] madengr|6 years ago|reply
I remember learning about N-dimensional sphere packing for coding.
[+] [-] raven105x|6 years ago|reply
[+] [-] dfeojm-zlib|6 years ago|reply
[+] [-] HeWhoLurksLate|6 years ago|reply