Searcharxiv⌕ Search

arXiv subjects

Denis E. Videla

Publications and source records attributed to Denis E. Videla.

18 recordsLinked to original sources
arXiv2026

On the number of solutions of systems of diagonal equations through diagonal GP-graphs: the general and the Hermitian-form cases

For any $m, s \in \mathbb{N}$, we study the number $N_{m\times s,q}(\kappa, \beta)$ of solutions $(x_1,\ldots,x_s) \in (\mathbb{F}_q)^s$ of the monic system of diagonal equations $$ X_{1}^{k_i} + \cdots + X_{s}^{k_i}= \beta_i, \qquad (1\le i \le m), $$ with $\kappa=(k_1,\ldots,k_m) \in \mathbb{N}^m$ and $\beta=(\beta_1,\ldots,\beta_m) \in (\mathbb{F}_q)^m$. We show that this number can be obtained in terms of some data of \textit{diagonal} GP-graphs $\Gamma(\kappa,q)$. This is a new family of graphs that we introduce here, i.e. Cayley graphs of the form $$ \Gamma(\kappa,q) = Cay(\mathbb{F}_{q}^{m}, R_{\kappa}) \quad \text{where} \quad R_{\kappa} = \{ (x^{k_1},\ldots,x^{k_m}) : x \in \mathbb{F}_{q}^*\}, $$ with $\kappa=(k_1,\ldots,k_m)\in \mathbb{N}^{m}$. In particular, we give three different expressions for $N_{m\times s,q}(\kappa, \beta)$: one in terms of walks, another in terms of adjacency matrices of $\Gamma(\kappa,q)$ and the last one in terms of the spectrum of $\Gamma(\kappa,q)$. Finally, we explicitly derive combinatorial formulas for the number of solutions $N_{m}(s,q) = N_{m\times s,q}(\kappa_\ell, 0)$ of monic homogeneous systems of diagonal equations of the form $$ X_1^{q^{\ell_i}+1} + \cdots + X_s^{q^{\ell_i}+1} = 0 \qquad (1\le i \le m),$$ with $\kappa_\ell=(\ell_1,\ldots,\ell_m)=(1,3,\ldots,2m-1)$ and $m\ge 2$, via the known spectrum of Hermitian-form graphs, which can be viewed as diagonal GP-graphs. For any $m,s \in \mathbb{N}$, we give general summation and recursive formulas for $N_m(s,q) \in \mathbb{Z}[q]$. For the small cases $N_{1}(s,q)$, $N_{2}(s,q)$ and $N_{m}(s,q)$, with $1\le s \le 5$, we give explicit expressions.

math.CO↗
arXiv2026

On $k$-th unitary Cayley graphs over finite commutative rings: structure and decompositions

Given $R$ a finite commutative ring with identity and $k \in \mathbb{N}$, we consider the $k$-th unitary Cayley graph $G_R(k)=Cay(R,U_{R,k})$ with $U_{R,k} = \{ x^k: x \in R^*\}$, and its symmetrized version $\mathcal{G}_R(k) = Cay(R,T_{R,k})$, with $T_{R,k}=U_{R,k} \cup (-U_{R,k})$. If $R$ is a local ring with maximal ideal $\frak m$, we give the blow-up decompositions for the graphs: namely, we have $G_R(k)= (G_{R/\frak m}(k))^{(|\frak m|)}$ and $\mathcal{G}_R(k)= (\mathcal{G}_{R/\frak m}(k))^{(|\frak m|)}$ for any $k$ such that $(k,|R|)=1$. If the ring $R$ has Artin decomposition $R=R_1 \times \cdots \times R_s$ in local rings $R_i$, we give the Kronecker product decompositions $G_R(k) = G_{R_1}(k) \otimes \cdots \otimes G_{R_s}(k)$ and $\mathcal{G}_R(k) = \mathcal{G}_{R_1}(k) \otimes \cdots \otimes \mathcal{G}_{R_s}(k)$. In further $(k,|R|)=1$, these decompositions can be given in terms of generalized Paley (GP) graphs over finite fields, that is $G_{R_i}(k) = \Gamma(k_i,q_i)$ and similarly for $\mathcal{G}_{R_i}(k)$, for $i=1,\ldots,s$. Also, the reduced graphs correspond to the graphs of the reduced rings, i.e.\@ $\big(G_{R}(k)\big)_{red}\simeq G_{R_{red}}(k)$ and $\big(\mathcal{G}_{R}(k)\big)_{red} \simeq \mathcal{G}_{R_{red}}(k)$. By using these decompositions in terms of GP-graphs, we study some basic structural properties of the graphs such as directedness, bipartiteness and connectedness.

math.CO↗
arXiv2026

The nature of the spectrum of generalized Paley graphs and weak Waring numbers over finite fields

We consider the family of generalized Paley graphs (GP-graphs for short) $Γ(k,q) = Cay(\mathbb{F}_q, (\mathbb{F}_q^*)^k)$, with $q=p^m$ and $p$ prime. We characterize all GP-graphs having real spectrum; namely, $Spec(Γ(k,q)) \subset \mathbb{R}$ if and only if $Γ(k,q)$ is undirected. We then study conditions for integrality in the spectrum and give a general method to produce integral GP-graphs through cyclotomic polynomials. Using this, we construct several infinite families of integral GP-graphs. Next, we focus on directed GP-graphs (GP-digraphs). We show that GP-digraphs always have three or more eigenvalues, and then we prove that there is only one kind of GP-digraphs having three different eigenvalues: the oriented Paley graphs $\vec{\mathcal{P}}_q$ or disjoint unions of copies of them, $\vec{\mathcal{P}}_q \cup \cdots \cup \vec{\mathcal{P}}_q$. Then, we show that generically the GP-digraphs have period 1 (equivalently index of imprimitivity 1) except for $Γ(q-1,q)$ with $q$ odd, which is the disjoint union of oriented $p$-cycles, having period $p$. Finally, as an application, we study weak Waring numbers over finite fields through GP-graphs. In particular, we reduce the computation of the weak Waring numbers over finite fields to the computation of classic Waring numbers over finite fields, a result previously obtained by Cochrane and Cipra in 2012 by other means.

math.CO↗
arXiv2025

Connected components and non-bipartiteness of generalized Paley graphs

In this work we consider the class of Cayley graphs known as generalized Paley graphs (GP-graphs for short) given by $Γ(k,q) = Cay(\mathbb{F}_q, \{x^k : x\in \mathbb{F}_q^* \})$, where $\mathbb{F}_q$ is a finite field with $q$ elements, both in the directed and undirected case. Hence $q=p^m$ with $p$ prime, $m\in \mathbb{N}$ and one can assume that $k\mid q-1$. We first give the connected components of an arbitrary GP-graph. We show that these components are smaller GP-graphs all isomorphic to each other (generalizing a Lim and Praeger's result from 2009 to the directed case). We then characterize those GP-graphs which are disjoint unions of odd cycles. Finally, we show that $Γ(k,q)$ is non-bipartite except for the graphs $Γ(2^m-1,2^m)$, $m \in \mathbb{N}$, which are isomorphic to $K_2 \sqcup \cdots \sqcup K_2$, the disjoint union of $2^{m-1}$ copies of $K_2$.

math.CO↗
arXiv2025

Spectral properties of generalized Paley graphs

We study the spectrum of generalized Paley graphs $Γ(k,q)=Cay(\mathbb{F}_q,R_k)$, undirected or not, with $R_k=\{x^k:x\in \mathbb{F}_q^*\}$ where $q=p^m$ with $p$ prime and $k\mid q-1$. We first show that the eigenvalues of $Γ(k,q)$ are given by the Gaussian periods $η_{i}^{(k,q)}$ with $0\le i\le k-1$. Then, we explicitly compute the spectrum of $Γ(k,q)$ with $1\le k \le 4$ and of $Γ(5,q)$ for $p\equiv 1\pmod 5$ and $5\mid m$. Also, we characterize those GP-graphs having integral spectrum, showing that $Γ(k,q)$ is integral if and only if $p$ divides $(q-1)/(p-1)$. Next, we focus on the family of semiprimitive GP-graphs. We show that they are integral strongly regular graphs (of pseudo-Latin square type). Finally, we characterize all integral Ramanujan graphs $Γ(k,q)$ with $1\le k \le 4$ or where $(k,q)$ is a semiprimitive pair.

math.CO↗
arXiv2024

The spectra of generalized Paley graphs of $(q^\ell+1)$-th powers and applications

We consider a special class of generalized Paley graphs over finite fields, namely the Cayley graphs with vertex set $\mathbb{F}_{q^m}$ and connection set the nonzero $(q^\ell+1)$-th powers in $\mathbb{F}_{q^m}$, as well as their complements. We explicitly compute the spectrum and the energy of these graphs. As a consequence, the graphs turn out to be (with trivial exceptions) simple, connected, non-bipartite, integral and strongly regular, of pseudo or negative Latin square type. By using the spectral information we compute several invariants of these graphs. We exhibit infinitely many pairs of equienergetic non-isospectral graphs. As applications, on the one hand we solve Waring's problem over $\mathbb{F}_q^m$ for the exponents $q^\ell+1$, for each $q$ and for infinitely many values of $\ell$ and $m$. We obtain that the Waring's number $g(q^\ell+1,q^m)=1$ or $2$, depending on $m$ and $\ell$, thus solving some open cases. On the other hand, we construct infinite towers of Ramanujan graphs in all characteristics. Finally, we give the Ihara zeta functions of these graphs.

math.CO↗
arXiv2023

Waring numbers over finite commutative local rings

In this paper we study Waring numbers $g_R(k)$ for $(R,\frak m)$ a finite commutative local ring with identity and $k \in \mathbb{N}$ with $(k,|R|)=1$. We first relate the Waring number $g_R(k)$ with the diameter of the Cayley graphs $G_R(k)=Cay(R,U_R(k))$ and $W_R(k)=Cay(R,S_R(k))$ with $U_R(k) = \{ x^k : x\in R^*\}$ and $S_R(k)=\{x^k : x\in R^\times\}$, distinguishing the cases where the graphs are directed or undirected. We show that in both cases (directed or undirected), the graph $G_R(k)$ can be obtained by blowing-up the vertices of $G_{\mathbb{F}_q}(k)$ a number $|\frak{m}|$ of times, with independence sets the cosets of $\frak{m}$, where $q$ is the size of the residue field $R/\frak m$. Then, by using the above blowing-up, we reduce the study of the Waring number $g_R(k)$ over the local ring $R$ to the computation of the Waring number $g(k,q)$ over the finite residue field $R/\frak m \simeq \mathbb{F}_q$. In this way, using known results for Waring numbers over finite fields, we obtain several explicit results for Waring numbers over finite commutative local rings with identity.

math.AC↗
arXiv2023

Number of cliques of Paley-type graphs over finite commutative local rings

In this work, given $(R,\frak m)$ a finite commutative local ring with identity and $k \in \mathbb{N}$ with $(k,|R|)=1$, we study the number of cliques of any size in the Cayley graph $G_R(k)=Cay(R,U_R(k))$ %and $W_R(k)=Cay(R,S_R(k))$ with $U_R(k)=\{x^k : x\in R^*\}$. Using the known fact that the graph $G_R(k)$ can be obtained by blowing-up the vertices of $G_{\mathbb{F}_{q}}(k)$ a number $|\frak{m}|$ of times, with independence sets the cosets of $\frak{m}$, where $q$ is the size of the residue field $R/\frak m$. Then, by using the above blowing-up, we reduce the study of the number of cliques in $G_R(k)$ over the local ring $R$ to the computation of the number of cliques of $G_{R/\frak{m}}(k)$ over the finite residue field $R/\frak m \simeq \mathbb{F}_q$. In this way, using known numbers of cliques of generalized Paley graphs ($k=2,3,4$ and $\ell=3,4$), we obtain several explicit results for the number of cliques over finite commutative local rings with identity.

math.CO↗
arXiv2022

A reduction formula for Waring numbers through generalized Paley graphs

We give a reduction formula for the Waring number $g(k,q)$ over a finite field $\mathbb{F}_q$. By exploiting the relation between $g(k,q)$ with the diameter of the generalized Paley graph $Γ(k,q)$ and by using the characterization due to Pearce and Praeger (2019) of those $Γ(k,q)$ which are Cartesian decomposable, we obtain the reduction formula $$g(\tfrac{p^{ab}-1}{bc},p^{ab}) = b g(\tfrac{p^a-1}{c},p^a)$$ for $p$ prime and $a,b,c$ positive integers under certain arithmetic conditions. Then, we find some arithmetic conditions to apply the formula above, which allow us to obtain many infinite families of explicit values of Waring numbers. Finally, we use the reduction formula together with the characterization of $2$-weight irreducible cyclic codes due to Schmidt and White (2002) to find infinite families of explicit even values of $g(k,q)$.

math.NT↗
arXiv2022

Generalized Paley graphs equienergetic with their complements

We consider generalized Paley graphs $Γ(k,q)$, generalized Paley sum graphs $Γ^+(k,q)$, and their corresponding complements $\bar Γ(k,q)$ and $\bar Γ^+(k,q)$, for $k=3,4$. Denote by $Γ= Γ^*(k,q)$ either $Γ(k,q)$ or $Γ^+(k,q)$. We compute the spectra of $Γ(3,q)$ and $Γ(4,q)$ and from them we obtain the spectra of $Γ^+(3,q)$ and $Γ^+(4,q)$ also. Then we show that, in the non-semiprimitive case, the spectrum of $Γ(3,p^{3\ell})$ and $Γ(4,p^{4\ell})$ with $p$ prime can be recursively obtained, under certain arithmetic conditions, from the spectrum of the graphs $Γ(3,p)$ and $Γ(4,p)$ for any $\ell \in \mathbb{N}$, respectively. Using the spectra of these graphs we give necessary and sufficient conditions on the spectrum of $Γ^*(k,q)$ such that $Γ^*(k,q)$ and $\bar Γ^*(k,q)$ are equienergetic for $k=3,4$. In a previous work we have classified all bipartite regular graphs $Γ_{bip}$ and all strongly regular graphs $Γ_{srg}$ which are complementary equienergetic, i.e.\@ $\{Γ_{bip}, \barΓ_{bip}\}$ and $\{Γ_{srg}, \barΓ_{srg}\}$ are equienergetic pairs of graphs. Here we construct infinite pairs of equienergetic non-isospectral regular graphs $\{Γ, \bar Γ\}$ which are neither bipartite nor strongly regular.

math.CO↗
arXiv2021

On regular graphs equienergetic with their complements

We give necessary and sufficient conditions on the parameters of a regular graph $Γ$ (with or without loops) such that $E(Γ)=E(\overline Γ)$. We study complementary equienergetic cubic graphs obtaining classifications up to isomorphisms for connected cubic graphs with single loops (5 non-isospectral pairs) and connected integral cubic graphs without loops ($Γ= K_3 \square K_2$ or $Q_3$). Then we show that, up to complements, the only bipartite regular graphs equienergetic and non-isospectral with their complements are the crown graphs $Cr(n)$ or $C_4$. Next, for the family of strongly regular graphs $Γ$ we characterize all possible parameters $srg(n,k,e,d)$ such that $E(Γ) = E(\overline Γ)$. Furthermore, using this, we prove that a strongly regular graph is equienergetic to its complement if and only if it is either a conference graph or else it is a pseudo Latin square graph (i.e. has $OA$ parameters). We also characterize all complementary equienergetic pairs of graphs of type $\mathcal{C}(2)$, $\mathcal{C}(3)$ and $\mathcal{C}(5)$ in Cameron's hierarchy (the cases $\mathcal{C}(1)$ and $\mathcal{C}(4)$ are still open). Finally, we consider unitary Cayley graphs over rings $G_R=X(R,R^*)$. We show that if $R$ is a finite Artinian ring with an even number of local factors, then $G_R$ is complementary equienergetic if and only if $R=\mathbb{F}_q \times \mathbb{F}_{q'}$ is the product of 2 finite fields.

math.CO↗
arXiv2021

The Waring's problem over finite fields through generalized Paley graphs

We show that the Waring's number over a finite field $\mathbb{F}_q$, denoted $g(k,q)$, when exists, coincides with the diameter of the generalized Paley graph $Γ(k,q)=Cay(\mathbb{F}_{q},R_k)$ with $R_k=\{x^k : x\in \mathbb{F}_q^*\}$. We find infinite new families of exact values of $g(k,q)$ from a characterization of graphs $Γ(k,q)$ which are also Hamming graphs previously proved by Lim and Praeger in 2009. Then, we show that every positive integer is the Waring number for some pair $(k,q)$ with $q$ not a prime. Finally, we find a lower bound for $g(k,p)$ with $p$ prime by using that $Γ(k,p)$ is a circulant graph in this case.

math.NT↗
arXiv2020

Integral equienergetic non-isospectral unitary Cayley graphs

We prove that the Cayley graphs $X(G,S)$ and $X^+(G,S)$ are equienergetic for any abelian group $G$ and any symmetric subset $S$. We then focus on the family of unitary Cayley graphs $G_R=X(R,R^*)$, where $R$ is a finite commutative ring with identity. We show that under mild conditions, $\{G_R, G_R^+\}$ are pairs of integral equienergetic non-isospectral graphs (generically connected and non-bipartite). Then, we obtain conditions such that $\{G_R, \bar G_R\}$ are equienergetic non-isospectral graphs. Finally, we characterize all integral equienergetic non-isospectral triples $\{G_R, G_R^+, \bar G_R \}$ such that all the graphs are also Ramanujan.

math.CO↗
arXiv2020

Spectral properties of generalized Paley graphs and their associated irreducible cyclic codes

For $q=p^m$ with $p$ prime and $k\mid q-1$, we consider the generalized Paley graph $Γ(k,q) = Cay(\mathbb{F}_q, R_k)$, with $R_k=\{ x^k : x \in \mathbb{F}_q^* \}$, and the irreducible $p$-ary cyclic code $\mathcal{C}(k,q) = \{(\textrm{Tr}_{q/p}(γω^{ik})_{i=0}^{n-1})\}_{γ\in \mathbb{F}_q}$, with $ω$ a primitive element of $\mathbb{F}_q$ and $n=\tfrac{q-1}{k}$. We first express the spectra of $Γ(k,q)$ in terms of Gaussian periods. Then, we show that the spectra of $Γ(k,q)$ and $\mathcal{C}(k,q)$ are mutually determined by each other if further $k\mid \tfrac{q-1}{p-1}$. We give $Spec(Γ(k,q))$ explicitly for those graphs associated with irreducible 2-weight cyclic codes in the semiprimitive and exceptional cases. We also compute $Spec(Γ(3,q))$ and $Spec(Γ(4,q))$.

math.CO↗
arXiv2020

Weight distribution of cyclic codes defined by quadratic forms and related curves

We consider cyclic codes $\mathcal{C}_\mathcal{L}$ associated to quadratic trace forms in $m$ variables $Q_R(x) = \operatorname{Tr}_{q^m/q}(xR(x))$ determined by a family $\mathcal{L}$ of $q$-linearized polynomials $R$ over $\mathbb{F}_{q^m}$, and three related codes $\mathcal{C}_{\mathcal{L},0}$, $\mathcal{C}_{\mathcal{L},1}$ and $\mathcal{C}_{\mathcal{L},2}$. We describe the spectra for all these codes when $\mathcal{L}$ is an even rank family, in terms of the distribution of ranks of the forms $Q_R$ in the family $\mathcal{L}$, and we also compute the complete weight enumerator for $\mathcal{C}_\mathcal{L}$. In particular, considering the family $\mathcal{L} = \langle x^{q^\ell} \rangle$, with $\ell$ fixed in $\mathbb{N}$, we give the weight distribution of four parametrized families of cyclic codes $\mathcal{C}_\ell$, $\mathcal{C}_{\ell,0}$, $\mathcal{C}_{\ell,1}$ and $\mathcal{C}_{\ell,2}$ over $\mathbb{F}_q$ with zeros $\{ α^{-(q^\ell+1)} \}$, $\{ 1,\, α^{-(q^\ell+1)} \}$, $\{ α^{-1},\,α^{-(q^\ell+1)} \}$ and $\{ 1,\,α^{-1},\,α^{-(q^\ell+1)}\}$ respectively, where $q = p^s$ with $p$ prime, $α$ is a generator of $\mathbb{F}_{q^m}^*$ and $m/(m,\ell)$ is even. Finally, we give simple necessary and sufficient conditions for Artin-Schreier curves $y^p-y = xR(x) + βx$, $p$ prime, associated to polynomials $R \in \mathcal{L}$ to be optimal. We then obtain several maximal and minimal such curves in the case $\mathcal{L} = \langle x^{p^\ell}\rangle$ and $\mathcal{L} = \langle x^{p^\ell}, x^{p^{3\ell}} \rangle$.

math.CO↗
arXiv2019

On diagonal equations over finite fields via walks in NEPS of graphs

In this paper, we obtain an explicit combinatorial formula for the number of solutions $(x_1,\ldots,x_r)\in \mathbb{F}_{p^{ab}}$ to the diagonal equation $x_{1}^k+\cdots+x_{r}^k=α$ over the finite field $\mathbb{F}_{p^{ab}}$, with $k=\frac{p^{ab}-1}{b(p^a-1)}$ and $b>1$ by using the number of $r$-walks in NEPS of complete graphs.

math.CO↗