相关论文: Computational problems for vector-valued quadratic…

We study parabolic quasi-variational inequalities (QVIs) of obstacle type. Under appropriate assumptions on the obstacle mapping, we prove the existence of solutions of such QVIs by two methods: one by time discretisation through elliptic…

We consider a non-polynomial cubic spline to develop the classes of methods for the numerical solution of singularly perturbed two-point boundary value problems. The proposed methods are second and fourth order accurate and applicable to…

We link the study of positive quantum maps, block positive operators, and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic…

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph $G = (V, E)$. Given an augmentation $\widehat{G} = (V, E \cup F)$ of $G$ and given costs $c \in…

We give a sufficient condition for the existence of a quadratic exponential vector with test function in L2(Rd) ? L?(Rd). We prove the linear independence and totality, in the quadratic Fock space, of these vectors. Using a technique…

Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to add at most $k$ edges to $G$ to obtain a trivially perfect…

For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…

We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…

This article is a sequel of [4], where we introduced quadratic forms on a module~ $V$ over a supertropical semiring $R$ and analysed the set of bilinear companions of a quadratic form $q: V \to R$ in case that the module $V$ is free, with…

Quadratic Unconstrained Binary Optimization models are useful for solving a diverse range of optimization problems. Constraints can be added by incorporating quadratic penalty terms into the objective, often with the introduction of slack…

A polynomial map $F=(P,Q)\in \Z [x,y]^2$ with Jacobian $JF:=P_xQ_y-P_yQ_x\equiv 1$ has a polynomial inverse of integer coefficients if the complex plane curve P=0 has infinitely many integer points.

For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…

We investigate the integrability of polynomial vector fields through the lens of duality in parameter spaces. We examine formal power series solutions annihilated by differential operators and explore the properties of the integrability…

We begin a systematic study of positivity and moment problems in an equivariant setting. Given a reductive group $G$ over $\R$ acting on an affine $\R$-variety $V$, we consider the induced dual action on the coordinate ring $\R[V]$ and on…

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials…