Recurrence free decomposition formulas for the Lauricella special functions

Tuhtasin Gulamjanovich Ergashev, Айнур Рыскан, N.N. Yuldashev

BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS, 2024

Full text Open access: Gold Metadata (CSL-JSON)

DOI 10.31489/2024m4/95-106

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Expansion formulas associated with the multidimensional Lauricella hypergeometric functions are wellestablished and extensively utilized. However, the recurrence relations inherit in these formulas add extra complexities to their use. A thorough analysis of the characteristics of these expansion formulas shows that they can be simplified and converted into a more convenient form. This paper presents new recurrence free decomposition formulas, which are employed to solve boundary value problems.