Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COMBINATORICS
2000

favoriteEmaildiscussreport

61views more COMBINATORICS 2000»

Where the Typical Set Partitions Meet and Join

13 years 4 months ago

Where the Typical Set Partitions Meet and Join

Download www.combinatorics.org

The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability that the coarsest refinement of all pi 's is the finest partition {1}, . . . , {n} is shown to approach 0 for r = 2, and 1 for r 3. The probability that the finest coarsening of all pi 's is the one-block partition is shown to approach 1 for every r 2.

Boris Pittel

Real-time Traffic

Coarsest Refinement | COMBINATORICS 2000 | Finest Partition | Set Partitions |

claim paper

Related Content

» On Spatially Partitioned Temporal Join

» Optimal splitters for database partitioning with size bounds

» Epsilon Grid Order An Algorithm for the Similarity Join on Massive HighDimensional Data

» Size Separation Spatial Join

» Hjoin decomposable graphs and algorithms with runtime single exponential in rankwidth

» SCOPE easy and efficient parallel processing of massive data sets

» Mining Association Rules from Stars

» Proximity Rank Join

» Splitting Ratios Metric Details of Topological LineLine Relations

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COMBINATORICS
Authors	Boris Pittel

Comments (0)