X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: f996b,1c2897ed56918deb X-Google-Attributes: gidf996b,public X-Google-ArrivalTime: 2001-09-19 15:33:04 PST Path: archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!newsfeed.berkeley.edu!news-hog.berkeley.edu!ucberkeley!xmission!news.stealth.net!news.cc.tut.fi!uutiset.saunalahti.fi!not-for-mail From: Ilmari Karonen Newsgroups: alt.ascii-art Subject: Re: Mike Throll 5 Date: 19 Sep 2001 22:32:48 GMT Organization: (dis)Order of the Holy Spoon (or whatever) Lines: 66 Message-ID: <1000936949.850@itz.pp.sci.fi> References: <3ba5bac8.2311763@News.CIS.DFN.DE> <9o5cf9$m7f$1@news.fas.harvard.edu> <3ba710ac.2496292@News.CIS.DFN.DE> <1000823107.6971@itz.pp.sci.fi> <9oachv$795$1@news.fas.harvard.edu> Reply-To: Ilmari Karonen NNTP-Posting-Host: simpukka.saunalahti.fi X-Trace: tron.sci.fi 1000938768 21969 195.74.0.20 (19 Sep 2001 22:32:48 GMT) X-Complaints-To: newsmaster@saunalahti.fi NNTP-Posting-Date: 19 Sep 2001 22:32:48 GMT User-Agent: postit.pl 0.05 Xref: archiver1.google.com alt.ascii-art:7675 In article <9oachv$795$1@news.fas.harvard.edu>, uncle monty wrote: >Ilmari Karonen wrote: >: In article <3ba710ac.2496292@News.CIS.DFN.DE>, Timofei Shatrov wrote: >:>On 17 Sep 2001 17:38:49 GMT, uncle monty tried to >:>confuse everyone with this message: >:> >:>>Given an initial separation of the plane RxR into a subset A and not-A, >:>>and an iterative process which at each step assigns membership in A to >:>>each point outside A whose circular neighbourhood of radius 1 has a >:>>greater intersection with A than with not-A, and removes each point >:>>previously within A whose circular neighbourhood of radius 1 has a greater >:>>intersection with not-A than with A, is it possible to choose initial A >:>>such that its area will increase by a factor of 1000 or more during the >:>>process? > >:>>I imagine it is some >:>>impossible fractal shape to begin with. >:> >:>No way. It's not very complicated. Just try to invent blot that can increase and >:>then magic word "asymptotics". My original idea was simply a ring with inner radius R and outer radius R+0.5+epsilon, for some humongous value of R and the smallest value of epsilon you can get away with. It's obvious that such a ring will get thicker as it shrinks, but unfortunately it's not at all obvious if its area will increase or not. And just to add to the frustration, after struggling with the trig and computing the hard parts by brute force, it seems I still don't know. Yes, the area appears to increase, but very slightly, and I'm not sure if the possible increase has an upper bound or not. >Well, I found a blot that can increase, but not a thousand-fold... take a >very large "sheet" of ink and punch holes in it, with diameter slightly >less than 1/sqrt(2pi)... unless they are spaced too close together they >will all be filled after one generation, while only the outer edge of the >whole sheet will have started degrading... am I on the right track? Hmm.. you just gave me an idea. Take one big blot. Fill it with N > 1 large circular holes, just far enough apart not to disturb each other's shrinking. Now fill the *remaining* blot with smaller circular holes, and repeat until the holes get too small. Now your blot is a fractal foam. If you make it big enough, I see no reason why you couldn't get an arbitrarily high area increase. Not that I could prove this either, but I'm a lot more confident in making that conjecture than with any of my previous ideas. Of course, if there's a non-fractal answer, as Timofei seems to imply above, I still have no idea what it could be. ObAscii: foam _..._ _ __ ./' `\,---.-'"".--.(_) /" "\ ,' .'"`. ." / .--: : __: _ ; | `._.'-( _: ( )__.7' (_)_./ -'-._ ; `.(_)-"`--'-. ; ,--.|-. .--".--. /_ .---(_)/ ;_ | : ; `; ;(_)--`-. `;-.(_)-'--' -- . _, .. j u s t. h o w l.i n g i n .t h e n.i g h t .. ._, . , )'' . /\_ . ' ,/\ . , ``( , _\__/ |__.'\._______,--;_'_`-.___,.______,/_,_`.__,-.__'__,/`-._,_| \____ ,_f_)\. Ilmari Karonen iltzu@sci.fi http://www.sci.fi/~iltzu/ /(_|_,.