相关论文: In Search of a Hidden Curve
We construct several modular compactifications of the Hurwitz space $H^d_{g/h}$ of genus $g$ curves expressed as $d$-sheeted, simply branched covers of genus $h$ curves. These compactifications are obtained by allowing the branch points of…
The problem of the existence of an equi-partition of a curve in $\R^n$ has recently been raised in the context of computational geometry. The problem is to show that for a (continuous) curve $\Gamma : [0,1] \to \R^n$ and for any positive…
Recently a new family of enumerative invariants called leaky Hurwitz numbers was introduced by Cavalieri-Markwig-Ranganathan in the context of logarithmic intersection theory. They admit an interpretation via tropical covers where the…
Hurwitz numbers, which count certain covers of the projective line (or, equivalently, factorizations of permuations into transpositions), have been extensively studied for over a century. The Gromov-Witten potential F of a point, the…
In this paper we study the geometry of the Severi varieties parametrizing curves on the rational ruled surface $\fn$. We compute the number of such curves through the appropriate number of fixed general points on $\fn$, and the number of…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
We employ techniques from group theory to show that, in many cases, counting problems on graphs are almost as hard to solve in a small number of instances as they are in all instances. Specifically, we show the following results. 1.…
We introduce a continuous domain framework for the recovery of a planar curve from a few samples. We model the curve as the zero level set of a trigonometric polynomial. We show that the exponential feature maps of the points on the curve…
To any metric spaces there is an associated metric profile. The rectifiability of the metric profile gives a good notion of curvature of a sub-Riemannian space. We shall say that a curvature class is the rectifiability class of the metric…
Given an holomorphic Higgs bundle on a compact Riemann surface of genus greater than one, we construct a DQ-module supported by the spectral curve associated to this bundle. Then, we relate quantum curves arising in various situations…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
Discontinuity with respect to data perturbations is common in algebraic computation where solutions are often highly sensitive. Such problems can be modeled as solving systems of equations at given data parameters. By appending auxiliary…
The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…
We introduce a method for studying reduction types of arithmetic curves and wildly ramified base change. We give new proofs of earlier results of Lorenzini and Obus-Wewers, and resolve a question of Lorenzini on the Euler characteristic of…
Cutting-planes are one of the most important building blocks for solving large-scale integer programming (IP) problems to (near) optimality. The majority of cutting plane approaches rely on explicit rules to derive valid inequalities that…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…
The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in computational mathematics. Its solution is supposed to provide…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
The classical Hurwitz numbers which count coverings of a complex curve have an analog when the curve is endowed with a theta characteristic. These "spin Hurwitz numbers", recently studied by Eskin, Okounkov and Pandharipande, are…