相关论文: Computational problems for vector-valued quadratic…
We present some advances, both from a theoretical and from a computational point of view, on a quadratic vector equation (QVE) arising in Markovian Binary Trees. Concerning the theoretical advances, some irreducibility assumptions are…
In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
Let $B$ be a bilinear form on pairs of points in the complex plane, of the form $B(p,q) = p^TMq$, for an invertible $2\times2$ complex matrix $M$. We prove that any finite set $S$ contained in an irreducible algebraic curve $C$ of degree…
In this paper, we consider the following two algebraic hypersurfaces $$S^1\times S^2=\{(x_1,x_2,x_3,x_4)\in \mathbb{R}^4:(x_1^2+x_2^2-a^2)^2 + x_3^2 + x_4^2 -1=0;~ a>1\}$$ and $$S^2\times S^1=\{(x_1,x_2,x_3,x_4)\in…
We construct a polynomial planar vector field of degree two with one invariant algebraic curves of large degree. We exhibit an explicit quadratic vector fields which invariant curves of degree nine, twelve, fifteen and eighteen degree.
This paper proves that non-convex quadratically constrained quadratic programs can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a certain technical condition. When this condition is…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
A $q$-bic form is a pairing $V \times V \to \mathbf{k}$ that is linear in the second variable and $q$-power Frobenius linear in the first; here, $V$ is a vector space over a field $\mathbf{k}$ containing the finite field on $q^2$ elements.…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
Birational Yang-Baxter maps (`set-theoretical solutions of the Yang-Baxter equation') are considered. A birational map $(x,y)\mapsto(u,v)$ is called quadrirational, if its graph is also a graph of a birational map $(x,v)\mapsto(u,y)$. We…
We show that deciding simulation equivalence and simulation preorder have quadratic lower bounds assuming that the Strong Exponential Time Hypothesis holds. This is in line with the best know quadratic upper bounds of simulation…
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known…
The spaces of Sp(n)-, Sp(n)U(1)- and Sp(n)Sp(1)- invariant, translation invariant, continuous convex valuations on the quaternionic vector space H^n are studied. Combinatorial dimension formulas involving Young diagrams and Schur…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
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…
Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over…
For a binary quadratic form $Q$, we consider the action of $\mathrm{SO}_Q$ on a two-dimensional vector space. This representation yields perhaps the simplest nontrivial example of a prehomogeneous vector space that is not irreducible, and…
Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…