Skip to main content
Log in

Pfaffian structures and critical problems in finite symplectic spaces

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

Just as matroids abstract the algebraic properties of determinants in a vector space, Pfaffian structures abstract the algebraic properties of Pfaffians or skew-symmetric determinants in a symplectic space (that is, a vector space with an alternating bilinear form). This is done using an exchange-augmentation axiom which is a combinatorial version of a Laplace expansion or straightening identity for Pfaffians. Using Pfaffian structures, we study a symplectic analogue of the classical critical problem: given a setS of non-zero vectors in a non-singular symplectic spaceV of dimension2m, find its symplectic critical exponent, that is, the minimum of the set {m−dim(U):U∩S=0}, whereU ranges over all the (totally) isotropic subspaces disjoint fromS. In particular, we derive a formula for the number of isotropic subspaces of a given dimension disjoint from the setS by Möbius inversion over the order ideal of isotropic flats in the lattice of flats of the matroid onS given by linear dependence. This formula implies that the symplectic critical exponent ofS depends only on its matroid and Pfaffian structure; however, it may depend on the dimension of the symplectic spaceV.

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

  1. H.H. Crapo and G.-C. Rota, On the Foundations of Combinatorial Theory: Combinatorial Geometries, Preliminary edition, M.I.T. Press, Cambridge, 1970.

    MATH  Google Scholar 

  2. L.E. Dickson, Linear Groups, Teubner, Leipzig, 1901, Reprinted Dover, New York 1958.

    Google Scholar 

  3. J. Edmonds and D.R. Fulkerson, Transversals and matroid partition, J. Res. Nat. Bur. Stand.69B (1965) 147–153.

    MathSciNet  Google Scholar 

  4. J.P.S. Kung, An Erlanger program for combinatorial geometries, Ph. D. Thesis, M.I.T., Cambridge, 1978.

    Google Scholar 

  5. J.P.S. Kung, Bimatroids and invariants, Adv. Math.30, (1978) 238–249.

    Article  MathSciNet  Google Scholar 

  6. J.P.S. Kung, Strong maps, In: Theory of Matroids, N.L. White, Ed., Cambridge University Press, Cambridge, 1986, pp. 224–253.

    Google Scholar 

  7. J.P.S. Kung, Critical problems, In: Matroid Theory, J.E. Bonin, J.G. Oxley and B. Servatius Eds., Amer. Math. Soc., Providence, RI, 1996, pp. 1–127.

    Google Scholar 

  8. L. Lovaśz and M.D. Plummer, Matching Theory, North-Holland, Amsterdam, 1986.

    Google Scholar 

  9. J.G. Oxley, Matroid Theory, Oxford University Press, Oxford, 1992.

    MATH  Google Scholar 

  10. R. Rado, Note on independence functions, Proc. London Math. Soc. (3)7 (1957) 300–320.

    MathSciNet  Google Scholar 

  11. G.-C. Rota, Combinatorial Theory and Invariant Theory, Notes taken by L. Guibas from the National Science Foundation Seminar in Combinatorial Theory, Bowdoin College, Maine, 1971, unpublished typescript.

    Google Scholar 

  12. W.T. Tutte, The factorisation of linear graphs, J. London Math. Soc.22 (1947) 107–111.

    MathSciNet  Google Scholar 

  13. D.J.A. Welsh, Matroid Theory, Academic Press, London and New York, 1976.

    MATH  Google Scholar 

  14. G. Whittle, On the critical exponent of transversal matroids, J. Combin. Theory Ser. B37 (1984) 94–95.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kung, J.P.S. Pfaffian structures and critical problems in finite symplectic spaces. Annals of Combinatorics 1, 159–172 (1997). https://doi.org/10.1007/BF02558472

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02558472

AMS Subject Classification

Keywords

Navigation