1
Finset
▶
1.1
Piecewise
1.2
Off-diagonal
2
Orders and Abstract Reduction Relations
▶
2.1
Foundedness Properties
3
Monomial Ideal
▶
3.1
Orderings on the Monomials in \(k[x_1,\ldots ,x_n]\)
3.2
Monomial Ideals and Dickson’s Lemma
4
Gröbner Bases
▶
4.1
Polynomial Reductions
4.2
Gröbner Bases-Existence and Uniqueness
5
The State Polytope
▶
5.1
Basic Concepts of Polyhedral Geometry
Dependency graph
Buchberger Algorithm Formalization
Sanghyeok0
1
Finset
1.1
Piecewise
1.2
Off-diagonal
2
Orders and Abstract Reduction Relations
2.1
Foundedness Properties
3
Monomial Ideal
3.1
Orderings on the Monomials in \(k[x_1,\ldots ,x_n]\)
3.2
Monomial Ideals and Dickson’s Lemma
4
Gröbner Bases
4.1
Polynomial Reductions
4.2
Gröbner Bases-Existence and Uniqueness
5
The State Polytope
5.1
Basic Concepts of Polyhedral Geometry