Classification of the (n, 3)-arcs in PG(2, 7)

In this paper the classification of the (n, 3)-arcs in PG(2, 7) is presented. It has been obtained using a computer-based exhaustive search that exploits projective equivalence and produces exactly one representative of each equivalence class. For each (n, 3)-arc, the automorphism group and the maximal size of a contained k-arc have been found.     

Complete caps in projective spaces PG (n, q)

A computer search in the finite projective spaces PG(n, q) for the spectrum of possible sizes k of complete k-caps is done. Randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete cap are given for many values of n and q. Many new sizes of complete caps are obtained.     

Computer search in projective planes for the sizes of complete arcs

The spectrum of possible sizes k of complete k-arcs in finite projective planes PG(2, q) is investigated by computer search. Backtracking algorithms that try to construct complete arcs joining the orbits of some subgroup of collineation group PΓ L (3, q) and randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete arc are given for q = 41, 43, 47, 49, 53, 59, 64, 71 ≤ q ≤ 809, q ≠ 529, 625, 729, and q = 821. New lower bounds on the second largest size of a complete arc are given for q = 31, 41, 43, 47, 53, 125. Also, many new sizes of complete arcs are obtained for 31 ≤ q ≤ 167.     

Planar functions over finite fields

Letp>2 be a prime. A functionf: GF(p)GF(p) is planar if for everyaGF(p) ^*, the functionf(x+a–f(x) is a permutation ofGF(p). Our main result is that every planar function is a quadratic polynomial. As a consequence we derive the following characterization of desarguesian planes of prime order. IfP is a protective plane of prime orderp admitting a collineation group of orderp ², thenP is the Galois planePG(2,p). The study of such collineation groups and planar functions was initiated by Dembowski and Ostrom [3] and our results are generalizations of some results of Johnson [8].We have recently learned that results equivalent to ours have simultaneously been obtained by Y. Hiramine and D. Gluck.     

Blocking Sets Of External Lines To A Conic In PG(2,q), q ODD

We determine all point-sets of minimum size in PG(2,q), q odd that meet every external line to a conic in PG(2,q). The proof uses a result on the linear system of polynomials vanishing at every internal point to the conic and a corollary to the classification theorem of all subgroups of PGL(2,q). * Research supported by the Italian Ministry MURST, Strutture geometriche, combinatoria e loro applicazioni and by the Hungarian-Italian Intergovernemental project “Algebraic and Geometric Structures”.     

Minimal blocking sets of size 2p – 2 and 2p – 3 in PG(2, p), p prime and p > 5

A general construction of minimal blocking sets of size 2p – 3, where p is a prime and p ≡ 1 (mod 4), p > 5, and of size 2p – 2, where p is a prime and p ≡ 3 (mod 4), p > 5 in PG(2, p) is presented. These blocking sets are all of Rédei type.      

Characterization of complete exterior sets of conics

Let be a set of exterior points of a nondegenerate conic inPG(2,q) with the property that the line joining any 2 points in misses the conic. Ifq1 (mod 4) then consists of the exterior points on a passant, ifq3 (mod 4) then other examples exist (at least forq=7, 11, ..., 31).Support from the Dutch organization for scientific Research (NWO) is gratefully acknowledged     

A completion problem for finite affine planes

A partial affine plane (PAP) of ordern is ann ²-setS of points together with a collection ofn-subsets ofS called lines such that any two lines meet in at most one point. We obtain conditions under which a PAP with nearlyn ²+n lines can be completed to an affine plane by adding lines. In particular, we make use of Bruck’s completion condition for nets to show that certain PAP’s with at leastn ²+n−√n can be completed and that forn≠3 any PAP withn ²+n−2 lines can be completed.     

How many s-subspaces must miss a point set in PG(d, q)

The following result is well-known for finite projective spaces. The smallest cardinality of a set of points of PG(n, q) with the property that every s-subspace has a point in the set is (q ^n+1-s - 1)/(q - 1). We solve in finite projective spaces PG(n, q) the following problem. Given integers s and b with 0 ≤ s ≤ n - 1 and 1 ≤ b ≤ (q ^n+1-s - 1)/(q - 1), what is the smallest number of s-subspaces that must miss a set of b points. If d is the smallest integer such that b ≤ (q ^d+1 - 1)/(q - 1), then we shall see that the smallest number is obtained only when the b points generate a subspace of dimension d. We then also determine the smallest number of s-subspaces that must miss a set of b points of PG(n, q) which do not lie together in a subspace of dimension d. The results are obtained by geometrical and combinatorial arguments that rely on a strong algebraic result for projective planes by T. Szőnyi and Z. Weiner.     

Random constructions and density results

In this paper we outline a construction method which has been used for minimal blocking sets in PG(2, q) and maximal partial line spreads in PG(n, q) and which must have a lot of more applications. We also give a survey on what is known about the spectrum of sizes of maximal partial line spreads in PG(n, q). At the end we list some more elaborate random techniques used in finite geometry.      

The uniqueness of the near hexagon on 729 points

We prove that any regular near hexagon with 729 vertices and lines of size 3 is derived from the ternary Golay code, thus settling the last case in doubt among the regular near hexagons with lines of size 3.     

On the sharpness of a theorem of B. segre

The theorem of B. Segre mentioned in the title states that a complete arc of PG(2,q),q even which is not a hyperoval consists of at mostq−√q+1 points. In the first part of our paper we prove this theorem to be sharp forq=s ² by constructing completeq−√q+1-arcs. Our construction is based on the cyclic partition of PG(2,q) into disjoint Baer-subplanes. (See Bruck [1]). In his paper [5] Kestenband constructed a class of (q−√q+1)-arcs but he did not prove their completeness. In the second part of our paper we discuss the connections between Kestenband’s and our constructions. We prove that these constructions result in isomorphic (q−√q+1)-arcs. The proof of this isomorphism is based on the existence of a traceorthogonal normal basis in GF(q ³) over GF(q), and on a representation of GF(q)³ in GF(q ³)³ indicated in Jamison [4].     

A class of d-dimensional flag transitive translation planes

Journal of Geometry -     

A new lower bound for Snake-in-the-Box Codes

In this paper we give a new lower bound on the length of Snake-in-the-Box Codes, i.e., induced cycles in thed-dmensional cube. The bound is a linear function of the number of vertices of the cube and improves the boundc·2 ^d /d, wherec is a constant, proved by Danzer and Klee.     

An Infinite Family of Steiner Systems from Cyclic Codes

Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are (Steiner triple systems), (Steiner quadruple systems), and . There are a few infinite families of Steiner systems in the literature. The objective of this paper is to present an infinite family of Steiner systems for all from cyclic codes. As a by‐product, many infinite families of 2‐designs are also reported in this paper.     

Aldo Cossu’s Work in Finite Geometry

A survey of the contributions of Aldo Cossu in finite geometry is given. Dedicated to the memory of Professor Aldo Cossu     

Flocks and ovals

An infinite family of q-clans, called the Subiaco q-clans, is constructed for q=2^e. Associated with these q-clans are flocks of quadratic cones, elation generalized quadrangles of order (q ², q), ovals of PG(2, q) and translation planes of order q ² with kernel GF(q). It is also shown that a q-clan, for q=2^e, is equivalent to a certain configuration of q+1 ovals of PG(2, q), called a herd.W. Cherowitzo gratefully acknowledges the support of the Australian Research Council and has the deepest gratitude and warmest regards for the Combinatorial Computing Research Group at the University of Western Australia for their congenial hospitality and moral support. I. Pinneri gratefully acknowledges the support of a University of Western Australia Research Scholarship.     

Wrapping polygons in polygons

This paper is developed toI ₂(2g).c-geometries, namely, point-line-plane structures where planes are generalized 2g-gons with exactly two lines on every point and any two intersecting lines belong to a unique plane.I ₂(2g).c-geometries appear in several contexts, sometimes in connection with sporadic simple groups. Many of them are homomorphic images of truncations of geometries belonging to Coxeter diagrams. TheI ₂(2g).c-geometries obtained in this way may be regarded as the standard ones. We characterize them in this paper. For everyI ₂(2g).c-geometry , we define a numberw(), which counts the number of times we need to walk around a 2g-gon contained in a plane of , building up a wall of planes around it, before closing the wall. We prove thatw()=1 if and only if is standard and we apply that result to a number of special cases.     

Steiner triple systems of order 19 associated with a certain type of projective plane of order 10

It is shown that the existence of a Steiner triple system of order 19 satisfying certain very restrictive conditions would lead to the completion of a large portion of the incidence matrix of a projective plane of order 10.     

Maximal arcs in Desarguesian planes of odd order do not exist

Forq an odd prime power, and 1<n<q, the Desarguesian planePG(2,q) does not contain an(nq–q+n,n)-arc.Supported by Italian M.U.R.S.T. (Research Group onStrutture geometriche, combinatoria, loro applicazioni) and G.N.S.A.G.A. of C.N.R.