J. Iosevich

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Additive energy and Fourier complexity of graphs

Vishal Gupta, Sam Ferguson, Alex Iosevich +3

We study the additive energy and the Fourier approximation of graph adjacency matrices labeled by a cyclic group. For a graph with $N$ vertices, $s$ edges and adjacency matrix $M$ ,…

math.CO2026

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

Samuel J. Ferguson, Joshua Iosevich

Fuglede's conjecture in $F_{p}^{d}$ says that a nonempty set tiles by translation if and only if it is spectral. We prove the conjecture in $F_{2}^{8}$ and $\mathbb{F}_{1…

math.CO2026

Edge complexity of graphs

Vishal Gupta, Alex Iosevich, Joshua Iosevich +2

Gupta and Iosevich introduced the edge complexity of a graph as the minimum Fourier ratio of its adjacency matrix over all vertex labelings and bounded it below by graph energy div…

Additive energy and Fourier complexity of graphs

Fuglede's conjecture holds in Fpd​ for p=2,d=8 and p=11,d=3

Edge complexity of graphs

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