Computing the Canonical Representation of Constructible Sets

Constructible sets are needed in many algorithms of Computer Algebra, particularly in the Gröbner Cover and other algorithms for parametric polynomial systems. In this paper we review the canonical form of constructible sets and give algorithms for computing it.

Saved in:

Bibliographic Details
Published in:	Mathematics in computer science Vol. 10; no. 1; pp. 165 - 178
Main Authors:	Brunat, Josep M., Montes, Antonio
Format:	Journal Article Publication
Language:	English
Published:	Cham Springer International Publishing 01-03-2016
Subjects:	Aplicacions de la informàtica Canonical representation Comprehensive Gröbner system Computer Science Constructibilitat (Teoria de conjunts) Constructibility (Set theory) Constructible sets Gröbner Cover Informàtica Locally closed sets Mathematics Mathematics and Statistics Parametric polynomial system Àrees temàtiques de la UPC Parametric polynomial system Constructible sets 68T15 13P10 Gröbner Cover Comprehensive Gröbner system Locally closed sets Canonical representation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Constructible sets are needed in many algorithms of Computer Algebra, particularly in the Gröbner Cover and other algorithms for parametric polynomial systems. In this paper we review the canonical form of constructible sets and give algorithms for computing it.
ISSN:	1661-8270 1661-8289
DOI:	10.1007/s11786-016-0248-2