The Deligne–Simpson problem—a survey

By Vladimir Petrov Kostov. 2002

66 citations recorded by the source corpus.

Abstract The Deligne–Simpson problem (DSP) (respectively the weak DSP) is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes C j ⊂ GL ( n , C ) or c j ⊂ gl ( n , C ) so that there exist irreducible (respectively with trivial centralizer) ( p + 1 ) -tuples of matrices M j ∈ C j or A j ∈ 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.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/d41a32aa2c76401a3adfaf2c06faf3afe64c35cb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. P. Shaw
  2. W. Crawley‐Boevey
  3. Daisuke Yamakawa
  4. Carlos Simpson
  5. P. Boalch
  6. Vladimir Petrov Kostov
  7. V. Ginzburg
  8. I. Losev

In Discrete Mathematics and Combinatorics

  1. P. Shaw
  2. W. Crawley‐Boevey
  3. Daisuke Yamakawa
  4. Vladimir Petrov Kostov
  5. Yuya Mizuno
  6. Markus Reineke
  7. Bernard Leclerc
  8. Tamás Hausel

In Mathematical Physics

  1. W. Crawley‐Boevey
  2. P. Shaw
  3. P. Boalch
  4. Daisuke Yamakawa
  5. Carlos Simpson
  6. H. Nakajima
  7. I. Losev
  8. Markus Reineke

Citations in the corpus