ﻻ يوجد ملخص باللغة العربية
We study the coherent cohomology of generalized flag supervarieties. Our main observation is that these groups are closely related to the free resolutions of (certain generalizations of) determinantal ideals. In the case of super Grassmannians, we completely compute the cohomology of the structure sheaf: it is composed of the singular cohomology of a Grassmannian and the syzygies of a determinantal variety. The majority of the work involves studying the geometry of an analog of the Grothendieck-Springer resolution associated to the super Grassmannian; this takes place in the world of ordinary (non-super) algebraic geometry. Our work gives a conceptual explanation of the result of Pragacz-Weyman that the syzygies of determinantal ideals admit an action of the general linear supergroup. In a subsequent paper, we will treat other flag supervarieties in detail.
We consider a series of four subexceptional representations coming from the third line of the Freudenthal-Tits magic square; using Bourbaki notation, these are fundamental representations $(G,X)$ corresponding to $(C_3, omega_3),, (A_5, omega_3), , (
Given a graph $G$, the $G$-parking function ideal $M_G$ is an artinian monomial ideal in the polynomial ring $S$ with the property that a linear basis for $S/M_G$ is provided by the set of $G$-parking functions. It follows that the dimension of $S/M_
For a local complete intersection subvariety $X=V({mathcal I})$ in ${mathbb P}^n$ over a field of characteristic zero, we show that, in cohomological degrees smaller than the codimension of the singular locus of $X$, the cohomology of vector bundles
We develop an analogue of Eisenbud-Floystad-Schreyers Tate resolutions for toric varieties. Our construction, which is given by a noncommutative analogue of a Fourier-Mukai transform, works quite generally and provides a new perspective on the relati
We study standard monomial bases for Richardson varieties inside the flag variety. In general, writing down a standard monomial basis for a Richardson variety can be challenging, as it involves computing so-called defining chains or key tableaux. How