Results 51 to 60 of about 17,517,320 (360)
Generalized Trigonometric Functions [PDF]
Mathematics of Computation, 1964 is also that of all functions of the form (1 + x2)-2N-c+lQ(x) where Q is a polynomial of degree 4N 2 or lower, the conditions determining the above formula for any a and N are the same as those determining Harper's formula for (using "k" and "n" in the meaning given them in [1]) k = a + 2N -2, n = 2N.
openaire +2 more sources
Generating function for generalized function of two variables [PDF]
Proceedings of the American Mathematical Society, 1974 In this paper we obtain a generating function for a generalized function of two variables. The result is very general in character and includes as particular cases some of the results recently given by Meijer [4], Carlitz [7] and Srivastava [5].
Sharma, B. L., Abiodun, R. F. A.
openaire +1 more source
Hybrid Numbers with Fibonacci and Lucas Hybrid Number Coefficients
Universal Journal of Mathematics and Applications, 2023 In this paper, we introduce hybrid numbers with Fibonacci and Lucas hybrid number coefficients. We give the Binet formulas, generating functions, and exponential generating functions for these numbers. Then we define an associate matrix for these numbers.
Emrah Polatlı
doaj +1 more source
Concrete Generic Functionals [PDF]
, 2003 Generic design is not only pertinent to programs, but a fortiori to declarative formalisms as well, and the ensuing generalizations often benefit programming. In the considered framework, generality is obtained by (re)defining traditionally non-functional objects uniformly as functions.
openaire +1 more source
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
Avoiding maximal parabolic subgroups of S_k [PDF]
, 2000 We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions.
Mansour, Toufik, Vainshtein, Alek
core +4 more sources
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
A generating function approach to branching random walks [PDF]
, 2015 It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points.
D. Bertacchi, F. Zucca
semanticscholar +1 more source
Generating-function method for fusion rules
, 2000 This is the second of two articles devoted to an exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper focuses on fusion rules, using the machinery developed for tensor products in the companion
Berenstein A. D. +19 more
core +2 more sources
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