Related papers: Non reality and non connectivity of complex polyno…
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.
We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…
NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
This article finds the answer to the question: for any problem from which a non-deterministic algorithm can be derived which verifies whether an answer is correct or not in polynomial time (complexity class NP), is it possible to create an…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
We show that there exist closed manifolds with arbitrarily small transcendental simplicial volumes. Moreover, we exhibit an explicit uncountable family of (transcendental) real numbers that are not realised as the simplicial volume of a…
Let $p$ be a real polynomial in two variables. We say that a polynomial $q$ is a real Jacobian mate of $p$ if the Jacobian determinant of the mapping $(p,q):\mathbb{R}^2\to\mathbb{R}^2$ is everywhere positive. We present a class of…
First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
We construct two computable topologically conjugate functions for which no conjugacy is computable, or even hyperarithmetic, resolving an open question of Kennedy and Stockman.
We say that a list of complex numbers is "realisable" if it is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (NIEP) is the problem of characterising all realisable lists. Although the NIEP…
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…
A number of results are proved concerning non-real zeros of derivatives of real meromorphic functions. In particular, the paper supersedes the previous arXiv submission "Non-real zeros of linear differential polynomials in real meromorphic…
We prove two inequalities for the complex orientations of a separating (Type I) non-singular real algebraic curve in $RP^2$ of any odd degree. We also construct a separating non-singular pseudoholomorphic curve in $RP^2$ of any degree…
Understanding, finding, or even deciding on the existence of real solutions to a system of equations is a very difficult problem with many applications. While it is hopeless to expect much in general, we know a surprising amount about these…