Related papers: Convex Algebraic Geometry of Curvature Operators
The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…
Spectrahedral shadows are projections of linear sections of the cone of positive semidefinite matrices. We characterize the polynomials that vanish on the boundaries of these convex sets when both the section and the projection are generic.
We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the…
The role of curvature in relation with Lie algebra contractions of the pseudo-ortogonal algebras so(p,q) is fully described by considering some associated symmetrical homogeneous spaces of constant curvature within a Cayley-Klein framework.…
For a given point set $S$ in a plane, we develop a distributed algorithm to compute the $\alpha-$shape of $S$. $\alpha-$shapes are well known geometric objects which generalize the idea of a convex hull, and provide a good definition for…
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finitely many basic semi-algebraic convex sets. We establish an explicit convergence rate estimate which relies on the maximum degree of the…
A new geometric proof of the spectral theorem for unbounded self-adjoint operators A in a Hilbert space H is given based on a splitting of A in positive and negative parts A+ and A-. For both operators A+ and A- the spectral family can be…
We investigate different aspects of area convexity [Sherman '17], a mysterious tool introduced to tackle optimization problems under the challenging $\ell_\infty$ geometry. We develop a deeper understanding of its relationship with more…
Spectral computations of infinite-dimensional operators are notoriously difficult, yet ubiquitous in the sciences. Indeed, despite more than half a century of research, it is still unknown which classes of operators allow for computation of…
In this paper we study quasi-homogeneous operators, which include the homogeneous operators, in the Cowen-Douglas class. We give two separate theorems describing canonical models (with respect to equivalence under unitary and invertible…
One-dimensional sigma-models with N supersymmetries are considered. For conventional supersymmetries there must be N-1 complex structures satisfying a Clifford algebra and the constraints on the target space geometry can be formulated in…
In this paper, we study solution operators of physical field equations on geometric meshes from a function-space perspective. We reveal that Hodge orthogonality fundamentally resolves spectral interference by isolating unlearnable…
The idea that symmetries simplify or reduce the complexity of a system has been remarkably fruitful in physics, and especially in quantum mechanics. On a mathematical level, symmetry groups single out a certain structure in the Hilbert…
A standard objective in computer experiments is to approximate the behaviour of an unknown function on a compact domain from a few evaluations inside the domain. When little is known about the function, space-filling design is advisable:…
For a smooth quasi-projective surface S over complex numbers we consider the Borel-Moore homology of the stack of coherent sheaves on S with compact support and make this space into an associative algebra by a version of the Hall…
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…