tag:blogger.com,1999:blog-3722233.post9145027051389455599..comments2015-02-27T03:52:50.747-06:00Comments on Computational Complexity: A New application of Ramsey Theory to a Geometry problemLance Fortnowhttps://plus.google.com/101693130490639305932noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-3722233.post-64960096280423547012013-01-25T10:11:45.455-06:002013-01-25T10:11:45.455-06:00(this is actually GASARCH but I am having a hard t...(this is actually GASARCH but I am having a hard time using my<br />google account today)<br /><br />1) I improved the results- the exp of loglog n is now 1/186 and<br />1/396.<br /><br />2) Using a paper of Shelah I am sure I can get (log n)^c for some c.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-19846367366138912802013-01-23T19:57:51.002-06:002013-01-23T19:57:51.002-06:00Anonymous coward is so awesome at math, he doesn&#...Anonymous coward is so awesome at math, he doesn't even need correct English! Clearly, his "results" are also so awesome that he doesn't even need to identify them, much less himself!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-32229407921004640932013-01-23T17:50:39.590-06:002013-01-23T17:50:39.590-06:00yeah, unfortunately, you're what we call a dum...yeah, unfortunately, you're what we call a dumb trollAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-56566425373125324502013-01-23T11:23:14.175-06:002013-01-23T11:23:14.175-06:00What do you mean? Sam and I have a result, and the...What do you mean? Sam and I have a result, and the paper is linked to.GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.comtag:blogger.com,1999:blog-3722233.post-69087071275934423202013-01-22T22:23:16.390-06:002013-01-22T22:23:16.390-06:00yeah, unfortunately, that's not wat it used to...yeah, unfortunately, that's not wat it used to mean anymore about getting some results. It's kinda cliche nowadays. but nice try nevertheless.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-74520276134649162002013-01-22T17:06:12.728-06:002013-01-22T17:06:12.728-06:00My above desc might not be clear so I claify here:...My above desc might not be clear so I claify here:<br /><br />h(a,n) is the largest number such that, given n points in <br />R^d, there will be h(a,n) of them such that all of<br />the distances between them are different.<br /><br />g(a,n) is the largest number such that, given n points in<br />R^d, there will be g(a,n) of them such that all of<br />the areas of triangles determined by 3 of them are different<br />(OH- the original points have to be no-three-colinear)GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com