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

We formulate and prove a large sieve inequality for quadratic characters over a number field. To do this, we introduce the notion of an n-th order Hecke family. We develop the basic theory of these Hecke families, including versions of the…

A general one-loop scattering amplitude may be expanded in terms of master integrals. The coefficients of the master integrals can be obtained from tree-level input in a two-step process. First, use known formulas to write the coefficients…

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal.

In this work the Isoperimetric Inequality for integral varifolds is used to obtain sharp estimates for the size of the set where the density quotient is small and to generalise Calder\'on's and Zygmund's theory of first order…

We establish a result on the large sieve with square moduli. These bounds impro ve recent results by S. Baier(math.NT/0512228) and L. Zhao(math.NT/0508125).

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We consider the large sieve inequality for sparse sequences of moduli and give a general result depending on the additive energy (both symmetric and asymmetric) of the sequence of moduli. For example, in the case of monomials $f(X) = X^k$…

Let $p(z)$ be a monic polynomial of degree $n$, with complex coefficients, and let $q(z)$ be its monic factor. We prove an asymptotically sharp inequality of the form $\|q\|_{E} \le C^n \|p\|_E$, where $\|\cdot\|_E$ denotes the sup norm on…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some…

The paper gives a full description of the growth of the gradient of a polynomial in two complex variables at infinity near any fiber of the polynomial

We adopt A. J. Irving's sieve method to study the almost-prime values produced by products of irreducible polynomials evaluated at prime arguments. This generalizes the previous results of Irving and Kao, who separately examined the…

An estimation method is presented for polynomial phase signals, i.e., those adopting the form of a complex exponential whose phase is polynomial in its indices. Transcending the scope of existing techniques, the proposed estimator can…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

In this paper we prove some exponential inequalities involving the sinc function. We analyze and prove inequalities with constant exponents as well as inequalities with certain polynomial exponents. Also, we establish intervals in which…

We prove several inequalities estimating the distance between volumes of two bodies in terms of the maximal or minimal difference between areas of sections or projections of these bodies. We also provide extensions in which volume is…

For any line bundle written as a subtraction of two ample line bundles, Siu's inequality gives a criterion on its bigness. We generalize this inequality to a relative case. The arithmetic meaning behind the inequality leads to its…

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…