相关论文: The Large Sieve Inequality for Integer Polynomial …

We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…

We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators. We…

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

In this article, we obtain an explicit version of Heath-Brown's large sieve inequality for quadratic characters and discuss its applications to $L$-functions and quadratic fields.

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…

We represent in this preprint the exact estimate for covariation berween two random variables (r.v.), which are measurable relative the corresponding sigma-algebras through anyhow mixing coefficients. We associate a solution of this problem…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

For each positive integer $d$, we prove a uniform $l^2$-decoupling inequality for the collection of all polynomials phases of degree at most $d$. Our result is intimately related to \cite{MR4078083}, but we use a different partition that is…

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.