Related papers: On semidefinite representations of plane quartics

Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…

In this article we consider the action of affine group and time rescaling on planar quadratic differential systems. We construct a system of representatives of the orbits of systems with at least five invariant lines, including the line at…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

We study lifts of tropical bitangents to the tropicalization of a given complex algebraic curve together with their lifting multiplicities. Using this characterization, we show that generically all the seven bitangents of a smooth tropical…

We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

For a rational function of several variables with nonnegative imaginary part on the upper poly-half-plane, the matrix representations are obtained.

We provide a dual representation of quasiconvex maps between two lattices of random variables in terms of conditional expectations. This generalizes the dual representation of quasiconvex real valued functions and the dual representation of…

We establish an asymptotic formula for the number of integral solutions of bounded height for pairs of diagonal quartic equations in $26$ or more variables. In certain cases, pairs in $25$ variables can be handled.

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous variables is supermodular. Although supermodular minimization is, in general, difficult,…

In the article the necessary and sufficient conditions for a representation of Lipschitz function of more than two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome…

In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or 'lift' of the convex set is especially useful if the…

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 introduce the notion of filtered representations of quivers, which is related to usual quiver representations, but is a systematic generalization of conjugacy classes of $n\times n$ matrices to (block) upper triangular matrices up to…

We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…

We define basic notions in the category of conic representations of a topological group and prove elementary facts about them. We show that a conic representation determines an ordinary dynamical system of the group together with a…

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

The Somos-4 equation defines the sequences with this name. Looking at these sequences with an additional property we get a quartic polynomial in 4 variables. This polynomial defines a rational, projective surface in $\mathbb{RP}^{3}$. Here…

Quadratically constrained quadratic programs (QCQPs) are a highly expressive class of nonconvex optimization problems. While QCQPs are NP-hard in general, they admit a natural convex relaxation via the standard semidefinite program (SDP)…