✦ LIBER ✦

Pairs of non-intersecting random flats

✍ Scribed by F. Affentranger

Publisher: Springer
Year: 1988
Tongue: English
Weight: 120 KB
Volume: 79
Category: Article
ISSN: 1432-2064
DOI: 10.1007/bf00319102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-intersecting paths, random tilings a

Non-intersecting paths, random tilings and random matrices

✍ Kurt Johansson 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 359 KB

New results on the enumeration of non-in

New results on the enumeration of non-intersecting random walks

✍ H.N.V. Temperley 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 874 KB

Pairs of complete intersections

✍ Michel André 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Intersection of random sequences

✍ G. P. Klimov; V. F. Matveev 📂 Article 📅 1986 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 270 KB

Intersections of Markov random sets

✍ John Hawkes 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 359 KB

Simultaneous intersection representation

Simultaneous intersection representation of pairs of graphs

✍ Tanenbaum, Paul J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB 👁 2 views

We characterize the pairs (G 1 , G 2 ) of graphs on a shared vertex set that are intersection polysemic: those for which the vertices may be assigned subsets of a universal set such that G 1 is the intersection graph of the subsets and G 2 is the intersection graph of their complements. We also cons