Bo'AZ Klartag
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bo'AZ Klartag has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Charles Fefferman
Department of Mathematics, Princeton University, Princeton, USA
2 shared publications - Nahum Zobin
College of William and Mary, Williamsburg, USA
1 shared publication - Roman Vershynin
Department of Mathematics, University of California, Davis, USA
1 shared publication V. D. Milman
Tel Aviv University
1 shared publication
Latest Publications
- Open Access
- 31 August 2009
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 25 (2) , 423-446
An example related to Whitney extension with almost minimal $C^m$ normWe present a counter-example to a certain conjecture that is related to Whitney's extension problems.
- 31 August 2009
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 25 (2) , 423-446
Open AccessAn example related to Whitney extension with almost minimal $C^m$ normWe present a counter-example to a certain conjecture that is related to Whitney's extension problems.
- Open Access
- 30 April 2009
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 25 (1) , 49-273
Fitting a $C^m$-Smooth Function to Data II
We exhibit efficient algorithms to perform the following task: Given a function f defined on a finite subset E \subset \mathbb R^n , compute a C^m function F on \mathbb R^n , with a controlled C^m norm, that approximates f on the subset E .
- 30 April 2009
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 25 (1) , 49-273
Open AccessFitting a $C^m$-Smooth Function to Data II
We exhibit efficient algorithms to perform the following task: Given a function f defined on a finite subset E \subset \mathbb R^n , compute a C^m function F on \mathbb R^n , with a controlled C^m norm, that approximates f on the subset E .
- Open Access
- 31 August 2007
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 23 (2) , 635-669
$C^1$ extensions of functions and stabilization of Glaeser refinements
Given an arbitrary set E \subset \mathbb R^n , n\ge 2 , and a function f: E \rightarrow \mathbb R , consider the problem of extending f to a C^1 function defined on the entire \mathbb R^n . A procedure for determining whether such an extension exists was suggested in 1958 by G. Glaeser. In 2004 C. Fefferman proposed a related procedure for dealing with the much more difficult cases of higher smoothness. The procedures in question require iterated computations of some bundles until the bundles stabilize. How many iterations are needed? We give a sharp estimate for the number of iterations that could be required in the C^1 case. Some related questions are discussed.
- 31 August 2007
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 23 (2) , 635-669
Open Access$C^1$ extensions of functions and stabilization of Glaeser refinements
Given an arbitrary set E \subset \mathbb R^n , n\ge 2 , and a function f: E \rightarrow \mathbb R , consider the problem of extending f to a C^1 function defined on the entire \mathbb R^n . A procedure for determining whether such an extension exists was suggested in 1958 by G. Glaeser. In 2004 C. Fefferman proposed a related procedure for dealing with the much more difficult cases of higher smoothness. The procedures in question require iterated computations of some bundles until the bundles stabilize. How many iterations are needed? We give a sharp estimate for the number of iterations that could be required in the C^1 case. Some related questions are discussed.
- 1 January 2007
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 157 (1) , 193-207
Small ball probability and Dvoretzky’s Theorem
- 1 January 2007
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 157 (1) , 193-207
Small ball probability and Dvoretzky’s Theorem
- Top Cited Papers
- 6 December 2006
- Published by Springer Nature in Geometric and Functional Analysis
- Vol. 16 (6) , 1274-1290
On convex perturbations with a bounded isotropic constant
- 6 December 2006
- Published by Springer Nature in Geometric and Functional Analysis
- Vol. 16 (6) , 1274-1290
Top Cited PapersOn convex perturbations with a bounded isotropic constant
- 1 April 2005
- Published by Springer Nature in Geometriae Dedicata
- Vol. 112 (1) , 169-182
Geometry of Log-concave Functions and Measures
- 1 April 2005
- Published by Springer Nature in Geometriae Dedicata
- Vol. 112 (1) , 169-182
Geometry of Log-concave Functions and Measures