2018
DOI: 10.1016/j.jmaa.2018.03.034
|View full text |Cite
|
Sign up to set email alerts
|

Three-term relations for F23(1)

Abstract: For the hypergeometric function of unit argument 3 F 2 (1) we prove the existence and uniqueness of three-term relations with arbitrary integer shifts. We show that not only the original 3 F 2 (1) function but also other five functions related to it satisfy one and the same three-term relation. This fact is referred to as simultaneousness. The uniqueness and simultaneousness provide three-term relations with a group symmetry of order 72. * MSC (2010): 33C20.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
16
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(17 citation statements)
references
References 13 publications
1
16
0
Order By: Relevance
“…(31)] (see (D.11)) among terminating 3 F 2 (1) on the right, and the same 3 F 2 (1) that appears in (B.3) on the left. However, following the same logic as outlined above, by setting ] to find an interesting contiguity relation (also see [23]):…”
Section: Acknowledgementsmentioning
confidence: 99%
“…(31)] (see (D.11)) among terminating 3 F 2 (1) on the right, and the same 3 F 2 (1) that appears in (B.3) on the left. However, following the same logic as outlined above, by setting ] to find an interesting contiguity relation (also see [23]):…”
Section: Acknowledgementsmentioning
confidence: 99%
“…(10) An identity of the form (10) is called a contiguous relation for 3 f 2 (1). An algorithm to calculate u(a) and v(a) explicitly is given in [9,Recipe 5.4]. According to it, one calculates the connection matrix A(a; k) as in [9, formula (30)] and define r(a; k) ∈ Q(a) to be its (1,2)-entry as in [9, formula (33)].…”
Section: Contiguous Relationsmentioning
confidence: 99%
“…as in [9,Proposition 5.3], where according to [9, formula (32)] one has det A(a; k) = (−1) k 0 +k 1 +k 2 (s(a) − 1; s(k)) 2 i=0 (a i ; k i )…”
Section: Contiguous Relationsmentioning
confidence: 99%
See 2 more Smart Citations