scientific article; zbMATH DE number 1163437
From MaRDI portal
Publication:4394972
Recommendations
- An efficient implementation for computing Gröbner bases over algebraic number fields
- scientific article; zbMATH DE number 3899033
- A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- A generalization of Gröbner basis algorithms to polycyclic group rings
- scientific article; zbMATH DE number 3941661
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors
- Efficient Gröbner bases computation over principal ideal rings
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
Cited in
(16)- SAGBI and SAGBI-Gröbner bases over principal ideal domains
- Using SAGBI bases to compute invariants
- Applications of SAGBI-bases in dynamics
- An algorithm to compute the H-bases for ideals of subalgebras
- \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
- SAGBI bases in \(G\)-algebras
- Computation of unirational fields
- A note on computing SAGBI-Gröbner bases in a polynomial ring over a field
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- On the S-operation in polynomial rings
- Standard bases for modules over polynomial subalgebras
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
- A variant of the Gröbner basis algorithm for computing Hilbert bases
- Sagbi-Gröbner bases under composition
- Using symmetries in the eigenvalue method for polynomial systems
- Saturations of subalgebras, SAGBI bases, and U-invariants
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394972)
