Displaying 281 – 300 of 388

Showing per page

On the power-series expansion of a rational function

D. V. Lee (1992)

Acta Arithmetica

Introduction. The problem of determining the formula for P S ( n ) , the number of partitions of an integer into elements of a finite set S, that is, the number of solutions in non-negative integers, h s , . . . , h s k , of the equation hs₁ s₁ + ... + hsk sk = n, was solved in the nineteenth century (see Sylvester [4] and Glaisher [3] for detailed accounts). The solution is the coefficient of x i n [(1-xs₁)... (1-xsk)]-1, expressions for which they derived. Wright [5] indicated a simpler method by which to find part of the solution...

On the proof of Erdős' inequality

Lai-Yi Zhu, Da-Peng Zhou (2017)

Czechoslovak Mathematical Journal

Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequality p ' [ - 1 , 1 ] 1 2 p [ - 1 , 1 ] for a constrained polynomial p of degree at most n , initially claimed by P. Erdős, which is different from the one in the paper of T. Erdélyi (2015). Whereafter, we give the situations on which the equality holds. On the basis of this inequality, we study the monotone polynomial which has only real zeros all but one outside of the interval ( - 1 , 1 ) and establish a new asymptotically sharp inequality.

On the quantitative Fatou property

A. Kamaly, A. M. Stokolos (2002)

Colloquium Mathematicae

The result of this article together with [1] and [4] gives a full quantitative description of a Fatou type property for functions from Hardy classes in the upper half plane.

On the randomized complexity of Banach space valued integration

Stefan Heinrich, Aicke Hinrichs (2014)

Studia Mathematica

We study the complexity of Banach space valued integration in the randomized setting. We are concerned with r times continuously differentiable functions on the d-dimensional unit cube Q, with values in a Banach space X, and investigate the relation of the optimal convergence rate to the geometry of X. It turns out that the nth minimal errors are bounded by c n - r / d - 1 + 1 / p if and only if X is of equal norm type p.

On the rate of approximation in the random sum CLT for dependent variables

Adhir Kumar Basu (1987)

Aplikace matematiky

Capital " O " and lower-case " o " approximations of the expected value of a class of smooth functions ( f C r ( R ) ) of the normalized random partial sums of dependent random variables by the expectation of the corresponding functions of Gaussian random variables are established. The same types of approximation are also obtained for dependent random vectors. This generalizes and improves previous results of the author (1980) and Rychlik and Szynal (1979).

Currently displaying 281 – 300 of 388