Related papers: A Collapsible Polynomial Hierarchy for Promise Pro…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time…
A class of generalized complex polynomials of Hermite type, suggested by a special magnetic Schrodinger operator, is introduced and some related basic properties are discussed.
Hamiltonian formulation of N=3 systems is considered in general. The Jacobi equation is solved in three classes. Compatible Poisson structures in these classes are determined and explicitly given. The corresponding bi-Hamiltonian systems…
We study the quantum-classical polynomial hierarchy, QCPH, which is the class of languages solvable by a constant number of alternating classical quantifiers followed by a quantum verifier. Our main result is that QCPH is infinite relative…
We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
Analytic-bilinear approach for construction and study of integrable hierarchies, in particular, the KP hierarchy is discussed. It is based on the generalized Hirota identity. This approach allows to represent generalized hierarchies of…
We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…
A relationship between two old mathematical subjects is observed: the theory of hypergeometric functions and the separability in classical mechanics. Separable potential perturbations of the integrable billiard systems and the Jacobi…
We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…
We establish the global existence of a class of strongly coupled parabolic systems. The necessary apriori estimates will be obtained via our new approach to the regularity theory of parabolic scalar equations with integrable data and new…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…