Search arXivSearch

arXiv · 2303.04312

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrea L. Gallo, Denis E. Videla. 2023-03-08. Number of cliques of Paley-type graphs over finite commutative local rings. https://arxiv.org/abs/2303.04312

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO