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

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by A.E. Pellet [Bulletin des Sciences Math\'ematiques, (2), vol 5 (1881), pp.393-395], some results of D.A.…

We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.

We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$…

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

This paper introduces the concept of generalized interlacing families of polynomials, which extends the classical interlacing polynomial method to handle polynomials of varying degrees. We establish a fundamental property for these…

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…

Many statistics of roots of random polynomials have been studied in the literature, but not much is known on the concentration aspect. In this note we present a systematic study of this question, aiming towards nearly optimal bounds to some…

We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…

A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted binary trees on three leaves, or quartets, unrooted binary…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are…