On reducible monodromy representations of some generalized Lam\'e equation
classification
🧮 math.CA
keywords
monodromyreducibleequationgeneralizedcompletelycomputecorrespondingdata
read the original abstract
In this note, we compute the explicit formula of the monodromy data for a generalized Lam\'{e} equation when its monodromy is reducible but not completely reducible. We also solve the corresponding Riemman-Hilbert problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.