Related papers: Partial smoothness of the numerical radius at matr…
We solve the Matrix Completion (MC) problem based on manifold optimization by incorporating the side information under which the columns of the intended matrix are drawn from a union of low dimensional subspaces. It is proved that this side…
A common strategy in the numerical solution of partial differential equations is to define a uniform discretization of a tensor-product multi-dimensional logical domain, which is mapped to a physical domain through a given coordinate…
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…
We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
This paper studies an optimization problem on the sum of traces of matrix quadratic forms in $m$ semi-orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the problem is nonconvex, the…
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…
A 3-dimensional graph-manifold is composed from simple blocks which are products of compact surfaces with boundary by the circle. Its global structure may be as complicated as one likes and is described by a graph which might be an…
Consider a convex domain B of space. We prove that there exist complete minimal surfaces which are properly immersed in B. We also demonstrate that if D and D' are convex domains with D bounded and the closure of D contained in D' then any…
It is investigated Hurwitz numbers, that correspond to covering of disk with single non-simple boundary critical value. It is found differential equations, that describe a generating function for these numbers.
We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite…
Gibbs manifolds are images of affine spaces of symmetric matrices under the exponential map. They arise in applications such as optimization, statistics and quantum~physics, where they extend the ubiquitous role of toric geometry. The Gibbs…
Given a compact smooth manifold $M$ with non-empty boundary and a Morse function, a pseudo-gradient Morse-Smale vector field adapted to the boundary allows one to build a Morse complex whose homology is isomorphic to the (absolute or…
We present deep optical imaging of three face-on disk galaxies together with a detailed description of the reduction and calibration methods used, in order to measure the intrinsic shape of their outer stellar edges. Whereas it is now well…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We derive intrinsic curvature and radius estimates for compact disks embedded in $\mathbb{R}^3$ with nonzero constant mean curvature and apply these estimates to study the global geometry of complete surfaces embedded in $\mathbb{R}^3$ with…
We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…
A large class of flat axially symmetric solutions to the Vlasov-Poisson system is constructed with the property that the corresponding rotation curves are approximately flat, slightly decreasing or slightly increasing. The rotation curves…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
In this paper, we study linear spaces of matrices defined over discretely valued fields and discuss their dimension and minimal rank drops over the associated residue fields. To this end, we take first steps into the theory of rank-metric…