✦ LIBER ✦

An Asymptotic Complete Intersection Theorem for Chain Products

✍ Scribed by Christian Bey; Konrad Engel

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 145 KB
Volume: 20
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1999.0285

No coin nor oath required. For personal study only.

✦ Synopsis

Let N (n, k) be the set of all n-tuples over the alphabet {0, 1, . . . , k} whose component sum equals . A subset F ⊆ N (n, k) is called a t-intersecting family if every two tuples in F have nonzero entries in at least t common coordinates. We determine the maximum size of a t-intersecting family in N λn (n, k) asymptotically for all fixed λ (0 < λ < k) and n → ∞.

📜 SIMILAR VOLUMES

Vanishing Theorems for Complete Intersec

Vanishing Theorems for Complete Intersections

✍ Craig Huneke; David A Jorgensen; Roger Wiegand 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 135 KB

The main focus of his paper was to understand when the tensor product M m N of finitely generated modules M and N over a regular local ring R R is torsion-free. This condition forces the vanishing of a certain Tor module associated with M and N, which in turn, by Auslander's famous R Ž . rigidity th

The Intersection Theorem for Direct Prod

The Intersection Theorem for Direct Products

✍ R. Ahlswede; H. Aydinian; L.H. Khachatrian 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A Product Theorem for Intersection Famil

A Product Theorem for Intersection Families

✍ Leonard J. Schulman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The Complete Intersection Theorem for Sy

The Complete Intersection Theorem for Systems of Finite Sets

✍ Rudolf Ahlswede; Levon H. Khachatrian 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

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 product theorem for row-complete Latin

A product theorem for row-complete Latin squares

✍ Jeff Higham 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

In this article it is shown how to construct a row-complete latin square of order mn, given one of order m and given a sequencing of a group of order n. This yields infinitely many new orders for which row-complete latin squares can be constructed.