相关论文: Compter (rapidement) le nombre de solutions d'\'eq…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…
We present and analyze a discontinuous Galerkin method for the numerical solution of a class of second-order linear mixed-type partial differential equations, i.e. equations that change their nature from elliptic to hyperbolic through the…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
We prove a general inequality for estimating the number of points of arbitrary complete intersections over a finite field. This extends a result of Deligne for nonsingular complete intersections. For normal complete intersections, this…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer…
In this paper, we introduce a new class of confluent hypergeometric functions of many variables, study their properties, and determine a system of partial differential equations that this function satisfies. It turns out that all the…
We study the multiplicities of pure motives modulo numerical equivalence, which are defined as scalars comparing the tannakian trace with the ring-theoretic trace. Our general set-up is that of a rigid semi-simple tensor category such that…
We compute the number of F_q-points on M_{4,n}, for n less than or equal to 3, and show that it is a polynomial in q, using a sieve based on Hasse-Weil zeta functions. As an application, we prove that the rational singular cohomology groups…
The reduced Lefschetz number, that is, the Lefschetz number minus 1, is proved to be the unique integer-valued function L on selfmaps of compact polyhedra which is constant on homotopy classes such that (1) L(fg) = L(gf), for f:X -->Y and…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
We give a short proof of an inequality, conjectured by Tsfasman and proved by Serre, for the maximum number of points on hypersurfaces over finite fields. Further, we consider a conjectural extension, due to Tsfasman and Boguslavsky, of…
We explain how to obtain the set of solutions of a multivariate polynomial equation modulo a power of a prime number. These solutions are determined by a tree, called the trunk, which makes it possible to reconstruct all solutions. We apply…
We consider a nonlocal functional equation that is a generalization of the mathematical model used in behavioral sciences. The equation is built upon an operator that introduces a convex combination and a nonlinear mixing of the function…
Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…
Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…
A standard observation in algebraic geometry and number theory is that a ramified cover of an algebraic variety $\widetilde{X}\rightarrow X$ over a finite field $F_q$ furnishes the rational points $x\in X(F_q)$ with additional arithmetic…