Finiteness Principles for Smooth Selection

Author(s): Fefferman, Charles L.; Israel, Arie; Luli, Garving K

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr15755

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fefferman, Charles L.	-
dc.contributor.author	Israel, Arie	-
dc.contributor.author	Luli, Garving K	-
dc.date.accessioned	2019-12-10T17:51:29Z	-
dc.date.available	2019-12-10T17:51:29Z	-
dc.date.issued	2016-04	en_US
dc.identifier.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	en_US
dc.identifier.issn	1016-443X	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr15755	-
dc.description.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.	en_US
dc.format.extent	422 - 477	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	GEOMETRIC AND FUNCTIONAL ANALYSIS	en_US
dc.rights	Author's manuscript	en_US
dc.title	Finiteness Principles for Smooth Selection	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1007/s00039-016-0366-7	-
dc.date.eissued	2016-05-05	en_US
dc.identifier.eissn	1420-8970	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1511.04804.pdf		603.14 kB	Adobe PDF	View/Download