Bárány, I;
Frankl, P;
(2021)
How (Not) to Cut Your Cheese.
The American Mathematical Monthly
, 128
(6)
pp. 543-552.
10.1080/00029890.2021.1901463.
Preview |
Text
BaFrMonthly.pdf - Accepted Version Download (278kB) | Preview |
Abstract
It is well known that a line can intersect at most 2n−1 unit squares of the n × n chessboard. Here we consider the three-dimensional version: how many unit cubes of the 3-dimensional cube [0,n]3 can a hyperplane intersect?
| Type: | Article |
|---|---|
| Title: | How (Not) to Cut Your Cheese |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1080/00029890.2021.1901463 |
| Publisher version: | https://doi.org/10.1080/00029890.2021.1901463 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10130253 |
Downloads since deposit
59Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months
Archive Staff Only
 |
View Item |
