Related papers: A Generalized RSK for Enumerating Linear Series on…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

The Wronski map is a finite, PGL_2(C)-equivariant morphism from the Grassmannian Gr(d,n) to a projective space (the projectivization of a vector space of polynomials). We consider the following problem. If C_r < PGL_2(C) is a cyclic…

We consider the general problem of enumerating branched covers of the projective line from a fixed general curve subject to ramification conditions at possibly moving points. Our main computations are in genus 1; the theory of limit linear…

We give an overview of recent progress around a problem introduced by Elekes and R\'onyai. The prototype problem is to show that a polynomial $f\in \mathbb{R}[x,y]$ has a large image on a Cartesian product $A\times B\subset \mathbb{R}^2$,…

We study subvarieties of very general complete intersections $X\subset \mathbb{P}^n$ of multidegree $(d_1,\dots,d_c)$, when $d:= d_1+\dots +d_c$ is sufficiently large. In a seminal paper Ein proved that if $d\geq 2n-c-k+2$, any…

A subset $Y$ of the general linear group $\operatorname{GL}(n,q)$ is called $t$-intersecting if $\operatorname{rk}(x-y)\le n-t$ for all $x,y\in Y$, or equivalently $x$ and $y$ agree pointwise on a $t$-dimensional subspace of…

Deep learning has consistently defied state-of-the-art techniques in many fields over the last decade. However, we are just beginning to understand the capabilities of neural learning in symbolic domains. Deep learning architectures that…

We provide a structural generalization of a theorem by Kleiman--Piene, concerning the enumerative geometry of nodal curves in a complete linear system |L| on a smooth projective surface S. Provided that r, the number of nodes, is…

Fix a sequence of $d$-regular graphs $(G_d)_{d\in \mathbb{N}}$ and denote by $G_{d,p}$ the graph obtained from $G_d$ after edge-percolation with probability $p=c/d$, for a constant $c>0$. We prove a quantitative local convergence of…

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…

We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…

The generalized coloring numbers of Kierstead and Yang (Order 2003) offer an algorithmically-useful characterization of graph classes with bounded expansion. In this work, we consider the hardness and approximability of these parameters.…

Generalised linear models for multi-class classification problems are one of the fundamental building blocks of modern machine learning tasks. In this manuscript, we characterise the learning of a mixture of $K$ Gaussians with generic means…

This is a short note on various results about the combinatorial properties of line arrangements in terms of the Chern numbers of the corresponding log surfaces. This resembles the study of the geography of surfaces of general type. We prove…

Let S be a complex smooth projective surface and L be a line bundle on S. For any given collection of isolated topological or analytic singularity types, we show the number of curves in the linear system |L| with prescribed singularities is…

The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it sequentially adds new random edges so that the degree of each…

We study the geometry of varieties parametrizing degree d rational and elliptic curves in P^n intersecting fixed general linear spaces and tangent to a fixed hyperplane H with fixed multiplicities along fixed general linear subspaces of H.…

Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…

The SHGH conjecture proposes a solution to the question of how many conditions a general union of fat points imposes on the complete linear system of curves in $\mathbb P^2$ of fixed degree $d$, and it is known to be true in many cases. We…

Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates…