Number of complete subgraphs of Peisert graphs and finite field hypergeometric functions

preprint2022arXivOpen access

Abstract

For a prime p≡3(mod4)p\equiv 3\pmod{4} and a positive integer tt, let q=p2tq=p^{2t}. Let gg be a primitive element of the finite field Fq\mathbb{F}_q. The Peisert graph P∗(q)P^\ast(q) is defined as the graph with vertex set Fq\mathbb{F}_q where abab is an edge if and only if a−b∈⟨g4⟩∪g⟨g4⟩a-b\in\langle g^4\rangle \cup g\langle g^4\rangle. We provide a formula, in terms of finite field hypergeometric functions, for the number of complete subgraphs of order four contained in P∗(q)P^\ast(q). We also give a new proof for the number of complete subgraphs of order three contained in P∗(q)P^\ast(q) by evaluating certain character sums. The computations for the number of complete subgraphs of order four are quite tedious, so we further give an asymptotic result for the number of complete subgraphs of any order mm in Peisert graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.