Related papers: A Generalized RSK for Enumerating Linear Series on…
Graphs embedded into surfaces have many important applications, in particular, in combinatorics, geometry, and physics. For example, ribbon graphs and their counting is of great interest in string theory and quantum field theory (QFT).…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
The generalised colouring numbers $\mathrm{adm}_r(G)$, $\mathrm{col}_r(G)$, and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have…
Consider a smooth, geometrically irreducible, projective curve of genus $g \ge 2$ defined over a number field of degree $d \ge 1$. It has at most finitely many rational points by the Mordell Conjecture, a theorem of Faltings. We show that…
We consider a Gaussian random matrix theory in the presence of an external matrix source. This matrix model, after duality (a simple version of the closed/open string duality), yields a generalized Kontsevich model through an appropriate…
We prove a smoothness result for spaces of linear series with prescribed ramification on twice-marked elliptic curves. In characteristic 0, we then apply the Eisenbud-Harris theory of limit linear series to deduce a new proof of the…
In this notes, we will give some remarks on the results in Rational points of universal curves by Hain. In particular, we consider the universal curves $\mathcal{M}_{g,n+1}\to \mathcal{M}_{g,n}$ and the sections of their algebraic…
We obtain a recursive formula answering the following question: How many irreducible, plane curves of degree d and (geometric) genus g pass through 3d-1+g general points in the plane? The formula is proved by studying suitable degenerations…
Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…
Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…
We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in…
Explicit models of families of genus 2 curves with multiplication by $\sqrt D$ are known for $D= 2, 3, 5$. We obtain generic models for genus 2 curves over $\mathbb Q$ with real multiplication in 12 new cases, including all fundamental…
In this article, we functorially associate definable sets to $k$-analytic curves, and definable maps to analytic morphisms between them, for a large class of $k$-analytic curves. Given a $k$-analytic curve $X$, our association allows us to…
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem…
Given two one-dimensional families $f$ and $g$ of regular plane polynomial automorphisms parameterised by an algebraic curve $B$, all defined over some number field $K$, such that one of them is dissipative, we prove that at any parameter…
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…