2,406 research outputs found

    Small Extended Generalized Quadrangles

    Get PDF
    We consider extensions of generalized quadrangles with parameters (s, t), and establish lower bounds (in terms of s and t) for the number of points, sometimes under additional hypotheses. We also study the structure of geometries attaining these bounds, give several constructions and some uniqueness proofs, and examine the question of further extensions

    Partial ovoids and partial spreads in symplectic and orthogonal polar spaces

    Get PDF
    We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improved upper bounds on the sizes of large maximal partial ovoids and large maximal partial spreads in the classical symplectic and orthogonal polar spaces. An overview of the status regarding these results is given in tables. The similar results for the hermitian classical polar spaces are presented in [J. De Beule, A. Klein, K. Metsch, L. Storme, Partial ovoids and partial spreads in hermitian polar spaces, Des. Codes Cryptogr. (in press)]

    Imbrex geometries

    Get PDF
    We introduce an axiom on strong parapolar spaces of diameter 2, which arises naturally in the framework of Hjelmslev geometries. This way, we characterize the Hjelmslev-Moufang plane and its relatives (line Grassmannians, certain half-spin geometries and Segre geometries). At the same time we provide a more general framework for a Lemma of Cohen, which is widely used to study parapolar spaces. As an application, if the geometries are embedded in projective space, we provide a common characterization of (projections of) Segre varieties, line Grassmann varieties, half-spin varieties of low rank, and the exceptional variety E6,1\mathcal{E}_{6,1} by means of a local condition on tangent spaces

    On highly regular strongly regular graphs

    Get PDF
    In this paper we unify several existing regularity conditions for graphs, including strong regularity, kk-isoregularity, and the tt-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using our theoretical results we show that a family of non rank 3 graphs known to satisfy the 77-vertex condition fulfills an even stronger condition, (3,7)(3,7)-regularity (the notion is defined in the text). Derived from this family we obtain a new infinite family of non rank 33 strongly regular graphs satisfying the 66-vertex condition. This strengthens and generalizes previous results by Reichard.Comment: 29 page

    Identifying codes in vertex-transitive graphs and strongly regular graphs

    Get PDF
    We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2ln(vertical bar V vertical bar) + 1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that reach both bounds. We exhibit infinite families of vertex-transitive graphs with integer and fractional identifying codes of order vertical bar V vertical bar(alpha) with alpha is an element of{1/4, 1/3, 2/5}These families are generalized quadrangles (strongly regular graphs based on finite geometries). They also provide examples for metric dimension of graphs

    A formulation of a (q+1,8)-cage

    Full text link
    Let q≥2q\ge 2 be a prime power. In this note we present a formulation for obtaining the known (q+1,8)(q+1,8)-cages which has allowed us to construct small (k,g)(k,g)--graphs for k=q−1,qk=q-1, q and g=7,8g=7,8. Furthermore, we also obtain smaller (q,8)(q,8)-graphs for even prime power qq.Comment: 14 pages, 2 figure
    • …
    corecore