The Rand and Block Distances of Pairs of Set Partitions

DOI10.1007/978-3-642-25011-8_23MaRDI QIDQ3111658zbMATH OpenOpenAlexWikidataFDO

Authors Frank Ruskey, Jennifer Woodcock

Publication date 13 January 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25011-8_23

zbMATH Keywords

block distanceRand distance

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Partitions of sets (05A18)

Recommendations

• Counting and computing the Rand and block distances of pairs of set partitions
• Random partitions of a set with given number of blocks
• On the maximal multiplicity of block sizes in a random set partition
• On the number of distinct block sizes in partitions of a set
• The asymptotic number of set partitions with unequal block sizes
• Erdős-Ko-Rado theorems for set partitions with certain block size
• Random Set Partitions
• Some Probabilistic Aspects of Set Partitions
• Measures of distinctness for random partitions and compositions of an integer

Cited in

(3)

• Counting and computing the Rand and block distances of pairs of set partitions
• Maximum of the transfer distance to a given partition
• Monotonic entropies

This page was built for publication: The Rand and Block Distances of Pairs of Set Partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111658)