partition

the sequence of finite sets whose coarsest partition is
required. These sets must be entered in the order under which only
consecutive sets may have non-empty intersection.


  The function computes the coarsest partition of 
a finite sequence of sets for which only consecutive sets may overlap. 

arith

Implement an efficient block Gibbs sampler with incomplete
data from a multinomial distribution taking values from the k
categories 1,2,...,k, where data are assumed to miss at random
and each missing datum belongs to one and only one of m
distinct non-empty proper subsets A1, A2,..., Am of 1,2,...,k
and the k categories are labelled such that only consecutive
A's may overlap.

partition: The Coarsest Partition of a Finite Sequence of Sets for Which Only Consecutive Sets May Overlap

Description

Usage

Arguments

Value

See Also

Examples