Results 11 to 20 of about 401,067 (279)

Recurrence Relations for Moments of Dual Generalized Order Statistics from Weibull Gamma Distribution and Its Characterizations [PDF]

open access: yes, 2014
In this paper, we establish explicit forms and new recurrence relations satisfied by the single and product moments of dual generalized order statistics from Weibull gamma distribution (WGD).
Abdel-Aty, Y.   +3 more
core   +2 more sources

Recurrence Relations for Orthogonal Polynomials on Triangular Domains

open access: yesMathematics, 2016
In Farouki et al, 2003, Legendre-weighted orthogonal polynomials P n , r ( u , v , w ) , r = 0 , 1 , … , n , n ≥ 0 on the triangular domain T = { ( u , v , w ) : u , v , w ≥ 0 , u + v + w = 1 } are constructed, where u , v , w
Abedallah Rababah
doaj   +1 more source

Binomial Sum Relations Involving Fibonacci and Lucas Numbers

open access: yesAppliedMath, 2023
In this paper, we provide a first systematic treatment of binomial sum relations involving (generalized) Fibonacci and Lucas numbers. The paper introduces various classes of relations involving (generalized) Fibonacci and Lucas numbers and different ...
Kunle Adegoke   +2 more
doaj   +1 more source

Recurrence relations connecting mock theta functions and restricted partition functions [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics, 2023
In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler's pentagonal number theorem, and Ramanujan's theta ...
M. Rana, H. Kaur, K. Garg
doaj   +1 more source

Relational Thinking of College Students in Solving Recurrence Relation Problems Using Hanoi Tower Props

open access: yesPrisma 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

Some Relations on the rRs(P,Q,z) Matrix Function

open access: yesAxioms, 2023
In this paper, we derive some classical and fractional properties of the rRs matrix function by using the Hilfer fractional operator. The theory of special matrix functions is the theory of those matrices that correspond to special matrix functions such ...
Ayman Shehata   +2 more
doaj   +1 more source

Complexity of Some Duplicating Networks

open access: yesIEEE 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

Recurrence Relations for Wronskian Hermite Polynomials

open access: yes, 2018
We consider polynomials that are defined as Wronskians of certain sets of Hermite polynomials. Our main result is a recurrence relation for these polynomials in terms of those of one or two degrees smaller, which generalizes the well-known three term ...
Bonneux, Niels, Stevens, Marco
core   +1 more source

Sequences of twice-iterated Δw-Gould–Hopper Appell polynomials

open access: yesJournal of Taibah University for Science
In 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]

open access: yesNotes on Number Theory and Discrete Mathematics
In 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

Home - About - Disclaimer - Privacy