University of British Columbia
On the clique number of Paley graphs and generalized Paley graphs
Abstract
dc:descriptionFinding 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yip, Chi Hoi
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/77005