[math-fun] David's "27" packing
My conjecture that 31 might be the first rotationally symmetric set of radii inexpressible in radicals is on the ropes. Corey and I worked out the equations for David's 27 (http://www2.stetson.edu/~efriedma/cirRcir/), but Reduce can't solve them algebraically anytime soon. Good old FindIntegerNullVector and FindRoot (999 digits) quickly give degree 20 (again?!) polynomials for the radii of all but the light orange disks, where PSLQ complains: FindIntegerNullVector::lowpr: FindIntegerNullVector cannot find an integer null vector because of insufficient precision of the input. >> Even with 9999 digits. LatticeReduce comes to the rescue, and says it's just a 10th degree over sqrt3, like the other 5. Here is the mysterious radius, in case you want to experiment: Root[4782969 - 1111774572 #1 + 44221126878 #1^2 - 307992419388 #1^3 - 8070585578919 #1^4 + 90167866460064 #1^5 + 150017012821404 #1^6 - 1381565181544056 #1^7 - 2541769632528930 #1^8 - 12793102409225160 #1^9 - 16223229604493784 #1^10 + 99440200315651104 #1^11 + 127666170124763526 #1^12 + 245161940234004576 #1^13 + 448033243426240932 #1^14 + 23246278469793432 #1^15 - 14112704124290727 #1^16 + 448087696965684 #1^17 + 19969942229946 #1^18 + 37004992764 #1^19 + 11771761 #1^20 &, 13] ~0.1760155767437583601645544130545779438560210712086956361545336164666108949916301221 Note that this is the only size which is surrounded by six different sizes. Finally, for David's Sum(radii) metric, Out[23]= s == Root[772690429687389147028310024964029054460615661037074186965170657489148640157424 - 1252150034158679892073592213738221544763982273185101716937850019400615469267216 #1 + 894101646306967418990714166469728854086811534040961919825626454389349568482607 #1^2 - 370535002186753148816065781791793841373361064007009093917305796349950654837894 #1^3 + 98585499109277440100892024783571503674461841813340963516397348934746393551831 #1^4 - 17537282099175471585324919382047103164067402676914160496887027103365237985296 #1^5 + 2095329496883146641591880827676789201936700111609182408312499347314971125404 #1^6 - 162581406984533745130162686637360629662639564698220123332118975994424295496 #1^7 + 7315174101074478959948591907336518346543812578462103252159725113209934156 #1^8 - 110179967256584058265325808692517286196365022221976714892569942238719952 #1^9 - 5210786844166514462554894258016492610911648226017109091287319543880958 #1^10 + 235504976723519352232932797704723384517491437953853656479644035104764 #1^11 - 822038136083999158156413079062172274783684008146700851353930742942 #1^12 - 78272319479518900556761239891321970600088764432072085939114898288 #1^13 + 560802701967280190031324433718254607649684741002636396646811692 #1^14 + 8012926781889727306623190565874256627453257915557081010606840 #1^15 - 22160201351067819572752983769650479439077975537076544188276 #1^16 - 77873705468844592325047782942025877646289806118814532768 #1^17 + 173017798526655483804206798601616162580746057680701703 #1^18 \ + 10267478177298250805153325223822351093391050035930 #1^19 + 118755914270972677050504275876817937004163071 #1^20 &, 8] In[24]:= N[%[[2]], 22] Out[24]= 4.762847452755912443159 This factors over sqrt3, but Root won't accept noninteger polynomials. rwg>May[be] he was seeing double after attempting a cholecystectomy? According to www.rhinoresourcecenter.com/ref_files/1178936542.pdf (p5?): black rhinos don't have gallbladders. (I wonder if the prosectorium was secure against Chinese herbalists.) The rhinos probably turn black when all that leaking bile collects in their skin. Somebody should cross a monotreme with a marsupial and name it Monomial monomial. --rwg
In this interview: http://bigthink.com/benoitmandelbrot He mentions two forms for the Mandelbrot that are believed to be equivalent but are not proved to be so. He doesn't give the details - can anyone either explain in more detail or point me at the details ? I've tried looking on the web but failed to find the conjecture the he mentions... bye Dave
Extract from http://en.wikipedia.org/wiki/Mandelbrot_set << Douady and Hubbard have shown that the Mandelbrot set is connected. In fact, they constructed an explicit conformal isomorphism between the complement of the Mandelbrot set and the complement of the closed unit disk. Mandelbrot had originally conjectured that the Mandelbrot set is disconnected. This conjecture was based on computer pictures generated by programs which are unable to detect the thin filaments connecting different parts of M. Upon further experiments, he revised his conjecture, deciding that M should be connected.
It looks to me as if that interview is rather ancient. In particular, Mandelbrot died in October last year. WFL On 7/27/11, David Makin <makinmagic@tiscali.co.uk> wrote:
In this interview:
http://bigthink.com/benoitmandelbrot
He mentions two forms for the Mandelbrot that are believed to be equivalent but are not proved to be so. He doesn't give the details - can anyone either explain in more detail or point me at the details ? I've tried looking on the web but failed to find the conjecture the he mentions...
bye Dave _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
The interview is I think from March 23, 2010 - at least that's what it says , and the conjecture he mentions is nothing to do with connectedness AFAIK - rather he says it's concerning two alternative definitions of the Set. See from 8.30 to 10.40 in the "Full Interview". See around 9.40 into the "full interview". On 27 Jul 2011, at 03:28, Fred lunnon wrote:
Extract from http://en.wikipedia.org/wiki/Mandelbrot_set
<< Douady and Hubbard have shown that the Mandelbrot set is connected. In fact, they constructed an explicit conformal isomorphism between the complement of the Mandelbrot set and the complement of the closed unit disk. Mandelbrot had originally conjectured that the Mandelbrot set is disconnected. This conjecture was based on computer pictures generated by programs which are unable to detect the thin filaments connecting different parts of M. Upon further experiments, he revised his conjecture, deciding that M should be connected.
It looks to me as if that interview is rather ancient. In particular, Mandelbrot died in October last year.
WFL
On 7/27/11, David Makin <makinmagic@tiscali.co.uk> wrote:
In this interview:
http://bigthink.com/benoitmandelbrot
He mentions two forms for the Mandelbrot that are believed to be equivalent but are not proved to be so. He doesn't give the details - can anyone either explain in more detail or point me at the details ? I've tried looking on the web but failed to find the conjecture the he mentions...
bye Dave _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
The one time I attended a talk by Mandelbrot, I came away with a very low opinion of his verbal skills: whatever might have been going on in his mind, when he attempted to express it he seemed incapable of anything more than high-flown waffling. The interview you quoted does little to dispel this impression. I've no idea what the alternative definition he refers to might be; but it seems to me entirely possible that he was by this stage very unwell, and may simply have become confused. Happens to us all, eventually ... WFL On 7/27/11, David Makin <makinmagic@tiscali.co.uk> wrote:
The interview is I think from March 23, 2010 - at least that's what it says , and the conjecture he mentions is nothing to do with connectedness AFAIK - rather he says it's concerning two alternative definitions of the Set. See from 8.30 to 10.40 in the "Full Interview".
See around 9.40 into the "full interview".
On 27 Jul 2011, at 03:28, Fred lunnon wrote:
Extract from http://en.wikipedia.org/wiki/Mandelbrot_set
<< Douady and Hubbard have shown that the Mandelbrot set is connected. In fact, they constructed an explicit conformal isomorphism between the complement of the Mandelbrot set and the complement of the closed unit disk. Mandelbrot had originally conjectured that the Mandelbrot set is disconnected. This conjecture was based on computer pictures generated by programs which are unable to detect the thin filaments connecting different parts of M. Upon further experiments, he revised his conjecture, deciding that M should be connected.
It looks to me as if that interview is rather ancient. In particular, Mandelbrot died in October last year.
WFL
On 7/27/11, David Makin <makinmagic@tiscali.co.uk> wrote:
In this interview:
http://bigthink.com/benoitmandelbrot
He mentions two forms for the Mandelbrot that are believed to be equivalent but are not proved to be so. He doesn't give the details - can anyone either explain in more detail or point me at the details ? I've tried looking on the web but failed to find the conjecture the he mentions...
bye Dave _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
This is odd. I've been studying the Mandelbrot set off and on for a frighteningly long time (26 years). I listened to the interview and read the transcript (which has many errors, but is at bigthink.com/ideas/19207 ) and did some Google searches in case maybe I was missing something. Just to clarify the question, Mandelbrot said the following (I have corrected several errors in the transcript): *The conjecture itself consists in two definitions of Mandelbrot set - two alternative definitions which are too technical to describe without a blackboard, but which are both very simple and which I assumed naively to be equivalent. Why did I assume so? Because in the pictures I could not see any difference. Obtaining pictures in one way or another way, I couldn't tell them apart. Therefore, I assumed they were identical and I went on studying this beast. I found that, again, many interesting observations of which most were very confirmed by many other very, very skilled mathematicians. But the idea that these two conditions, definitions, are identical is still open. So there are two definitions of Mandelbrot set, the usual one and another one, and they may theoretically be different. People are getting close, but have not proven it completely.* The best I can do at connecting this statement to truth is as follows: The only thing that has been worked on extensively by "many very skilled mathematicians" who are "getting closer, but have not proven it completely" is the MLC conjecture, namely that the Mandelbrot set is locally connected. The Mandelbrot set is normally defined by the "z=0, iterate z'=z^2+c, see if it remains bounded" definition which can be implemented as a computer program. This is done by defining a c value for each pixel on the screen and computing the z values numerically. Using a modern programming model (like OpenCL), each pixel performs its own iteration, all pixels iterate in parallel, and if you have infinite patience (-: all pixels destined to "escape" will eventually do so. The Mandelbrot set is also sometimes defined as (using the wording on the Wikipedia page) "the limit set of a sequence of plane algebraic curves, the Mandelbrot curves, of the general type known as polynomial lemniscates". These curves are: L1: |c|=2, L2: |c^2+c|=2, L3: |(c^2+c)^2+c|=2, and so on. They form a set of "contour lines" which are seen in many early computer images, including some in Mandelbrot's 1986 book. They first few are illustrated (with formulas) here: http://en.wikipedia.org/wiki/File:Lemniscates5.png A Mandelbrot set image can be produced by plotting these curves, which needs to be done not by scanning pixels but by "walking" along the curve, using a numerical method similar to root-finding. So my guess at making sense of Mandelbrot's "conjecture" statement is that, the "limit of lemniscates" definition might imply MLC. In other words, if it can be shown that the lemniscates L1, L2, L3, ... converge on the boundary of the Mandelbrot set, then perhaps such a proof would also prove MLC. If so, then the MLC conjecture is equivalent to a conjecture that the two ways of drawing the Mandelbrot set (pixel scanning and tracing lemniscates) yield the same image, and Mandelbrot's statements would make sense. It's a stretch, but it's the best I can do. - Robert Munafo On Tue, Jul 26, 2011 at 21:18, David Makin <makinmagic@tiscali.co.uk> wrote:
In this interview:
http://bigthink.com/benoitmandelbrot
He mentions two forms for the Mandelbrot that are believed to be equivalent but are not proved to be so. He doesn't give the details - can anyone either explain in more detail or point me at the details ? I've tried looking on the web but failed to find the conjecture the he mentions...
bye Dave
-- Robert Munafo -- mrob.com Follow me at: gplus.to/mrob - fb.com/mrob27 - twitter.com/mrob_27 - mrob27.wordpress.com - youtube.com/user/mrob143 - rilybot.blogspot.com
Thanks Robert, I have a hunch that you are absolutely correct ! Whilst working on ways of speeding up 3D rendering years ago (essentially just for quaternions) one of the methods I tried was essentially based on the lemniscates (though I didn't know the term), this was before I even knew or realised that "distance estimation" could be applied to quaternions and used for controlled ray-stepping - at the time the ray-stepping I used was (my own) "delta DE" method which was simply based on numerical deltas in the smooth iteration values along a ray (very directional, required corrections). On 28 Jul 2011, at 06:36, Robert Munafo wrote:
This is odd. I've been studying the Mandelbrot set off and on for a frighteningly long time (26 years). I listened to the interview and read the transcript (which has many errors, but is at bigthink.com/ideas/19207 ) and did some Google searches in case maybe I was missing something.
Just to clarify the question, Mandelbrot said the following (I have corrected several errors in the transcript):
*The conjecture itself consists in two definitions of Mandelbrot set - two alternative definitions which are too technical to describe without a blackboard, but which are both very simple and which I assumed naively to be equivalent. Why did I assume so? Because in the pictures I could not see any difference. Obtaining pictures in one way or another way, I couldn't tell them apart. Therefore, I assumed they were identical and I went on studying this beast. I found that, again, many interesting observations of which most were very confirmed by many other very, very skilled mathematicians. But the idea that these two conditions, definitions, are identical is still open. So there are two definitions of Mandelbrot set, the usual one and another one, and they may theoretically be different. People are getting close, but have not proven it completely.*
The best I can do at connecting this statement to truth is as follows:
The only thing that has been worked on extensively by "many very skilled mathematicians" who are "getting closer, but have not proven it completely" is the MLC conjecture, namely that the Mandelbrot set is locally connected.
The Mandelbrot set is normally defined by the "z=0, iterate z'=z^2+c, see if it remains bounded" definition which can be implemented as a computer program. This is done by defining a c value for each pixel on the screen and computing the z values numerically. Using a modern programming model (like OpenCL), each pixel performs its own iteration, all pixels iterate in parallel, and if you have infinite patience (-: all pixels destined to "escape" will eventually do so.
The Mandelbrot set is also sometimes defined as (using the wording on the Wikipedia page) "the limit set of a sequence of plane algebraic curves, the Mandelbrot curves, of the general type known as polynomial lemniscates". These curves are:
L1: |c|=2, L2: |c^2+c|=2, L3: |(c^2+c)^2+c|=2,
and so on. They form a set of "contour lines" which are seen in many early computer images, including some in Mandelbrot's 1986 book. They first few are illustrated (with formulas) here: http://en.wikipedia.org/wiki/File:Lemniscates5.png A Mandelbrot set image can be produced by plotting these curves, which needs to be done not by scanning pixels but by "walking" along the curve, using a numerical method similar to root-finding.
So my guess at making sense of Mandelbrot's "conjecture" statement is that, the "limit of lemniscates" definition might imply MLC. In other words, if it can be shown that the lemniscates L1, L2, L3, ... converge on the boundary of the Mandelbrot set, then perhaps such a proof would also prove MLC. If so, then the MLC conjecture is equivalent to a conjecture that the two ways of drawing the Mandelbrot set (pixel scanning and tracing lemniscates) yield the same image, and Mandelbrot's statements would make sense.
It's a stretch, but it's the best I can do.
- Robert Munafo
On Tue, Jul 26, 2011 at 21:18, David Makin <makinmagic@tiscali.co.uk> wrote:
In this interview:
http://bigthink.com/benoitmandelbrot
He mentions two forms for the Mandelbrot that are believed to be equivalent but are not proved to be so. He doesn't give the details - can anyone either explain in more detail or point me at the details ? I've tried looking on the web but failed to find the conjecture the he mentions...
bye Dave
-- Robert Munafo -- mrob.com Follow me at: gplus.to/mrob - fb.com/mrob27 - twitter.com/mrob_27 - mrob27.wordpress.com - youtube.com/user/mrob143 - rilybot.blogspot.com _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
On Thu, Jul 28, 2011 at 1:36 AM, Robert Munafo <mrob27@gmail.com> wrote:
The Mandelbrot set is also sometimes defined as (using the wording on the Wikipedia page) "the limit set of a sequence of plane algebraic curves, the Mandelbrot curves, of the general type known as polynomial lemniscates". These curves are:
L1: |c|=2, L2: |c^2+c|=2, L3: |(c^2+c)^2+c|=2,
and so on. They form a set of "contour lines" which are seen in many early computer images, including some in Mandelbrot's 1986 book. They first few are illustrated (with formulas) here: http://en.wikipedia.org/wiki/File:Lemniscates5.png
So my guess at making sense of Mandelbrot's "conjecture" statement is that, the "limit of lemniscates" definition might imply MLC. In other words, if it can be shown that the lemniscates L1, L2, L3, ... converge on the boundary of the Mandelbrot set, then perhaps such a proof would also prove MLC. If so, then the MLC conjecture is equivalent to a conjecture that the two ways of drawing the Mandelbrot set (pixel scanning and tracing lemniscates) yield the same image, and Mandelbrot's statements would make sense.
Except that the statement that the leminscates converge to the boundary of the mandelbrot set is easily seen to be true. If a point is outside of Ln, then one of the iterates has norm > 2, and further iteration will increase the norm, so the point is not in the Mandelbrot set. And if a point is inside Ln for every n, then all the iterates lie within L1, so the iterates don't diverge, and the point is in the mandelbrot set. Here is a half-remembered, and possibly mangled, conjecture that two definitions both define the Mandelbrot set. Let f_c be the map f_c(z) = z^2 + c. And let f_c^n be the nth iterate of f_c. Among the points in the Mandelbrot set, we have at least the following points: A. Fixed points of iterates; Those points c for which f_c^n(0) = 0 for some n. B. Points in the basin of attraction of fixed points of iterates: Suppose there exist z and n for which f_c^n(z) = z, and |f_c^n'(z)| < 1. Then for points w sufficiently near z, the sequence f_c^(n*m)(w) converges to z. If 0 is sufficiently near z, then c is in the Mandelbrot set. More succinctly, these are the values c for which there exists an n such that lim_(m->infinity) f_c^nm(0) exists. C. The Mandelbrot set is closed, (it is the intersection of the closed sets |f_c^n(0)| < 100), so any set in the closure of A and B is in the Mandelbrot set. There could be another category I'm leaving out, but I think the unproved conjecture is that this is all there is, that is, that every point in the Mandelbrot set is in one of these 3 categories. But I don't see a good way to plot the points in category B, so I can't reconcile this with Mandelbrot's claim that the conjecture seemed to be true experimentally. Andy
participants (5)
-
Andy Latto -
Bill Gosper -
David Makin -
Fred lunnon -
Robert Munafo