Neeldhara
  • About
  • Research
    • Overview
    • People
    • Publications
    • Surveys
  • Teaching
    • Courses
    • Materials
  • Lists
    • Puzzles
    • Bookmarks
  • Exposition
    • Talks
    • Videos
  • Events
  • Blog

#16. Covering a Cube Minus One Vertex

Published

17 Nov, 2023

(Back to course page.)

Link to Slides · Link to recording


Prompts for discussion:

  1. We saw during the discussion two different ways of covering the cube minus the origin with (d) hyperplanes: we can use the hyperplanes {xi=1},i=1,2,…,d\left\{x_i=1\right\}, i=1,2, \ldots, d{xi​=1},i=1,2,…,d, or the hyperplanes {x1+x2+⋯+xd=k},k=1,2,…,d\left\{x_1+x_2+\cdots+x_d=k\right\}, k=1,2, \ldots, d{x1​+x2​+⋯+xd​=k},k=1,2,…,d. Are there other ways? Can all the ways be counted?

  2. What happens if you are trying to avoid two points? Note that it now perhaps matters which two!


© 2022 • Neeldhara Misra • Credits •

 

Corrections? Please leave a comment here or a PR in this repository, thanks!

I’d rather be a failure at something I love than a success at something I hate.

George Burns

You live and you learn — at any rate, you live.

Douglas Adams

A problem worthy of attack proves its worth by fighting back.

Paul Erdos

×