Related papers: Restriction Estimates for space curves with respec…

In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…

This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…

In this paper, we study the restriction problem for one class of hypersurfaces with vanishing curvature in $\mathbb{R}^n$ with $n$ being odd. We obtain an $L^2-L^p$ restriction estimate, which is optimal except at the endpoint. Furthermore,…

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

We improve the best known exponent for the restriction conjecture in R^6. Our idea is applicable to any dimension n satisfying n = 0 mod 3, though we do not explicitly calculate the improvement for n > 6. This improves the recent results of…

In this note we consider the adjoint restriction estimate for hypersurface under additional regularity assumption. We obtain the optimal $H^s$-$L^q$ estimate and its mixed norm generalization. As applications we prove some weighted…

We provide an alternative and self contained proof of the main result of Bennett, Carbery, Tao regarding the multilinear restriction estimate. The approach is inspired by the recent result of Guth about the Kakeya version of multilinear…

Bennett, Carbery and Tao considered the $k$-linear restriction estimate in $\mathbb{R}^{n+1}$ and established the near optimal $L^\frac2{k-1}$ estimate under transversality assumptions only. We have shown that the trilinear restriction…

If $c, \overline c\colon [a,b]\to \mathbb R^2$ are two convex planar curve parameterized by affine arc length and $A\colon [a,b]\to [0,\infty)$ is the area bounded by the restriction $c\big|_{[a,s]}$ and the segment between $c(a)$ and…

A $\sqrt{n}$ estimate in the hyperplane problem with arbitrary measures has recently been proved in \cite{K3}. In this note we present analogs of this result for sections of lower dimensions and in the complex case. We deduce these…

We survey techniques for constrained curve fitting, based upon Bayesian statistics, that offer significant advantages over conventional techniques used by lattice field theorists.

We give a sharp lower bound on the area of the domain enclosed by an embedded curve lying on a two-dimensional sphere, provided that geodesic curvature of this curve is bounded from below. Furthermore, we prove some dual inequalities for…

Estimation of parameters that obey specific constraints is crucial in statistics and machine learning; for example, when parameters are required to satisfy boundedness, monotonicity, or linear inequalities. Traditional approaches impose…

We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance…

We consider the problem of calculating learning curves (i.e., average generalization performance) of Gaussian processes used for regression. On the basis of a simple expression for the generalization error, in terms of the eigenvalue…

We establish near-optimal mixed-norm estimates for the X-ray transform restricted to polynomial curves with a weight that is a power of the affine arclength. The bounds that we establish depend only on the spatial dimension and the degree…

Extending results for space curves we establish bounds for the cohomology of a non-degenerate curve in projective $n$-space. As a consequence, for any given $n$ we determine all possible pairs $(d, g)$ where $d$ is the degree and $g$ is the…

We study the estimation error of constrained M-estimators, and derive explicit upper bounds on the expected estimation error determined by the Gaussian width of the constraint set. Both of the cases where the true parameter is on the…

We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…

We establish optimal $(p,q)$ ranges for two types of estimates associated to three dimensional complex polynomial curves. These are the estimates for the weighted restriction of the Fourier Transform to a complex polynomial curve, and the…