Skip to main content
SpringerLink
Log in

The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph

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

Abstract

We sho that the universal embedding dimensions (over F 2) of the near polygons associated ith Sym(2n) (vieed as subgroup of Sp1(2n - 2, 2)) are the Catalan numbers.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. E. Brouwer, A. M. Cohen, J. I. Hall and H. A. Wilbrink, Near polygons and Fischer spaces, Geometriae Dedicata, Vol. 49 (1994) pp. 349-368.

    Google Scholar 

  2. A. E. Brouwer and H. A. Wilbrink, The structure of near polygons with quads, Geometriae Dedicata, Vol. 14 (1983) pp. 145-176.

    Google Scholar 

  3. A. E. Brouwer and H. A. Wilbrink, Two infinite sequences of near polygons, Math. Centr. Report ZW194, Amsterdam (1983).

  4. J. H. van Lint, Combinatorial Theory Seminar, Eindhoven University of Technology, Lecture Notes in Math., 382, Springer, Berlin-New York (1974).

    Google Scholar 

  5. E. E. Shult and A. Yanushka, Near n-gons and line systems, Geometriae Dedicata, Vol. 9 (1980) pp. 1-72.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Math and Computer Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    A. Blokhuis & A. E. Brouer

Authors
  1. A. Blokhuis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. E. Brouer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blokhuis, A., Brouer, A.E. The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph. Designs, Codes and Cryptography 17, 299–303 (1999). https://doi.org/10.1023/A:1026421028689

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026421028689

Search

Navigation