相关论文: Compter (rapidement) le nombre de solutions d'\'eq…

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…

We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…

Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.

The aim of this article is to investigate the cohomology (l-adic as well as Betti) of schemes, and more generally of certain algebraic stacks, that are proper and smooth over the integers and have the property that there exists a polynomial…

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating…

Inspired by the work about solutions of a system of real polynomial equations done by Hermite, this paper introduces a Hermitian form, which encodes information about solutions of a system of complex polynomial equations with conjugate…

Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…

The classical Lefschetz fixed point theorem states that the number of fixed points, counted with multiplicity $\pm 1$, of a smooth map $f$ from a manifold $M$ to itself can be calculated as the alternating sum $\sum (-1)^k \textrm{ tr }…

We study the set of common F_q-rational zeros of systems of multivariate symmetric polynomials with coefficients in a finite field F_q. We establish certain properties on these polynomials which imply that the corresponding set of zeros…

In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…