2017
DOI: 10.1007/s00209-017-1906-z
|View full text |Cite
|
Sign up to set email alerts
|

On reducible monodromy representations of some generalized Lamé equation

Abstract: In this note, we compute the explicit formula of the monodromy data for a generalized Lamé equation when its monodromy is reducible but not completely reducible. We also solve the corresponding Riemman-Hilbert problem.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…This f C (τ) appears in the expression of solutions of certain Painlevé VI equation (cf. [3,5]). The following result proves the existence and uniqueness of τ(C) as zeros of f C (τ).…”
Section: Existence and Uniqueness Of τ(C)mentioning
confidence: 99%
“…This f C (τ) appears in the expression of solutions of certain Painlevé VI equation (cf. [3,5]). The following result proves the existence and uniqueness of τ(C) as zeros of f C (τ).…”
Section: Existence and Uniqueness Of τ(C)mentioning
confidence: 99%
“…Without knowing the root structure of Q (A; p, τ), the proof of the assertion (2) is to apply the connection between GLE (4.4) and Painlevé VI equation. Since the proof of Theorem 4.A is long and has nothing related to Theorem 1.2, we refer the proof to [5].…”
Section: From the Viewpoint Of The Monodromy Datamentioning
confidence: 99%
“…Without knowing the root structure of Q(A; p, τ), the proof of the assertion (2) is to apply the connection between GLE (4.4) and Painlevé VI equation. Since the proof of Theorem 4.A is long and has nothing related to Theorem 1.2, we refer the proof to[5].How to apply Theorem 4.A to obtain Theorem 1.2? For k ∈ {1, 2, 3}, we denote C k to be the unique solution of equation(4.6).…”
mentioning
confidence: 99%