UBC Theses and Dissertations

UBC Theses Logo

UBC Theses and Dissertations

On the clique number of Paley graphs and generalized Paley graphs Yip, Chi Hoi

Abstract

Finding reasonably good upper and lower bounds for the clique number of Paley graphs and generalized Paley graphs is an old and open problem in additive combinatorics. In this thesis, we use polynomial methods, together with various tools from number theory, graph theory, and combinatorics, to study this problem. Specifically, we obtain improved upper bounds on the clique number of Paley graphs and generalized Paley graphs over a finite field. We also obtain new upper bounds on the number of distinct roots of lacunary polynomials and improve lower bounds on the number of directions determined by a Cartesian product in an affine Galois plane over a finite field.

Item Media

Item Citations and Data

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International