相关论文: In Search of a Hidden Curve
A new, simple method to approach enumerative questions about rational curves on rational surfaces is described. Applications include a short proof of Kontsevich's formula for plane curves and a the solution of the analogous problem for the…
This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…
A Howe curve is a curve of genus $4$ obtained as the fiber product over $\mathbf{P}^1$ of two elliptic curves. Any Howe curve is canonical. This paper provides an efficient algorithm to find superspecial Howe curves and that to enumerate…
We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden…
A canonically-embedded curve of genus $g$ is a pure 1-dimensional, non-degenerate subscheme $C$ of ${\bf P}^{g-1}$ over an algebraically closed field $k$, for which ${\cal O}_C(1) \cong \omega_C$, (the dualizing sheaf)$ and $h^0(C, {\cal…
Suppose X is a (smooth projective irreducible algebraic) curve over a finite field k. Counting the number of points on X over all finite field extensions of k will not determine the curve uniquely. Actually, a famous theorem of Tate implies…
Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…
Nonlinear spectral problems arise across a range of fields, including mechanical vibrations, fluid-solid interactions, and photonic crystals. Discretizing infinite-dimensional nonlinear spectral problems often introduces significant…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contains the (unknown) true location of the vertex. The regions we…
In this paper, we develop a systematic approach to enumerate curves with a certain number of nodes and one further singularity which maybe more degenerate. As a result, we obtain an explicit formula for the number of curves in a…
Double Hurwitz numbers count branched covers of the projective line with fixed branch points, with simple branching required over all but two points 0 and infinity, and the branching over 0 and infinity specified by partitions of the degree…
In this article we investigate regular curves whose derivatives have vanishing mean oscillations. We show that smoothing these curves using a standard mollifier one gets regular curves again. We apply this result to solve a couple of open…
Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…
We introduce a new matrix model representation for the generating function of simple Hurwitz numbers. We calculate the spectral curve of the model and the associated symplectic invariants developed in [Eynard-Orantin]. As an application, we…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
Double Hurwitz numbers enumerating weighted $n$-sheeted branched coverings of the Riemann sphere or, equivalently, weighted paths in the Cayley graph of $S_n$ generated by transpositions are determined by an associated weight generating…
In general or normal random matrix ensembles, the support of eigenvalues of large size matrices is a planar domain (or several domains) with a sharp boundary. This domain evolves under a change of parameters of the potential and of the size…
In this paper, we compute the number of covers of curves with given branch behavior in characteristic p for one class of examples with four branch points and degree p. Our techniques involve related computations in the case of three branch…
Genus 2 curves have been an object of much mathematical interest since eighteenth century and continued interest to date. They have become an important tool in many algorithms in cryptographic applications, such as factoring large numbers,…