Ed, I think you got the gist of it. (You made some technical mistakes in your explanation, and answer to the point 2 is NO, to both subpoints. T is exact number of conflicting assemblies (including target assembly itself), and different Ts intersect.)
You should understand that this bound is trivial, and it doesn't take deep insight to come up with it (it was the first thing to check when you asked me for a specific low-overlap estimate/example, and I just wrote it down in that e-mail). From what you write, it seems that you are generally uncomfortable with math, and this problem required a little bit of familiarity with algorithms on graphs/discrete math. -- Vladimir Nesov [EMAIL PROTECTED] http://causalityrelay.wordpress.com/ ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=117534816-b15a34 Powered by Listbox: http://www.listbox.com
