Results 241 to 250 of about 25,376 (299)
Some of the next articles are maybe not open access.
Canadian Journal of Mathematics, 1956
1. Introduction. Let a1 a2, …, am be a set of real non-negative numbers and let1.1 P(x) = a1x + a2x2 + … + amxm (am ≠ 0).Many combinatorial problems can be reduced to the study of numbers Bn generated by1.2.Some problems of this type were treated by Touchard (7), Jacobsthal (3), Chowla, Herstein, Moore and Scott (1; 2), and the present authors (4).
Moser, Leo, Wyman, Max
openaire +1 more source
1. Introduction. Let a1 a2, …, am be a set of real non-negative numbers and let1.1 P(x) = a1x + a2x2 + … + amxm (am ≠ 0).Many combinatorial problems can be reduced to the study of numbers Bn generated by1.2.Some problems of this type were treated by Touchard (7), Jacobsthal (3), Chowla, Herstein, Moore and Scott (1; 2), and the present authors (4).
Moser, Leo, Wyman, Max
openaire +1 more source
Journal of Mathematical Analysis and Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Lee, C.A. Morales, H. Villavicencio
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Lee, C.A. Morales, H. Villavicencio
openaire +2 more sources
Canadian Journal of Mathematics, 1957
In a previous paper (1) the authors considered the problem of finding an asymptotic formula for numbers or functions Bn,m whose generating function is of the form(1.1),where Pm(x) is a polynomial of degree m in x given by(1.2), am≠0.The above-mentioned paper contained the ...
Moser, Leo, Wyman, Max
openaire +1 more source
In a previous paper (1) the authors considered the problem of finding an asymptotic formula for numbers or functions Bn,m whose generating function is of the form(1.1),where Pm(x) is a polynomial of degree m in x given by(1.2), am≠0.The above-mentioned paper contained the ...
Moser, Leo, Wyman, Max
openaire +1 more source
Applicable Algebra in Engineering, Communication and Computing, 1998
The author gives an expansion algorithm for germs of exp-log functions at infinity, which is correct modulo Schanuel's conjecture. He also shows how the algorithm can be made generic.
openaire +2 more sources
The author gives an expansion algorithm for germs of exp-log functions at infinity, which is correct modulo Schanuel's conjecture. He also shows how the algorithm can be made generic.
openaire +2 more sources
Perturbation Expansion: Is it Asymptotic?
Modern Physics Letters A, 1997It is pointed out that, for any model with bound state, contrary to the case of nonrelativistic quantum mechanics, perturbation expansion based on Feynman rules in relativistic quantum field theory is not asymptotic of physical amplitude in which the effects of bound state are considered.
openaire +2 more sources
Asymptotic expansions by Γ-convergence
Continuum Mechanics and Thermodynamics, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braides A., Truskinovsky L.
openaire +2 more sources
A Distributional Theory of Asymptotic Expansions
Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1990Abstract We present various techniques for the asymptotic expansions of generalized functions. We show that the moment asymptotic expansions hold for a very wide variety of kernels such as generalized functions of rapid decay and rapid oscillations.
R Estrada, R. P Kanwal
openaire +1 more source
On Multiple Asymptotic Expansions
SIAM Journal on Mathematical Analysis, 1972In previous papers asymptotic meaning has been attached to the formal double sums $\sum _{m = 0}^\infty \sum _{n = 0}^\infty a_{mn} x^{ - n} e^{ - \lambda mx} (\lambda > 0)$ as $x \to 0$ in a sector of the right half-plane. Formal applications of these sums to elastic scattering and to singular perturbation problems have also been given.
openaire +1 more source