Searcharxiv⌕ Search

arXiv · 2610.36417

Fuglede's conjecture holds in eight dimensions over the field with two elements

Abstract

Fuglede's conjecture in a finite abelian group says that a nonempty subset tiles by translation if and only if it is spectral, meaning that the space of complex-valued functions on the subset has an orthogonal basis consisting of restrictions of group characters. We prove the conjecture in the eight-dimensional vector space over the field with two elements. In fact, every spectral set and every tile in this space has a tiling complement which is a linear subspace. We first prove that the Fourier support of a nonempty proper subset of density different from one half contains a two-dimensional subspace. Consequently, every spectral set of density one quarter has a subspace tiling complement. This gives a simpler proof of Kadowaki's dimension-seven result, replacing his use of the classification of Hadamard matrices of order 32 by the classical five classes of order 16. Our dimension-eight proof uses exact finite verifications involving Hadamard matrices of order 32 and perfect codes of length 15. We include the proofs of the reductions used from Kadowaki's preprint, so that neither positive result depends on his dimension-seven theorem. Finally, we give an elementary spectral example of density one eighth in dimension nine whose Fourier support contains no three-dimensional subspace. Thus, the Fourier-support argument at quarter density does not extend in this form to eighth density. Dimension nine is the only case still unresolved over the field with two elements, and this obstruction shows why the present Fourier-support method cannot resolve it as it stands.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuel J. Ferguson, Joshua Iosevich. 2026-10-26. Fuglede's conjecture holds in eight dimensions over the field with two elements. https://arxiv.org/abs/2610.36417

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A spanning tree model for chromatic homology

After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the chromatic polynomial. In this paper, we present a spanning tree model for the chromatic complex, i.e., we describe a chain complex generated by certain spanning trees of the graph that is chain homotopy equivalent to the chromatic complex. We employ the spanning tree model over $\mathcal{A}_m:= \frac{\mathbb{Z}[x]}{ }$ algebra to answer two open questions. First, we establish the conjecture posed by Sazdanovic and Scofield regarding the homological span of chromatic homology over $\mathcal{A}_m$ algebra, demonstrating that for any graph $G$ with $v$ vertices and $b$ blocks, the homological span is $v - b$. Additionally, we prove a conjecture of Helme-Guizon, Przytycki, and Rong concerning the existence of torsion of order dividing $m$ in chromatic homology over $\mathcal{A}_m$ algebra.

math.CO↗

Total eight-colorings of maximal planar graphs of maximum degree six

We prove that every finite simple maximal planar graph of maximum degree at most six admits a total eight-coloring. We first show that every proper vertex four-coloring of a subcubic graph extends to a total five-coloring. A curvature inequality for boundary walks then gives a matching decomposition of four-connected triangulations with degrees five and six, extending their prescribed vertex four-colorings to total eight-colorings. In a minimum counterexample, two local boundary colorings force the degree-four vertices to have disjoint neighborhoods. A characterization of the local extension obstructions permits these vertices to be restored simultaneously. The proof uses Hamiltonian-connectedness of four-connected planar graphs and Kardoš's Hamiltonicity theorem for three-connected cubic planar graphs.

math.CO↗

Two families of Young tableaux with periodic walls: Counting formulas and differential transcendence

Banderier, Marchal, and Wallner studied the enumeration problem for Young tableaux with walls. These are similar to standard Young tableaux, except that local decreases are allowed at some walls. In 2021, Banderier and Wallner counted Young tableaux with periodic walls, in which the elementary blocks are Young diagrams of shape $(2,2)$. They obtained exact counting formulas for $30$ of the $32$ classes up to symmetry. In this paper, we first derive recurrences for counting the remaining two classes of Young tableaux with periodic walls. We then prove that their counting exponential generating functions are differentially transcendental. Consequently, they are neither D-algebraic nor D-finite. This disproves a conjecture of Banderier and Wallner.

math.CO↗