加载中…
We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers and , we show that for each positive integer such that , there are maximal cliques of size approximately in the -Paley graph defined on . We also confirm a conjecture of Goryainov, Shalaginov, and the second author on the maximality of certain cliques in generalized Paley graphs, as well as an analogous conjecture of Goryainov for Peisert graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本