Computing the canonical representation of constructible sets

DOI10.1007/s11786-016-0248-2zbMath1365.13043OpenAlexW2296000985MaRDI QIDQ294390

Antonio Montes, Josep M.Brunat Blay

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 representationcomprehensive Gröbner systemconstructible setsGröbner coverlocally closed setsparametric polynomial system

Mathematics Subject Classification ID

Related Items (2)

Distance to the loss of structural properties for linear systems under parametric uncertainties ⋮ When is a polynomial ideal binomial after an ambient automorphism?

Uses Software

• RegularChains
• SINGULAR
• ConstructibleSetTools
• ParametricSystemTools

Cites Work

• Unnamed Item
• Unnamed Item
• Gröbner bases for polynomial systems with parameters
• Gröbner bases and primary decomposition of polynomial ideals
• Generalizing the Steiner-Lehmus theorem using the Gröbner cover
• Gröbner bases for families of affine or projective schemes
• Basic Modern Algebra with Applications
• Software Using the Gröbner Cover for Geometrical Loci Computation and Classification
• A new algorithm for computing comprehensive Gröbner systems
• GROEBNER BASES FOR CONSTRUCTIBLE SETS
• SINGULAR
• The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
• Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.

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