Related papers: Some approximation problems in semi-algebraic geom…
We consider the problem of positioning a cloud of points in the Euclidean space $\mathbb{R}^d$, using noisy measurements of a subset of pairwise distances. This task has applications in various areas, such as sensor network localization and…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the…
The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…
In this contribution, we augment the metric learning setting by introducing a parametric pseudo-distance, trained jointly with the encoder. Several interpretations are thus drawn for the learned distance-like model's output. We first show…
We study Semidefinite Programming, \SDPc relaxations for Sensor Network Localization, \SNLc with anchors and with noisy distance information. The main point of the paper is to view \SNL as a (nearest) Euclidean Distance Matrix, \EDM,…
Consider the problem of minimizing a quadratic objective subject to quadratic equations. We study the semialgebraic region of objective functions for which this problem is solved by its semidefinite relaxation. For the Euclidean distance…
We study the problem of semi-supervised learning on graphs in the regime where data labels are scarce or possibly corrupted. We propose an approach called $p$-conductance learning that generalizes the $p$-Laplace and Poisson learning…
We show that, assuming NP $\not\subseteq$ $\cap_{\delta > 0}$DTIME$\left(\exp{n^\delta}\right)$, the shortest vector problem for lattices of rank $n$ in any finite $\ell_p$ norm is hard to approximate within a factor of $2^{(\log n)^{1 -…
We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and…
We introduce the problem Partial VC Dimension that asks, given a hypergraph $H=(X,E)$ and integers $k$ and $\ell$, whether one can select a set $C\subseteq X$ of $k$ vertices of $H$ such that the set $\{e\cap C, e\in E\}$ of distinct…
A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on $\Z/N\Z$ introduced by Gowers in his proof of Szemer\'edi's…
We consider a semi-algebraic function defined on a closed semi-algebraic set X. We give formulas relating the topology of X to the indices of the critical points of the function and to the topological behavior of the function at infinity.…
Generically, a fully measured elasticity tensor has no material symmetry. For single crystals with a cubic lattice, or for the aeronautics turbine blades superalloys such as Nickelbased CMSX-4, cubic symmetry is nevertheless expected. It is…
We give a novel and effective criterion for algebraicity of rational normal analytic surfaces constructed from resolving the singularity of an irreducible curve-germ on $CP^2$ and contracting the strict transform of a given line and all but…
We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…