Finiteness Principles for Smooth Selection
Author(s): Fefferman, Charles L.; Israel, Arie; Luli, Garving K
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr15755| Abstract: | In this paper we prove finiteness principles for C-m(R-n, R-D) and C-m-1,C-1(R-n, R-D) selections. In particular, we provide a proof for a conjecture of Brudnyi-Shvartsman (1994) on Lipschitz selections for the case when the domain is X = R-n. |
| Publication Date: | Apr-2016 |
| Electronic Publication Date: | 5-May-2016 |
| Citation: | Fefferman, Charles, Israel, Arie, Luli, Garving K. (2016). Finiteness Principles for Smooth Selection. GEOMETRIC AND FUNCTIONAL ANALYSIS, 26 (422 - 477. doi:10.1007/s00039-016-0366-7 |
| DOI: | doi:10.1007/s00039-016-0366-7 |
| ISSN: | 1016-443X |
| EISSN: | 1420-8970 |
| Pages: | 422 - 477 |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | GEOMETRIC AND FUNCTIONAL ANALYSIS |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.