Skip to main content
SpringerLink
Log in

A Linear Programming Method for Finding Orthocomplements in Finite Lattices

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

A method of embedding partially ordered setsinto linear spaces is presented. The problem of findingall orthocomplementations in a finite lattice is reducedto a linear programming problem.

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

  • Aigner, M. (1979). Combinatorial Theory, Springer-Verlag, Berlin.

    Google Scholar 

  • Stanley, R. (1986). Enumerative Combinatorics, Wadsworth and Brooks, Monterey, California.

    Google Scholar 

Download references

Authors
  1. G. N. Parfionov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. R. Zapatrine
    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

Parfionov, G.N., Zapatrine, R.R. A Linear Programming Method for Finding Orthocomplements in Finite Lattices. International Journal of Theoretical Physics 37, 211–213 (1998). https://doi.org/10.1023/A:1026698213966

Download citation

  • Issue Date:

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

Keywords

Search

Navigation