Recommendations
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
- \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
- SAGBI bases in rings of multiplicative invariants
- scientific article; zbMATH DE number 1163437
- S. A. G. B. I. bases for rings of formal modular seminvariants
Cites work
- scientific article; zbMATH DE number 4132298 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1163437 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 4196114 (Why is no real title available?)
- scientific article; zbMATH DE number 3304649 (Why is no real title available?)
- scientific article; zbMATH DE number 967398 (Why is no real title available?)
- Algorithms in invariant theory
- An algorithm to compute the invariant ring of a \(G_ a\)-action on an affine variety
- Analogs of Gröbner bases in polynomial rings over a ring
- On the theory of graded structures
- Polynomial bounds for rings of invariants
- Sagbi bases with applications to blow-up algebras.
- Toric ideals generalized by quadratic binomials
Cited in
(7)- \texttt{SubalgebraBases} in Macaulay2
- Using symmetries in the eigenvalue method for polynomial systems
- Saturations of subalgebras, SAGBI bases, and U-invariants
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
- Gröbner bases for the rings of special orthogonal and \(2\times 2\) matrix invariants
- Standard Monomial Theory of RR Varieties
- Certification for polynomial systems via square subsystems
This page was built for publication: Using SAGBI bases to compute invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295793)
