University of Cambridge > Talks.cam > Combinatorics Seminar > Intersection sizes of linear subspaces with the hypercube

Intersection sizes of linear subspaces with the hypercube

Add to your list(s) Download to your calendar using vCal

  • User Carla Groenland (University of Oxford)
  • ClockThursday 07 November 2019, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

What are the possible intersection sizes that a k-dimensional subspace can have with the vertices of the n-dimensional hypercube (in Euclidean space)? Melo and Winter [arXiv:1712.01763, 2017] conjectured that all intersection sizes larger than 2 to the {k-1} (the “large” sizes) are of the form 2 to the {k-1} + 2 to the i. We show that this is almost true: the large intersection sizes are either of this form or of the form 35·2 to the {k-6} . We also disprove a second conjecture of Melo and Winter by proving that a positive fraction of the “small” values is missing. Joint work with Tom Johnson

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity