On generalized power-series

J. Mikusiński

Displaying similar documents to “On generalized power-series”

On partitions without small parts

J.-L. Nicolas, A. Sárközy (2000)

Journal de théorie des nombres de Bordeaux

Similarity:

Let $r (n, m)$ denote the number of partitions of $n$ into parts, each of which is at least $m$ . By applying the saddle point method to the generating series, an asymptotic estimate is given for $r (n, m)$ , which holds for $n \to \infty$ , and $1 \leq m \leq c_{1} \frac{n}{{(log n)}^{c_{2}}}$ .

Exponential asymptotics for intersection local times of stable processes and random walks

Xia Chen, Jay Rosen (2005)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

On generalized exponential functions

J. Mikusiński (1953)

Studia Mathematica

Similarity:

Dirichlet convolutions and the Silverman-Toeplitz conditions

S. Segal (1964)

Acta Arithmetica

Similarity:

Reducibility of lacunary polynomials I

Andrzej Schinzel (1969)

Acta Arithmetica

Similarity:

A theorem on bounded moments

J. Mikusiński, C. Ryll-Nardzewski (1953)

Studia Mathematica

Similarity:

A $q$ -logarithmic analogue of Euler’s sine integral

Nobushige Kurokawa, Masato Wakayama (2005)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

Iterative feature selection in least square regression estimation

Pierre Alquier (2008)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

This paper presents a new algorithm to perform regression estimation, in both the inductive and transductive setting. The estimator is defined as a linear combination of functions in a given dictionary. Coefficients of the combinations are computed sequentially using projection on some simple sets. These sets are defined as confidence regions provided by a deviation (PAC) inequality on an estimator in one-dimensional models. We prove that every projection the algorithm actually improves...

The lattice point problem of many-dimensional hyperboloids II

B. Srinivasan (1963)

Acta Arithmetica

Similarity: