On the Deligne-Simpson problem

Abstract

The Deligne-Simpson problem is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes Cj⊂ SL(n, C) or cj⊂ sl(n, C) so that there exist irreducible (p+1)-tuples of matrices Mj∈ Cj or Aj∈ cj satisfying the equality M1... Mp+1=I or A1+... +Ap+1=0. We solve the problem for generic eigenvalues with the exception of the case of matrices Mj when the greatest common divisor of the numbers j,l(σ) of Jordan blocks of a given matrix Mj, with a given eigenvalue σ and of a given size l (taken over all j, σ, l) is >1. Generic eigenvalues are defined by explicit algebraic inequalities. For such eigenvalues there exist no reducible (p+1)-tuples. The matrices Mj and Aj are interpreted as monodromy operators of regular linear systems and as matrices-residua of fuchsian ones on Riemann's sphere.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…