Related papers: Intersections numbers on the compact variety of ra…
We compute the intersection cohomology of the moduli spaces $M_{r,d}$ of semistable vector bundles having rank $r$ and degree $d$ over a curve. We do this by relating the Hodge-Deligne polynomial of the intersection cohomology of $M_{r,d}$…
We describe a method of computing equivariant and ordinary intersection cohomology of certain varieties with actions of algebraic tori, in terms of structure of the zero- and one-dimensional orbits. The class of varieties to which our…
In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…
We prove a localization formula for virtual fundamental classes in the context of torus equivariant perfect obstruction theories. As an application, the higher genus Gromov-Witten invariants of projective space are expressed as graph sums…
In this paper, we discuss classical derivation of the residue integral representation of the d=1 rational Gromov-Witten invariants of projective hypersurfaces that followed from localization technique.
We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…
We use twisted stable maps to compute the number of rational degree d plane curves having prescribed contacts to a smooth plane cubic.
We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…
The purpose of this paper is to provide a way to compute the intersection cohomology of the GIT quotient of a nonsingular projective variety. We show that the middle perversity intersection cohomology of the GIT quotient $M//G$ is naturally…
In this note we give a shortened proof of a theorem of Rudnev, which bounds the number of incidences between points and planes over an arbitrary field. Rudnev's proof uses a map that goes via the four-dimensional Klein quadric to a…
The goal of this very short note is to give a new proof of Faber's formula for the socle intersection numbers in the tautological ring of $\mathcal{M}_g$. This new proof exhibits a new beautiful tautological relation that stems from the…
Given a compact orientable surface $\Sigma$, let $\Cal S(\Sigma)$ be the set of isotopy classes of essential simple loops on $\Sigma$. We determine a complete set of relations for a function from $\Cal S(\Sigma)$ to $\bold Z$ to be a…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
This is an introduction to the geometry of compact Riemann surfaces, largely following the books Farkas-Kra, Fay, Mumford Tata lectures. 1) Defining Riemann surfaces with atlases of charts, and as locus of solutions of algebraic equations.…
We present a Kedlaya-style point counting algorithm for cyclic covers $y^r = f(x)$ over a finite field $\mathbb{F}_{p^n}$ with $p$ not dividing $r$, and $r$ and $\deg{f}$ not necessarily coprime. This algorithm generalizes the…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
A generalization of the Kontsevich Airy-model allows one to compute the intersection numbers of the moduli space of p-spin curves. These models are deduced from averages of characteristic polynomials over Gaussian ensembles of random…
A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…