Tiling without a subspace complement: a sharp counterexample in dimension nine over the field with two elements
math.CO, math.CA
Submitted: 2026-10-30
Updated: 2026-10-30
Comments: 28 pages, 3 tables, no figures; includes a comparison appendix and ancillary Python verification scripts and data
Code: https://github.com/dvgyl/math-and-theory
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: We construct an explicit 64-point subset of F 2 9 which tiles by translation but has no linear-subspace tiling complement.
Abstract
We construct an explicit 64-point subset of F 2 9 which tiles by translation but has no linear-subspace tiling complement. Together with our earlier dimension-eight theorem and a product argument, this shows that every nonempty tile in F 2 d has a linear-subspace complement precisely when d at most8. The example is spectral, so it is not a counterexample to Fuglede's conjecture. Its construction uses six three-dimensional subspaces of F 2 6, specified by a small table. We classify all its tiling complements and spectra: there are exactly 512 complements and 64 spectra, with one translation class of each. Every spectrum has normalized Wiener norm 15/8. An appendix proves that Goyal's related construction is affinely inequivalent but has the same tiling complements and spectra. The construction and both classifications are proved from first principles. We also give elementary proofs of the positive assertion in dimensions at most seven and for all tile sizes other than sixteen in dimension eight. The remaining case uses our previously established theorem based on the classification of perfect binary codes of length fifteen.
Sources
- Fuglede's conjecture holds in eight dimensions over the field with two elements
- Fuglede's conjecture holds in F p d for p=2,,d=8 and p=11,,d=3
- Periodicity of tiles in finite Abelian groups
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality