We study Hoeffding decomposable exchangeable sequences with values in a finite set D = {d1, . . . , dK}. We provide a new combinatorial characterization of Hoeffding decomposability and use this result to show that, for every K ≥ 3, there exists a class of neither Pólya nor i.i.d. D-valued exchangeable sequences that are Hoeffding decomposable.

The purpose of this study is to determine critical environmental parameters of soil K availability and to quantify those contributors by using a proposed path model. In this study, plot experiments were designed into different treatments, and soil samples were collected and further analyzed in laboratory to investigate soil properties influence on soil potassium forms (water soluble K, exchange...

Total body potassium determined by whole-body monitoring and exchangeable body potassium estimated with (43)K were measured simultaneously in 12 patients with stable chronic renal failure. Values for the exchangeable potassium were obtained after equilibration periods of 24, 48, and 64 hours. The exchangeable body potassium, expressed as a percentage of the total body potassium (mean +/- S.E. o...

Call a random partition of the positive integers partially exchangeable if for each finite sequence of positive integers n l , . . . , nk, the probability that the partition breaks the first nl + . . . § nk integers into k particular classes, of sizes nl . . . . , nk in order of their first elements, has the same value p(na . . . . . nk) for every possible choice of classes subject to the sizes...

Consider two exchangeable sequences (Xk)k2N and (X̂k)k2N with the property that Sn P n k=1 Xk and Ŝn P n k=1 X̂k have the same distribution for all n 2 N. David Aldous posed the following question. Does this imply that the two exchangeable sequences have the same joint distributions? We give an example that shows the answer to Aldous' question is, in general, in the negative. On the other hand, w...

We study k-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer k = 1, 2, . . .. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for k > 1, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is ne...

We study k-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer k = 1, 2, . . .. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for k > 1, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is ne...