Singer difference sets and the projective norm graph
Tam\'as M\'esz\'aros, Lajos R\'onyai, Tibor Szab\'o

TL;DR
This paper explores the relationship between Singer difference sets and projective norm graphs, providing new descriptions and proving the presence of specific complete bipartite subgraphs, which impacts extremal graph theory bounds.
Contribution
It introduces a novel polynomial-based description of Singer difference sets within norm groups and proves the existence of a $K_{4,6}$ subgraph in projective norm graphs for all prime powers $q \
Findings
Singer difference sets can be described as solutions to a polynomial equation.
The projective norm graph $ ext{NG}(q,4)$ contains $K_{4,6}$ for all $q \
The results extend the understanding of subgraph containment in norm graphs and their extremal properties.
Abstract
We demonstrate a close connection between the classic planar Singer difference sets and certain norm equation systems arising from projective norm graphs. This, on the one hand leads to a novel description of planar Singer difference sets as a subset of , the group of elements of norm 1 in the field extension . is given as the solution set of a simple polynomial equation, and we obtain an explicit formula expressing each non-identity element of as a product with . The description and the definitions naturally carry over to the nonplanar and the infinite setting. On the other hand, relying heavily on the difference set properties, we also complete the proof that the projective norm graph does contain the complete bipartite graph for every…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
Singer difference sets and the projective norm graph
Tamás Mészáros11footnotemark: 1111Freie Universität Berlin 222Position funded by the DRS Fellowship Program of Freie Universität Berlin
Lajos Rónyai333Institute for Computer Science and Control, Hungarian Academy of Sciences and BME 444Research supporten in part by NKFIH Grant No. K115288.
Tibor Szabó11footnotemark: 1 555Research supported in part by GIF grant No. G-1347-304.6/2016.
Abstract
We demonstrate a close connection between the classic planar Singer difference sets and certain norm equation systems arising from projective norm graphs. This, on the one hand leads to a novel description of planar Singer difference sets as a subset of , the group of elements of norm 1 in the field extension . is given as the solution set of a simple polynomial equation, and we obtain an explicit formula expressing each non-identity element of as a product with B,C\in\mbox{\mathcal{H}}. The description and the definitions naturally carry over to the nonplanar and the infinite setting. On the other hand, relying heavily on the difference set properties, we also complete the proof that the projective norm graph does contain the complete bipartite graph for every prime power . This complements the property, known for more than two decades, that projective norm graphs do not contain (and hence provide tight lower bounds for the Turán number ).
1 Introduction and results
1.1 Projective norm graphs
Let be an arbitrary field, for let be a cyclic Galois extension of degree and let us denote by the norm of this extension, i.e. for we have where the automorphism generates the Galois group of and denotes the -fold iteration of . Then the projective norm-graph has vertex set , where denotes the multiplicative subgroup of , and two vertices and are adjacent if and only if .666For technical reasons we allow the two vertices to be the same, i.e. we allow loop edges..
Projective norm graphs over finite fields were introduced by Alon, Rónyai and Szabó [1] in connection with the Turán problem for complete bipartite graphs. For a prime power we use the standard notation for the finite field with elements. When , then and the automorphism above can be chosen to be the Frobenius automorphism and the graph is denoted by . It is not difficult to show that has edges, where is the number of vertices. In [1] it was also proved that does not contain as a subgraph, and hence has essentially the highest number of edges among graphs with this property, on the same number of vertices.
Determining the largest number of edges a graph on vertices without a subgraph isomorphic to can have is one of the classic problems of extremal graph theory, its history going back more than a century, to the theorem of Mantel about triangle-free graphs. The value of is settled asymptotically when is non-bipartite, but for bipartite graphs its order of magnitude is known only in a handful of cases. Even for the simplest bipartite graphs, such as even cycles and complete bipartite graphs, the question is wide open. The general upper bound of Kővári, Sós and Turán [18] states that for every . Matching lower bounds are known only for (Klein [10]), (Brown [7]), and by the projective norm graphs for arbitrary and . The fundamental question of the order of magnitude of is very much open for any .
In general it is not known how large complete bipartite graphs the projective norm graph contains. For it could even be the case that there is an infinite sequence of prime powers such that does not contain a copy of and hence resolves the question of the order of magnitude of for every and . With that, the determination of the largest integer , for which contains a for every large enough prime power , has potentially far reaching consequences. For and the projective norm graph does contain a by combinatorial reasons (the KST upper bound), so and . For however, it was only known that .
In this direction Grosu [14] has recently shown that contains a copy of the complete bipartite graph for roughly -fraction of all primes . In [2], among other things, this was extended for any prime power if the characteristic is not or . Furthermore, the proof also provided many copies of . Computer calculations have also suggested that the same holds in the case as well, but the arguments in [2] crucially used the restriction on the characteristic. In this paper we provide different arguments to show the existence of in for the cases when and , and hence establish . In the process we uncover a close connection between the norm equation systems arising from the projective norm graph and the classic Singer difference sets. We consider this connection one of the main contributions of our paper. In the next subsection we introduce the necessary background for the latter.
1.2 Difference sets
Given a multiplicative group , a subset \mbox{\mathcal{D}}\subseteq\mbox{\mathcal{G}} is called a planar difference set if every non-identity element A\in\mbox{\mathcal{G}} has a unique representationas a product of an element from and an element from \mbox{\mathcal{D}}^{-1}, where \mbox{\mathcal{D}}^{-1}:=\{d^{-1}:d\in\mbox{\mathcal{D}}\} denotes the set of inverses of the elements of . We refer to this representation as the mixed representation of with respect to .
Difference sets in finite groups are central and diverse objects in design theory with a rich history and numerous applications both inside and outside mathematics. For a gentle introduction and survey the reader may consult e.g. [21]. If a finite group admits a planar difference set of size , then its order, by simple counting, must be of the form , where . Planar difference sets in Abelian groups are only known to exist if is a cyclic group and is a prime power. In what follows we will simply write ’difference set’ instead of planar difference set. The first construction was given by Singer [25], using the finite projective plane . A collineation is a one-to-one mapping on the points of the plane carrying lines into lines. Singer proved that in there is always a collineation that cyclically permutes the points. Then if we label the points , so that for every , then the indicies corresponding to points on the same line will form a difference set of size in the additive cyclic group . For the other direction he remarks that such a difference set naturally induces a projective geometry of order . This strong connection motivates the name ’planar’ difference set.
In general, for multiplicative groups \mbox{\mathcal{G}}_{1},\mbox{\mathcal{G}}_{2} two difference sets \mbox{\mathcal{D}}_{1}\subset\mbox{\mathcal{G}}_{1} and \mbox{\mathcal{D}}_{2}\subset\mbox{\mathcal{G}}_{2} are called equivalent if there exists a group isomorphism \varphi:\mbox{\mathcal{G}}_{1}\rightarrow\mbox{\mathcal{G}}_{2} and an element \Gamma\in\mbox{\mathcal{G}}_{2} such that \varphi(\mbox{\mathcal{D}}_{1})=\Gamma\cdot\mbox{\mathcal{D}}_{2}. For example, in Abelian groups any difference set is equivalent to its inverse \mbox{\mathcal{D}}^{-1} via the isomorphism . In Singer’s construction from above, choosing different lines for the same collineation also results in equivalent difference sets. Singer conjectured that every difference set in is equivalent to his construction. This conjecture is still very much open. Berman [3] and Halberstam and Laxton [15], verifying a related conjecture of Singer, determined the exact number of reduced difference sets of Singer type in , where a(n additive) difference set is called reduced if it contains both [math] and .
We finish this subsection with an equivalent formulation of Singer’s construction that will be useful later. We consider the cyclic group \mbox{\mathcal{G}}=\raisebox{2.5pt}{\mathbb{F}{q^{3}}^{*}}\left/\raisebox{-2.5pt}{\mathbb{F}{q}^{*}}\right.. The order of this group is and the cosets of those elements for which the trace form a difference set of size which is equivalent to the Singer difference set (see e.g. [23]).
1.3 Results
Difference sets.
In order to treat infinite difference sets as well, we introduce our definitions and results for arbitrary fields, restricting to finite fields only when necessary. This general approach also keeps the arguments more transparent.
Let be an arbitrary field and a Galois extension of degree 3. Let be a nonidentity -automorphism of . Then the Galois group of the extension over is , where and, of course, . We denote by the norm of this extension: for we have . When it causes no confusion, which will be the case most of the time, we omit writing the index . Examples of such extensions are simplest cubic fields [24], which are important and well studied objects in algebraic number theory.
We shall consider two functions defined as
[TABLE]
For let \mbox{\mathcal{H}}_{i} denote the set of roots of in and let denote the set of elements in with norm . It is easy to see that is a subgroup of the multiplicative group . In our first result we prove that \mbox{\mathcal{H}}_{1} and \mbox{\mathcal{H}}_{2} form a difference set in the cyclic group with an explicit formula for the mixed representation.
Theorem 1.1**.**
The sets \mbox{\mathcal{H}}_{1} and \mbox{\mathcal{H}}_{2} are equivalent difference sets in the group and \mbox{\mathcal{H}}_{2}=\mbox{\mathcal{H}}_{1}^{-1}. Furthermore, the unique mixed representation of an element A\in\mbox{\mathcal{N}}\setminus\{1\} (with respect to \mbox{\mathcal{H}}_{i}) is given by the following explicit formulas:
[TABLE]
Infinite difference sets were earlier constructed by Hughes [16] using a greedy-like approach. Our construction is more explicit and so offers more possibilities to study these nice combinatorial structures.
Next we spell out the statement of our theorem for finite fields. We shall show that in this case our difference sets are of Singer type. Let , and take to be the Frobenius automorphism . Then and become polynomials over , namely
[TABLE]
and the group is the unique subgroup of order in .
Corollary 1.2**.**
The root set \mbox{\mathcal{H}}_{1}\subseteq\mathbb{F}_{q^{3}} of the polynomial and the root set \mbox{\mathcal{H}}_{2}\subseteq\mathbb{F}_{q^{3}} of the polynomial are equivalent difference sets of size in the order cyclic group of norm elements of with \mbox{\mathcal{H}}_{2}=\mbox{\mathcal{H}}_{1}^{-1}. Furthermore the unique mixed representation of an element A\in\mbox{\mathcal{N}}\setminus\{1\} (with respect to \mbox{\mathcal{H}}_{i}) is given by the following explicit formulas:
[TABLE]
Moreover, both \mbox{\mathcal{H}}_{1} and \mbox{\mathcal{H}}_{2} are equivalent to the Singer difference set.
Even though the difference sets given here are equivalent to Singer’s construction, their description as the roots of a simple polynomial and the explicit formulas for the mixed representation are interesting on their own right.
In Section 3 we generalize Theorem 1.1 and Corollary 1.2 from the planar case to Singer difference sets of arbitrary classical parameters.
Projective norm graphs.
As already mentioned earlier, one of the main results in [2] is that if then contains as a subgraph. Relying heavily on the properties of the Singer difference set from Corollary 1.2 and its connection to norm equation systems, here we settle the remaining cases of characteristic and .
Theorem 1.3**.**
Let where is a prime. Then contains as a subgraph. In particular, and contain as a subgraph for and .
Complementing Theorem 1.3 we remark that it is immediate that does not contain , and in and we verified by computer search that there is no either.
2 Proofs
2.1 Properties of the sets
We start by proving a few helpful properties of the sets \mbox{\mathcal{H}}_{i}, inlcuding their unique mixed representation property from Theorem 1.1.
Proposition 2.1**.**
- (i)
For we have . In particular, \mbox{\mathcal{H}}_{2}=\mbox{\mathcal{H}}_{1}^{-1}. 2. (ii)
Every A\in\mbox{\mathcal{N}}\setminus\{1\} can be represented uniquely as a product of an element of \mbox{\mathcal{H}}_{1} and an element of \mbox{\mathcal{H}}_{2}. This representation is given by
[TABLE] 3. (iii)
[TABLE]
in particular, if , then
[TABLE] 4. (iv)
If then , in particular \phi(\mbox{\mathcal{H}}_{i})=\mbox{\mathcal{H}}_{i}.
Proof.
(i) For we have
[TABLE]
The rest of the statement follows by the definition of the \mbox{\mathcal{H}}_{i}’s.
(ii) First we show the uniqueness of the representation of the form (2). Suppose that A\in\mbox{\mathcal{N}}\setminus\{1\} and with A_{1}\in\mbox{\mathcal{H}}_{1} and A_{2}=A/A_{1}\in\mbox{\mathcal{H}}_{2}. Then
[TABLE]
By expressing from the two equations we obtain
[TABLE]
Solving for gives that the only possibility is
[TABLE]
This gives uniqueness and the stated formula (1) for as well. It remains to verify that A_{i}\in\mbox{\mathcal{H}}_{i}. We consider first . Using
[TABLE]
we have
[TABLE]
and hence A\in\mbox{\mathcal{H}}_{1}. The verification of A_{2}\in\mbox{\mathcal{H}}_{2} is a similar calculation that we leave to the reader.
(iii) To see the desired equalties of sets note that for an element we have if and only , which happens if and only if .
If furthermore , then for we have , while otherwise the non-trivial third-roots of unity are in if and only if .
(iv) The statement is a direct consequence of the fact that is an automorphism that fixes . ∎
2.2 Difference sets and a norm equation system
After Proposition 2.1(ii), all we need in order to complete the proof of Theorem 1.1 is to show that \mbox{\mathcal{H}}_{1},\mbox{\mathcal{H}}_{2}\subseteq\mbox{\mathcal{N}}. In our next result we are not only proving that the elements of \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2} indeed have norm , but we are also able to characterize them as the solutions in of the norm equation system
[TABLE]
which is closely related to projective norm graphs. Besides this connection, the system (3) also arises naturally in algebraic number theory. When is a number field, then the algebraic integer solutions of (3) will be exceptional units in the sense of Nagell [22]. Exceptional units are interesting objects, in particular one can show that their number is always finite.
Proposition 2.2**.**
* is a solution of (3) if and only if Y\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}.*
Proof.
The proof is adapted from [2] which handled the finite field setting. We first write the equations of (3) in simple product form.
[TABLE]
Expressing from both equations and clearing denominators gives
[TABLE]
After expanding and simplifying we obtain
[TABLE]
It is easy to check that the left hand side of (4) is
[TABLE]
Clearly, by the above calculations, any solution of (3) will be a solution of (4), hence , which in turn is equivalent to Y\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}.
Conversely, let Y\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2} i.e. . Then either
[TABLE]
or
[TABLE]
Note that the denominator is non-zero in both cases. Using part (iv) of Proposition 2.1, in the first case we obtain
[TABLE]
while in the second case we get
[TABLE]
In both cases we have and therefore
[TABLE]
Similarly, for the norm of we obtain
[TABLE]
This finishes the proof. ∎
Proof of Theorem 1.1..
Proposition 2.2 shows that for every X\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}, hence \mbox{\mathcal{H}}_{1},\mbox{\mathcal{H}}_{2}\subseteq\mbox{\mathcal{N}}. The equality \mbox{\mathcal{H}}_{2}=\mbox{\mathcal{H}}_{1}^{-1} is just part (i) of Proposition 2.1, while the unique mixed representation of an element A\in\mbox{\mathcal{N}}\setminus\{1\} is provided by part (ii) of Proposition 2.1. ∎
Proof of Corollary 1.2..
Most of the statements follow directly by applying Theorem 1.1 to the setting , , and . Note that then is an order multiplicative group, hence any difference set in it, in particular \mbox{\mathcal{H}}_{1} and \mbox{\mathcal{H}}_{2}, must have size . In particular, this implies that both and have all their roots in \mbox{\mathcal{N}}\subseteq\mathbb{F}_{q^{3}}.
It remains to prove the equivalence of \mbox{\mathcal{H}}_{1} (and so of \mbox{\mathcal{H}}_{2}) to the Singer difference set , for which we use the description mentioned at the end of Subsection 1.2, i.e.
[TABLE]
Consider the group homomorphism , given by . Since , the image of is contained in . The kernel is and |\mbox{\mathcal{N}}|=q^{2}+q+1=\frac{q^{3}-1}{q-1}, so the quotient map provides an isomorphism between the groups \raisebox{2.5pt}{\mathbb{F}{q^{3}}^{*}}\left/\raisebox{-2.5pt}{\mathbb{F}{q}^{*}}\right. and .
We claim that maps into \mbox{\mathcal{H}}_{1}, i.e. if is such that , then A^{q-1}\in\mbox{\mathcal{H}}_{1}. Indeed,
[TABLE]
Using the injectivity of and |\mbox{\mathcal{S}}|=|\mbox{\mathcal{H}}_{1}|, we obtain that \bar{\Phi}(\mbox{\mathcal{S}})=\mbox{\mathcal{H}}_{1}, showing that gives the desired equivalence of the difference sets and \mbox{\mathcal{H}}_{1}. ∎
2.3 Norm equation systems with the maximum number of solutions
Let be an arbitrary field and a Galois extension of degree . Finding a in , up to a couple of technicalities to be handled later, is essentially equivalent to finding distinct pairs such that the system
[TABLE]
has six solutions . Note that by the -freeness of the projective norm graph (see Subsection 5.1 in the Appendix), we also know that (5) can have at most six solutions for any values of the parameters.
In what follows we will study this system for special sets of parameters and try to find particular choices where the maximum possible six solutions are attained. The main result of this subsection is that in some cases this is indeed possible. For a fixed element A\in\mbox{\mathcal{N}}\setminus\{1\} consider the following system of norm equations:
[TABLE]
Theorem 2.3**.**
Let , where is prime, and let , . Then there exists an element A\in\mbox{\mathcal{N}}\setminus\{1\} such that the system (6) has 6 solutions in .
The starting point in the proof of Theorem 2.3 is an observation, valid over arbitary fields, that connects the solution set of the system (6) to the solution set of (3) and hence to the difference sets \mbox{\mathcal{H}}_{1}, \mbox{\mathcal{H}}_{2}.
Proposition 2.4**.**
An element is a solution of (6) with parameter A\in\mbox{\mathcal{N}}\setminus\{1\} if and only if and are both contained in \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}.
Proof.
By Proposition 2.2 and are both contained in \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2} if and only they are both solutions of (3). We show that this is equivalent to being a solution of (6).
Suppose first that is a solution of (6). Then a fortiori is a solution of (3) and . Also,
[TABLE]
hence is also a solution of (3).
Conversely, assume that and are both solutions of (3). Then, in particular, satisfies the first two equations from (6), as for the third one we have
[TABLE]
and hence is a solution of (6). ∎
By the previous propostion we will be looking for product representations of an element from the set \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}. To prove Theorem 2.3 we actually need to find an element A\in\mbox{\mathcal{N}}\setminus\{1\} that has three such product representations , such that the six elements B_{1},C_{1},B_{2},C_{2},B_{3},C_{3}\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2} are all distinct. For this we will crucially use that \mbox{\mathcal{H}}_{1} and \mbox{\mathcal{H}}_{2}=\mbox{\mathcal{H}}_{1}^{-1} are difference sets in and inverses of each other.
Recall that if is any difference set in some multiplicative group then every element A\in\mbox{\mathcal{G}}\setminus\{1\} has a unique representation, called mixed representation, as a product such that one of and is from and the other is from \mbox{\mathcal{D}}^{-1}. In the next propositions we summarize our knowledge about other product representations. To this end we will call a product a **-representation of the element A\in\mbox{\mathcal{G}} if both and are from .
Proposition 2.5**.**
Let be an arbitrary difference set in some multiplicative group . Then every A\in\mbox{\mathcal{G}} has at most one -representation.
Proof.
Let us assume that for some D_{1},D_{2},D_{3},D_{4}\in\mbox{\mathcal{D}}. Then , and this, by the difference set property, is either or we have and : in any case . ∎
The explicit descriptions of our difference sets allow us to characterize when an \mbox{\mathcal{H}}_{i}-representation with distinct factors exists.
Proposition 2.6**.**
- (i)
If then A\in\mbox{\mathcal{N}} has an \mbox{\mathcal{H}}_{1}-representation with different factors if and only if is a non-zero square in . 2. (ii)
If then A\in\mbox{\mathcal{N}} has an \mbox{\mathcal{H}}_{2}-representation with different factors if and only if is a non-zero square in .
Proof.
In the case of finite fields most parts of the argument have already appeared in [2]. As the proof of the two parts is analogous, below we only present the one of (i).
Suppose first that A\in\mbox{\mathcal{N}} has an \mbox{\mathcal{H}}_{1}-representation. This means that there is an element such that and are both roots of , i.e.
[TABLE]
after expressing from both equations, letting them being equal and clearing denominators we obtain . Clearly, the role of and can be switched, which means that both and are roots of the quadratic equation
[TABLE]
If char(, this is possible only if the discriminant
[TABLE]
is a nonzero square in .
For the other direction suppose that is a nonzero square in , i.e. there is some element such that . Then we know that the quadratic equation in (7) has two different roots, namely . Clearly, , so to finish the proof it is enough to show that X_{\pm}\in\mbox{\mathcal{H}}_{1}, i.e. .
Using we have
[TABLE]
Then and hence . However which, as char(, excludes . Therefore . As a consequance we get
[TABLE]
Now we are ready to substitute into .
[TABLE]
where at the last equality we just used that are the roots of (7). ∎
For the elements of \mbox{\mathcal{H}}_{i} the existence of a \mbox{\mathcal{H}}_{3-i}-representation follows directly.
Proposition 2.7**.**
If then its unique \mbox{\mathcal{H}}_{3-i}-representation is given by .
Proof.
On the one hand, as , we have that . On the other hand, by Proposition 2.1(i) we have , and so by Proposition 2.1(iv) we have \frac{1}{\phi(A)}=\phi\left(\frac{1}{A}\right)\in\mbox{\mathcal{H}}_{3-i} and . The uniqueness follows from Proposition 2.5. ∎
From now on we will consider the special case (and ), and separate the cases according to the characteristic modulo .
2.3.1 Characteristic
In this subsection we settle the case of characteristic which was left open in [2]. Our method extends to odd characteristic , which was settled, in a much stronger form, already in [2].
First we show the existence of six solutions when is congruent to modulo (as opposed to ).
Proposition 2.8**.**
Let be a prime power such that , and let and . Then there exists an element A\in\mbox{\mathcal{N}}\setminus\{1\} such that the system (6) has 6 solutions in .
Proof.
We will find an element A\in\mbox{\mathcal{N}}\setminus\{1\} that has an \mbox{\mathcal{H}}_{i}-representation for both and , such that . These four elements, together with the two elements A_{1}\in\mbox{\mathcal{H}}_{1} and A_{2}\in\mbox{\mathcal{H}}_{2} from the unique mixed representation of (which exists by Proposition 2.1(ii)) give us six distinct solutions of (6). Indeed, they are solutions of (6) by Proposition 2.4 and their distinctness follows immediately from the fact that the sets \mbox{\mathcal{H}}_{1} and \mbox{\mathcal{H}}_{2} are disjoint by Proposition 2.1(iii).
In order to find the appropriate element , for a set \mbox{\mathcal{H}}\subseteq\mbox{\mathcal{N}} we define
[TABLE]
to be the set of its pairwise products from distinct factors, and show that \mbox{\mathcal{H}}_{1}^{*}\cap\mbox{\mathcal{H}}_{2}^{*} is not empty.
First note that by Proposition 2.6(ii) the pairwise products of the elements of \mbox{\mathcal{H}}_{i} are all distinct, hence the cardinality of \mbox{\mathcal{H}}_{i}^{*} is \binom{|\mbox{\mathcal{H}}_{i}|}{2}=\frac{q^{2}+q}{2}. Both \mbox{\mathcal{H}}_{1}^{*} and \mbox{\mathcal{H}}_{2}^{*} are subsets of the -element set \mbox{\mathcal{N}}\setminus\{1\}. For this note that \mbox{\mathcal{H}}_{i} is contained in , which is closed under multiplication, and that 1\not\in\mbox{\mathcal{H}}_{i}^{*} since \mbox{\mathcal{H}}_{i} is disjoint from its inverse \mbox{\mathcal{H}}_{3-i} by our assumption on and Proposition 2.1(iii). Hence the only way \mbox{\mathcal{H}}_{1}^{*} and \mbox{\mathcal{H}}_{2}^{*} could be disjoint is if their union is \mbox{\mathcal{N}}\setminus\{1\}. In this case however it would also hold that
[TABLE]
where denotes the sum of the elements of a subset . On the one hand the set is the collection of all roots in of the polynomial and so \sigma(\mbox{\mathcal{N}}) is times the coefficient of in this polynomial, which is [math]. From this we obtain that \sigma(\mbox{\mathcal{N}}\setminus\{1\})=-1. On the other hand \mbox{\mathcal{H}}_{i} is the set of all roots in of the polynomial , hence \sigma(\mbox{\mathcal{H}}_{i}^{*}) is the coefficient of in , which is 0 for . We arrived to a contradiction, as the left hand side of (8) is (-1), while the right hand side is [math]. ∎
Proof of Theorem 2.3 for .
First note that is a cubic extension of and the norm of an element is the same, irrespective in which of the two fields we compute it: . This means that if for an element with the system (6) with the norm function has six distinct solutions , then the very same six elements are also solutions of the the system (6) with the norm function .
Now let be a prime and let be an arbitrary power where is odd. Then Proposition 2.8 gives the required six distinct solutions when and . By repeated application of the above observation, the statement also follows for any positive integer and . These include all the powers when .
When then only those powers are included where . So we are left with prime powers of the form . To settle these last cases one first resolves the problem when the prime power is and then uses the above squaring trick to deduce the case of arbitrary .
For we have found the appropriate of norm , for which the system (6) has six distinct solution with the aid of a computer. To describe this example, let be the primitive element of whose minimal polynomial over is , and consider the system
[TABLE]
By Magma Calculator [6] it is easily verified that is in \mbox{\mathcal{N}}\setminus\{1\}, and that the system has indeed six solutions, namely U^{1725},U^{2775},U^{3435}\in\mbox{\mathcal{H}}_{1} and U^{1065},U^{2130},U^{2370}\in\mbox{\mathcal{H}}_{2} with
[TABLE]
∎
2.3.2 Characteristic
Proof of Theorem 2.3 for .
Just like in the previous subsection, we will find an element A\in\mbox{\mathcal{N}}\setminus\{1\} which has an \mbox{\mathcal{H}}_{i}-representation for both and , such that these four elements and the two elements A_{1}\in\mbox{\mathcal{H}}_{1} and A_{2}\in\mbox{\mathcal{H}}_{2} from the mixed representation of (which exists by Proposition 2.1(ii)) are pairwise distinct and hence provide six distinct solutions of (6).
We do this in two steps. First we find an element that has both \mbox{\mathcal{H}}_{1}- and \mbox{\mathcal{H}}_{2}-representation, but in one of them the factors are not distinct.
Lemma 2.9**.**
For or there is an element C\in\mbox{\mathcal{H}}_{i}\setminus\{1\}, such that has an \mbox{\mathcal{H}}_{3-i}-representation with distinct factors .
Let us fix elements C\in\mbox{\mathcal{H}}_{i}\setminus\{1\} and B,E\in\mbox{\mathcal{H}}_{3-i} guaranteed by Lemma 2.9. We show that the element is the kind we are looking for. First observe that by Proposition 2.1(i)
[TABLE]
provide a \mbox{\mathcal{H}}_{i}- and \mbox{\mathcal{H}}_{3-i}-representation of , respectively. Note furthermore that as (\mbox{\mathcal{H}}_{i}\setminus\{1\})\cap\mbox{\mathcal{H}}_{3-i}=\emptyset, we have and hence . Consequently, by Proposition 2.1(ii) there exists a unique mixed representation with A_{i}\in\mbox{\mathcal{H}}_{i}.
Next we show that these six elements from the representations are all distinct.
Lemma 2.10**.**
The elements A_{i},C,\frac{1}{E}\in\mbox{\mathcal{H}}_{i} and A_{3-i},\frac{1}{C},B\in\mbox{\mathcal{H}}_{3-i} are all distinct.
To finish the proof of Theorem 2.3 note that by Proposition 2.4 these elements provide six distinct solutions of (6). ∎
We finish this subsection proving the two lemmas from the above proof.
Proof of Lemma 2.10.
For the distinctness first we establish that none of the six elements is . This is certainly true for and by the choice of in Lemma 2.9. Now assume that or is , say (the argument in the case is analogous). On the one hand, as E\in\mbox{\mathcal{H}}_{3-i}, by Proposition 2.7 has a unique \mbox{\mathcal{H}}_{i}-representation: . On the other hand is also a \mbox{\mathcal{H}}_{i}-representation of , so by the uniqueness we must have , and thus and E^{q}=\frac{1}{C}\in\mbox{\mathcal{H}}_{3-i}. That means \phi(E)=E^{q}\in\mathbb{F}_{q}\cap\mbox{\mathcal{H}}_{3-i}=\mbox{\mathcal{H}}_{1}\cap\mbox{\mathcal{H}}_{2}=\{1\} by Proposition 2.1(iii), which is only possible if . This contradicts and implies . Finally assume that or is equal to , say . Then are two \mbox{\mathcal{H}}_{2}-representations of . By uniqueness either or should be , which is a contradiction by the above.
Since none of the six elements is and by part (iii) of Proposition 2.1 \mbox{\mathcal{H}}_{1}\cap\mbox{\mathcal{H}}_{2}=\{1\}, we established that
[TABLE]
We are left to show that and . Since they are proved analogously we present just the first one.
If , then , which is a contradiction as A_{3-i}\in\mbox{\mathcal{H}}_{3-i} and \frac{1}{E}\in\mbox{\mathcal{H}}_{i} and none of them is . If , then , which is a contradiction similarly as A_{3-i}\in\mbox{\mathcal{H}}_{3-i} and C\in\mbox{\mathcal{H}}_{i} and none of them is . Finally, suppose that . Then we have , which is a contradiction as B\in\mbox{\mathcal{H}}_{3-i}\setminus\{1\} and C^{3}\in\mbox{\mathcal{H}}_{i}\setminus\{1\} because the polynomial is defined over , hence if , then as well. ∎
Proof of Lemma 2.9.
We want to find a C\in\mbox{\mathcal{H}}_{i}\setminus\{1\} for or , such that has an \mbox{\mathcal{H}}_{3-i}-representation with different elements and . This happens exactly if one of the formulas in Proposition 2.6 is a nonzero square in when we substitute . It turns out that after simplifying the substituted formula of (i) using and clearing its square denominator we obtain the very same expression as after simplifying the substituted formula of (ii) using and clearing its square denominator:
[TABLE]
We aim to find an element C\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\} for which is a square in , or equivalently, is a square in .
As it turns out the factors of can be conveniently expressed using the trace of :
[TABLE]
and so
[TABLE]
In characteristic this expression is a square if and only if is a square. Using Theorem 5.18 from [20] we get that
[TABLE]
where is the quadratic character of . Therefore, as has at most two solutions, for at least elements the expression is a square.
This ensures the existence of many good “traces”, which we can use to construct many good , as we now show that the trace function is a -to- function on \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\}. That is, if for C_{1},C_{2}\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\} then and are conjugates of each other. For this we note that the minimal polynomial of an element of \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\} can be expressed just by the trace of :
[TABLE]
Hence if and have the same trace, then they have the same minimal polynomial.
Consequently there are exactly \frac{|\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\}|}{3}=\frac{2q}{3} elements in that are traces of some element in \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\}.
In conclusion, there are at least elements which are traces of an element from \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\}, and for which , and hence also , is a square. This completes the proof for .
Otherwise, by our assumption on , we are left with the case . Then we can directly find a such that it is the trace of an element C\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\} and is a nonzero square in . In fact will do. First note that is in and hence is a square in its quadratic extension . Now, to finish the argument it is enough to show that is the minimal polynomial of some C\in\mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\} over , because then we automatically have . It is immediate that is irreducible over , hence it can not have a root in , and therefore it is irreducible over . Next consider the polynomial for . Then (when computed over ) we have
[TABLE]
which in view of Proposition 2.2 means that the roots of solve the system (3) with norm function . But then, as we have seen earlier, the roots of also solve the system (3) with norm function , and hence, again by Proposition 2.2 and the fact , we have that any root of is in \mbox{\mathcal{H}}_{1}\cup\mbox{\mathcal{H}}_{2}\setminus\{1\}, as desired. ∎
2.4 Norm equation systems and subgraphs in
In this subsection we prove Theorem 1.3. In the first lemma we connect solutions of a norm equation systems with three equations to four adjacencies in the projective norm-graph. For this let again be an arbitrary field and a Galois extension of degree .
Lemma 2.11**.**
Suppose that for and , the element is a solution of (5). Then in the projective norm graph the vertex is adjacent to all the vertices
[TABLE]
Proof.
We check the adjacenies from the statement. For the first three vertices, using , we have
[TABLE]
For the last vertex we have
[TABLE]
as requested. ∎
The statement of Theorem 1.3 now follows easily.
Proof of Theorem 1.3.
By Theorem 2.3 there exists an element A\in\mbox{\mathcal{N}}\setminus\{1\} such that the system (6) admits solutions in . We choose an element from such that . This is clearly possible since for . Let , , , , , and . The corresponding norm equation system of the form (5), as the translation of (6) by , also has six distinct solutions, which we denote by . Since by the choice of the elements and , as well as the solutions are non-zero, Lemma 2.11 is applicable. As the elements are also distinct, so are the vertices
[TABLE]
which we denote by , . By Lemma 2.11 each of them is adjacent to the six distinct vertices , .
In order for these adjacencies to indeed give rise to a in , we need to make sure that none of them represents a loop.
If , then has no loop edges, so all the participating vertices are different, and they form a .
Assume now that . Let us call an element bad for the pair of indicies , if . For every fixed pair there exists exactly one which is bad for , namely . Therefore, together there are at most elements which are bad for some pair . As , there exists an element which is not bad for any pair. For this , the ten vertices , , and , , are all distinct and hence give rise to a . ∎
3 General difference sets of Singer type
In general an difference set is a set of elements in a multiplicative group of order , such that any element has exactly mixed product representations with respect to . Singer’s construction naturally generalizes to the case with parameters for any , which are called Singer parameters. Unlike for , the planar case, for many values difference sets having Singer parameters yet being inequivalent to Singer’s construction are known to exist (see e.g. [13]).
In the case of planar difference sets we made use of a convenient description of the Singer difference set inside the multiplicative group \raisebox{2.5pt}{\mathbb{F}{q^{3}}^{*}}\left/\raisebox{-2.5pt}{\mathbb{F}{q}^{*}}\right. as the collection of cosets of elements of trace [math]. In what follows, we extend this description to the general setting of degree cyclic Galois extensions over arbitrary fields , that we encountered already in Section 1 in connection with projective norm graphs. To this end, let be an arbitrary field and a cyclic Galois extension of degree with . Let be the trace function corresponding to this extension, i.e. for we have
[TABLE]
where denotes the -fold iteration of some generator of the Galois group. Now consider the subset
[TABLE]
of the multiplicative group \raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right., where denotes the image of under the natural map \mathbb{K}^{*}\rightarrow\raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right..
It is known [23] that when is a finite field then is a Singer difference set with parameters . This can be extended for arbitrary , using the natural -dimensional projective space structure on \raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right. (which is induced by the -dimensional -vector space structure of ). It turns out that for any non-identity element , the set of -elements from the mixed representations of with respect to forms a subspace of projective dimension .
Proposition 3.1**.**
Let \overline{\mbox{\mathcal{L}}} be a subspace of \raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right. of projective dimension . Then for every element \overline{A}\in\raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right.\setminus\left\{\overline{1}\right\} the set
[TABLE]
forms a subspace of projective dimension .
Proof.
Let be a -dimensional subspace of over such that \overline{\mbox{\mathcal{L}}}=\raisebox{2.5pt}{\mbox{}\setminus{0}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right.. Then for any element \overline{A}\in\raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{*}}\right.\setminus\left\{\overline{1}\right\} we have
[TABLE]
where is such that and
[TABLE]
Observe that \mbox{\mathcal{R}}_{\mbox{\mathcal{L}}}\left(A\right)=\mbox{\mathcal{L}}\cap A\mbox{\mathcal{L}}, where A\mbox{\mathcal{L}}=\{AL\ |\ L\in\mbox{\mathcal{L}}\}.
Since , the -dimensional subspaces and A\mbox{\mathcal{L}} are different, hence their intersection has dimension . Therefore the projective dimension of \mbox{\mathcal{R}}_{\overline{\mbox{\mathcal{L}}}}\left(\overline{A}\right) is indeed . ∎
Corollary 3.2**.**
Let \overline{\mbox{\mathcal{L}}} be a subspace of \raisebox{2.5pt}{\mathbb{F}_{q^{t}}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right. of projective dimension . Then \overline{\mbox{\mathcal{L}}} is a difference set in the multiplicative group \raisebox{2.5pt}{\mathbb{F}_{q^{t}}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right. with parameters . In particular, so is .
Proof.
The set \mbox{\mathcal{R}}_{\overline{\mbox{\mathcal{L}}}}\left(\overline{A}\right) is in a one-to-one correspondence with the collection of mixed \overline{\mbox{\mathcal{L}}}-respresentations of . Since a projective space of dimension over has size , the parameters of the difference set follow.
Finally note that as is a non-trivial -linear function, is a -dimensional subspace of . Hence the set\mbox{\mathcal{S}}_{t}=\raisebox{2.5pt}{\text{Ker}(\operatorname{Tr}_{\mathbb{K}/\mathbb{F}})\setminus{0}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right. is a subspace of \raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{*}}\right. of projective dimension , and as such is a difference set with Singer parameters. ∎
In Corollary 1.2 we gave an alternative description of planar difference sets of Singer type over finite fields as the root set of a simple polynomial and gave explicit formulas of the product representation of each element. Here we extend this result to the general setting. For this let denote the norm function of the extension and the group of elemens of norm in . Furthermore, we shall consider the function
[TABLE]
We remark that the function appears in a paper of Foster [12] in the formulation of the Murphy condition.
In the next theorem we show that the set
[TABLE]
of roots of in is contained in the multiplicative group and has the same difference set property that the mixed representation of any element A\in\mbox{\mathcal{N}}\setminus\{1\} with respect to \mbox{\mathcal{D}}_{t} form (in some sense) a projective space of dimension over . In addition we will also be able to describe concisely these product representations.
Theorem 3.3**.**
There is a group isomorphism \overline{\Phi}:\raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right.\rightarrow\mbox{\mathcal{N}} such that \overline{\Phi}(\mbox{\mathcal{S}}_{t})=\mbox{\mathcal{D}}_{t}. In particular, through , the set \mbox{\mathcal{D}}_{t} inherits the difference set property of \mbox{\mathcal{S}}_{t} just like the projective space structure. Moreover, given an element A\in\mbox{\mathcal{N}}\setminus\{1\} the different mixed representations of with respect to \mbox{\mathcal{D}}_{t} are exactly the products , where is a root in of the function
[TABLE]
Proof.
Consider the map defined by . On the one hand, one readily sees that the map maps into . On the other hand, by Hilbert’s Theorem 90 [19] we know that for every A\in\mbox{\mathcal{N}} there is an element such that , which in turn shows that is surjective. Therefore, as Ker, the quotient map \overline{\Phi}:\raisebox{2.5pt}{\mathbb{K}^{}}\left/\raisebox{-2.5pt}{\mathbb{F}^{}}\right.\rightarrow\mbox{\mathcal{N}} provides an isomorphism between the respective groups.
Next we show that the image of \mbox{\mathcal{S}}_{t} under the map is \mbox{\mathcal{D}}_{t}. For this let . Then, on the one hand, we have
[TABLE]
Therefore, if \overline{Y}\in\mbox{\mathcal{S}}_{t}, then \overline{\Phi}\left(\overline{Y}\right)\in\mbox{\mathcal{D}}_{t}. Finally, let A\in\mbox{\mathcal{D}}_{t}, i.e. is a root of . Then , and hence, again by Hilbert’s Theorem 90, there is an element such that and so . By the above calculations , meaning that \overline{Y}\in\mbox{\mathcal{S}}_{t}. This concludes the proof of \overline{\Phi}(\mbox{\mathcal{S}}_{t})=\mbox{\mathcal{D}}_{t}.
Now let us turn to the second part of the theorem. Given an element A\in\mbox{\mathcal{N}}\setminus\{A\} first take a mixed representations with B,C\in\mbox{\mathcal{D}}_{t}. Then, in particular, we have C=\frac{B}{A}\in\mbox{\mathcal{D}}_{t} and hence . Therefore, we have that is also a root of the function
[TABLE]
For the other direction suppose that is a root of . Note that then necessarily , as otherwise we would have , which is a contradiction as for A\in\mbox{\mathcal{N}}\setminus\{1\} we have . To finish the proof we need to show that , as then the product is a valid product representation of with respect to \mbox{\mathcal{D}}_{t}. Using that and , we have
[TABLE]
and hence . However, as remarked earlier, for A\in\mbox{\mathcal{N}}\setminus\{1\} we have , so this at once implies that , and so , as required. ∎
Next we spell out the special case of Theorem 3.3 when , and is the Frobenius automorphism . This gives a description of the classic Singer difference set inside as the set of roots of a simple polynomial and describes the mixed representations of any element also using the roots of a polynomial.
Corollary 3.4**.**
Let be a prime power, an integer, and let us define over the polynomial
[TABLE]
of degree . Then the set
[TABLE]
of roots of forms a -difference set in the cyclic group of norm elements of , which is equivalent to the Singer difference set \mbox{\mathcal{S}}_{t}. Moreover, given an element A\in\mbox{\mathcal{N}}\setminus\{1\}, the different mixed \mbox{\mathcal{D}}_{t}-representations of are exactly the products , where is a root in of the degree polynomial
[TABLE]
∎
In connection with Corollary 3.4 first note, that in particular it implies that the polynomials and always split over . Also, in the special case , we recover the difference set \mbox{\mathcal{H}}_{1} from Corollary 1.2. In this case the polynomial is linear and its unique root is exactly the elment from Corollary 1.2.
4 Concluding remarks
It is widely conjectured [5, 9] that the KST upper bound,
[TABLE]
is tight up to constant factor for every . Together with the results of [2], Theorem 1.3 establishes that for , the projective norm graph does not resolve this conjecture beyond the cases .
Several interesting questions remain open.
Complete bipartite graphs in projective norm graphs.
Both in [2] and in Theorem 1.3 we could only find a special kind of copies of . The number of these copies is only roughly . If that was it, then a simple uniform random subgraph of with a few deleted edges would prove the tightness of the KST-bound for and . We think however, also supported by computer experiments, that the number of copies of in should be the same order as their typical number in the random graph of the same edge density.
Conjecture 1**.**
The number of copies of in is .
The determination of is still widely open for , when we do not even know whether there is a in for every large enough . While it is probably more realistic to expect that there are copies of for every and large enough (besides numerology, i.e. that for and , there are also algebro-geometric heuristics pointing towards this), we harbour a slim hope that was still a special case. At least the graph seems quite special, with a unique structure and symmetries, and maybe that alone is responsible for the presence of subgraphs.
Infinite projective norm graphs.
The first constructions of dense -free graphs were motivated by simple facts from real Euclidean geometry: two lines of the plane intersect in at most one point; three unit spheres in -space intersect in at most two points. Consequently the point/line incidence graph of the Euclidean plane is -free, and the unit-distance graph of the Euclidean -space is -free. Furthermore these infinite -free graphs are “dense” in terms of the dimension of the neighborhoods. So when defined over appropriate finite fields, in a way that the algebra in the proof of their -freeness carries over, their number of edges verifies the tightness of the KST-bound for and .
The (projective) norm graphs were not constructed this way, yet one can define them over an arbitrary field , see Section 1. The key lemma from [17] holds over any field, which implies that the proof of the -freeness of also extends to for arbitrary and arbitrary Galois extension of degree . (For completeness we include the argument in the Appendix.) In particular, if then does not contain for any field . After seeing that does contain for any , it might seem plausible that the same is true for infinite fields.
The tightness of the KST-bound.
The tightness of the order of magnitude of the KST-bound is a central question of the area. This conjecture suggests that whatever density is not ruled out by simple double counting, should essentially be possible to realize with a construction. Here we speculate that this might not be the case and offer a counter-conjecture.
In any graph with edges, the number of common neighbors of an average -tuple is (at least) a constant depending on . If this graph with edges is random then this constant average is spread out over distributions that are each approximately Poisson with mean . Consequently for any , a positive constant proportion of -tuples have at least neighbors. In contrast, in any -free construction with edges (matching the KST-bound), no -tuple can have more than neighbors. So in such constructions each of the Poisson-tails has to be absorbed by the -tuples with at most common neighbors. Should such graphs exist for some , they must be extremely rare, their mere existence has to be a coincidence and should require quite a bit of structure.
In all known constructions (including Klein [10], Brown [7], KRS [17], ARS [1] and Bukh [8]) this is realized using the algebro/geometric notion of dimension and its strong correlation with the cardinality of the corresponding variety: an “everyday” -dimensional variety over has roughly points. To achieve that the common neighborhood of four vertices is less than a constant , one appeals to the geometric intuition that in the four-dimensional space the intersection of four hypersurfaces, that are in general enough position, is [math]-dimensional, and hence it is the union of constantly many points. A graph can be defined on a four-dimensional space of roughly vertices, and the neighborhood of each vertex can be chosen to be some hypersurface, which then have roughly the desired size . For a -free graph the intersection of any four of the neighborhood-hypersurfaces should have size . Now if the neighborhood-hypersurfaces are carefully chosen, so that any four of them are in general enough position, then their intersection is [math]-dimensional and hence has size , a constant.
How to choose the hypersurfaces and what is this constant? Even though choosing randomly is a generally good strategy (witnessed by the random algebraic construction of Bukh [8]), finding good explicit choices, as it is often the case, is not so straightforward. By the KST-bound the constant bounding the neighborhoods of -tuples in any graph with edges is at least , and the projective norm graph chooses neighborhoods where they are bounded by not more than . The current analysis of the random choice gives an upper bound of .
Now how small could this constant be? We believe that the presence of some notion of “dimension” in this problem is a necessity and this constant is just going to be in the nature of the geometry of the hypersurface-neighborhoods we have chosen. As such, it will not just be limited by the simple combinatorial restrictions of the KST-bound but also by those of geometry/algebra. And then its extrema should be delivered by a regular, rigid structure with distinctive properties. For we have seen ample evidence that the projective norm graph fits this bill, and tend to accept it as the limit of what algebra can offer in this realm. Since we know now that does occur in , we conjecture the following.
Conjecture 2**.**
.
We note that should this conjecture be true, it of course implies that the KST-bound is not tight for the symmetric case either. That further implies that for every ; this is the consequence of (an adaptation of) a theorem of Erdős and Simonovits [11].
While we do believe Conjecture 2, at the same time we also think that it is more likely that we see it disproved than proved. For a proof one might need to develop a two step approach. Given a -free graph with edges, build up a significant-enough proportion of a pseudo-algebraic/geometric framework using the neighborhoods as hypersurfaces, with surfaces having appropriate intersection sizes and structure. Then, provided the pseudo-algebra/geometry gives a structure rigid enough, establish the existence of a . Preliminary results in this direction were proven by Blagojevic, Bukh, and Karasev [4] and in this paper.
5 Appendix
5.1 -freeness of
As before, let be an arbitrary field and for let be a cyclic Galois extension of degree , whose Galois group is generated by the automorphism . We aim to prove that the projective norm graph is -free, i.e. that the common neighbourhood of vertices has size at most . The proof is exactly the same as in the case of finite fields, and it is included here only because we need some of the steps anyway.
For let be an -set of vertices. Without loss of generality we may assume that for , as otherwise the common neighbourhood of would be empty. For let
[TABLE]
and consider the system
[TABLE]
of norm equations. Simple substitutions show that a vertex is in the common neighbourhood of if and only if is a solution to (10). Note that is well-defined, as . Therefore, we have that the size of the common neighbourhood of is at most the number of solutions to (10). We remark that it can be less (by one) exactly if [math] is a solution to (10), which happens if .
Now set and let us recall the key lemma from the original proof due to Kollár, Rónyai and Szabó [17].
Lemma 5.1**.**
Let be a field and for such that for . Then the system of equations
[TABLE]
has at most solutions .
To finish the proof of the -freeness we just need to realize that the equations in (10) can be rewritten, namely for we have
[TABLE]
Now if for we set , and then Lemma 5.1 applies with and gives that the system (10) has at most solutions and hence any -set of vertices in has at most common neighbours, as desired.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. Alon, L. Rónyai, T. Szabó. Norm-graphs: variations and applications. Journal of Combinatorial Theory, Series B 76 :280–290 (1999).
- 2[2] T. Bayer, T. Mészáros, L. Rónyai, T. Szabó. Exploring projective norm graphs. ar Xiv:1908.05190 (2019)
- 3[3] G. Berman. Finite projective plane geometries and difference sets. Transactions of the American Mathematical Society 74 :492–499 (1953).
- 4[4] P. Blagojević, B. Bukh, R. Karasev. Turán numbers for K s , t subscript 𝐾 𝑠 𝑡 K_{s,t} -free graphs: topological obstructions and algebraic constructions. Israel Journal of Mathematics 197 (1):199–214 (2013).
- 5[5] B. Bollobás. Extremal Graph Theory. Academic Press (1978).
- 6[6] W. Bosma, J. Cannon, C. Playoust. The Magma algebra system I -The user language. Journal of Symbolic Computation 24 :235–265 (1997).
- 7[7] W.G. Brown. On graphs that do not contain a Thomsen graph. Canadian Mathematical Bulletin 9 :281–285 (1966).
- 8[8] B. Bukh. Random algebraic construction of extremal graphs. Bullettin of the London Mathematical Society 47 (6):939–945 (2015).
