Related papers: Some approximation problems in semi-algebraic geom…
Let $\theta\in\mathbb{R}^d$. We associate three objects to each approximation $(p,q)\in \mathbb{Z}^d\times \mathbb{N}$ of $\theta$: the projection of the lattice $\mathbb{Z}^{d+1}$ to the hyperplane of the first $d$ coordinates along the…
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes the closeness of the points in the same cluster, even if the…
It is generally known that in order to solve the split equality fixed-point problem (SEFPP), it is necessary to compute the norm of bounded and linear operators, which is a challenging task in real life, to address this issue, we studied…
For $\theta$ a non-algebraic point on a quasi projective variety over a number field, I prove that $\theta$ has an approximation by a series of algebraic points of bounded height and degree which is essentially best possible. Applications…
We derive a priori error estimates for Nitsche's method applied to elliptic problems on approximate domains. Such approximations arise, for example, in unfitted finite element methods, data-driven simulations, and evolving domain problems,…
We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
We show that the dimension of the Cuntz semigroup of a C*-algebra is determined by the dimensions of the Cuntz semigroups of its separable sub-C*-algebras. This allows us to remove separability assumptions from previous results on the…
In this paper we discuss a classical geometrical problem of estimating an unknown point's location in $\Real{n}$ from several noisy measurements of the Euclidean distances from this point to a set of known reference points (anchors). We…
In this work we approach the problem of approximating uniformly continuous semialgebraic maps $f:S\to T$ from a compact semialgebraic set $S$ to an arbitrary semialgebraic set $T$ by semialgebraic maps $g:S\to T$ that are differentiable of…
In this paper consisting of two parts, we study the integral of a logarithmic differential form on a compact semi-algebraic set in R^n or C^n. In Part I, we prove the convergence of the integral when the semi-algebraic set satisfies…
We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…
In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…
We introduce the concept of average best $m$-term approximation widths with respect to a probability measure on the unit ball of $\ell_p^n$. We estimate these quantities for the embedding $id:\ell_p^n\to\ell_q^n$ with $0<p\le q\le \infty$…
Are two sets of observations drawn from the same distribution? This problem is a two-sample test. Kernel methods lead to many appealing properties. Indeed state-of-the-art approaches use the $L^2$ distance between kernel-based distribution…
This paper studies the strong quasiconvexity of norm and distance functions in finite-dimensional normed spaces. Although the Euclidean norm is known to be strongly quasiconvex on bounded convex sets, a complete characterization of this…
For a family of second-order elliptic systems in divergence form with rapidly oscillating almost-periodic coefficients, we obtain estimates for approximate correctors in terms of a function that quantifies the almost periodicity of the…
We derive logarithmic gradient estimate and universal boundedness estimate for semilinear elliptic equations on \RCD\, metric measure spaces, which contains the class of Riemannian manifolds with Ricci curvature bounded below. These…
In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…