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

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

We propose a First-Order System Least Squares (FOSLS) method based on deep-learning for numerically solving second-order elliptic PDEs. The method we propose is capable of dealing with either variational and non-variational problems, and…

Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…

In this paper, we prove that there exists a unique solution to the Dirichlet boundary value problem for a general class of semilinear second order elliptic partial differential equations. Our approach is probabilistic. The theory of…

A new weak Galerkin (WG) finite element method for solving the second-order elliptic problems on polygonal meshes by using polynomials of boundary continuity is introduced and analyzed. The WG method is utilizing weak functions and their…

We study the last fall degrees of {\em semi-local} polynomial systems, and the computational complexity of solving such systems for closed-point and rational-point solutions, where the systems are defined over a finite field. A semi-local…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…

Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…

We consider a few modifications of the Big prime modular $\gcd$ algorithm for polynomials in $\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors…

We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic…

We prove $L_p$ estimates of solutions to a conormal derivative problem for divergence form complex-valued higher-order elliptic systems on a half space and on a Reifenberg flat domain. The leading coefficients are assumed to be merely…

The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…

The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…

In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a…

In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…