相关论文: Solving algebraic equations in roots of unity

We present sharp bounds on the number of maximal torsion cosets in a subvariety of the complex algebraic torus $\mathbb{G}_{\textrm{m}}^n$. Our first main result gives a bound in terms of the degree of the defining polynomials. A second…

We obtain bounds on the number of maximal torsion cosets for algebraic subvarieties of n-tori, defined over the rationals, using model theoretic methods.

We estimate the growth rate of the function which counts the number of torsion points of order at most $T$ on an algebraic subvariety of the algebraic torus $\mathbb G_m^n$ over some algebraically closed field. We prove a general upper…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

We give a uniform bound on the degree of the maximal torsion cosets for subvarieties of an abelian variety. The proof combines algebraic interpolation and a theorem of Serre on homotheties in the Galois representation associated to the…

We give a simplified proof and an improvement of a recent theorem by A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions to systems of linear equations with polynomial or rational coefficients.

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Investigating a conjecture of Zannier, we study irreducible subvarieties of abelian schemes that dominate the base and contain a Zariski dense set of torsion points that lie on pairwise isogenous fibers. If everything is defined over the…

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

Work of Laurent and Sarnak, following a conjecture of Lang, shows that the number of torsion points of order n on an algebraic subset of an affine complex torus is polynomial periodic. In this paper, we find bounds on the degree and period…

A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…

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…

We prove that large classes of algebras in the framework of root of unity quantum cluster algebras have the structures of maximal orders in central simple algebras and Cayley-Hamilton algebras in the sense of Procesi. We show that every…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…