Search arXivSearch

arXiv · 1210.3841

Hilbert series of certain jet schemes of determinantal varieties

Abstract

We consider the affine variety ${\mathcal{Z}_{2,2}^{m,n}}$ (or just "$Y$") of first order jets over ${\mathcal{Z}_{2}^{m,n}}$ (or just "$X$"), where $X$ is the classical determinantal variety given by the vanishing of all $2\times 2$ minors of a generic $m\times n$ matrix. When $2 < m \le n$, this jet scheme $Y$ has two irreducible components: a trivial component, isomorphic to an affine space, and a nontrivial component that is the closure of the jets supported over the smooth locus of $X$. This second component is referred to as the principal component of $Y$; it is, in fact, a cone and can also be regarded as a projective subvariety of $\mathbf{P}^{2mn-1}$. We prove that the degree of the principal component of $Y$ is the square of the degree of $X$ and more generally, the Hilbert series of the principal component of $Y$ is the square of the Hilbert series of $X$. As an application, we compute the $a$-invariant of the principal component of $Y$ and show that the principal component of $Y$ is Gorenstein if and only if $m=n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sudhir R. Ghorpade, Boyan Jonov, B. A. Sethuraman. 2013-11-15. Hilbert series of certain jet schemes of determinantal varieties. https://doi.org/10.2140/pjm.2014.272.147

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO