相关论文: On the Complexity of Diophantine Geometry in Low D…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We…

We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…

It is a generalization of Pell's equation $x^2-Dy^2=0$. Here, we show that: if our Diophantine equation has a particular integer solution and $ab$ is not a perfect square, then the equation has an infinite number of solutions; in this case…

In this paper, an original reduction algorithm for solving simultaneous multivariate polynomial equations is presented. The algorithm is exponential in complexity, but the well-known algorithms, such as the extended Euclidean algorithm and…

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

In this article, we present a geometric theoretical analysis of semidefinite feasibility problems (SDFPs). This is done by decomposing a SDFP into smaller problems, in a way that preserves most feasibility properties of the original…

Many natural optimization problems derived from $\sf NP$ admit bilevel and multilevel extensions in which decisions are made sequentially by multiple players with conflicting objectives, as in interdiction, adversarial selection, and…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

There are a number of results saying that for certain "path-following" algorithms that solve PPAD-complete problems, the solution obtained by the algorithm is PSPACE-complete to compute. We conjecture that these results are special cases of…

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…

Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

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.…