Related papers: Computational problems for vector-valued quadratic…

Let V be a plane smooth cubic curve over a finitely generated field k. The Mordell-Weil theorem for V states that there is a finite subset P \subset V(k) such that the whole V(k) can be obtained from P by drawing secants and tangents…

Let $\mathbb{F}$ be a field of characteristic different from $2$ and $3$, and let $V$ be a vector space of dimension $2$ over $\mathbb{F}$. The generic classification of homogeneous quadratic maps $f\colon V\to V$ under the action of the…

We determine a precise necessary and sufficient condition for completeness of the Hamiltonian vector field associated to a homogeneous cubic polynomial on a symplectic plane.

We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

We study quadratic optimization with indicator variables and an M-matrix, i.e., a PSD matrix with non-positive off-diagonal entries, which arises directly in image segmentation and portfolio optimization with transaction costs, as well as a…

Optimal decentralized controller design is notoriously difficult, but recent research has identified large subclasses of such problems that may be convexified and thus are amenable to solution via efficient numerical methods. One recently…

Let $V$ be a vector space with countable dimension over a field, and let $u$ be an endomorphism of it which is locally finite, i.e. $(u^k(x))_{k \geq 0}$ is linearly dependent for all $x$ in $V$. We give several necessary and sufficient…

We investigate the manifold $\cal{M}$ of (real) quadratic forms in n > 1 variables having a multiple eigenvalue. In addition to known facts, we prove that 1) $\cal{M}$ is irreducible, 2) in the case of n = 3, scalar matrices and only them…

We prove a criterion for continuity of bilinear maps on countable direct sums of topological vector spaces. As a first application, we get a new proof for the fact (due to Hirai et al. 2001) that the map taking a pair of test functions on…

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

For a symmetric system, we want to study the problem of crossing an hypersurface in the neighborhood of a given point, when we suppose that all of the available vector fields are tangent to the hypersurface at the point. Classically one…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in combinatorial optimization, circuit design, and other fields. The positive…

We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a…

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…

In this paper, we will interest in finding the number of zeros of the quadratic forms over finite fields. We will apply the tool for finding the number of rational points of supersingular curves in [6]. We will give some more tools for…

We propose a sufficient condition for invertibility of a polynomial mapping function defined on a cube or simplex. This condition is applicable to finite element analysis using curved meshes. The sufficient condition is based on an analysis…

It is well-known that asymptotic stability (AS) of homogeneous polynomial vector fields of degree one (i.e., linear systems) can be decided in polynomial time e.g. by searching for a quadratic Lyapunov function. Since homogeneous vector…