Order Embeddings

Order Embeddings is a mathematical mapping between partially ordered sets that preserves the order relation, distinguished by being both injective and relation-preserving, thereby enabling one poset to be embedded as a substructure within another while maintaining its original order-theoretic properties.

44

Publications

1.6K

Citations

85

Authors

60

Institutions

Publications per year

2017–2026

10

Authors

85

  1. MC
    Mauro C. Beltrametti

    University of Genoa, Italy

    3 publications · 122 citations

    3

    h-index

  2. RS
    Ryota Suzuki

    National Institute of Advanced Industrial Science and Technology, Japan

    2 publications · 31 citations

    2

    h-index

  3. AL
    Alain Louveau

    Sorbonne Université, France

    2 publications · 46 citations

    2

    h-index

  4. AM
    Andrew McCallum

    University of Massachusetts Amherst, United States

    2 publications · 25 citations

    2

    h-index

  5. AJ
    Andrew J. Sommese

    University of Notre Dame, United States

    2 publications · 110 citations

    2

    h-index

1–5 of 85

Venues

  1. Journal of Symbolic Logic

    6 publications · 119 citations

    6

    h-index

  2. arXiv (Cornell University)

    Repository · 5 publications · 163 citations

    5

    h-index

  3. Canadian Journal of Mathematics

    3 publications · 33 citations

    3

    h-index

  4. Theoretical Computer Science

    2 publications · 132 citations

    2

    h-index

  5. Communications in Algebra

    2 publications · 66 citations

    2

    h-index

1–5