Searcharxiv⌕ Search

arXiv subjects

Mauricio Velasco

Publications and source records attributed to Mauricio Velasco.

At least 37 records · Page 2Linked to original sources

Local angles and dimension estimation from data on manifolds

For data living in a manifold $M\subseteq \mathbb{R}^m$ and a point $p\in M$ we consider a statistic $U_{k,n}$ which estimates the variance of the angle between pairs of vectors $X_i-p$ and $X_j-p$, for data points $X_i$, $X_j$, near $p$, and evaluate this statistic as a tool for estimation of the intrinsic dimension of $M$ at $p$. Consistency of the local dimension estimator is established and the asymptotic distribution of $U_{k,n}$ is found under minimal regularity assumptions. Performance of the proposed methodology is compared against state-of-the-art methods on simulated data.

math.ST↗

Compressive sensing and truncated moment problems on spheres

We propose convex optimization algorithms to recover a good approximation of a point measure $μ$ on the unit sphere $S\subseteq \mathbb{R}^n$ from its moments with respect to a set of real-valued functions $f_1,\dots, f_m$. Given a finite subset $C\subseteq S$ the algorithm produces a measure $μ^*$ supported on $C$ and we prove that $μ^*$ is a good approximation to $μ$ whenever the functions $f_1,\dots, f_m$ are a sufficiently large random sample of independent Kostlan-Shub-Smale polynomials. More specifically, we give sufficient conditions for the validity of the equality $μ=μ^*$ when $μ$ is supported on $C$ and prove that $μ^*$ is close to the best approximation to $μ$ supported on $C$ provided that all points in the support of $μ$ are close to $C$.

math.OC↗

Compressed sensing of data with a known distribution

Compressed sensing is a technique for recovering an unknown sparse signal from a small number of linear measurements. When the measurement matrix is random, the number of measurements required for perfect recovery exhibits a phase transition: there is a threshold on the number of measurements after which the probability of exact recovery quickly goes from very small to very large. In this work we are able to reduce this threshold by incorporating statistical information about the data we wish to recover. Our algorithm works by minimizing a suitably weighted $\ell_1$-norm, where the weights are chosen so that the expected statistical dimension of the corresponding descent cone is minimized. We also provide new discrete-geometry-based Monte Carlo algorithms for computing intrinsic volumes of such descent cones, allowing us to bound the failure probability of our methods.

math.OC↗

Do Sums of Squares Dream of Free Resolutions?

We associate to a real projective variety $X$ two convex cones which are fundamental in real algebraic geometry: the cone $P_X$ of quadratic forms nonnegative on $X$, and the cone $Σ_X$ of sums of squares of linear forms. The dual cone $Σ_X^\ast$ is a spectrahedron and we show that its convexity properties are closely related to homological properties of $X$. For instance, we show that all extreme rays of $Σ_X^\ast$ have rank one if and only if X has Castelnuovo-Mumford regularity two. More generally, if $Σ_X^\ast$ has an extreme ray of rank $p > 1$, then $X$ does not satisfy the property $N_{2,p}$. We show that the converse also holds in a wide variety of situations: the smallest $p$ for which property $N_{2,p}$ does not hold is equal to the smallest rank of an extreme ray of $Σ_X^\ast$ greater than one. These results allow us to generalize the work of Blekherman-Smith-Velasco on equality of nonnegative polynomials and sums of squares from irreducible varieties to reduced schemes and to classify all spectrahedral cones with only rank one extreme rays. Our results have applications to the positive semidefinite matrix completion problem and to the truncated moment problem on projective varieties.

math.AG↗

A lower bound for the determinantal complexity of a hypersurface

We prove that the determinantal complexity of a hypersurface of degree $d > 2$ is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least $5$. As a result, we obtain that the determinantal complexity of the $3 \times 3$ permanent is $7$. We also prove that for $n> 3$, there is no nonsingular hypersurface in $\mathbf{P}^n$ of degree $d$ that has an expression as a determinant of a $d \times d$ matrix of linear forms while on the other hand for $n \le 3$, a general determinantal expression is nonsingular. Finally, we answer a question of Ressayre by showing that the determinantal complexity of the unique (singular) cubic surface containing a single line is $5$.

cs.CC↗

Test Sets for Nonnegativity of Polynomials Invariant under a Finite Reflection Group

A set $S\subset \mathbb{R}^n$ is a nonnegativity witness for a set $U$ of real homogeneous polynomials if $F$ in $U$ is nonnegative on $\mathbb{R}^n$ if and only if it is nonnegative at all points of $S$. We prove that the union of the hyperplanes perpendicular to the elements of a root system $Φ\subseteq \mathbb{R}^n$ is a witness set for nonnegativity of forms of low degree which are invariant under the reflection group defined by $Φ$. We prove that our bound for the degree is sharp for all reflection groups which contain multiplication by $-1$. We then characterize subspaces of forms of arbitrarily high degree where this union of hyperplanes is a nonnegativity witness set. Finally we propose a conjectural generalization of Timofte's half-degree principle for finite reflection groups.

math.CO↗

Semidefinite approximations of conical hulls of measured sets

Let $C$ be a proper convex cone generated by a compact set which supports a measure $μ$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $μ$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral cones which contains the cone $C^*$ dual to $C$. We prove convergence results for such sequences of spectrahedra and provide tools for bounding the distance between $P_k$ and $C^*$. These tools are especially useful on cones with enough symmetries and allow us to determine bounds for several cones of interest. We compute such upper bounds for semidefinite approximations of cones over traveling salesman polytopes and for cones of nonnegative ternary sextics and quaternary quartics.

math.OC↗

Gap vectors of real projective varieties

Let $X\subseteq \mathbb{P}^m$ be a totally real, non-degenerate, projective variety and let $Γ\subseteq X(\mathbb{R})$ be a generic set of points. Let $P$ be the cone of nonnegative quadratic forms on $X$ and let $Σ$ be the cone of sums of squares of linear forms. We examine the dimensions of the faces $P(Γ)$ and $Σ(Γ)$ consisting of forms in $P$ and $Σ$, which vanish on $Γ$. As the cardinality of the set $Γ$ varies in $1,\dots,\rm{codim}(X)$, the difference between the dimensions of $P(Γ)$ and $Σ(Γ)$ defines a numerical invariant of $X$, which we call the gap vector of X. In this article we begin a systematic study of its fundamental properties. Our main result is a formula relating the components of the gap vector of $X$ and the quadratic deficiencies of $X$ and its generic projections. The quadratic deficiency is a fundamental numerical invariant of projective varieties introduced by F. L. Zak. The relationship between quadratic deficiency and gap vectors allows us to effectively compute the gap vectors of concrete varieties as well as to prove several general properties. We prove that gap vectors are weakly increasing, obtain upper bounds for their rate of growth and prove that these upper bounds are eventually achieved for all varieties. Moreover, we give a characterization of the varieties with the simplest gap vectors: We prove that the gap vector vanishes identically precisely for varieties of minimal degree, and characterize the varieties whose gap vector equals $(0,\dots, 0,1)$. In particular, our results give a new proof of the theorem of Blekherman, Smith and Velasco saying that there are nonnegative quadratic forms which are not sums of squares on every variety, which is not of minimal degree. Finally, we determine the gap vector of all Veronese embeddings of $\mathbb{P}^2$, generalizing work of the first three authors.

math.AG↗

Dual toric codes and polytopes of degree one

We define a statistical measure of the typical size of short words in a linear code over a finite field. We prove that the dual toric codes coming from polytopes of degree one are characterized, among all dual toric codes, by being extremal with respect to this measure. We also give a geometric interpretation of the minimum distance of dual toric codes and characterize its extremal values. Finally, we obtain formulas for the parameters of both primal and dual toric codes associated to polytopes of degree one.

math.AG↗

Sums of squares and varieties of minimal degree

Let X be a real nondegenerate projective subvariety such that its set of real points is Zariski dense. We prove that every real quadratic form that is nonnegative on X is a sum of squares of linear forms if and only if X is a variety of minimal degree. This substantially extends Hilbert's celebrated characterization of equality between nonnegative forms and sums of squares. We obtain a complete list for the cases of equality and also a classification of the lattice polytopes Q for which every nonnegative Laurent polynomial with support contained in 2Q is a sum of squares.

math.AG↗

Linearization functors on real convex sets

We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to efficient computation. These operations are convex analogues of Hom functors, tensor products, symmetric powers, exterior powers and general Schur functors on vector spaces and lead to novel constructions even for polyhedra.

math.OC↗

A syzygetic approach to the smoothability of zero-dimensional schemes

We consider the question of which zero-dimensional schemes deform to a collection of distinct points; equivalently, we ask which Artinian k-algebras deform to a product of fields. We introduce a syzygetic invariant which sheds light on this question for zero-dimensional schemes of regularity two. This invariant imposes obstructions for smoothability in general, and it completely answers the question of smoothability for certain zero-dimensional schemes of low degree. The tools of this paper also lead to other results about Hilbert schemes of points, including a characterization of nonsmoothable zero-dimensional schemes of minimal degree in every embedding dimension d\geq 4.

math.AG↗

Cox rings of degree one del Pezzo surfaces

Let X be a del Pezzo surface of degree one over an algebraically closed field (of any characteristic), and let Cox(X) be its total coordinate ring. We prove the missing case of a conjecture of Batyrev and Popov, which states that Cox(X) is a quadratic algebra. We use a complex of vector spaces whose homology determines part of the structure of the minimal free Pic(X)-graded resolution of Cox(X) over a polynomial ring. We show that sufficiently many Betti numbers of this minimal free resolution vanish to establish the conjecture.

math.AG↗

Blow-ups of $\mathbb{P}^{n-3}$ at $n$ points and spinor varieties

Work of Dolgachev and Castravet-Tevelev establishes a bijection between the $2^{n-1}$ weights of the half-spin representations of $\mathfrak{so}_{2n}$ and the generators of the Cox ring of the variety $X_n$ which is obtained by blowing up $\mathbb{P}^{n-3}$ at $n$ points. We derive a geometric explanation for this bijection, by embedding ${\rm Cox}(X_n)$ into the even spinor variety (the homogeneous space of the even half-spin representation). The Cox ring of the blow-up $X_n$ is recovered geometrically by intersecting torus translates of the even spinor variety. These are higher-dimensional generalizations of results by Derenthal and Serganova-Skorobogatov on del Pezzo surfaces.

math.AG↗

Big rational surfaces

We prove that the Cox ring of a smooth rational surface with big anticanonical class is finitely generated. We classify surfaces of this type that are blow-ups of the plane at distinct points lying on a (possibly reducible) cubic.

math.AG↗

A survey on Cox rings

We survey the construction of the Cox ring of an algebraic variety X and study the birational geometry of X when its Cox ring is finitely generated.

math.AG↗

Hilbert schemes of 8 points

The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >= 4. In the simplest case of reducibility, the component R^4_8 \subset H^4_8 is defined by a single explicit equation which serves as a criterion for deciding whether a given ideal is a limit of distinct points. To understand the components of the Hilbert scheme, we study the closed subschemes of H_n^d which parametrize those ideals which are homogeneous and have a fixed Hilbert function. These subschemes are a special case of multigraded Hilbert schemes, and we describe their components when the colength is at most 8. In particular, we show that the scheme corresponding to the Hilbert function (1,3,2,1) is the minimal reducible example.

math.AG↗

Picard-graded Betti numbers and the defining ideals of Cox rings

Let X be a smooth projective variety with torsion-free Picard group. We introduce complexes of vector spaces whose homology determines the structure of the minimal free resolution of the Cox ring of X over the polynomial ring and show how the homology of these complexes can be studied by purely geometric methods. As an application of these techniques we give a simple new proof of a characterization of the Cox rings of Del Pezzo surfaces (of degree >1) conjectured by Batyrev and Popov.

math.AG↗