✦ LIBER ✦

Lattices of random sets and progressivity

✍ Scribed by B. Gail Ivanoff; Ely Merzbach; Ioana Schiopu-Kratina

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 322 KB
Volume: 22
Category: Article
ISSN: 0167-7152
DOI: 10.1016/0167-7152(94)00054-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattice random walks for sets of random

Lattice random walks for sets of random walkers. First passage times

✍ Katja Lindenberg; V. Seshadri; K. E. Shuler; George H. Weiss 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 637 KB

Stochastic homogenization and random lat

Stochastic homogenization and random lattices

✍ X. Blanc; C. Le Bris; P.-L. Lions 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Pairings from down-sets and up-sets in d

Pairings from down-sets and up-sets in distributive lattices

✍ D.E Daykin; A.J.W Hilton; D Miklós 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 835 KB

Representation of lattices by fuzzy sets

✍ Branimir Šešelja; Andreja Tepavčević 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 500 KB

Characterization problems for graphs, pa

Characterization problems for graphs, partially ordered sets, lattices, and families of sets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 909 KB

A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p

The random set and the cutting of random

The random set and the cutting of random fuzzy sets

✍ Qing-De Li 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 624 KB