When lattice cubes meet affine subspaces: a short note
Combinatorics
2019-09-13 v2 Computational Geometry
Abstract
We give short and simple proofs of what seem to be folklore results: * the maximum cardinality of the intersection of a lattice cube with an affine subspace; * the minimum number of affine subspaces needed to cover a lattice cube.
Keywords
Cite
@article{arxiv.1909.03542,
title = {When lattice cubes meet affine subspaces: a short note},
author = {Lê Thành Dũng Nguyên},
journal= {arXiv preprint arXiv:1909.03542},
year = {2019}
}
Comments
2 pages