Skip to main content
SpringerLink
Log in

A characterization of the simplex

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

Abstract

In the vein of Rado's beautiful characterization of matroids by the functioning of the Greedy Algorithm we prove that our persistent frustrations in obtaining analogues and generalizations of Shapiro's Lemma had a good reason.

Essentially, only the classical case of the power set can work.

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. Kolchin, E.R.,Differential algebra and algebraic groups. Academic Press, New York, 1973, p. 53.

    Google Scholar 

  2. Welsh, D.J.A.,Matroid theory. Academic Press, New York, 1976, pp. 357 and 52.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, 203 B.T. Road, 700 035, Calcutta, India

    K. S. Vijayan

Authors
  1. K. S. Vijayan
    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

Vijayan, K.S. A characterization of the simplex. Aeq. Math. 24, 33–38 (1982). https://doi.org/10.1007/BF02193032

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS (1980) subject classification

Search

Navigation