Computing the canonical representation of constructible sets
A locally closed set is the intersection of a closed set and an open set. The canonical representation of a locally closed set consists in two specially chosen radical ideals. This article describes an algorithm \textsc{Crep} to compute a canonical representation of a locally closed set. It then uses \textsc{Crep} to compute a canonical representation of a constructible set, a finite union of locally closed sets. Constructible sets have the useful application that they ``appear naturally in solving parametric polynomial systems of equations. In particular, one can use constructible sets to construct a Gröbner cover; that is, a finite set of pairs of sets used to investigate parametric polynomial systems (see [\textit{A. Montes} and \textit{M. Wibner}, J. Symb. Comp. 45, 1391--1425 (2010; Zbl 1207.13108)]). Two algorithms, \textsc{FirstLevel} and \textsc{ConsLevels}, compute the canonical representation of constructible sets. A third algorithm, \textsc{SimplifyUnion}, can accelerate \textsc{FirstLevel}. The article concludes with three examples: one, a geometric problem in 3-dimensional space; the second, an application to the computation of a Gröbner cover; and the third, a brief summary of how performance changed in one (unnamed) system where the use of \textsc{SimplifyUnion} reduced the time to compute a canonical representation of a constructible set by roughly two-thirds.
- 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
- 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.
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- GROEBNER BASES FOR CONSTRUCTIBLE SETS
- 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
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 1107486 (Why is no real title available?)
- SINGULAR
- Software using the Gröbner cover for geometrical loci computation and classification
- The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
- Constructive sets in computable sets
- When is a polynomial ideal binomial after an ambient automorphism?
- Distance to the loss of structural properties for linear systems under parametric uncertainties
- Algebraic analysis of the structural properties of parametric linear time-invariant systems
- Effective Hilbert's irreducibility theorem for primary ideals
Uses Software
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)
