𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A classification theorem for diagrams of simplicial sets

✍ Scribed by W.G. dwyer; D.M. Kan

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
1003 KB
Volume
23
Category
Article
ISSN
0040-9383

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Dynkin diagram classification theorem
A Dynkin diagram classification theorem arising from a combinatorial problem
✍ Robert A. Proctor πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 646 KB

## Los .4ngrlrs. Caljf'orrlia 90024 A combinatorial-linear algebraic condition suflicient for a ranked partially ordered set to be rank unimodal and strongly Sperner is presented. The distributive lattices which satisfy this condition are classified. These lattices are indexed by Dynkin diagrams

An intersection theorem for systems of s
An intersection theorem for systems of sets
✍ A. V. Kostochka πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 346 KB πŸ‘ 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists

A decomposition theorem for Ο‡1-convex se
A decomposition theorem for Ο‡1-convex sets
✍ Marilyn Breen πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 830 KB

A set S in 1 :" is said to he X,-convex if and only if S does not contain a visually independent subset having cardinality h', . It is natural tts ask when an h',-convex set may be expressed as a countable unI.,n of convex sets. Here i! is proved that if S is a closed h',-convex set in the plane and

A theorem on families of sets
A theorem on families of sets
✍ Bernt LindstrΓΆm πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 171 KB