Results 21 to 30 of about 764,748 (296)
Some identities of bivariate Pell and bivariate Pell-Lucas polynomials
Journal of Amasya University the Institute of Sciences and Technology, 2023 In this paper, we obtain some identities for the bivariate Pell polynomials and bivariate Pell-Lucas polynomials. We establish some sums and connection formulas involving them.
Yashwant Panwar
doaj +1 more source
Generating Functions for Bessel Functions [PDF]
Canadian Journal of Mathematics, 1959 On replacing the parameter n in Bessel's differential equation1.1by the operator y(∂/∂y), the partial differential equation Lu = 0 is constructed, where1.2This operator annuls u(x, y) = v(x)yn if, and only if, v(x) satisfies (1.1) and hence is a cylindrical function of order n.
openaire +2 more sources
New Bilateral Type Generating Function Associated with I-Function
Abstract and Applied Analysis, 2014 We aim at establishing a new bilateral type generating function associated with the I-function and a Mellin-Barnes type of contour integral. The results derived here are of general character and can yield a number of (known and new) results in the theory
Praveen Agarwal +2 more
doaj +1 more source
Highly excited strings I: Generating function
Nuclear Physics B, 2017 This is the first of a series of detailed papers on string amplitudes with highly excited strings (HES). In the present paper we construct a generating function for string amplitudes with generic HES vertex operators using a fixed-loop momentum formalism.
Dimitri P. Skliros +2 more
doaj +1 more source
General Grouping Functions [PDF]
, 2020 Some aggregation functions that are not necessarily associative, namely overlap and grouping functions, have called the attention of many researchers in the recent past. This is probably due to the fact that they are a richer class of operators whenever one compares with other classes of aggregation functions, such as t-norms and t-conorms ...
Helida Santos +8 more
openaire +3 more sources
On the combinatorics of sparsification
Algorithms for Molecular Biology, 2012 Background We study the sparsification of dynamic programming based on folding algorithms of RNA structures. Sparsification is a method that improves significantly the computation of minimum free energy (mfe) RNA structures.
Huang Fenix WD, Reidys Christian M
doaj +1 more source
Singularity analysis via the iterated kernel method [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We provide exact and asymptotic counting formulas for five singular lattice path models in the quarter plane. Furthermore, we prove that these models have a non D-finite generating function.
Stephen Melczer, Marni Mishna
doaj +1 more source
A new method for computing asymptotics of diagonal coefficients of multivariate generating functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Let $\sum_{\mathbf{n} \in \mathbb{N}^d} F_{\mathbf{n}} \mathbf{x}^{\mathbf{n}}$ be a multivariate generating function that converges in a neighborhood of the origin of $\mathbb{C}^d$. We present a new, multivariate method for computing the asymptotics of
Alexander Raichev, Mark C. Wilson
doaj +1 more source
A Short Note on Integral Transformations and Conversion Formulas for Sequence Generating Functions
Axioms, 2019 The purpose of this note is to provide an expository introduction to some more curious integral formulas and transformations involving generating functions.
Maxie D. Schmidt
doaj +1 more source
A class of orthogonal polynomials of a new type
International Journal of Mathematics and Mathematical Sciences, 1983 The purpose of this paper is to study a class of polynomials Fnm(x,λ,ν) associated with a class of m differential equations, where λ is fixed, n is a variable parameter, m is fixed positive integer and ν is a non-negative integer
M. Dutta, Kanchan Prabha Manocha
doaj +1 more source