Toric Ideal Computation

Toric Ideal Computation is a computational method in algebraic geometry that determines the defining ideal of a toric variety from a given integer matrix by generating a binomial ideal encoding the algebraic relations among monomials associated with the matrix columns.

40

Publications

1.3K

Citations

57

Authors

43

Institutions

Publications per year

2017–2026

6

Authors

57

  1. HO
    Hidefumi Ohsugi

    The University of Osaka, Japan

    5 publications · 324 citations

    5

    h-index

  2. ER
    Enrique Reyes

    Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico

    5 publications · 165 citations

    5

    h-index

  3. TH
    Takayuki Hibi

    The University of Osaka, Japan

    4 publications · 311 citations

    4

    h-index

  4. IG
    Isidoro Gitler

    Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico

    3 publications · 94 citations

    3

    h-index

  5. RH
    Rafael H. Villarreal

    Instituto Politécnico Nacional, Mexico

    3 publications · 106 citations

    3

    h-index

1–5 of 57

Venues

  1. Journal of Symbolic Computation

    4 publications · 166 citations

    4

    h-index

  2. Journal of Pure and Applied Algebra

    2 publications · 59 citations

    2

    h-index

  3. Journal of Algebraic Combinatorics

    2 publications · 29 citations

    2

    h-index

  4. Journal of Combinatorial Theory Series A

    2 publications · 103 citations

    2

    h-index

  5. Journal of Algebra

    2 publications · 198 citations

    2

    h-index

1–5