home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!caen!uflorida!mailer.cc.fsu.edu!fsu1.cc.fsu.edu!rose
- From: rose@fsu1.cc.fsu.edu (Kermit Rose)
- Newsgroups: sci.math
- Subject: Re: ? Quick algorithm for random covering sets ?
- Message-ID: <1992Jul18.131603.26814@mailer.cc.fsu.edu>
- Date: 23 Jul 92 05:13:39 GMT
- References: <SQUASH.92Jul17215435@bourbaki.msri.org>
- Reply-To: rose@fsu1.cc.fsu.edu
- Organization: Florida State University
- Lines: 27
- News-Software: VAX/VMS VNEWS 1.3-4
-
- In article <SQUASH.92Jul17215435@bourbaki.msri.org>, squash@bourbaki.msri.org (Jonathan King) writes...
- >Do any of you have a suggestion for a "fast" algorithm which:
- > Given positive integers D > K > 2, the algorithm hands me K "random"
- >non-empty subsets of {1,...,D} whose union is all of {1,...,D} and with no
- >element common to all K sets.
- >
- >"Fast" doesn't have a technical definition here, -the algorithm needs to go
- >inside a deeply nested loop. "Random" isn't precise either but at least the
- >probability that element d is in set S_k should be close to independent of d.
- >
- >I'm looking for a easily-programmable, practical algorithm, even if it has
- >theoretical shortcomings. -Jonathan, squash@math.ufl.edu
-
- There should be real numbers b_1,b_2,...b_K with the property that
- the sequences
- {[b_1],[2 b_1],[3 b_1],....}
- {[b_2],[2 b_2],[3 b_2],...}
- ..
- {[b_K],[2 b_K],[3 b_K],...} have pairwise null intersection.
- [x] means largest integer less than or equal to x.
-
- I do not remember how to find these numbers. The value of D is not
- relevant since the b's are the same for all D.
-
- rose@fsu1.cc.fsu.edu To be sure I see your response, use e-mail.
- -----------------------------------------------------------------------
- Be of good cheer, for it is much more fun than being depressed.
-