Skip to content
Preprint

Fuglede's conjecture holds in $\mathbb{F}_{p}^{d}$ for $p=2,\,d=8$ and $p=11,\,d=3$

Oct 2026 · 0 citations
Mathematics

Abstract

Fuglede's conjecture in $\mathbb{F}_p^d$ says that a nonempty set tiles by translation if and only if it is spectral. We prove the conjecture in $\mathbb{F}_2^8$ and $\mathbb{F}_{11}^3$. Over $\mathbb{F}_2$ we show more generally that the Fourier support of a nonconstant indicator of density different from one half contains a plane. Consequently every spectral set of density one quarter has a subspace tiling complement. This supplies one of the dimension-eight reductions left by Kadowaki; the others are completed using classified Hadamard matrices and perfect binary codes. In $\mathbb{F}_2^9$ we prove that every tile is spectral and that every spectral set has power-of-two cardinality. All spectral cardinalities except $64$ are shown to tile, and we give further reductions of the remaining case. We also construct a spectral set of density one eighth whose Fourier support contains no three-dimensional subspace. For $\mathbb{F}_{11}^3$ we extend the geometric method of Fallon, Mayeli, and Villano by using moment identities, polynomial plane profiles, weighted incidence counts, and exact finite computations. The computations and their verification programs are described in the appendices.

View source

Similar papers

Preprint Oct 2026

Fuglede's conjecture holds in $\mathbb{F}_2^7$

We prove that a nonempty subset of the binary vector space $\mathbb{F}_2^7$ is spectral if and only if it tiles $\mathbb{F}_2^7$ by translations. This is the smallest binary dimension left open by Ferguson and Sothanaphan. For the implication from tiling to spectrality we show that every eight-point subset of $\mathbb{...

Atsushi Kadowaki · 0 citations
Preprint Sep 2026

Resolving a conjecture on permutation polynomials over $\mathbb{F}_{2^n}$

Let $\delta\in\mathbb{F}_{2^n}$ satisfy $\operatorname{Tr}_{\mathbb{F}_{2^n}/\mathbb{F}_2}(\delta)=1$. We study the permutation behavior of $$ f(x) = \left(\frac{1}{x^2+x+\delta}\right)^{2^k}+x $$ over $\mathbb{F}_{2^n}$. Helleseth and Zinoviev proved that $f(x)$ is a permutation for $k=0,1$, and remarked that numerica...

Yi Li · 0 citations
Preprint Oct 2026

A reduction theorem for L\^e's conjecture

Let $\boldsymbol{n}=(n_1,n_2,n_3):(\mathbb{C}^2,0)\to(\mathbb{C}^3,0)$ be a holomorphic map germ admitting an injective representative. We prove that if $(d\boldsymbol{n})_0=0$, then $\mathrm{ord}_0(\boldsymbol{n})\in\{2,3,4\}$. This reduces L\^e's conjecture to excluding potential counterexamples $\boldsymbol{n}$ of o...

P. P. Cuadrado · 0 citations
Preprint Oct 2026

On $\mathbb{P}^1$-bundles on $\mathbb{P}^3$ that are small modifications of a Fano fourfold

We find necessary conditions for the projectivization of a rank two vector bundle $\mathcal{E}$ on $\mathbb{P}^3_{\mathbb{C}}$ to be related to a smooth Fano 4-fold by a small $\mathbb{Q}$-factorial modification (SQM). Furthermore, we fully describe the birational geometry of $\mathbb{P}_{\mathbb{P}^3}(\mathcal{E})$ wh...

P. Pastorino · 0 citations
Preprint Oct 2026

The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes

The canonical $\mathbb{Z}_{2^s}$-linear Hadamard codes are the Gray images of the $\mathbb{Z}_{2^s}$-additive codes. Their rank, the dimension of the binary linear span, was known in closed form only for $s\le 3$, and for $s \ge 4$ only through computer computations for small lengths. We give a method that computes the...

Xuan Wang, Min-Jia Shi · 0 citations
Preprint Oct 2026

Full classification of $\mathbb{Z}_{p^s}$-linear generalized Hadamard codes

The $\mathbb{Z}_{p^s}$-additive codes are subgroups of $\mathbb{Z}_{p^s}^n$. A $\mathbb{Z}_{p^s}$-linear generalized Hadamard (GH) code is a GH code over $\mathbb{Z}_p$ which is the Gray map image of a $\mathbb{Z}_{p^s}$-additive code. A recursive construction gives such codes $H_p^{t_1,\dots,t_s}$, of type $(n;t_1,\do...

D. K. Bhunia · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.