INDISPENSABLE BINOMIALS OF FINITE GRAPHS

By Hidefumi Ohsugi, Takayuki Hibi. 2005

49 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Pharmacology

View Paper: https://www.semanticscholar.org/paper/99bf54a58eb2118791b13b65b4797e1b1cc4b7e3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Takayuki Hibi
2. Hidefumi Ohsugi
3. Jürgen Herzog
4. Adam Van Tuyl

In Computational Theory and Mathematics

1. Takayuki Hibi
2. Hidefumi Ohsugi
3. Jürgen Herzog

Citations in the corpus

• Toric Ideals Arising from Contingency Tables (2007, background): “On the other hand, a binomial f belonging to IA is called indispensable ([20] and [16]) if, for an arbitrary system F of binomial generators of IA, either f or−f appears in F .”
• Minimal systems of binomial generators and the indispensable complex of a toric ideal (2006, background): “To study this problem, Ohsugi and Hibi introduced in [10] the notion of indispensable binomials while Aoki, Takemura and Yoshida introduced in [1] the notion of indispensable monomials.”