Related papers: Extreme Nonnegative Quadratics over Stanley Reisne…
Recent studies have shown that aggregating convolutional features of a pre-trained Convolutional Neural Network (CNN) can obtain impressive performance for a variety of visual tasks. The symmetric Positive Definite (SPD) matrix becomes a…
We study projective varieties $X \subset \mathbb{P}^r$ of dimension $n \geq 2$, of codimension $c \geq 3$ and of degree $d \geq c + 3$ that are of maximal sectional regularity, i.e. varieties for which the Castelnuovo-Mumford regularity…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
We prove that in the varieties where every compact congruence is a factor congruence and every nontrivial algebra contains a minimal subalgebra, a finitely presented algebra is projective if and only if it has every minimal algebra as its…
As proved recently in [PT], for varieties $X^{r+1}\subset \mathbb P^N$ such that through $n\geq 2$ general points there passes an irreducible curve $C$ of degree $\delta\geq n-1$ we have $N\leq \pi(r,n,\delta+r(n-1)+2)$, where $\pi(r,n,d)$…
This article is a continuation of a previous article which concerned the splitting problem for subspaces of superspaces. We begin with a general account of projective superspaces. Subsequently, we specialise to subvarieties of `positive'…
We develop a practical semidefinite programming (SDP) facial reduction procedure that utilizes computationally efficient approximations of the positive semidefinite cone. The proposed method simplifies SDPs with no strictly feasible…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
We study linear systems cut out by cones of fixed degree on a smooth complex curve $C\subset\mathbb{P}^{3}$. We develop a systematic study of the families of such systems, considering their limits, their infinitesimal behaviour and some…
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…
We study the projective geometry of homogeneous varieties $X= G/P\subset P(V)$, where $G$ is a complex simple Lie group, $P$ is a maximal parabolic subgroup and $V$ is the minimal $G$-module associated to $P$. Our study began with the…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…
Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…
We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs). With the aggregate sparsity matrix from the data matrices of a QCQP with $n$ variables, the rank and positive…
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers in the first linear strand of the minimal free resolutions of projective varieties in arbitrary characteristic. For this purpose, we first…
We formulate a novel characterization of a family of invertible maps between two-dimensional domains. Our work follows two classic results: The Rad\'o-Kneser-Choquet (RKC) theorem, which establishes the invertibility of harmonic maps into a…
Motivated by applications to perverse sheaves, we study combinatorics of two cell decompositions of the symmetric product of the complex line, refining the complex stratification by multiplicities. Contingency matrices, appearing in…
The problem of polynomial least squares fitting in the standard Lagrange basis is addressed in this work. Although the matrices involved in the corresponding overdetermined linear systems are not totally positive, rectangular totally…