2020
DOI: 10.1007/s40316-020-00135-5
|View full text |Cite
|
Sign up to set email alerts
|

Linear independence of values of G-functions, II: outside the disk of convergence

Abstract: Given any non-polynomial G-function F (z) = ∞ k=0 A k z k of radius of convergence R and in the kernel a G-operator L F , we consider the G-functions FA k

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…The usual version of this criterion (see for instance [9,Theorem 4]) is the same statement, but the assumption on F is replaced by the assumption that L (n) is invertible. The latter is stronger, since it is equivalent to asking F = R q for any n. Indeed if F = R q then L (n) has rank q: for each n we may extract q linearly independent columns of L (n) , and obtain an invertible matrix to which [9,Theorem 4] applies. The point is that we shall apply Proposition 2 to the matrices [s k,i ] constructed in Proposition 1, and the subspace F is not always equal to R q (see Remark 3 in §1.4).…”
Section: Siegel's Linear Independence Criterionmentioning
confidence: 99%
See 1 more Smart Citation
“…The usual version of this criterion (see for instance [9,Theorem 4]) is the same statement, but the assumption on F is replaced by the assumption that L (n) is invertible. The latter is stronger, since it is equivalent to asking F = R q for any n. Indeed if F = R q then L (n) has rank q: for each n we may extract q linearly independent columns of L (n) , and obtain an invertible matrix to which [9,Theorem 4] applies. The point is that we shall apply Proposition 2 to the matrices [s k,i ] constructed in Proposition 1, and the subspace F is not always equal to R q (see Remark 3 in §1.4).…”
Section: Siegel's Linear Independence Criterionmentioning
confidence: 99%
“…Using Eq. (2.2) we may apply the usual version of Siegel's criterion (namely [9,Theorem 4]) to this matrix and deduce that . . .…”
Section: Siegel's Linear Independence Criterionmentioning
confidence: 99%