相关论文: On the first fall degree of summation polynomials

We generalize the lemmas of Thomas Kretschmer to arbitrary number fields, and apply them with a 2-descent argument to obtain bounds for families of elliptic curves over certain imaginary quadratic number fields with class number 1. One such…

A new weak Galerkin (WG) method is introduced and analyzed for the second order elliptic equation formulated as a system of two first order linear equations. This method, called WG-MFEM, is designed by using discontinuous piecewise…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

We apply the discontinuous Galerkin finite element method with a degree $p$ polynomial basis to the linear advection equation and derive a PDE which the numerical solution solves exactly. We use a Fourier approach to derive polynomial…

The SEA algorithm for computing the cardinality of elliptic curves over finite fields in many characteristic uses modular polynomials. These polynomials come into different flavors, and methods to compute them flourished. Once equipped with…

We prove some improvements of the classical Weil bound for one variable additive and multiplicative character sums associated to a polynomial over a finite field $k=\Fq$ for two classes of polynomials which are invariant under a large…

In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…

An algorithm and associated strategy for solving polynomial systems within the optimization framework is presented. The algorithm and strategy are named, respectively, the penetrating gradient algorithm and the deepest descent strategy. The…

We augment the method of Wooley (2015) by some new ideas and in a series of results, improve his metric bounds on the Weyl sums and the discrepancy of fractional parts of real polynomials with partially prescribed coefficients. We also…

A first-order elliptic-hyperbolic system in extended projective space is shown to possess strong solutions to a natural class of Guderley-Morawetz-Keldysh problems on a typical domain.

Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…

We introduce an algebra model to study higher order sum rules for orthogonal polynomials on the unit circle. We build the relation between the algebra model and sum rules, and prove an equivalent expression on the algebra side for the sum…

Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

This paper deals with the polynomial linear system solving with errors (PLSwE) problem. Specifically, we focus on the evaluation-interpolation technique for solving polynomial linear systems and we assume that errors can occur in the…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Starting from the classical division polynomials we construct homogeneous polynomials $\alpha_n$, $\beta_n$, $\gamma_n$ such that for $P = (x:y:z)$ on an elliptic curve in Weierstrass form over an arbitrary ring we have $nP =…

We introduce a conceptual framework for numerically solving linear elliptic, parabolic, and hyperbolic PDEs on bounded, polytopal domains in euclidean spaces by deep neural networks. The PDEs are recast as minimization of a least-squares…

This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this objective led us to revisit the interplay between error bounds…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…