Intersection patterns of linear subspaces with the hypercube

Nolmar Melo, Andreas Winter

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Following a combinatorial observation made by one of us recently in relation to a problem in quantum information Nakata et al. (2017) [7], we study what are the possible intersection cardinalities of a k-dimensional subspace with the hypercube in n-dimensional Euclidean space. We also propose two natural variants of the problem by restricting the type of subspace allowed. We find that whereas every natural number eventually occurs as the intersection cardinality for some k and n, on the other hand for each fixed k, the possible intersections sizes are governed by severe restrictions. To wit, while the largest intersection size is evidently 2k, there is always a large gap to the second largest intersection size, which we find to be [Formula presented]2k for k≥2 (and 2k−1 in the restricted version). We also present several constructions, and propose a number of open questions and conjectures for future investigation.

Original languageEnglish
Pages (from-to)60-71
Number of pages12
JournalJournal of Combinatorial Theory, Series A
Volume164
DOIs
StatePublished - May 2019
Externally publishedYes

Keywords

  • Algebraic combinatorics
  • Hypercube
  • Linear subspace

Fingerprint

Dive into the research topics of 'Intersection patterns of linear subspaces with the hypercube'. Together they form a unique fingerprint.

Cite this