Paley-like graphs over finite fields from vector spaces

DOI10.1016/J.FFA.2023.102171MaRDI QIDQ6413155arXivFDO

Publication date 6 October 2022

Full work available at URL https://doi.org/10.1016/J.FFA.2023.102171

Extremal set theory (05D05) Arithmetic combinatorics; higher degree uniformity (11B30) Exponential sums (11T23) Quadratic and bilinear forms, inner products (15A63)

arXiv classification

math.CO math.NT

Abstract: Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper we explore a natural multiplicative-additive analogue of such graphs arising from vector spaces over finite fields. Namely, if

n g e 2

and

U s u b s e t n e q m a t h b b F_{q^{n}}

is an

m a t h b b F_{q}

-vector space,

G_{U}

is the (undirected) graph with vertex set

V (G_{U}) = m a t h b b F_{q^{n}}

and edge set

E (G_{U}) = (a, b) i n m a t h b b F_{q^{n}}^{2}, |, a e b, a b i n U

. We describe the structure of an arbitrary maximal clique in

G_{U}

and provide bounds on the clique number

o m e g a (G_{U})

of

G_{U}

. In particular, we compute the largest possible value of

o m e g a (G_{U})

for arbitrary

q

and

n

. Moreover, we obtain the exact value of

o m e g a (G_{U})

when

U s u b s e t n e q m a t h b b F_{q^{n}}

is any

m a t h b b F_{q}

-vector space of dimension

d_{U} i n 1, 2, n - 1

.

This page was built for publication: Paley-like graphs over finite fields from vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413155)