2003
DOI: 10.1515/advg.2003.010
|View full text |Cite
|
Sign up to set email alerts
|

Description of algebraically constructible functions

Abstract: Abstract. The algebraically constructible functions on a real algebraic set are the sums of signs of polynomials on this set. We prove a formula giving the minimal number of polynomials needed to write generically a given algebraically constructible function as a sum of signs. We also prove a characterization of the polynomials appearing in a generic presentation of the function with the minimal number of polynomials. Both results are e¤ective.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…The goal of this section is to bound in terms of d the number of polynomial functions needed in such representation. This is connected to the work of I. Bonnard ([6] and [7]) that concerns the representation of general algebraically constructible functions as sums of signs of polynomial functions. However, the author cautions the reader that most of the results of this text concern specifically algebraically constructible functions that are signs of regulous functions and depend strongly of the nice properties verified by the regulous functions.…”
Section: Lengths Of Signs Of Regulous Functions (Part 1)mentioning
confidence: 99%
See 1 more Smart Citation
“…The goal of this section is to bound in terms of d the number of polynomial functions needed in such representation. This is connected to the work of I. Bonnard ([6] and [7]) that concerns the representation of general algebraically constructible functions as sums of signs of polynomial functions. However, the author cautions the reader that most of the results of this text concern specifically algebraically constructible functions that are signs of regulous functions and depend strongly of the nice properties verified by the regulous functions.…”
Section: Lengths Of Signs Of Regulous Functions (Part 1)mentioning
confidence: 99%
“…In the fourth and sixth sections, we investigate on the number of polynomial functions needed in the representation of Theorem A. This is connected to the work of I. Bonnard in [6] and [7]. We also study the case where the sign of a regulous function is the sign of a polynomial function.…”
Section: Introductionmentioning
confidence: 99%