pith. sign in

arxiv: math/0206298 · v1 · submitted 2002-06-27 · 🧮 math.RA · math.AG· math.RT

The Deligne-Simpson problem -- a survey

classification 🧮 math.RA math.AGmath.RT
keywords deligne-simpsonmatricesproblemrespsubsetsurveycentralizerchoice
0
0 comments X
read the original abstract

The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there exist irreducible (resp. with trivial centralizer) $(p+1)$-tuples of matrices $M_j\in C_j$ or $A_j\in c_j$ satisfying the equality $M_1... M_{p+1}=I$ or $A_1+... +A_{p+1}=0$}. The matrices $M_j$ and $A_j$ are interpreted as monodromy operators of regular linear systems and as matrices-residua of Fuchsian ones on Riemann's sphere. The present paper offers a survey of the results known up to now concerning the DSP.

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.