Quadrance polygons, association schemes and strongly regular graphs
Le Anh Vinh
Abstract
Quadrance between two points A1 = [x1,y1] and A2 = [x2,y2] is the number Q (A1, A2) := (x2 - x1)2 + (y2 - y1)2. In this paper, we present some interesting results arise from this notation. In Section 1, we will study geometry over finite fields under quadrance notations. The main purpose of Section 1 is to answer the question, for which a1,...,an, we have a polygon A1...An such that Q(Ai,Ai+1)=ai for i = 1,...,n. In Section 2, using tools developed in Section 1, we define a family of association schemes over finite field space Fq x Fq where q is a prime power. These schemes give rise to a graph Vq with vertices the points of Fq2, and where (X,Y) is an edge of Vq if and only if Q(X,Y) is a nonzero square number in Fq. In Section 3, we will show that Vq is a strongly regular graph and propose a conjecture about the maximal clique of Vq.
Create a lesson
Related papers
Szemerédi's theorem with random differences and arithmetic Kakeya
Gabriel Dahia
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang et al.
Proofs of four Takigiku--Tsuchioka conjectures on level 2 principal characters of A2-1(2)
Liuquan Wang
Two conjectures on the cospectrality of complete tripartite graphs are false
Irena M. Jovanović, Jelena Sedlar, Riste Škrekovski
Saturation and semisaturation of oriented graphs
Vladimir Bošković, Balázs Keszegh
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Jia Wei, Muhuo Liu, Zhifu You et al.