scientific article; zbMATH DE number 1273647

MaRDI QIDQ4237377zbMATH OpenFDO

Authors Ralf Fröberg, Jörgen Backelin

Publication date 23 September 1999

zbMATH Keywords

BergmanBuchberger based algorithmscyclic \(n\)-rootsGröbner basis element

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Cited in

(11)

• Thirty years of polynomial system solving, and now?
• A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
• A convex geometric approach to counting the roots of a polynomial system
• Solving a system of algebraic equations with symmetries
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• CAZAC sequences and Haagerup's characterization of cyclic \(N\)-roots
• On non-binomial structure of cyclic 8-roots
• On biunimodular vectors for unitary matrices
• \(u\)-generation: solving systems of polynomials equation-by-equation

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 Q4237377)