✦ LIBER ✦

Consensus-based partitions in the space of ordered partitions

✍ Scribed by Czeslaw Danilowicz; Ngoc Thanh Nguyen

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 353 KB
Volume: 21
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(88)90061-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The lattice theory of r-ordered partitio

The lattice theory of r-ordered partitions

✍ Michel Serfati 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 934 KB

This paper deals with ordered patitions of a set (indexed by some integer r) considered as 'natural' extensions of subsets, mainly from the lattice theory viewpoint (secondary, ring theory aspects). The present theory is in fact a (complete) set-theoretical realization of general Post algebras. This

Order-matchings in the partition lattice

✍ Murali K Srinivasan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Partitions of the 8-dimensional vector s

Partitions of the 8-dimensional vector space over GF(2)

✍ S. El-Zanati; O. Heden; G. Seelinger; P. Sissokho; L. Spence; C. Vanden Eynden 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

Let V = V(n,q) denote the vector space of dimension n over GF(q). A set of subspaces of V is called a partition of V if every nonzero vector in V is contained in exactly one subspace of V. Given a partition P of V with exactly a i subspaces of dimension i for 1 ≤ i ≤ n, we have n i=1 a i (q i -1) =

Ordered and unordered random partitions

Ordered and unordered random partitions of an integer and the GEM distribution

✍ Masaaki Sibuya; Hajime Yamato 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 361 KB

On partitions of the q-ary Hamming space

On partitions of the q-ary Hamming space into few spheres

✍ Andreas Klein; Markus Wessler 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract In this paper, we present a generalization of a result due to Hollmann, Körner, and Litsyn [9]. They prove that each partition of the __n__‐dimensional binary Hamming space into spheres consists of either one or two or at least __n__ + 2 spheres. We prove a __q__‐ary version of that gap

Chains in the lattice of noncrossing par

Chains in the lattice of noncrossing partitions

✍ Paul H. Edelman; Rodica Simion 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 735 KB

The lattice of noncrossing set partitions is known to admit an R-labeling. Under this labeling, maximal chains give rise to permutations. We discuss structural and enumerative properties of the lattice of noncrossing partitions, which pertain to a new permutation statistic, m(a), defined as the num