✦ LIBER ✦

The Complete Intersection Theorem for Systems of Finite Sets

✍ Scribed by Rudolf Ahlswede; Levon H. Khachatrian

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 383 KB
Volume: 18
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1995.0092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Intersection Statements for Systems of S

Intersection Statements for Systems of Sets

✍ W.A Deuber; P Erdős; D.S Gunderson; A.V Kostochka; A.G Meyer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 320 KB

A family of r sets is called a 2-system if any two sets have the same intersection. Denote by F(n, r) the most number of subsets of an n-element set which do not contain a 2-system consisting of r sets. Constructive new lower bounds for F(n, r) are given which improve known probabilistic results, an

Families of Finite Sets in which No Inte

Families of Finite Sets in which No Intersection of ℓ Sets Is Covered by the Union of s Others

✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (

Completeness of LpSpaces and Radon–Nikod

Completeness of LpSpaces and Radon–Nikodym Theorems for Unbounded Finitely Additive Measures

✍ Wayne C Bell; John W Hagood 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Viro Method for the Construction of Real

Viro Method for the Construction of Real Complete Intersections

✍ F. Bihan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The Viro method is a powerful construction method of real nonsingular algebraic hypersurfaces with prescribed topology. It is based on polyhedral subdivisions of Newton polytopes. A combinatorial version of the Viro method is called combinatorial patchworking and arises when the considered subdivisi

A complete set of invariants for finite

A complete set of invariants for finite groups and other results

✍ Moshe Roitman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 448 KB

For a finite group G and a set Z c ( 1,2,..., n) let e,h 1) = C h(g) 0 et(g) 63 a.. 0 e,(g), SEG where G?) = g if i E I, a?) = 1 if i&Z. We prove, among other results, that the positive integers tr(e,(n, I, ) + ... + e,(n, I,))': n, r, k) 1, Zjz { l,..., n), 1 < II,1 < 3 for 1 1 and a set Z s { 1,2