✦ LIBER ✦

Arrangements of -sets with intersection constraints

✍ Scribed by Tao Jiang; Manley Perkel; Dan Pritikin

Book ID: 118737082
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 291 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Set Constraints with Intersection

✍ Witold Charatonik; Andreas Podelski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Set systems with union and intersection

Set systems with union and intersection constraints

✍ Dhruv Mubayi; Reshma Ramadurai 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Sets with Large Intersection Properties

✍ Falconer, K. J. 📂 Article 📅 1994 🏛 Oxford University Press 🌐 English ⚖ 793 KB

On systems of finite sets with constrain

On systems of finite sets with constraints on their unions and intersections

✍ Da-Lun Wang 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Intersection subgroups of complex hyperp

Intersection subgroups of complex hyperplane arrangements

✍ Luis Paris 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Let A be a central arrangement of hyperplanes in C n , let M(A) be the complement of A, and let L(A) be the intersection lattice of A. For X in L(A) we set A X = {H ∈ A: H ⊇ X}, and We call the images of these monomorphisms intersection subgroups of type X and prove that they form a conjugacy class

A Class of Hypergraph Arrangements with

A Class of Hypergraph Arrangements with Shellable Intersection Lattice

✍ Dmitry N. Kozlov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown