相关论文: In Search of a Hidden Curve

The zero set of a real polynomial in two variable is a curve in $\mathbb R^2$. For a generic choice of its coefficients this is a non-singular curve, a collection of circles and lines properly embedded in $\mathbb R^2$. What topological…

${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…

Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by…

Bender-Canfield showed that a plethora of graph counting problems in oriented/unoriented surfaces involve two constants $t_g$ and $p_g$ for the oriented and the unoriented case respectively. T.T.Q. Le and the authors recently discovered a…

Let $X\to \mathbb P^2$ be the elliptic Calabi-Yau threefold given by a general Weierstrass equation. We answer the enumerative question of how many discrete rational curves lie over lines in the base, proving part of a conjecture by Huang,…

We enumerate complex curves on toric surfaces of any given degree and genus, having a single cusp and nodes as their singularities, and matching appropriately many point constraints. The solution is obtained via tropical enumerative…

We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…

We define a quadratically enriched count of rational curves in a given divisor class passing through a collection of points on a del Pezzo surface $S$ of degree $\geq 3$ over a perfect field $k$ of characteristic $\neq 2,3.$ When $S$ is…

We develop a holonomy reduction procedure for general Cartan geometries. We show that, given a reduction of holonomy, the underlying manifold naturally decomposes into a disjoint union of initial submanifolds. Each such submanifold…

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

For curves singularities the dimension of smoothing components in the deformation space is an invariant of the singularity, but in general the deformation space has components of different dimensions. We are interested in the question what…

Single Hurwitz numbers enumerate branched covers of the Riemann sphere with specified genus, prescribed ramification over infinity, and simple branching elsewhere. They exhibit a remarkably rich structure. In particular, they arise as…

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…

Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…

Gromov-Witten theory is used to define an enumerative geometry of curves in Calabi-Yau 5-folds. We find recursions for meeting numbers of genus 0 curves, and we determine the contributions of moving multiple covers of genus 0 curves to the…

An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…

This paper presents a methodology for finding numerically, by means of curve-following, all real solutions of a general system of $n$ nonlinear equations in $n$ unknowns, within a given $n$-dimensional box. The main idea behind our method…

Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…

Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…

A degree $d$ genus $g$ cover of the complex projective line by a smooth irreducible curve $C$ yields a vector bundle on the projective line by pushforward of the structure sheaf. We classify the bundles that arise this way when $d = 5$.…