On small minimal blocking sets in classical generalized quadrangles
|
|
- Franklin Ramsey
- 5 years ago
- Views:
Transcription
1 On small minimal blocking sets in classical generalized quadrangles Miroslava Cimráková a Jan De Beule b Veerle Fack a, a Research Group on Combinatorial Algorithms and Algorithmic Graph Theory, Department of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 S9, B 9000 Ghent, Belgium b Department of Pure Mathematics and Computer Algebra, Ghent University, Krijgslaan 281 S22, B 9000 Ghent, Belgium Abstract We present exhaustive and non-exhaustive search algorithms for small minimal blocking sets in generalized quadrangles. Using these techniques, new results were obtained for some classical generalized quadrangles. Moreover, some of these computer results lead to a general construction of small minimal blocking sets. Key words: generalized quadrangle, blocking set, computer search 1 Introduction and preliminaries A finite generalized quadrangle of order (s, t), also denoted GQ(s, t), is an incidence structure S = (P, B, I), in which P and B are disjoint (non-empty) sets of objects, called points and lines respectively, and for which I is a symmetric point-line incidence relation satisfying the following axioms: (i) each point is incident with 1 + t lines (t 1) and two distinct points are incident with at most one line; (ii) each line is incident with 1 + s points (s 1) and two distinct lines are incident with at most one point; Corresponding author. addresses: Miroslava.Cajkova@UGent.be (Miroslava Cimráková), Jan.DeBeule@UGent.be (Jan De Beule), Veerle.Fack@UGent.be (Veerle Fack). URL: vfack/ (Veerle Fack). Preprint submitted to Discrete Applied Mathematics 27 June 2006
2 (iii) if x is a point and L is a line not incident with x, then there is a unique pair (y, M) P B for which x I M I y I L. Interchanging points and lines in S yields a generalized quadrangle S D of order (t, s), which is called the dual of S. If s = t, S is said to have order s. A generalized quadrangle of order (s, 1) is called a grid and a generalized quadrangle of order (1, t) is called a dual grid. A generalized quadrangle with s, t > 1 is called thick. The thick classical finite generalized quadrangles are respectively the nonsingular 4-dimensional parabolic quadrics Q(4, q) of order q, the non-singular 5-dimensional elliptic quadrics Q (5, q) of order (q, q 2 ), the non-singular 3- and 4-dimensional Hermitian varieties H(3, q 2 ) and H(4, q 2 ) of respective orders (q 2, q) and (q 2, q 3 ), and the non-singular finite generalized quadrangle W (q) of order q consisting of the points of P G(3, q) and of the totally isotropic lines of a symplectic polarity η. Let S = (P, B, I) be a generalized quadrangle of order (s, t). For x P denote x = {y P y x} and note that x x. If A is an arbitrary subset of P, the perp of A is denoted by A and is defined as A = {x x A}. An ovoid of a generalized quadrangle S is a set O of points of S such that each line of S is incident with exactly one point of O, necessarily, O = st + 1. A partial ovoid is a set O of points of S such that each line of S is incident with at most one point of O. Dually, a spread of S is a set R of lines of S such that each point of S is incident with a unique line of R, necessarily, R = st+1. A partial spread of S is a set R of lines of S such that each point of S is incident with at most one line of R. A partial ovoid (or spread) is called maximal or complete if it is not contained in a larger partial ovoid (or spread). A blocking set of S is a set B of points of S such that each line of S is incident with at least one point of B. Necessarily B st + 1 for a GQ(s, t), with equality if and only if B is an ovoid. A cover of S is a set C of lines of S such that each point of S is incident with at least one line of C. Necessarily C st + 1 for a GQ(s, t), with equality if and only if C is a spread. It is clear that a blocking set in S is a cover in the dual S D. A blocking set B is called minimal if B \ p is not a blocking set for any point p B, while a cover C is called minimal if C \ L is not a cover for any line L C. Let B be a blocking set of S of size st r. We call r the excess of the blocking set. A line of S is called a multiple line if it contains at least two points of B. The excess of a line is the number of points of B it contains, minus one. The weight of a point of S with respect to B is the minimum of the excesses of the lines of S passing through this point. Dually, for a cover the concepts of excess, multiple point, excess of a point and weight of a line are defined in a similar way. 2
3 A non-singular quadric Q(2, q) is called a conic and a non-singular Hermitian variety H(2, q 2 ) is called a Hermitian curve. When q is even, every non-singular parabolic quadric Q(4, q) has a nucleus, a point on which every line has exactly one point in common with Q(4, q). A sum of lines L of PG(n, q) is a collection of lines of PG(n, q), where each line is assigned a positive integer, called its weight. Furthermore, the weight of a point with respect to L is the sum of the weights of the lines of L through this point. A pencil of a GQ(s, t) is the set of t + 1 lines on a point of the generalized quadrangle. A blocking set B of the projective plane PG(2, q) is a set of points in PG(2, q) such that each line is incident with at least one point of B. A blocking set containing a line is called trivial, otherwise it is called non-trivial. It is known [1] that the smallest non-trivial blocking sets in PG(2, q), with q an odd prime, have size 3(q + 1)/2. In this paper we concentrate on small blocking sets in the classical generalized quadrangles. It is easy to see that a minimal blocking set of size st + s is obtained by taking the set of points of a pencil through an arbitrary point x of S, minus x itself. Our aim is to find minimal blocking sets of S of size smaller than st + s, which neither are ovoids (in case S contains ovoids). The paper is organized as follows. In Sections 2 and 3 we focus on the generalized quadrangles W (q) and Q(4, q). We collect the known results on the smallest minimal blocking sets, describe the exhaustive and non-exhaustive algorithms which we use in the computer search, and present our new results on small minimal blocking sets. In Section 4 we summarize the known results on small minimal blocking sets in other classical generalized quadrangles, and add some new results on spectra of sizes for which small minimal blocking sets of H(3, q 2 ) exist, obtained by our non-exhaustive searches. 2 Blocking sets of W (q) and of Q(4, q), q even It is known [11] that Q(4, q) has ovoids for every value of q and that W (q) only has ovoids for even values of q. We recall that Q(4, q) is isomorphic to W (q), for q even. In [9] Eisfeld, Storme, Szőnyi and Sziklai proved the following results for blocking sets of W (q) and Q(4, q). Theorem 1 (Eisfeld et al. [9]) Let B be a blocking set of the quadric Q(4, q), q even. If q 32 and B q q, then B contains an ovoid of Q(4, q). 3
4 q # points Earlier results [9] Sizes found , ,271 Table 1 Sizes of minimal blocking sets found in Q(4, q), for small values of q, q even. All results are obtained by heuristic search. If q = 4, 8, 16 and B q q+4, then B contains an ovoid of Q(4, q). 6 Theorem 2 (Eisfeld et al. [9]) Let B be a blocking set of W (q), q odd, then B > q (q 1)/3. Moreover the authors in [9] give a construction of a minimal blocking set of W (q) of size q (q 2). For q = 3, 4, 5 they show that this is indeed the size of the smallest minimal blocking sets in W (q). In the rest of this section, we focus on small minimal blocking sets in Q(4, q), for even q. 2.1 Computer search The following results were obtained by a computer search, implementing a greedy heuristic as follows. A minimal blocking set is built step by step, starting from the set of all points, and removing points one by one from this set, until it is a minimal blocking set. During this process a set is maintained of points which are still allowed choices for removing. Choosing a point that leaves the largest number of points in this allowed set, tends to build small minimal blocking sets. Using a minimal blocking set obtained by this approach, a simple restart strategy adds some of the points and again removes points until the blocking set is minimal. Both the adding and the removing can be done either randomly or following the above greedy heuristic. For each q considered, Table 1 lists the sizes smaller than q 2 + q for which our program found a minimal blocking set. For comparison reasons we also list the sizes of the known small minimal blocking set obtained in [9]. Our computer searches find a minimal blocking set of size q 2 + q 1 for each q even considered. We also observed the existence of a minimal blocking set of size q 2 + q 3 for q = 8, 16 (for q = 4 this value corresponds to the size of an ovoid). We now describe the structure of these blocking sets, the investigation of which is also done by computer. 4
5 q 1 points p 1 L p 2 q/2 points Fig. 1. Blocking set of Q(4, q) of size q 2 + q Blocking set B of size q 2 + q 1 for q = 2, 4, 8, 16 There is a line L and two points p 1 and p 2 on this line not contained in the blocking set B. All q 1 points from L, except for the points p 1 and p 2, belong to B. Through the points p 1 and p 2 there are 2q lines (excluding the line L) and on each line there are q/2 points of B. These q 1 + (2q)(q/2) points form a minimal blocking set of size q 2 + q 1. This is illustrated in Figure 1. We note that for q = 2 we get an ovoid. In [9] a construction for a minimal blocking sets of size q 2 + q 1 in W (q) is given. Here we describe another construction for minimal blocking sets of size q 2 + q 1, which corresponds to our computer results. Let B be the blocking set of size q 2 + q described earlier, i.e., a pencil on a point p 1, where all points of the lines of the pencil belong to B, except p 1. Let L be a line of this pencil and let p 2 be a point on L different from p 1. We consider a conic C 1, containing p 2, such that its nucleus is the nucleus of Q(4, q). This conic intersects the pencil through the point p 1 in q +1 mutually non-collinear points c 1 1, c 1 2,... c 1 q+1, where c 1 1 = p 2. The conic C1 intersects the pencil on p 2 in q + 1 non-collinear points c 2 1, c2 2,... c2 q+1, where c2 1 = p 1. Now, we remove the q+1 points c 1 1, c1 2,... c1 q+1 from the blocking set and add the q points c2 2,... c2 q+1. The obtained set of size q 2 + q 1 is indeed a blocking set, since we substitute the points of C 1 by the points of C1. Checking the minimality is easy, since through each point of the new set there is at least one line containing only one point of the set. Notice that the points of conics can be interchanged q 1 times. This construction is illustrated in Figure Blocking set B of size q 2 + q 3 for q = 4, 8, 16 There is a line L and four points p 0, p 1, p 2 and p 3 on this line not contained in the blocking set B. All q 3 points from L, except for the points p i, i = 0, 1, 2, 3, belong to B. Through the points p i, i = 0, 1, 2, 3 there are 4q lines (excluding the line L) and on each line there are q/4 points of B. These q 3 + (4q)(q/4) 5
6 C 1 p 1 L p 2 C 1 Fig. 2. Construction of blocking sets of size q 2 + q 1 p 1 p 2 p 3 p 4 q 3 points L q/4 points q lines Fig. 3. Blocking set of Q(4, q) of size q 2 + q 3 points form a minimal blocking set of size q 2 + q 3. This is illustrated in Figure 3. We note that for q = 4 we get an ovoid. 2.4 Blocking set B of size q 2 + q (2 k 1) for q 2 k, k > 0 In the previous cases a minimal blocking set of the smallest possible parameter was an ovoid. If q = 8, a minimal blocking set of size q 2 + q 7 is an ovoid. However, our heuristic searches did not find a minimal blocking set of that size for q > 8. Now the following question naturally arises. Is it possible to construct a blocking set of size q 2 + q 7 for q > 8 using the previous ideas? Even more generally, are there any blocking sets of size q 2 + q (2 k 1), for q 2 k, k > 0 with the following structure? There is a line L and 2 k points p i, 0 i 2 k 1, on this line not contained in the blocking set B. All q k points from L, except for the points p i, belong to B. Through all points p i there are 2 k q lines (excluding the line L) and on each line there are q/2 k points of B. Is it possible that these (q k ) + (2 k q)(q/2 k ) = q 2 + q (2 k 1) points form a minimal blocking set? 6
7 Finally we note that we are currently working on a geometrical construction for minimal blocking sets of size smaller than q 2 + q 1. 3 Blocking sets in Q(4, q), q odd When q is even, Theorem 1 gives a lower bound for minimal blocking sets of Q(4, q). However, for q odd, no similar result is known. Even the question whether minimal blocking sets of cardinality q exist, has not yet been answered in general. Recently De Beule and Metsch [4] solved this problem for q an odd prime and proved that, for such q, Q(4, q) has no minimal blocking set of size q Here we perform a computer search for small minimal blocking sets i.e. minimal blocking sets of size smaller than q 2 + q, of Q(4, q), q odd. Our algorithms rely on theoretical properties of the structure of multiple lines. Before describing our algorithm and presenting our results, we summarize these properties. 3.1 Structure of multiple lines First, we define a regulus and its opposite regulus in Q(4, q). Consider a grid Q + (3, q) Q(4, q). A regulus of Q(4, q) is a set of q + 1 pairwise disjoint lines in Q + (3, q). The set of the remaining q + 1 pairwise disjoint lines in Q + (3, q) is called the opposite regulus. The following theorem describes the structure of multiple points of a cover in a generalized quadrangle. Theorem 3 (Eisfeld et al. [9]) Let C be a cover of a classical generalized quadrangle S of order (q, t) embedded in PG(n, q). Let C = qt r, with q + r smaller than the cardinality of the smallest non-trivial blocking sets in PG(2, q). Then the multiple points of C form a sum of lines of PG(n, q), where the weight of a line in this sum is equal to the weight of this line with respect to the cover, and with the sum of the weights of the lines equal to r. Consider a cover of S = W (q), satisfying the conditions of Theorem 3. This cover dualizes to a blocking set B of S = Q(4, q) (see [11]). Note that a line of W (q) dualizes to a pencil in Q(4, q), while a line of PG(3, q) which is not a line of W (q) dualizes to a regulus. Hence the sum of multiple lines of S = W (q) can be described by pencils and reguli in S = Q(4, q). In [7], De Beule and Storme prove the following lemma. 7
8 m m (a) Case I: r = 1, q odd, one pencil (b) Case II.a: r = 2, q > 3 odd, one pencil Fig. 4. One pencil Lemma 4 (De Beule and Storme [7]) Suppose that C is a cover of S = W (q), of size q r, with q + r smaller than the cardinality of the smallest non-trivial blocking sets in PG(2, q), such that the multiple points of C are a sum A of lines of PG(3, q). If L is a line of A, L not a line of W (q), then L A, with the symplectic polarity corresponding to W (q). Let B be a blocking set of Q(4, q), of size q r, with q + r smaller than the cardinality of the smallest non-trivial blocking sets in PG(2, q). We now describe in more detail the different possibilities for the structure of the multiple lines of B, for the special cases r = 1 and r = 2. This is done by applying Theorem 3 to the cover C of W (q) and dualizing this result; here we only give the dual information. Case I: r = 1, for all q odd There is exactly one point m Q(4, q) \ B, such that all q + 1 lines on m are the multiple lines of B and they meet B in exactly two points. This case is illustrated for q = 3 in Figure 4(a). Case II: r = 2, for all q > 3 odd a. There is exactly one point m Q(4, q) \ B, such that all q + 1 lines on m are the multiple lines of B and they meet B in exactly three points (see Figure 4(b)). b. There are two collinear points m, n Q(4, q) \ B, and the q + 1 lines on m resp. n meet B in exactly two points, except for the line on m and n which meets B in exactly three points (see Figure 5). c. There are two non-collinear points m, n Q(4, q) \ B, such that the q + 1 lines on m resp. n meet B in exactly two points (see Figure 6). d. There is a regulus R M and its opposite regulus R N, such that every line of R M and every line of R N meets B in exactly two points (see Figure 7). 8
9 m n Fig. 5. Case II.b: r = 2, q > 3 odd, two collinear pencils m n Fig. 6. Case II.c: r = 2, q > 3 odd, two non-collinear pencils Fig. 7. Case II.d: r = 2, q > 3 odd, regulus and opposite regulus Using the above information about the structure of multiple lines, the following results for q = 3, 5, 7 were obtained previously: De Winter [8] constructed a minimal blocking set B of size q of Q(4, 5), which contains exactly 12 points on a hyperbolic quadric. This corresponds to Case II.d (r = 2). With the aid of a computer, De Beule and Storme [7] found that, if B is a minimal blocking set of Q(4, 3) different from an ovoid, then B > 11. De Beule, Hoogewijs and Storme [6] found that, if B is a minimal blocking set of Q(4, q), q = 5, 7 different from an ovoid of Q(4, q), then B > q De Beule, Hoogewijs and Storme [6] also performed a computer search to exclude the existence of a minimal blocking set of Q(4, 7) of size q satisfying the special property that there is one point of Q(4, 7) with q + 1 lines on it being blocked by exactly three points of B. This corresponds to Case II.a. 9
10 Here we tackle the specific questions: Are there other minimal blocking sets of size q in Q(4, 5)? Is there any blocking set of size q in Q(4, 7)? and the more general question: Is there any minimal blocking set of size at least q and smaller than q 2 + q in Q(4, q), q odd? 3.2 Exhaustive search algorithm and results In order to search for minimal blocking sets we use a backtracking algorithm, which tries in every recursion step to extend a partial blocking set (which is not a blocking set yet) by adding the points of a set A of allowed remaining points in a systematic way. When reaching a point where the set A is empty, a new minimal blocking set has been found. In what follows, we explain how to determine the allowed set and how the search can be pruned by forcing points. From now on, we consider only parameter values q and r for which the structure of the multiple lines was described above. The first step in the algorithm is to determine the excess of the lines. Since a generalized quadrangle is transitive on the pairs of points and on the pairs of lines, we can fix the structure, i.e., the pencils or reguli, in all considered cases. In particular, we determine the lines, which are multiple with the considered excess. Let midpoint be a point, where the lines of the pencil meet. In the cases where pencils appear (I, II.a, II.b and II.c), we can also directly remove the midpoint(s) of pencil(s) from the allowed set. In each recursive step we determine the new allowed set. Let p be a point currently added to B in this recursive step. If adding the point p gives rise to a line, which attains the expected excess, we can remove all still allowed points on this line from the allowed set. The information about the structure of multiple lines can be used to improve the pruning as follows. Let e L be the excess of a line L and let b L be the number of points of the current partial blocking set on the line L. Let A L be the set of still allowed points on the line L. Consider a step in the recursive process where the current set gives rise to a line for which e L + 1 = A L + b L holds. If the points of A L are not added to the current set, then the resulting partial blocking set can never be extended to a minimal blocking set, so we can prune these possibilities and force the points to be added to the current set. Figure 8 illustrates this idea. Suppose that after adding a point p in the re- 10
11 r r r L f p L f p L f 2 f 1 p (a) Forcing a point on a nonmultiple line (b) Forcing a point on a multiple line (c) Forcing two points on a multiple line Fig. 8. Illustrating the idea of forcing points # points B # B II.a II.b II.c II.d Q(4, 5) Q(4, 7) Table 2 Classification of minimal blocking sets of size q 2 +3 in Q(4, 5) and Q(4, 7). cursive step, a point r was removed from the current set of allowed points. In Figure 8(a), there is only one point f on the non-multiple line L left which can be added to the partial blocking set. Similarly, let L be a multiple line with excess 1, as shown in Figures 8(b) and 8(c). Since there is only one point (resp. two points) left on the multiple line L which can be added to the partial blocking set, we can forcedly add these points to the set, thus pruning the possible extensions that do not contain these points. By exhaustive search we determined the classification of minimal blocking sets of size q for Q(4, 5) and Q(4, 7). The results are shown in Table 2. For both values of q and for each of the cases II.a, II.b, II.c and II.d, we classified all minimal blocking sets of size q We summarize these results in the following lemma. Lemma 5 There is a unique minimal blocking set of size q = 28 in Q(4, 5) and there is no minimal blocking set of size q in Q(4, 7). 11
12 # multiple lines r # grids Q(4, 5) Q(4, 7) Q(4, 11) Q(4, q) (q + 1)(q 3) q 3 (q 3)/2 if q {5, 7, 11} Table 3 Structure of the blocking sets of Q(4, q), q = 5, 7, 11 of size q 2 + q Minimal blocking sets of size q 2 + q 2 Using the same greedy heuristic as described in Section 2 we searched for minimal blocking sets in Q(4, q) for larger values of q and r. Typically we were interested in any minimal blocking set (different from an ovoid) with size smaller than q 2 + q. For q = 5, 7, 9, 11, we obtain minimal blocking sets of size q 2 + q 2, i.e., with excess r = q 3. We investigated (also by computer) the structure of the obtained blocking sets, focusing on the multiple lines and the way in which they are structured. The case q = 9 turns out to be different and will be treated separately. For q = 5, 7, 11 we observed that, for the blocking sets found, all multiple lines have excess one, which means that the multiple lines contain two points of the blocking set. For q = 5, De Winter [8] already noticed that all multiple lines form a grid. We observed that also for q = 7, 11 grids are formed by the multiple lines, and even that more than one grid appears, as summarized in Table 3. For these cases the number of multiple lines is 2(q + 1)(q 3)/2 and the number of grids formed by multiple lines is (q 3)/2. Moreover, for q = 7, 11 there are q + 1 points of B common to all grids. Finally we observed that it is possible to obtain a maximal partial ovoid of size q 2 1 by removing these q + 1 common points and adding two points of the perp of this set. In Q(4, 5) are there 4 possibilities of obtaining such a maximal partial ovoid by removing q + 1 points. For q = 9 we observed that, for the maximal blocking sets found, all multiple lines have excess three. The blocking set found has 20 multiple lines and we checked that they form a grid. Previously we found by exhaustive search [2] that no maximal partial ovoids of size q 2 1 exist in Q(4, 9); this result was recently generalized by De Beule and Gács [3] for all q = p h, p an odd prime, h > 1. 12
13 Finally we also want to mention our effort, which was not successful yet, to try and find a blocking set of size q 2 + q 2 for larger q, especially for q = 13. If we suppose that this blocking set would be of the same structure, it should contain 5 grids with 14 points in the intersection. So far we have found no blocking set of the given size by our (not exhaustive!) computer search. We expect that no blocking set of Q(4, 13) of size q 2 + q 2 exists. 4 Blocking sets in H(d, q 2 ), q = 3, 4 and in Q (5, q) As we described in the introduction, one can construct a minimal blocking set of size st + s of any generalized quadrangle of order (s, t) by taking the set of points of a pencil through an arbitrary point x, minus the point x itself. The following theorems show that these construction yields the (unique) smallest minimal blocking set of size st + s for the generalized quadrangles Q (5, q) and H(4, q 2 ). Theorem 6 (Metsch [10]) Suppose that B is a minimal set of points of Q (5, q) with the property that B meets every line of Q (5, q). Then B q 3 + q. If B = q 3 + q, then B = p \ {p} for some point p Q (5, q). Recently, a similar theorem was proved for H(4, q 2 ). Theorem 7 (De Beule and Metsch [5]) Suppose that B is a minimal set of points of H(4, q 2 ) with the property that B meets every line of H(4, q 2 ). Then B q 5 + q 2. If B = q 5 + q 2, then B = p \ {p} for some point p H(4, q 2 ). To our knowledge there is nothing known about small minimal blocking sets in H(3, q 2 ). In Table 4 we present some new results found by our heuristic searches. We list the sizes smaller than q 3 + q 2 for which our program found minimal blocking sets. For comparison reasons we also list the size q of an ovoid and the size q 3 + q 2 of the blocking set described in the introduction. For q = 2 we classified all minimal blocking sets of small size. There are two minimal blocking sets of size 10, twelve minimal blocking sets of size 11 and thirty minimal blocking sets of size 12. Finally, we can construct a spectrum of minimal blocking sets for each value from q 3 + r, r = 1,..., q 2. Consider a Hermitian curve H contained in H(3, q 2 ). This curve is contained in a plane, denoted by π. Consider any point p H. Consider the q lines of π on p. Exactly q 2 of them intersect H in a Hermitian variety H on 13
14 q # points q q 3 + q 2 Sizes found , Table 4 Sizes for minimal blocking sets of H(3, q 2 ) smaller than q 3 + q 2, for small values of q, obtained by heuristic search. The notation a..b means that for all values in the interval [a, b] a minimal blocking set of that size has been found. a line (this is a H(1, q 2 )). It is clear that H is again a Hermitian variety on a line. Consider r different lines L i on p and their corresponding Hermitian varieties H i. Consider the r Hermitian varieties Hi, they are mutually skew and lie all in p. It is clear that the set H \ ( r i=1 H i) r i=1 H i is a minimal blocking set of size q 3 + r of H(3, q 2 ). Since we have exactly q 2 suitable lines on p, we can construct a spectrum of minimal blocking sets of size q 3 + r, r = 1,..., q 2. References [1] A. Blokhuis, On the size of blocking sets in PG(2, p). Combinatorica 14, , [2] M. Cimráková, S. De Winter, V. Fack, and L. Storme, On the smallest maximal partial ovoids and spreads of the generalized quadrangles W (q) and Q(4, q). European J. Combin. (2006), to appear. [3] J. De Beule and A. Gács, Complete (q 2 1)-arcs of Q(4, q), q = p h, p odd prime, h > 1, do not exist. Finite Fields Appl. (2005), submitted. [4] J. De Beule and K. Metsch, Minimal blocking sets of size q of Q(4, q), q an odd prime, do not exist. Finite Fields Appl., 11, , [5] J. De Beule and K. Metsch, The smallest point sets that meet all generators of H(2n, q). Discrete Math., 294, 75-81, [6] J. De Beule, A. Hoogewijs and L. Storme, On the size of minimal blocking sets of Q(4, q), for q = 5, 7. ACM SIGSAM Bulletin, 38, 67-84, [7] J. De Beule and L. Storme, On the smallest minimal blocking sets of Q(2n, q), for q an odd prime. Discrete Math., 294, , [8] S. De Winter, Private communication, [9] J. Eisfeld, L. Storme, T. Szőnyi and P. Sziklai, Covers and blocking sets of classical generalized quadrangles. Discrete Math., 238, 35-51,
15 [10] K. Metsch. A Bose-Burton theorem for elliptic polar spaces. Des. Codes Cryptogr., 17(1-3): , [11] S.E. Payne and J.A. Thas, Finite Generalized Quadrangles. Pitman Res. Notes Math. Ser Longman,
Two-intersection sets with respect to lines on the Klein quadric
Two-intersection sets with respect to lines on the Klein quadric F. De Clerck N. De Feyter N. Durante Abstract We construct new examples of sets of points on the Klein quadric Q + (5, q), q even, having
More informationFinite affine planes in projective spaces
Finite affine planes in projective spaces J. A.Thas H. Van Maldeghem Ghent University, Belgium {jat,hvm}@cage.ugent.be Abstract We classify all representations of an arbitrary affine plane A of order q
More informationFunctional codes arising from quadric intersections with Hermitian varieties
Functional codes arising from quadric intersections with Hermitian varieties A. Hallez L. Storme June 16, 2010 Abstract We investigate the functional code C h (X) introduced by G. Lachaud [10] in the special
More informationA spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd
A spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd C. Rößing L. Storme January 12, 2010 Abstract This article presents a spectrum result on minimal blocking sets with
More informationHyperplanes of Hermitian dual polar spaces of rank 3 containing a quad
Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be Abstract
More informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
More informationSUBSTRUCTURES OF FINITE CLASSICAL POLAR SPACES
In: Current Research Topics in Galois Geometry Editors: J. De Beule and L. Storme, pp. 33-59 ISBN 978-1-61209-523-3 c 2011 Nova Science Publishers, Inc. Chapter 2 SUBSTRUCTURES OF FINITE CLASSICAL POLAR
More informationOn the structure of the directions not determined by a large affine point set
On the structure of the directions not determined by a large affine point set Jan De Beule, Peter Sziklai, and Marcella Takáts January 12, 2011 Abstract Given a point set U in an n-dimensional affine space
More informationEuropean Journal of Combinatorics. Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces
European Journal of Combinatorics 31 (2010) 1586 1593 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Locally subquadrangular hyperplanes
More informationGeneralized quadrangles and the Axiom of Veblen
Geometry, Combinatorial Designs and Related Structures (ed. J. W. P. Hirschfeld), Cambridge University Press, London Math. Soc. Lecture Note Ser. 245 (1997), 241 -- 253 Generalized quadrangles and the
More informationComplete arcs on the parabolic quadric Q(4,q)
Finite Fields and Their Applications 14 (008) 14 1 http://www.elsevier.com/locate/ffa Complete arcs on the parabolic quadric Q(4,q) Jan De Beule a,,1, András Gács b, a Department of Pure Mathematics and
More informationThe maximum size of a partial spread in H(4n + 1,q 2 ) is q 2n+1 + 1
The maximum size of a partial spread in H(4n +, 2 ) is 2n+ + Frédéric Vanhove Dept. of Pure Mathematics and Computer Algebra, Ghent University Krijgslaan 28 S22 B-9000 Ghent, Belgium fvanhove@cage.ugent.be
More informationDense near octagons with four points on each line, III
Dense near octagons with four points on each line, III Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationLax embeddings of the Hermitian Unital
Lax embeddings of the Hermitian Unital V. Pepe and H. Van Maldeghem Abstract In this paper, we prove that every lax generalized Veronesean embedding of the Hermitian unital U of PG(2, L), L a quadratic
More informationSearch algorithms for substructures in generalized quadrangles
Search algorithms for substructures in generalized quadrangles Miroslava Cimráková Promotor: Prof. Dr. Veerle Fack Co-promotor: Dr. Jan De Beule Academiejaar 2005-2006 Vakgroep Toegepaste Wiskunde en Informatica
More informationLax Embeddings of Generalized Quadrangles in Finite Projective Spaces
Lax Embeddings of Generalized Quadrangles in Finite Projective Spaces J. A. Thas H. Van Maldeghem 1 Introduction Definition 1.1 A (finite) generalized quadrangle (GQ) S = (P, B, I) is a point-line incidence
More informationA characterization of the finite Veronesean by intersection properties
A characterization of the finite Veronesean by intersection properties J. Schillewaert, J.A. Thas and H. Van Maldeghem AMS subject classification: 51E0, 51A45 Abstract. A combinatorial characterization
More informationCharacterizations of the finite quadric Veroneseans V 2n
Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our
More informationBlocking sets of tangent and external lines to a hyperbolic quadric in P G(3, q), q even
Manuscript 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 Blocking sets of tangent and external lines to a hyperbolic quadric in P G(, q), q even Binod Kumar Sahoo Abstract Bikramaditya Sahu Let H be a fixed hyperbolic
More informationDistance-j Ovoids and Related Structures in Generalized Polygons
Distance-j Ovoids and Related Structures in Generalized Polygons Alan Offer and Hendrik Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, Belgium
More informationLarge minimal covers of PG(3,q)
Large minimal covers of PG(3,q) Aiden A. Bruen Keldon Drudge Abstract A cover of Σ = PG(3,q) is a set of lines S such that each point of Σ is incident with at least one line of S. A cover is minimal if
More informationOn the geometry of regular hyperbolic fibrations
On the geometry of regular hyperbolic fibrations Matthew R. Brown Gary L. Ebert Deirdre Luyckx January 11, 2006 Abstract Hyperbolic fibrations of PG(3, q) were introduced by Baker, Dover, Ebert and Wantz
More informationGeneralized Quadrangles Weakly Embedded in Finite Projective Space
Generalized Quadrangles Weakly Embedded in Finite Projective Space J. A. Thas H. Van Maldeghem Abstract We show that every weak embedding of any finite thick generalized quadrangle of order (s, t) in a
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationOn linear sets on a projective line
On linear sets on a projective line M. Lavrauw G. Van de Voorde August 14, 2013 Abstract Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationPartial geometries pg(s, t, 2 ) with an abelian Singer group and a characterization of the van Lint-Schrijver partial geometry
J Algebr Comb (2006) 24:285 297 DOI 10.1007/s10801-006-0019-2 Partial geometries pg(s, t, 2 ) with an abelian Singer group and a characterization of the van Lint-Schrijver partial geometry S. De Winter
More informationDerivation Techniques on the Hermitian Surface
Derivation Techniques on the Hermitian Surface A. Cossidente, G. L. Ebert, and G. Marino August 25, 2006 Abstract We discuss derivation like techniques for transforming one locally Hermitian partial ovoid
More informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
More informationCodes from generalized hexagons
Codes from generalized hexagons A. De Wispelaere H. Van Maldeghem 1st March 2004 Abstract In this paper, we construct some codes that arise from generalized hexagons with small parameters. As our main
More informationSPG systems and semipartial geometries
Adv. Geom. 1 (2001), 229±244 Advances in Geometry ( de Gruyter 2001 SPG systems and semipartial geometries (Communicated by H. Van Maldeghem) Abstract. First, the paper contains new necessary and su½cient
More informationA characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q)
A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q) Joris De Kaey and Hendrik Van Maldeghem Ghent University, Department of Pure Mathematics and Computer
More informationGeneralized Quadrangles with a Spread of Symmetry
Europ. J. Combinatorics (999) 20, 759 77 Article No. eujc.999.0342 Available online at http://www.idealibrary.com on Generalized Quadrangles with a Spread of Symmetry BART DE BRUYN We present a common
More informationPublications. L. Storme
Publications L. Storme 1 Articles 1. J.W.P. Hirschfeld, L. Storme, J.A. Thas and J.F. Voloch, A characterization of Hermitian curves. J. Geom. 41 (1991), 72-78. 2. L. Storme and J.A. Thas, Generalized
More informationQuasimultiples of Geometric Designs
Quasimultiples of Geometric Designs G. L. Ebert Department of Mathematical Sciences University of Delaware Newark, DE 19716 ebert@math.udel.edu Dedicated to Curt Lindner on the occasion of his 65th birthday
More informationGalois geometries contributing to coding theory
Ghent University Dept. of Pure Mathematics and Computer Algebra Krijgslaan 281 - S22 9000 Ghent Belgium Thurnau, April 15, 2010 OUTLINE 1 CODING THEORY 2 GRIESMER BOUND AND MINIHYPERS 3 EXTENDABILITY RESULTS
More informationCocliques in the Kneser graph on line-plane flags in PG(4, q)
Cocliques in the Kneser graph on line-plane flags in PG(4, q) A. Blokhuis & A. E. Brouwer Abstract We determine the independence number of the Kneser graph on line-plane flags in the projective space PG(4,
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA. Semifield spreads
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA Semifield spreads Giuseppe Marino and Olga Polverino Quaderni Elettronici del Seminario di Geometria Combinatoria 24E (Dicembre 2007) http://www.mat.uniroma1.it/~combinat/quaderni
More informationTwo-character sets as subsets of parabolic quadrics
Two-character sets as subsets of parabolic uadrics Bart De Bruyn Ghent University Department of Mathematics Krijgslaan 81 (S) B-9000 Gent Belgium E-mail: bdb@cageugentbe Abstract A two-character set is
More informationOn the intersection of Hermitian surfaces
On the intersection of Hermitian surfaces Nicola Durante and Gary Ebert Abstract In [6] and [3] the authors determine the structure of the intersection of two Hermitian surfaces of PG(3, q 2 ) under the
More informationUnextendible Mutually Unbiased Bases (after Mandayam, Bandyopadhyay, Grassl and Wootters)
Article Unextendible Mutually Unbiased Bases (after Mandayam, Bandyopadhyay, Grassl and Wootters) Koen Thas Department of Mathematics, Ghent University, Ghent 9000, Belgium; koen.thas@gmail.com Academic
More informationTight Sets and m-ovoids of Quadrics 1
Tight Sets and m-ovoids of Quadrics 1 Qing Xiang Department of Mathematical Sciences University of Delaware Newark, DE 19716 USA xiang@mathudeledu Joint work with Tao Feng and Koji Momihara 1 T Feng, K
More informationGeneralized Veronesean embeddings of projective spaces, Part II. The lax case.
Generalized Veronesean embeddings of projective spaces, Part II. The lax case. Z. Akça A. Bayar S. Ekmekçi R. Kaya J. A. Thas H. Van Maldeghem Abstract We classify all embeddings θ : PG(n, K) PG(d, F),
More informationCharacterizations of Segre Varieties
Characterizations of Segre Varieties J. A Thas H. Van Maldeghem Abstract In this paper several characterizations of Segre varieties and their projections are given. The first two characterization theorems
More informationEvery generalized quadrangle of order 5 having a regular point is symplectic
Every generalized quadrangle of order 5 having a regular point is symplectic Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationAbout Maximal Partial 2-Spreads in PG(3m 1, q)
Innovations in Incidence Geometry Volume 00 (XXXX), Pages 000 000 ISSN 1781-6475 About Maximal Partial 2-Spreads in PG(3m 1, q) Sz. L. Fancsali and P. Sziklai Abstract In this article we construct maximal
More informationEmbeddings of Small Generalized Polygons
Embeddings of Small Generalized Polygons J. A. Thas 1 H. Van Maldeghem 2 1 Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, jat@cage.rug.ac.be 2 Department
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationSome Two Character Sets
Some Two Character Sets A. Cossidente Dipartimento di Matematica e Informatica Università degli Studi della Basilicata Contrada Macchia Romana 85100 Potenza (ITALY) E mail: cossidente@unibas.it Oliver
More informationOn the nucleus of the Grassmann embedding of the symplectic dual polar space DSp(2n, F), char(f) = 2
On the nucleus of the Grassmann embedding of the symplectic dual polar space DSp(2n, F), char(f) = 2 Rieuwert J. Blok Department of Mathematics and Statistics Bowling Green State University Bowling Green,
More informationarxiv: v1 [math.co] 14 Jan 2016
The Cameron-Liebler problem for sets Maarten De Boec, Leo Storme and Andrea Švob arxiv:1601.03628v1 [math.co] 14 Jan 2016 Abstract Cameron-Liebler line classes and Cameron-Liebler -classes in PG(2 + 1,
More informationCharacterizations of Veronese and Segre Varieties
Characterizations of Veronese and Segre Varieties Joseph A. Thas and Hendrik Van Maldeghem Dedicated to the memory of A. Barlotti Abstract. We survey the most important characterizations of quadric Veroneseans
More informationVertex opposition in spherical buildings
Vertex opposition in spherical buildings Anna Kasikova and Hendrik Van Maldeghem Abstract We study to which extent all pairs of opposite vertices of self-opposite type determine a given building. We provide
More informationNew Bounds for Partial Spreads of H(2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon
New Bounds for Partial Spreads of H2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon Ferdinand Ihringer Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Givat Ram, Jerusalem,
More informationGalois geometries contributing to coding theory
Ghent University Dept. of Mathematics Krijgslaan 281 - S22 9000 Ghent Belgium Opatija, 2010 OUTLINE 1 CODING THEORY 2 GRIESMER BOUND AND MINIHYPERS 3 COVERING RADIUS AND SATURATING SETS 4 LINEAR MDS CODES
More informationLinear Point Sets and Rédei Type k-blocking
Journal of Algebraic Combinatorics 14 (2001), 221 228 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q) L. STORME ls@cage.rug.ac.be
More informationQuadratic Sets 4.5 Elliptic, Parabolic and Hyperbolic Quadratic Sets
Quadratic Sets 4.5 Elliptic, Parabolic and Hyperbolic Quadratic Sets Definitions Def: Let Q be a nondegenerate quadratic set in a d-dimensional projective space P (not assumed to be finite). If d is even
More informationON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR SIMEON BALL, AART BLOKHUIS, ANDRÁS GÁCS, PETER SZIKLAI, AND ZSUZSA WEINER Abstract. In this paper we prove that a set of points (in a projective
More informationJournal of Discrete Mathematical Sciences & Cryptography Vol. 9 (2006), No. 1, pp
Some generalizations of Rédei s theorem T. Alderson Department of Mathematical Sciences University of New Brunswick Saint John, New Brunswick Canada EL 4L5 Abstract By the famous theorems of Rédei, a set
More informationDomesticity in projective spaces
Innovations in Incidence Geometry Volume 12 (2011), Pages 141 149 ISSN 1781-6475 ACADEMIA PRESS Domesticity in projective spaces Beukje Temmermans Joseph A. Thas Hendrik Van Maldeghem Abstract Let J be
More informationOn sets without tangents and exterior sets of a conic
On sets without tangents and exterior sets of a conic Geertrui Van de Voorde Abstract A set without tangents in PG(2, q) is a set of points S such that no line meets S in exactly one point. An exterior
More informationOn m ovoids of W 3 (q)
On m ovoids of W 3 (q) A. Cossidente, C. Culbert, G. L. Ebert, and G. Marino Abstract We show that the generalized quadrangle W 3 (q) for odd q has exponentially many 1 (q+1) ovoids, thus implying that
More informationA geometric approach to Mathon maximal arcs. Thomas Maes
Faculteit Wetenschappen Vakgroep Wiskunde A geometric approach to Mathon maximal arcs Thomas Maes Promotoren: Prof. Dr. F. De Clerck Dr. S. De Winter Proefschrift voorgelegd aan de Faculteit Wetenschappen
More informationShult Sets and Translation Ovoids of the Hermitian Surface
Shult Sets and Translation Ovoids of the Hermitian Surface A. Cossidente, G. L. Ebert, G. Marino, and A. Siciliano Abstract Starting with carefully chosen sets of points in the Desarguesian affine plane
More informationGeometric Characterizations of Finite Chevalley Groups of Type B 2
Geometric Characterizations of Finite Chevalley Groups of Type B 2 Koen Thas Hendrik Van Maldeghem Ghent University Department of Pure Mathematics and Computer Algebra Galglaan 2, B-9000 Ghent, Belgium
More informationOn the chromatic number of q-kneser graphs
On the chromatic number of q-kneser graphs A. Blokhuis & A. E. Brouwer Dept. of Mathematics, Eindhoven University of Technology, P.O. Box 53, 5600 MB Eindhoven, The Netherlands aartb@win.tue.nl, aeb@cwi.nl
More informationApplications of Galois Geometries to Coding Theory and Cryptography
Applications of Galois Geometries to Coding Theory and Cryptography Ghent University Dept. of Mathematics Krijgslaan 281 - Building S22 9000 Ghent Belgium Albena, July 1, 2013 1. Affine spaces 2. Projective
More informationIdentifying codes in vertex-transitive graphs and strongly regular graphs
Identifying codes in vertex-transitive graphs and strongly regular graphs Sylvain Gravier Institut Fourier University of Grenoble Grenoble, France sylvain.gravier@ujf-grenoble.fr Aline Parreau LIRIS University
More informationGeneralized polygons in projective spaces
Generalized polygons in projective spaces Hendrik Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B-9000 Gent, Belgium, e-mail: hvm@cage.rug.ac.be 1 Introduction
More informationMichel Lavrauw. Scattered Spaces with respect to Spreads, and Eggs in Finite Projective Spaces
Michel Lavrauw Scattered Spaces with respect to Spreads, and Eggs in Finite Projective Spaces Scattered Spaces with respect to Spreads, and Eggs in Finite Projective Spaces PROEFSCHRIFT ter verkrijging
More informationarxiv: v1 [math.co] 23 Nov 2015
arxiv:1511.0753v1 [math.co] 3 Nov 015 New results on maximal partial line spreads in PG(5, q) Maurizio Iurlo Abstract In this work, we prove the existence of maximal partial line spreads in PG(5,q) of
More informationOn Ferri s characterization of the finite quadric Veronesean V 4 2
On Ferri s characterization of the finite quadric Veronesean V 4 2 J. A. Thas H. Van Maldeghem Abstract We generalize and complete Ferri s characterization of the finite quadric Veronesean V2 4 by showing
More informationA subset of the Hermitian surface
G page 1 / 11 A subset of the Hermitian surface Giorgio Donati Abstract Nicola Durante n this paper we define a ruled algebraic surface of PG(3, q 2 ), called a hyperbolic Q F -set and we prove that it
More informationOn the Grassmann modules for the symplectic groups
On the Grassmann modules for the symplectic groups Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 81 (S), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationCollineations of polar spaces with restricted displacements
Collineations of polar spaces with restricted displacements B. Temmermans J. A. Thas H. Van Maldeghem Department of Mathematics, Ghent University, Krijgslaan 281, S22, B 9000 Gent btemmerm@cage.ugent.be,
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
More informationSemifield flocks, eggs, and ovoids of Q(4, q)
Semifield flocks, eggs, and ovoids of Q(4, q) Michel Lavrauw Universita degli studi di Napoli Federico II Dipartimento di Matematica e Applicazioni R. Caccioppoli Via Cintia Complesso Monte S. Angelo 80126
More informationOn finite Steiner surfaces
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/220187353 On finite Steiner surfaces Article in Discrete Mathematics February 2012 Impact Factor:
More informationExterior powers and Clifford algebras
10 Exterior powers and Clifford algebras In this chapter, various algebraic constructions (exterior products and Clifford algebras) are used to embed some geometries related to projective and polar spaces
More informationThe classification of the largest caps in AG(5, 3)
The classification of the largest caps in AG(5, 3) Y. Edel S. Ferret I. Landjev L. Storme Abstract We prove that 45 is the size of the largest caps in AG(5, 3), and such a 45-cap is always obtained from
More informationThe L 3 (4) near octagon
The L 3 (4) near octagon A. Bishnoi and B. De Bruyn October 8, 206 Abstract In recent work we constructed two new near octagons, one related to the finite simple group G 2 (4) and another one as a sub-near-octagon
More informationBlocking sets in PG(2, q n ) from cones of PG(2n, q)
J Algebr Comb (2006) 24:61 81 DOI 10.1007/s10801-006-9102-y Blocking sets in PG(2, q n ) from cones of PG(2n, q) Francesco Mazzocca Olga Polverino Received: 11 February 2004 / Accepted: 12 December 2005
More informationA geometric proof of a theorem on antiregularity of generalized quadrangles
Des. Codes Cryptogr. (2012) 64:255 263 DOI 10.1007/s10623-011-9569-y A geometric proof of a theorem on antiregularity of generalized quadrangles Anna Y. Pun Philip P. W. Wong Received: 17 January 2011
More informationExtending MDS Codes. T. L. Alderson
Extending MDS Codes T. L. Alderson Abstract A q-ary (n,k)-mds code, linear or not, satisfies n q + k 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show
More informationA Geometric Characterization of the Perfect Ree-Tits Generalized Octagons.
A Geometric Characterization of the Perfect Ree-Tits Generalized Octagons. H. Van Maldeghem Dedicated to Prof. J. Tits on the occasion of his 65th birthday 1 Introduction The world of Tits-buildings, created
More informationSaturating sets in projective planes and hypergraph covers
Saturating sets in projective planes and hypergraph covers Zoltán Lóránt Nagy MTA ELTE Geometric and Algebraic Combinatorics Research Group H 7 Budapest, Pázmány P sétány /C, Hungary nagyzoli@cseltehu
More informationLarge incidence-free sets in geometries
Large incidence-free sets in geometries Stefaan De Winter Department of Mathematical Sciences Michigan Technological University Michigan, U.S.A. Jeroen Schillewaert sgdewint@mtu.edu Jacques Verstraete
More informationLacunary Polynomials over Finite Fields Course notes
Lacunary Polynomials over Finite Fields Course notes Javier Herranz Abstract This is a summary of the course Lacunary Polynomials over Finite Fields, given by Simeon Ball, from the University of London,
More informationFinite Generalized Quadrangles
Finite Generalized Quadrangles S.E. Payne J.A. Thas ii Contents 1 Combinatorics of finite generalized quadrangles 1 1.1 Axioms and definitions.................................... 1 1.2 Restrictions on
More informationOn Exceptional Lie Geometries
On Exceptional Lie Geometries Anneleen De Schepper Jeroen Schillewaert Hendrik Van Maldeghem Magali Victoor Dedicated to the memory of Ernie Shult Abstract Parapolar spaces are point-line geometries introduced
More informationα-flokki and Partial α-flokki
Innovations in Incidence Geometry Volume 00 (XXXX), Pages 000 000 ISSN 1781-6475 α-flokki and Partial α-flokki W. E. Cherowitzo N. L. Johnson O. Vega Abstract Connections are made between deficiency one
More informationStrongly Regular (:, ;)-Geometries
Journal of Combinatorial Theory, Series A 95, 234250 (2001) doi:10.1006jcta.2000.3164, available online at http:www.idealibrary.com on Strongly Regular (:, ;)-Geometries Nicholas Hamilton 1 Vakgroep Zuivere
More informationThe Non-Existence of certain Regular Generalized Polygons
The Non-Existence of certain Regular Generalized Polygons H. Van Maldeghem October 9, 2002 Abstract We define the notion of d i -regularity and regularity in generalized polygons, thus generalizing the
More informationOn Cameron-Liebler line classes with large parameter
On with large parameter J. De Beule (joint work with Jeroen Demeyer, Klaus Metsch and Morgan Rodgers) Department of Mathematics Ghent University Department of Mathematics Vrije Universiteit Brussel June
More information1 Lacunary Polynomials over Finite Fields.
1 Lacunary Polynomials over Finite Fields. 1.1 Introduction In 1970 Rédei published his treatise Lückenhafte Polynome über endlichen Körpern [34], soon followed by the English translation Lacunary Polynomials
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationA characterization of the set of lines either external to or secant to an ovoid in PG(3,q)
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (011), Pages 159 163 A characterization of the set of lines either external to or secant to an ovoid in PG(3,q) Stefano Innamorati Dipartimento di Ingegneria
More informationThe geometry of finite fields
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA The geometry of finite fields Simeon Ball Quaderni Elettronici del Seminario di Geometria Combinatoria 2E (Maggio 2001) http://www.mat.uniroma1.it/ combinat/quaderni
More informationPrimitive arcs in P G(2, q)
Primitive arcs in P G(2, q) L. Storme H. Van Maldeghem December 14, 2010 Abstract We show that a complete arc K in the projective plane P G(2, q) admitting a transitive primitive group of projective transformations
More informationBlocking sets in chain geometries
Blocking sets in chain geometries Andrea Blunck 1 Hans Havlicek 2 Corrado Zanella 3 Contents 1. Introduction (3). 2. Examples of chain geometries (4). 3. Finite chain geometries (5). 4. Blocking sets (6).
More information