Forbidden (0,1)-Vectors in Hyperplanes of \Bbb{R}n: The Restricted Case

Authors:
R. Ahlswede;H. Aydinian;L. H. Khachatrian
Affiliations:
Fakultät Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615 Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, D-33501 Bielefeld, Germany;Fakultät Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615 Bielefeld, Germany
Venue:
Designs, Codes and Cryptography
Year:
2003

Citing 5
Cited 3

Non-trivial intersecting families

Journal of Combinatorial Theory Series A
The complete nontrivial-intersection theorem for systems of finite sets

Journal of Combinatorial Theory Series A
Sperner theory

Sperner theory
The complete intersection theorem for systems of finite sets

European Journal of Combinatorics
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace

Combinatorica

Forbidden (0,1)-vectors in Hyperplanes of $$\mathbb{R}^{n}$$: The unrestricted case

Designs, Codes and Cryptography
On Security of Statistical Databases

SIAM Journal on Discrete Mathematics
Bibliography of publications by Rudolf Ahlswede

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we continue our investigation on “Extremal problems under dimension constraint” introduced in [2].Let E(n, k) be the set of (0,1)-vectors in \Bbb{R}n with k one's. Given 1 ≤ m, w ≤ n let X ⊂ E(n, m) satisfy span (X) ∩ E(n, w) = ⊘. How big can |X| be?This is the main problem studied in this paper. We solve this problem for all parameters 1 ≤ m, w ≤ n and n n0(m, w).