Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNested Hilbert schemes and the nested q,t-Catalan series
177
0
0.0
(
0
)
Authors
Mahir Bilen Can
Ask ChatGPT about the research
No Arabic abstract
In this paper we study the tangent spaces of the smooth nested Hilbert scheme $ Hil{n,n-1}$ of points in the plane, and give a general formula for computing the Euler characteristic of a $TT^2$-equivariant locally free sheaf on $Hil{n,n-1}$. Applying our result to a particular sheaf, we conjecture that the result is a polynomial in the variables $q$ and $t$ with non-negative integer coefficients . We call this conjecturally positive polynomial as textsl{the nested $q,t$-Cat alan series}, for it has many conjectural properties similar to that of the $q,t $-Catalan series.
rate research
Read More
We express nested Hilbert schemes of points and curves on a smooth projective surface as virtual resolutions of degeneracy loci of maps of vector bundles on smooth ambient spaces. We show how to modify the resulting obstruction theories to produce the virtual cycles of Vafa-Witten theory and other sheaf-counting problems. The result is an effective way of calculating invariants (VW, SW, local PT and local DT) via Thom-Porteous-like Chern class formulae.
Consider a family of integral complex locally planar curves. We show that under some assumptions on the basis, the relative nested Hilbert scheme is smooth. In this case, the decomposition theorem of Beilinson, Bernstein and Deligne asserts that the pushforward of the constant sheaf on the relative nested Hilbert scheme splits as a direct sum of shifted semisimple perverse sheaves. We will show that no summand is supported in positive codimension.
The earlier work of the first and the third named authors introduced the algebra $mathbb{A}_{q,t}$ and its polynomial representation. In this paper we construct an action of this algebra on the equivariant K-theory of certain smooth strata in the flag Hilbert schemes of points on the plane. In this presentation, the fixed points of torus action correspond to generalized Macdonald polynomials and the the matrix elements of the operators have explicit combinatorial presentation.
In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $mathbb{P}^n(mathbb{F}_q)$, and they may be seen as a generalization of the so-called projective Reed-Muller codes. We calculate the length and the dimension of such codes, a lower bound for the minimum distance and the exact minimum distance in a special case (which includes the projective Reed-Muller codes). At the end we show some relations between the parameters of these codes and those of the affine cartesian codes.
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert scheme as subscheme of a suitable Grassmannian and in Chapter 5 we determine a new set of equations of degree lower than the degree of equations known so far. In Chapter 2 we study the most important objects used to project algorithmic techniques, namely Borel-fixed ideals. We determine an algorithm computing all the saturated Borel-fixed ideals with Hilbert polynomial assigned and we investigate their combinatorial properties. In Chapter 3 we show a new type of flat deformations of Borel-fixed ideals which lead us to give a new proof of the connectedness of the Hilbert scheme. In Chapter 4 we construct families of ideals that generalize the notion of family of ideals sharing the same initial ideal with respect to a fixed term ordering. Some of these families correspond to open subsets of the Hilbert scheme and can be used to a local study of the Hilbert scheme. In Chapter 6 we deal with the problem of the connectedness of the Hilbert scheme of locally Cohen-Macaulay curves in the projective 3-space. We show that one of the Hilbert scheme considered a good candidate to be non-connected, is instead connected. Moreover there are three appendices that present and explain how to use the implementations of the algorithms proposed.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
