Related papers: On Diophantine equations over $\mathbb Z[i]$ with …
The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
Except for a limited number of cases, a complete classification of the Diophantine sets of polynomial rings and fields of rational functions seems out of reach at present. We contribute to this problem by proving that several natural sets…
Artin solved Hilbert's $17^{th}$ problem by showing that every positive semidefinite polynomial can be realized as a sum of squares of rational functions. Pfister gave a bound on the number of squares of rational functions: if $p$ is a…
Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…
In this note is given an algebraic solution to the problem 1997-6 proposed by D. A. Panov in the list of Arnold's problems \cite{Arnld2b}. In particular, it is shown that there does not exist a real polynomial function $f$ on the real…
We address the decision problem for sentences involving univariate functions constructed from a fixed Pfaffian function of order $1$. We present a new symbolic procedure solving this problem with a computable complexity based on the…
A novel development is given of the theory of Gaussian quadrature, not relying on the theory of orthogonal polynomials. A method is given for computing the nodes and weights that is manifestly independent of choice of basis in the space of…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…
We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].
${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…
We show that determining Kapranov rank of tropical matrices is not only NP-hard over any infinite field but also if solving Diophantine equations over the rational numbers is undecidable, then determining Kapranov rank over the rational…
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the…
We construct a faithfully flat algebra over the infinite polynomial ring on an algebraically closed field that is not descendable.