Related papers: Identifiability through special linear measurement…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…
In this paper we give for any integer l > 2 a numerical criterion ensuring the existence of a chain of length l of lines through two general points of an irreducible variety X in P^N, involving the degrees and the number of homogeneous…
When data contains measurement errors, it is necessary to make assumptions relating the observed, erroneous data to the unobserved true phenomena of interest. These assumptions should be justifiable on substantive grounds, but are often…
Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…
We prove an existence and uniqueness result for solutions to linear $X$-elliptic equations with $L^1$ data and zero Dirichlet boundary conditions. Such solutions depend continuously on the datum. Moreover, we show that an improvement in the…
Recent work has shown that finite mixture models with $m$ components are identifiable, while making no assumptions on the mixture components, so long as one has access to groups of samples of size $2m-1$ which are known to come from the…
Let A be a unital standard algebra on a complex Banach space X with dimX >1. We characterize the linear maps D; T : A --> B(X) satisfying aT(b) + D(a)b= 0 whenever a,b in A are such that ab = 0.
A projective variety $X\subset\mathbb{P}^N$ is $h$-identifiable if the generic element in its $h$-secant variety uniquely determines $h$ points on $X$. In this paper we propose an entirely new approach to study identifiability, connecting…
It is an elementary fact that if we fix an arbitrary set of $d+1$ affine independent points $\{p_0,\dots p_d\}$ in $\mathbb{R}^d$, then the Euclidean distances $\{|x-p_j|\}_{j=0}^d$ determine the point $x$ in $\mathbb{R}^d$ uniquely. In…
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points. However, relying on linearization points leads to proofs that are…
We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.
A variety $X$ is covered by lines if there exist a finite number of lines contained in $X$ passing through each general point. I prove two theorems. Theorem 1:Let $X^n\subset P^M$ be a variety covered by lines. Then there are at most $n!$…
Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…
Let $\mathbf{p}$ be a configuration of $n$ points in $\mathbb{R}^d$ for some $n$ and some $d \ge 2$. Each pair of points has a Euclidean length in the configuration. Given some graph $G$ on $n$ vertices, we measure the point-pair lengths…
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…
We prove that a real x is 1-generic if and only if every differentiable computable function has continuous derivative at x. This provides a counterpart to recent results connecting effective notions of randomness with differentiability. We…
Let $Y$ be a generic link of a subvariety $X$ of a nonsingular variety $A$. We give a description of the Grauert-Riemenschneider canonical sheaf of $Y$ in terms of the multiplier ideal sheaves associated to $X$ and use it to study the…
In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…
An algebraic criterion that is sufficient to establish the existence of certain a priori estimates for the solution of first-order homogeneous linear characteristic problems is derived. Estimates of such kind ensure the stability of the…
Linearisability has become the standard correctness criterion for concurrent data structures, ensuring that every history of invocations and responses of concurrent operations has a matching sequential history. Existing proofs of…