Related papers: Solving algebraic equations in roots of unity

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

For any fixed field $K\!\in\!\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5, \ldots\}$, we prove that all polynomials $f\!\in\!\mathbb{Z}[x]$ with exactly $3$ (resp. $2$) monomial terms, degree $d$, and all coefficients having absolute value at…

We determine upper bounds on the number of rational points of an affine or projective algebraic set defined over an extension of a finite field by a system of polynomial equations, including the case where the algebraic set is not defined…

We show that there exists a family of instances of the lot-sizing problem, such that any branch-and-bound tree that solves them requires an exponential number of nodes, even in the case when the branchings are performed on general split…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…

In 1996, Merel showed there exists a function $B\colon \mathbb{Z}^+\rightarrow \mathbb{Z}^+$ such that for any elliptic curve $E/F$ defined over a number field of degree $d$, one has the torsion group bound $\# E(F)[\textrm{tors}]\leq…

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…

We consider integrable vertex models whose Boltzmann weights (R-matrices) are trigonometric solutions to the graded Yang-Baxter equation. As is well known the latter can be generically constructed from quantum affine superalgebras…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

We study the problem of approximating the largest root of a real-rooted polynomial of degree $n$ using its top $k$ coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in $k$ that…

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…