Two-character sets arising from gluings of orbits (Q2376087): Difference between revisions

A simple graph \(\Gamma\) is called symmetric if its automorphism group is transitive on the set of ordered edges of \(\Gamma\). \(\Gamma\) is called a strongly regular graph \(\mathrm{srg}(v, k, \lambda, \mu)\) if it is \(k\)-regular with \(v\) vertices with the additional property that for every pair \((x, y)\) of adjacent (respectively non-adjacent) vertices, the number of vertices commonly adjacent to both \(x\) and \(y\) is \(\lambda\) (respectively \(\mu\)). This paper constructs two infinite families of symmetric strongly regular graphs using transitive two-character sets. A two-character set \(S\) in \(\mathrm{PG}(d, q)\) is an \(n\)-set of points with the property that every hyperplane of \(\mathrm{PG}(d, q)\) meets \(S\) in \(n - w_1\) or \(n - w_2\) points (where \(w_1\) and \(w_2\) are positive constants). A two-character set \(S\) in \(\mathrm{PG}(d, q)\) implies the existence of a \(2\)-weight code (with non-zero weights \(w_1\) and \(w_2\)) called a projective two-weight code. If we embed \(\mathrm{PG}(d, q) = \Pi\) as a hyperplane in \(\mathrm{PG}(d + 1, q)\), then with points of \(\mathrm{PG}(d +1, q) \setminus \Pi\) as vertices and with two vertices adjacent if the line containing corresponding points meets \(\Pi\) in \(S\), we obtain a strongly regular symmetric graph provided \(S\) also has a transitive automorphism group. Besides constructing two infinite families of symmetric strongly regular graphs, the paper also discusses a construction of quasi- quadrics in \(\mathrm{PG}(d, q)\) which are combinatorial versions of quadrics. A construction of a quasi-quadric which is not a quadric is achieved using a non-degenerate polarity of \(\mathrm{PG}(d, q)\) with \(d\) odd. In this case, the constructed quasi-quadric is a two-character set and hence gives rise to a strongly regular graph. Automorphism groups of the constructed strongly regular graphs are not completely understood (in contrast with those strongly regular graphs arising from quadrics).