Computing the canonical representation of constructible sets

DOI10.1007/S11786-016-0248-2MaRDI QIDQ294390zbMATH OpenOpenAlexFDO

Authors Antonio Montes, Josep M. Brunat

Publication date 16 June 2016

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/100350

zbMATH Keywords

canonical representation[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=comprehensive+Gr%EF%BF%BD%EF%BF%BDbner+system&go=Go comprehensive Gr��bner system]constructible sets[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+cover&go=Go Gr��bner cover]locally closed setsparametric polynomial system

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)

Recommendations

• Software for discussing parametric polynomial systems: the Gröbner cover
• An implicitization algorithm with fewer variables
• First order perturbation and local stability of parametrized systems
• Presentation of the book The Gröbner cover
• Gröbner bases for polynomial systems with parameters
• A new class of term orders for elimination
• Minimal canonical comprehensive Gröbner systems
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• scientific article; zbMATH DE number 1350005
• scientific article; zbMATH DE number 4210304

Cites work

• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 1107486 (Why is no real title available?)
• A new algorithm for computing comprehensive Gröbner systems
• Basic modern algebra with applications
• Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.
• GROEBNER BASES FOR CONSTRUCTIBLE SETS
• Generalizing the Steiner-Lehmus theorem using the Gröbner cover
• Gröbner bases and primary decomposition of polynomial ideals
• Gröbner bases for families of affine or projective schemes
• Gröbner bases for polynomial systems with parameters
• SINGULAR
• Software using the Gröbner cover for geometrical loci computation and classification
• The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple

Cited in

(4)

• Constructive sets in computable sets
• Algebraic analysis of the structural properties of parametric linear time-invariant systems
• Distance to the loss of structural properties for linear systems under parametric uncertainties
• When is a polynomial ideal binomial after an ambient automorphism?

Describes a project that uses

Uses Software

• RegularChains
• SINGULAR
• ConstructibleSetTools
• ParametricSystemTools

This page was built for publication: Computing the canonical representation of constructible sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294390)