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
Parents
40
1–5 of 40
57
5
h-index
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico
5 publications · 165 citations
5
h-index
4
h-index
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico
3 publications · 94 citations
3
h-index
3
h-index
1–5 of 57
43

Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
Mexico City, Mexico
6 h-index
12 publications
379 citations

Instituto Politécnico Nacional
Mexico City, Mexico
6 h-index
10 publications
349 citations
The University of Osaka
Osaka, Japan
4 h-index
7 publications
555 citations

University of Ioannina
Ioannina, Greece
3 h-index
6 publications
218 citations
The University of Tokyo
Tokyo, Japan
2 h-index
2 publications
65 citations
Max Planck Institute for Mathematics in the Sciences
Leipzig, Germany
2 h-index
2 publications
23 citations
Rikkyo University
Tokyo, Japan
2 h-index
2 publications
80 citations

Kagoshima University
Kagoshima, Japan
2 h-index
2 publications
65 citations
1–8 of 43
4 publications · 166 citations
4
h-index
2 publications · 59 citations
2
h-index
2 publications · 29 citations
2
h-index
2 publications · 103 citations
2
h-index
2 publications · 198 citations
2
h-index
1–5