Skip to main content
Log in

Matroids algebraic overF(t) are algebraic overF

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

In his thesis [3] M. J. Piff conjectured that a matroid, which is algebraic over a fieldFit) witht transcendent overF, must be algebraic overF. Two proofs have appeared, one by Shameeva [5] and another one by the author [2], but both are unsatisfactory. In this paper I will settle conjecture by applying a theorem of Seidenberg.

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. N. Jacobson,Basic Algebra I, Freeman & Co., New York, 1985.

    Google Scholar 

  2. B. Lindström, A reduction of algebraic representations of matroids,Proc. Amer. Math. Soc. 100 (1987), 388–389.

    Google Scholar 

  3. M. J.Piff, Some problems in combinatorial theory (thesis), Oxford, 1972.

  4. A. Seidenberg, Some remarks on Hilbert's nullstellensatz,Archiv der Mathematik 7 (1956), 235–240.

    Article  Google Scholar 

  5. O. V. Shameeva, Algebraic representability. of matroids, Vestnik Moskovskogo Universiteta,Matematika 40 (1985), 29–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lindström, B. Matroids algebraic overF(t) are algebraic overF . Combinatorica 9, 107–109 (1989). https://doi.org/10.1007/BF02122691

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS subject classification (1980)

Navigation