Covering a function on the plane by two continuous functions on an uncountable square – the consistency
✍ Scribed by Mariusz Rabus; Saharon Shelah
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 138 KB
- Volume
- 103
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We present a uniform approach towards deriving upper bounds on the covering radius of a code as a function of its dual distance structure and its cardinality. We show that the bounds obtained previously by Delsarte, Helleseth et al.. TietGiinen, resp. Solt-and Stokes follow as special cases. Moreove
We correct a previously published theorem by proving a criterion to decide whether the ÿbration given by a real polynomial function f : R 2 → R is locally trivial at inÿnity. The algorithmical nature of this criterion provides a test that can be applied to any real polynomial f.