2006
DOI: 10.4171/020-1/8
|View full text |Cite
|
Sign up to set email alerts
|

On the reductions and classical solutions of the Schlesinger equations

Abstract: Abstract. The Schlesinger equations S (n,m) describe monodromy preserving deformations of order m Fuchsian systems with n+1 poles. They can be considered as a family of commuting time-dependent Hamiltonian systems on the direct product of n copies of m × m matrix algebras equipped with the standard linear Poisson bracket. In this paper we address the problem of reduction of particular solutions of "more complicated" Schlesinger equations S (n,m) to "simpler" S (n ′ ,m ′ ) having n ′ < n or m ′ < m.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 36 publications
(62 reference statements)
0
13
0
Order By: Relevance
“…• In another work [16] by Dubrovin and Mazzocco the idea of reducibility of Schlesinger systems was developed: a solution to a Schlesinger system is called reducible if it can be expressed in terms of solutions to Schlesinger systems with smaller number of singularities or lower matrix dimension. In particular, it was proved that if all monodromy matrices have the same blocktriangular structure, than the solution is reducible.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…• In another work [16] by Dubrovin and Mazzocco the idea of reducibility of Schlesinger systems was developed: a solution to a Schlesinger system is called reducible if it can be expressed in terms of solutions to Schlesinger systems with smaller number of singularities or lower matrix dimension. In particular, it was proved that if all monodromy matrices have the same blocktriangular structure, than the solution is reducible.…”
Section: Discussionmentioning
confidence: 99%
“…Now we note that the last d − 1 rows in the block S ∞ above the diagonal in the monodromy matrix M ∞ (A. 16) form an (d − 1) × (d − 1) matrix which coincides with the Cartan matrix for A d−1 . Therefore each row of the matrix M ∞ is a coordinate vector of a root of A d−1 with respect to a basis of weight vectors {v i } defined by…”
Section: Theoremmentioning
confidence: 95%
See 2 more Smart Citations
“…Note that triangular and, more generally, reducible, Schlesinger systems of arbitrary size p were already studied by B. Dubrovin, M. Mazzocco in [10], where the main question was the following: when are solutions of one Schlesinger system for N (p × p)-matrices expressed via solutions of some other "simpler" Schlesinger systems of smaller matrix size or involving less than N matrices? However, there was no restriction imposed on the exponents, and thus there was no discussion of the integration of such systems in an explicit, in particular algebro-geometric, form.…”
Section: Introductionmentioning
confidence: 99%