It's been a while since I've CodeCogged, and I'm pleased to find that the site is still there. This brings out an intemperate desire to see some fancy mathematical typesetting, and an email from Springer provides the impetus. I get free previews for the occasional paper, you see, and it's always fun to look at its contents and realise, once again, that while I might understand every word in a sentence, I have no idea what the thing in its entirety means.
So, anyway, here's a theorem from Alexander Kuznetsov (2008) 'Lefschetz decompositions and categorical resolutions of singularities', Selecta Mathematica (New Series), Volume 13, Number 4, pp 661-696.
Theorem 1. The triangulated categorywith functors
and
is a categorical resolution of
. Moreover, we have a semiorthogonal decomposition
Finally, ifis Gorenstein and
then
is weakly crepant if
is strongly crepant if
![]()
Kuznetsov goes on to say: 'Certainly, minimal categorical resolutions are the most interesting.'
One day I'll figure out how to inline the LaTeX so that it doesn't appear off the rest of the text. Good thing to have an occasional challenge, eh?
One day I'll figure out how to inline the LaTeX so that it doesn't appear off the rest of the text. Good thing to have an occasional challenge, eh?
0 comments:
Post a Comment