加载中…
We consider relative character varieties on with , or . Using a diagrammatic method of Simpson’s, we give an explicit linear upper bound on the rank of an MC-minimal character variety of dimension . An arbitrary character variety is isomorphic, via Katz’s middle convolution, to one satisfying the bound. For the general linear and non-overlapping quadratic cases, the bounds we give are the sharpest possible using this method.

生成讲解博客的中文版本

生成AI智能校验的中文版本