Results 31 to 40 of about 105,284,140 (301)
Probabilistic recurrence relations revisited
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chaudhuri, S., Dubhashi, D.
openaire +4 more sources
Prisma Sains: Jurnal Pengkajian Ilmu dan Pembelajaran Matematika dan IPA IKIP Mataram, 2021 The purpose of this study is to describe how college students with visual, auditory, and kinaesthetic learning style think relationally in solving recurrence relation problems using the tower of Hanoi.
Nur Fitriyah Indraswari +1 more
doaj +1 more source
Recurrence coefficients for discrete orthonormal polynomials and the Painlevé equations [PDF]
, 2013 We investigate semi-classical generalizations of the Charlier and Meixner polynomials, which are discrete orthogonal polynomials that satisfy three-term recurrence relations.
Clarkson, Peter
core +1 more source
Some Properties of a Third Order Partial Recurrence Relation
, 2022 This paper explores a connection between third order recursive sequences and generalized continued fractions by analogy with second order recursive sequences and ordinary two-dimensional continued fractions.
Shannon, AG, Deveci, O
core +1 more source
Sequences of twice-iterated Δw-Gould–Hopper Appell polynomials
Journal of Taibah University for ScienceIn this paper, we introduce general sequence of twice-iterated [Formula: see text]-(degenerate) Gould–Hopper Appell polynomials (TI-DGHAP) via discrete [Formula: see text]-Gould–Hopper Appell convolution. We obtain some of their characteristic properties
Neslihan Biricik +2 more
doaj +1 more source
A formal operator involving Fermatian numbers [PDF]
Notes on Number Theory and Discrete MathematicsIn this note, old and new properties of Fermatian numbers _zₙ= (1-zⁿ)/(1-z) are recalled. A new formal operator is defined and some identities and extensions are discussed.
Carlos M. da Fonseca, Anthony G. Shannon
doaj +1 more source
A recurrence relation for generalised connection coefficients [PDF]
, 2023 We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example is integrals of
Iserles, Arieh, Gao, Jing
core +1 more source
Complexity of Some Duplicating Networks
IEEE Access, 2021 There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source
Two variables generalized Laguerre polynomials
Karpatsʹkì Matematičnì Publìkacìï, 2021 The objective of this paper is to introduce and study the generalized Laguerre polynomial for two variables. We prove that these polynomials are characterized by the generalized hypergeometric function.
A. Asad
doaj +1 more source