1. Consider a projective plane of order with a polarity , that is, is a bijection that sends points to lines and lines to points, . Define a graph with the vertex set ; two vertices adjacent if .
- (a) Show that the adjacency relation is symmetric.
- (b) Show that is -free.
- (c) Give a precise condition under which is a witness for .
\begin{proof}
a) By , iff , so iff .
b) If is not -free, there exists such that , , , , which deduces that and , which deduces that , leading to a contradiction.
c) Define .
Then and in this case .
The inequality holds and so , i.e.
One can verify that a precise condition is , and each line contains exactly one point in .
\end{proof}
2. Consider , odd, with a conic defined by with associated bilinear form . Define by .
- (a) Show that ⟂ is a polarity.
- (b) Define a graph as in the previous exercise with . Let be the induced subgraph of on the set of vertices with a square, and let be the induced subgraph of on the set of vertices with a nonsquare. Show that either or is triangle-free. (Hint: Consider what happens when .)
- (c) Conclude that .
Bonus exercise: Both constructions work for even. Here the absolute trace of partitions the points into two halves.
\begin{proof}
a) It suffices to check is a bijection that sends points to lines and lines to points, .
因为非退化所以 kernel 是 2 维的,所以是直线。由 对称得到.
So is a polarity.
b) If or is not triangle free, then there exists such that are squares, and , , and . It deduces that . Then is a set of orthogonal basis of . Let be a transform matrix from to . Then the gram matrix under the basis is
whose determinant is a square . Since the product of three non-square element is non-square, is triangle-free.
c) By Exercise 1, is -free and so for . Define . Then and . It deduces that . Since , we have and . Now we finish the proof.
(Proof of : Number of solutions of is , where is Legendre symbol. It follows that .)
\end{proof}
3. Show all of the following for :
\begin{proof}
Recall that
Notice that
where . Furthermore, , where is the number of partitions of , see ^5tpltg. By Pentagonal number theorem, .
Since, it is easy to check the second inequality.
\end{proof}
4. Suppose that and .
- (a) Consider an intersecting family of -subsets of , that is, for all , we have . Suppose that . Show the following:
- i. If an element is disjoint from some -subset , then meets at most elements of .
- ii. If , then and consists of all -subsets that contain a fixed element.
- (b) Consider an intersecting family of -subspace of , that is, for all , we have . Suppose that . Show the following:
- i. If a 1 -subspace is disjoint from some -subspace , then meets at most elements of .
- ii. If , then and consists of all -subspaces that contain a fixed element.
\begin{proof}
a) i)The number of elements of such that meets
a) ii) Otherwise, if there does not exist for all , for any , there exists such that and meets at most elements of . We also assume that . Since , fix , then . It deduces that
which deduces that , which is impossible.
b) i) Similarly, the number
ii) Similarly, assume that and for each , there exists a -subspace in such that . Still fix , and there is
which deduces that .
Since and by Exercise 3, we have , contradiction.
\end{proof}
5. In , consider a spread of a hyperplane into -spaces. We define an incidence geometry as follows:
- (a) The points consist of the 1-spaces of not in and the elements of .
- (b) The lines consist of the -spaces of that meet in an element of , and .
- (c) A point and a line are incident when the corresponding objects are incident in .
Show that is a projective plane of order . (See Problem 24C in Van Lint-Wilson for an alternative formulation.)
\begin{proof}
Recall that ^zg2bnx.
Any two points are incident with a unique line: For -space of not in and , is the unique common line. For , and is the unique common line. For are two -spaces of not in , is a -space contained in , which is contained in a unique element of .
Any two lines are incident with a unique common point. For , if , then is the unique common line; otherwise a unique -space of not in . For and , is an element of , which is the unique common point we desired.
There are four points, no three collinear. Take as three -spaces not in and , such that the common line of is neither nor .
This projective plane is of order .
Number of .
Number of -spaces not in .
So the number of points is and so this projective plane is of order .
\end{proof}
6. Show that if a - design exists, then or .
\begin{proof}
Since for each , is an integer.
Recall that
In the other words, a -design is also a -design.
Link to original
Thus, and are integers.
It follows that and .
So for some , and yields .
Consequently, .
\end{proof}