It is well known that the size of a polynomial is controlled in the whole complex plane by the logarithmic integral of the polynomial. In the present thesis we show that the logarithmic sum, a discrete analogue of the logarithmic integral, can be used, with suitable precautions, for the same purpose. We obtain uniform estimates of polynomials having sufficiently small logarithmic sums. In these estimates, dependence of the polynomials is expressed entirely through the logarithmic sums of the polynomials.This result was originally established by Paul Koosis in 1966. The proof that we present here is, however, new. We use a suitable version of a so-called multiplier theorem. Theorems of this kind were first published by Beurling and Malliavin...
Dedicated to the memory of Professor Jun-ichi Igusa, source of inspiration. Abstract. — We propose a...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
Let f: {−1, 1}n → [−1, 1] have degree d as a multilinear polynomial. It is well-known that the total...
AbstractWe give uniform estimates in the whole complex plane of entire functions of exponential type...
AbstractWe give uniform estimates in the whole complex plane of entire functions of exponential type...
Abstract. We give uniform estimates of entire functions of exponential type less than a numerical co...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
One question that we investigate in this paper is, how can we build log-concave polynomials using sp...
One question that we investigate in this paper is, how can we build log-concave polynomials using sp...
In this paper, we provide a new bound for exponential sums in one variable. This new bound gives non...
AbstractIn this paper, we provide a new bound for exponential sums in one variable. This new bound g...
Abstract. We study inequalities connecting a product of uniform norms of polynomials with the norm o...
AbstractIn the first part of the paper, certain incomplete character sums over a finite field Fpr ar...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
In this review, we will consider two closely related problems associated with the lognormal distribu...
Dedicated to the memory of Professor Jun-ichi Igusa, source of inspiration. Abstract. — We propose a...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
Let f: {−1, 1}n → [−1, 1] have degree d as a multilinear polynomial. It is well-known that the total...
AbstractWe give uniform estimates in the whole complex plane of entire functions of exponential type...
AbstractWe give uniform estimates in the whole complex plane of entire functions of exponential type...
Abstract. We give uniform estimates of entire functions of exponential type less than a numerical co...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
One question that we investigate in this paper is, how can we build log-concave polynomials using sp...
One question that we investigate in this paper is, how can we build log-concave polynomials using sp...
In this paper, we provide a new bound for exponential sums in one variable. This new bound gives non...
AbstractIn this paper, we provide a new bound for exponential sums in one variable. This new bound g...
Abstract. We study inequalities connecting a product of uniform norms of polynomials with the norm o...
AbstractIn the first part of the paper, certain incomplete character sums over a finite field Fpr ar...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
In this review, we will consider two closely related problems associated with the lognormal distribu...
Dedicated to the memory of Professor Jun-ichi Igusa, source of inspiration. Abstract. — We propose a...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
Let f: {−1, 1}n → [−1, 1] have degree d as a multilinear polynomial. It is well-known that the total...