Bibliographic Details
| Title: |
Number of complete subgraphs of Peisert graphs and finite field hypergeometric functions. |
| Authors: |
Bhowmik, Anwita1 (AUTHOR) anwita@iitg.ac.in, Barman, Rupam1 (AUTHOR) |
| Superior Title: |
Research in Number Theory. 3/8/2024, Vol. 10 Issue 2, p1-21. 21p. |
| Subject Terms: |
*HYPERGEOMETRIC functions, *SUBGRAPHS, *FINITE fields |
| Abstract: |
For a prime p ≡ 3 (mod 4) and a positive integer t, let q = p 2 t . Let g be a primitive element of the finite field F q . The Peisert graph P ∗ (q) is defined as the graph with vertex set F q where ab is an edge if and only if a - b ∈ ⟨ g 4 ⟩ ∪ g ⟨ g 4 ⟩ . We provide a formula, in terms of finite field hypergeometric functions, for the number of complete subgraphs of order four contained in P ∗ (q) . We also give a new proof for the number of complete subgraphs of order three contained in P ∗ (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 m in Peisert graphs. [ABSTRACT FROM AUTHOR] |
|
Copyright of Research in Number Theory is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
