Abstract hyperovals, partial geometries, and transitive hyperovals

Includes bibliographical references.2015 Summer.A hyperoval is a (q+2)- arc of a projective plane π, of order q with q even. Let G denote the collineation group of π containing a hyperoval Ω. We say that Ω is transitive if for any pair of points x, y is an element of Ω, there exists a g is an element of G fixing Ω setwise such that xg = y. In1987, Billotti and Korchmaros proved that if 4||G|, then either Ω is the regular hyperoval in PG(2,q) for q=2 or 4 or q = 16 and |G||144. In 2005, Sonnino proved that if |G| = 144, then π is desarguesian and Ω is isomorphic to the Lunelli-Sce hyperoval. For our main result, we show that if G is the collineation group of a projective plane containing a transitivehyperoval with 4 ||G|, then |G| = 144 and Ω is isomorphic to the Lunelli-Sce hyperoval. We also show that if A(X) is an abstract hyperoval of order n ≡ 2(mod 4); then |Aut(A(X))| is odd. If A(X) is an abstract hyperoval of order n such that Aut(A(X)) contains two distinct involutions with |FixX(g)| and |FixX(ƒ)| ≥ 4. Then we show that FixX(g) ≠ FixX(ƒ). We also show that there is no hyperoval of order 12 admitting a group whose order is divisible by 11 or 13, by showing that there is no partial geometry pg(6, 10, 5) admitting a group of order 11 or of order 13. Finally, we were able to show that there is no hyperoval in a projective plane of order 12 with a dihedral subgroup of order 14, by showing that that there is no partial geometry pg(7, 12, 6) admitting a dihedral group of order 14. The latter results are achieved by studying abstract hyperovals and their symmetries

A new construction of the d-dimensional Buratti–Del Fra dual hyperoval

AbstractThe Buratti–Del Fra dual hyperoval Dd(F2) is one of the four known infinite families of simply connected d-dimensional dual hyperovals over F2 with ambient space of vector dimension (d+1)(d+2)/2 (Buratti and Del Fra (2003) [1]). A criterion (Proposition 1) is given for a d-dimensional dual hyperoval over F2 to be covered by Dd(F2) in terms of the addition formula. Using it, we provide a simpler model of Dd(F2) (Proposition 3). We also give conditions (Lemma 4) for a collection S[B] of (d+1)-dimensional subspaces of K⊕K constructed from a symmetric bilinear form B on K≅F2d+1 to be a quotient of Dd(F2). For when d is even, an explicit form B satisfying these conditions is given. We also provide a proof for the fact that the affine expansion of Dd(F2) is covered by the halved hypercube (Proposition 10)

Coding Theory and Algebraic Combinatorics

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. We describe and recapitulate important results in the development of the state of the art. In addition, we give illustrative examples and constructions, and highlight recent advances. Finally, we provide a collection of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in Information and Coding Theory", ed. by I. Woungang et al., World Scientific, Singapore, 201

Flag-transitive L_h.L*-geometries

The classification of finite flag-transitive linear spaces, obtained by Buekenhout, Delandtsheer, Doyen, Kleidman, Liebeck and Saxl [20] at the end of the eighties, gave new impulse to the program of classifying various classes of locally finite flag-transitive geometries belonging to diagrams obtained from a Coxeter diagram by putting a label L or L ∗ on some (possibly, all) of the singlebond strokes for projective planes

Pairwise transitive 2-designs

We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs, intersecting block-pairs and non-intersecting block-pairs. These 2-designs fall into two classes: the symmetric ones and the quasisymmetric ones. The symmetric examples include the symmetric designs from projective geometry, the 11-point biplane, the Higman-Sims design, and designs of points and quadratic forms on symplectic spaces. The quasisymmetric examples arise from affine geometry and the point-line geometry of projective spaces, as well as several sporadic examples.Comment: 28 pages, updated after review proces

Equiangular Tight Frames That Contain Regular Simplices

An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. A regular simplex is a special type of ETF in which the number of vectors is one more than the dimension of the space they span. In this paper, we consider ETFs that contain a regular simplex, that is, have the property that a subset of its vectors forms a regular simplex. As we explain, such ETFs are characterized as those that achieve equality in a certain well-known bound from the theory of compressed sensing. We then consider the so-called binder of such an ETF, namely the set of all regular simplices that it contains. We provide a new algorithm for computing this binder in terms of products of entries of the ETF\u27s Gram matrix. In certain circumstances, we show this binder can be used to produce a particularly elegant Naimark complement of the corresponding ETF. Other times, an ETF is a disjoint union of regular simplices, and we show this leads to a certain type of optimal packing of subspaces known as an equichordal tight fusion frame. We conclude by considering the extent to which these ideas can be applied to numerous known constructions of ETFs, including harmonic ETFs