On the stability of sets defined by a finite number of equalities and inequalities
โ Scribed by J. F. Bonnans; G. Launay
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 496 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We show that the known algorithms used to re-write any first order quantifierfree formula over an algebraically closed field into its normal disjunctive form are essentially optimal. This result follows from an estimate of the number of sets definable by equalities and inequalities of fixed polynomi
This paper skws that for any su Dset S of vertices of the m-dimensional hypercube, L!!d(S) G P-1 \* ~%e.-e ind(SS is the rtMxnwm number of tinear inequz!ities needed to define S. I:'urthermare, for any k in the range 1 c k r? 2n-1, there is an S with ind(S) = k, with the defining inequalities taken
Given a set U of size q in an affine plane of order q, we determine the possibilities for the number of directions of secants of U, and in many cases characterize the sets U with given number of secant directions.