Sperner theory
Forbidden (0,1)-Vectors in Hyperplanes of \Bbb{R}n: The Restricted Case
Designs, Codes and Cryptography
Intersection theorems under dimension constraints
Journal of Combinatorial Theory Series A
On Security of Statistical Databases
SIAM Journal on Discrete Mathematics
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
Hi-index | 0.01 |
In this paper, we continue our investigation on "Extremal problems under dimension constraints" introduced [1]. The general problem we deal with in this paper can be formulated as follows. Let$$\mathbb{U}$$ be an affine plane of dimension k in$$\mathbb{R}^{n}$$. Given$$F \subset E(n) {\buildrel = \over \Delta} \{0, 1\}^{n} \subset \mathbb{R}^{n}$$ determine or estimate$$\max \left\{|{\cal U} \cap E(n)|: {\cal U} \cap F = {\O}\right\}$$.Here we consider and solve the problem in the special case where$${\cal U}$$ is a hyperplane in$$\mathbb{R}^{n}$$ and the "forbidden set"$$F = E(n,k) {\buildrel = \over \Delta} \left\{x^{n} \in E(n): x^{n} \hbox{has} k \hbox{ones}\right\}$$. The same problem is considered for the case, where$$\mathbb{U}$$ is a hyperplane passing through the origin, which surprisingly turns out to be more difficult. For this case we have only partial results.