Computing PUR of zero-dimensional ideals of breadth at most one

DOI10.1007/s11424-021-9330-1zbMath1483.13046OpenAlexW3174495516MaRDI QIDQ2121179

Zhe Li, Baoxin Shang, Jian Pan, Shugong Zhang

Publication date: 1 April 2022

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-021-9330-1

zbMATH Keywords

Gröbner basiscyclic basispolynomial univariate representationseparating element

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Uses Software

• ISOLATE

Cites Work

• Unnamed Item
• Computing the multiplicity structure of an isolated singular solution: case of breadth one
• Solving zero-dimensional systems through the rational univariate representation
• Solving polynomial equations. Foundations, algorithms, and applications
• A modular method to compute the rational univariate representation of zero-dimensional ideals
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
• Computing the multiplicity structure in solving polynomial systems

This page was built for publication: Computing PUR of zero-dimensional ideals of breadth at most one