Related papers: Efficiently Detecting Torsion Points and Subtori
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
We show that, for many choices of finite tuples of generators $X = (x_1, \dots , x_d)$ of a tracial von Neumann algebra $(M, \tau)$ satisfying certain decomposition properties (non-primeness, possessing a Cartan subalgebra, or property…
Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
We conjecture that the roots of a degree-n univariate complex polynomial are located in a union of n-1 annuli, each of which is centered at a root of the derivative and whose radii depend on higher derivatives. We prove the conjecture for…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
We present a structure theorem for the multiple non-cyclotomic irreducible factors appearing in the family of all univariate polynomials with a given set of coefficients and varying exponents. Roughly speaking, this result shows that the…
We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…
We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a rich family of…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
The polynomial Szemer\'{e}di theorem implies that, for any $\delta \in (0,1)$, any family $\{P_1,\ldots, P_m\} \subset \mathbb{Z}[y]$ of nonconstant polynomials with constant term zero, and any sufficiently large $N$, every subset of…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We specify a small set, consisting of $O(d(\log\log d)^2)$ points, that intersects the basins under Newton's method of \emph{all} roots of \emph{all} (suitably normalized) complex polynomials of fixed degrees $d$, with arbitrarily high…
The Shub-Smale Tau Conjecture is a hitherto unproven statement (on integer roots of polynomials) whose truth implies both a variant of $P\neq NP$ (for the BSS model over C) and the hardness of the permanent. We give alternative conjectures,…