Skip to main content
Log in

Remarks on polarity designs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Jungnickel and Tonchev (Des. Codes Cryptogr. 51:131–140, [11]) used polarities of PG(2d − 1, q) to construct non-classical designs with a hyperplane and the same parameters and same intersection numbers as the classical designs PG d (2d, q), for every prime power q and every integer d ≥ 2. Our main result shows that these properties already characterize their polarity designs. Recently, Jungnickel and Tonchev (Des. Codes Cryptogr. [14] introduced new invariants for simple incidence structures \({\mathcal{D}}\), which admit both a coding theoretic and a geometric description. Geometrically, one considers embeddings of \({\mathcal{D}}\) into projective geometries Π = PG(n, q), where an embedding means identifying the points of \({\mathcal{D}}\) with a point set V in Π in such a way that every block of \({\mathcal{D}}\) is induced as the intersection of V with a suitable subspace of Π. Then the new invariant—which we shall call the geometric dimension geomdim q \({\mathcal{D}}\) of \({\mathcal{D}}\) —is the smallest value of n for which \({\mathcal{D}}\) may be embedded into the n-dimensional projective geometry PG(n, q). The classical designs PG d (n, q) always have the smallest possible geometric dimension among all designs with the same parameters, namely n, and are actually characterized by this property. We give general bounds for geomdim q \({ \mathcal{D}}\) whenever \({\mathcal{D}}\) is one of the (exponentially many) “distorted” designs constructed in Jungnickel and Tonchev (Des. Codes Cryptogr. 51:131–140, [11]; Des. Codes Cryptogr. 55:131–140, [12]—a class of designs with classical parameters which includes the polarity designs as a very special case. We also show that this class contains designs with the same parameters as PG d (n, q) and geomdim q \({\mathcal{D} = n + 1}\), for every prime power q and for all values of d and n with 2 ≤ d ≤ n−1. Regarding the polarity designs, we conjecture that their geometric dimension always satisfies our general upper bound with equality, that is, geomdim q \({\mathcal{D} = 4d}\) for the polarity design \({\mathcal{D}}\) with the parameters of PG d (2d, q), but we are only able to establish this result if we restrict ourselves to the special case of “natural” embeddings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

  • Bierbrauer J.: Introduction to Coding Theory. Chapman and Hall/CRC, Boca Raton (2005)

    MATH  Google Scholar 

  • Donovan D.M., Grannell M.J.: Designs having the parameters of projective and affine spaces. Des. Codes Cryptogr. 60, 225–240 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  • Frankl P., Wilson R.M.: The Erdős-Ko-Rado theorem for vector spaces. J. Comb. Theory A 43, 228–236 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • Fuji-Hara R., Vanstone S.A.: The existence of orthogonal resolutions of lines in AG(n, q). J. Comb. Theory A 45, 139–147 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  • Fuji-Hara R., Vanstone S.A.: Hyperplane skew resolutions and their applications. J. Comb. Theory A 47, 134–144 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  • Godsil C.D., Newman M.W.: Independent sets in association schemes. Combinatorica 26, 431–443 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Hirschfeld J.W.P.: Finite Projective Spaces of Three Dimensions. Oxford University Press, Oxford (1985)

    MATH  Google Scholar 

  • Hirschfeld J.W.P.: Projective Geometries over Finite Fields, 2nd edn. Oxford University Press, Oxford (1998)

    MATH  Google Scholar 

  • Jungnickel D.: Recent results on designs with classical parameters. J. Geom. 101, 137–155 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  • Jungnickel D., Tonchev V.D.: Polarities, quasi-symmetric designs, and Hamada’s conjecture. Des. Codes Cryptogr. 51, 131–140 (2009)

    Article  MathSciNet  Google Scholar 

  • Jungnickel D., Tonchev V.D.: The number of designs with geometric parameters grows exponentially. Des. Codes Cryptogr. 55, 131–140 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  • Jungnickel D., Tonchev V.D.: A Hamada type characterization of the classical geometric designs. Des. Codes Cryptogr. 65, 15–28 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  • Jungnickel D., Tonchev V.D.: New invariants for incidence structures. Des. Codes Cryptogr. (2012). doi:10.1007/s10623-012-9636-z.

  • Munemasa A., Tonchev V.D.: The twisted Grassmann graph is the block graph of a design. Innov. Incid. Geom. 12, 1–6 (2011)

    MATH  MathSciNet  Google Scholar 

  • Newman M.W.: Independent sets and eigenspaces. PhD thesis, University of Waterloo (2004).

  • Tanaka H.: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. J. Comb. Theory A 113, 903–910 (2006)

    Article  MATH  Google Scholar 

  • Tonchev V.D.: Quasi-symmetric 2-(31, 7, 7)-designs and a revision of Hamada’s conjecture. J. Comb. Theory A 42, 104–110 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • Tonchev V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121–128 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Tonchev V.D.: Finite geometry, designs, codes, and Hamada’s conjecture. In: Crnković D., Tonchev V. (eds.) Information Security, Coding Theory and Related Combinatorics, pp. 437–448. IOS Press, Amsterdam (2011).

  • van Dam E.R., Koolen J.H.: A new family of distance-regular graphs with unbounded diameter. Invent. Math. 162, 189–193 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dieter Jungnickel.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the special topic on “Finite Geometries: A special issue in honor of Frank De Clerck”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghinelli, D., Jungnickel, D. & Metsch, K. Remarks on polarity designs. Des. Codes Cryptogr. 72, 7–19 (2014). https://doi.org/10.1007/s10623-012-9748-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9748-5

Keywords

Mathematics Subject Classification (2010)

Navigation