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

Authors:
R. Ahlswede;H. Aydinian;L. Khachatrian
Affiliations:
Universität Bielefeld, Fakultät für Mathematik, Germany;Universität Bielefeld, Fakultät für Mathematik, Germany;Universität Bielefeld, Fakultät für Mathematik, Germany
Venue:
Combinatorica
Year:
2003

Citing 0
Cited 6

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

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

Designs, Codes and Cryptography
Intersection theorems under dimension constraints

Journal of Combinatorial Theory Series A
Projection-forcing multisets of weight changes

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and solve a natural geometrical extremal problem. For the set E(n,w) = {xn ∈ {0,1}n : xn has w ones } of vertices of weight w in the unit cube of ℝn we determine M (n,k,w) ≜ max{|Ukn ∩ E(n,w)|:Ukn is a k-dimensional subspace of ℝn. We also present an extension to multi-sets and explain a connection to a higher dimensional Erdős–Moser type problem.