A. Iosevich

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

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…

math.CO2026

Packing sets under finite groups via algebraic incidence structures

Norbert HegyvÃ¡ri, Le Quang Hung, Alex Iosevich +1

Let $G$ be a finite group acting on a vector space $V = F_{p}^{n}$ over a prime field. Given finite sets $S \subset G$ and $E \subset V$ , we study the restricted orbit union $…

math.CO2024

Congruence Classes of Simplex Structures in Finite Field Vector Spaces

Timothy Cheek, Joseph Cooper, Pico Gilman +6

We study a generalization of the ErdÅs-Falconer distance problem over finite fields. For a graph $G$ , two embeddings $p, p^{'} : V (G) \to F_{q}^{d}$ of a graph $G$ are congruent…

math.CO2024

Interpolation of point configurations in the discrete plane

Esen Aksoy, Alex Iosevich, Brian McDonald

Defining distances over finite fields formally by $∣∣ x - y ∣∣ := (x_{1} - y_{1})^{2} + \dots + (x_{d} - y_{d})^{2}$ for $x, y \in F_{q}^{d}$ , distance problems naturally arise in analogy to those stu…