相关论文: Random trees and moduli of curves
These are lecture notes that are based on the lectures from a class I taught on the topic of Randomized Linear Algebra (RLA) at UC Berkeley during the Fall 2013 semester.
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
The modular curves serve as excellent objects for testing conjectures in arithmetic geometry. They possess a natural geometric definition in contrast with rather nontrivial structure. On the other hand, they are well-studied from the…
The circle method has been successfully used over the last century to study rational points on hypersurfaces. More recently, a version of the method over function fields, combined with spreading out techniques, has led to a range of results…
This is an expository paper. The geometry of phylogenetic trees is used to present in an accessible and pleasant fashion the results of Deligne, Mumford, and Knudsen about the moduli space of n distinct points on the projective line and its…
In this paper we describe a construction which produces classes in a compactification of the moduli space of curves. This construction extends a construction of Kontsevich which produces classes in the open moduli space from the initial…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
We show that introducing a periodic time coordinate in the models of Penner-Kontsevich type generalizes the corresponding constructions to the case of the moduli space ${\cal S}_{gn}^k$ of curves $C$ with homology chains $\gamma\in…
We study the intersection ring of the space $\M(\alpha_1,...,\alpha_m)$ of polygons in $\R^3$. We find homology cycles dual to generators of this ring and prove a recursion relation in $m$ (the number of steps) for their intersection…
We consider a class of tautological top intersection products on the moduli space of stable pairs consisting of semistable vector bundles together with N sections on a smooth complex projective curve C. We show that when N is large, these…
Building on our earlier work on toric residues and reduction, we give a proof for the mixed toric residue conejecture of Batyrev and Materov. We simplify and streamline our technique of tropical degenerations, which allows one to…
We give a conjectural formula for the characteristic number of rational cuspidal curves in the projective plane by extending the idea of Kontsevich's recursion formula (namely, pulling back the equality of two divisors in the four pointed…
This is a survey paper that also contains some new results. It will appear in the proceedings of the AMS summer research institute on Algebraic Geometry at Santa Cruz.
Standard combinatorial construction, due to Kontsevich, associates to any $\ai$-algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We propose an…
We provide formulas for the degrees of the projections of the locus of square matrices with given rank from linear spaces spanned by a choice of matrix entries. The motivation for these computations stem from applications to `matrix…
We prove the structure theorem of the intersection complexes of toric varieties in the category of mixed Hodge modules. This theorem is due to Bernstein, Khovanskii and MacPherson for the underlying complexes with rational coefficients. As…
In this paper, we study the joint behaviour of the degree, depth and label of and graph distance between high-degree vertices in the random recursive tree. We generalise the results obtained by Eslava and extend these to include the labels…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that…
We prove a new effective recursion formula for computing all intersection indices (integrals of $\psi$ classes) on the moduli space of curves, inducting only on the genus.