English
Related papers

Related papers: On eigenfunctions and maximal cliques of generalis…

200 papers

In this paper we find new maximal cliques of size $\frac{q+1}{2}$ or $\frac{q+3}{2}$, accordingly as $q\equiv 1(4)$ or $q\equiv 3(4)$, in Paley graphs of order $q^2$, where $q$ is an odd prime power. After that we use new cliques to define…

Combinatorics · Mathematics 2021-03-02 Sergey Goryainov , Vladislav V. Kabanov , Leonid Shalaginov , Alexandr Valyuzhenich

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…

Number Theory · Mathematics 2024-12-02 Greg Martin , Chi Hoi Yip

Let $GP(q,d)$ be the $d$-Paley graph defined on the finite field $\mathbb{F}_q$. It is notoriously difficult to improve the trivial upper bound $\sqrt{q}$ on the clique number of $GP(q,d)$. In this paper, we investigate the connection…

Number Theory · Mathematics 2022-03-25 Chi Hoi Yip

There is a conjecture that the second largest maximal cliques in Paley graphs of square order $P(q^2)$ have size $\frac{q+\epsilon}{2}$, where $q \equiv \epsilon \pmod 4$, and split into two orbits under the full group of automorphisms…

Combinatorics · Mathematics 2024-10-08 Huye Chen , Sergey Goryainov , Cong Hu

The celebrated Erd\H{o}s-Ko-Rado (EKR) theorem for Paley graphs (of square order) states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended…

Combinatorics · Mathematics 2024-02-02 Chi Hoi Yip

A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…

Mathematical Physics · Physics 2024-12-24 Jon Harrison , Clare Pruss

We prove that a family of pseudo-Paley graphs of square order obtained from unions of cyclotomic classes satisfies the Erd\H{o}s-Ko-Rado (EKR) module property, in a sense that the characteristic vector of each maximum clique is a linear…

Combinatorics · Mathematics 2023-01-02 Shamil Asgarli , Sergey Goryainov , Huiqiu Lin , Chi Hoi Yip

In this paper we prove that balanced characteristic functions of canonical cliques in a Paley graph of square order $P(q^2)$ span the $\frac{-1+q}{2}$-eigenspace of the graph. This is the first of two steps to a second proof of the analogue…

Combinatorics · Mathematics 2021-04-22 Sergey Goryainov , Huiqiu Lin

A well-known conjecture due to van Lint and MacWilliams states that if $A$ is a subset of $\mathbb{F}_{q^2}$ such that $0,1 \in A$, $|A|=q$, and $a-b$ is a square for each $a,b \in A$, then $A$ must be the subfield $\mathbb{F}_q$. This…

Combinatorics · Mathematics 2022-08-30 Shamil Asgarli , Chi Hoi Yip

It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…

Combinatorics · Mathematics 2024-06-21 Sergey Goryainov , Chi Hoi Yip

Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \neq \mathbb{F}_q^*$. We show that the clique number of the Cayley graph $\operatorname{Cay}(\mathbb{F}_q^+,S)$ is at most…

Combinatorics · Mathematics 2025-11-26 Chi Hoi Yip

For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…

Probability · Mathematics 2021-07-06 Roland Bauerschmidt , Jiaoyang Huang , Antti Knowles , Horng-Tzer Yau

We describe a new class of maximal cliques, with a vector space structure, of Cayley graphs defined on the additive group of a field. In particular, we show that in the cubic Paley graph with order $q^3$, the subfield with $q$ elements…

Combinatorics · Mathematics 2022-08-16 Chi Hoi Yip

Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise…

Combinatorics · Mathematics 2024-08-16 Shamil Asgarli , Chi Hoi Yip

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…

Combinatorics · Mathematics 2019-01-31 Gary R. W. Greaves , Leonard H. Soicher

Let $q$ be an odd prime power. Denote by $r(q)$ the value of $q$ modulo 4. In this paper, we establish a linear fractional correspondence between two types of maximal cliques of size $\frac{q+r(q)}{2}$ in the Paley graph of order $q^2$.

Combinatorics · Mathematics 2022-04-15 Sergey Goryainov , Alexander Masley , Leonid Shalaginov

To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…

Combinatorics · Mathematics 2012-03-09 Ahmed Noubi Elsawy

In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smallest eigenvalue by considering a vertex that is adjacent to some (but not all) vertices of the maximal clique. As a consequence, we show that…

Combinatorics · Mathematics 2020-12-18 Gary R. W. Greaves , Jack H. Koolen , Jongyook Park

The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{A\Gamma L}}(1,q)$ whenever $q$ is sufficiently…

Combinatorics · Mathematics 2025-11-25 Ilia Ponomarenko

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Combinatorics · Mathematics 2022-08-10 Ferdinand Ihringer
‹ Prev 1 2 3 10 Next ›