相关论文: In Search of a Hidden Curve

We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether a given subset of the vertices contains any…

Hurwitz theory provides a large variety of enumerative problems related to algebraic geometry, mathematical physics, and combinatorics. We give a general framework to approach the large genus asymptotics of Hurwitz theory using only…

The topological recursion of Eynard and Orantin governs a variety of problems in enumerative geometry and mathematical physics. The recursion uses the data of a spectral curve to define an infinite family of multidifferentials. It has been…

Learning a latent embedding to understand the underlying nature of data distribution is often formulated in Euclidean spaces with zero curvature. However, the success of the geometry constraints, posed in the embedding space, indicates that…

Hurwitz numbers count covers of curves satisfying fixed ramification data. Via monodromy representation, this counting problem can be transformed to a problem of counting factorizations in the symmetric group. This and other beautiful…

A Howe curve is a curve of genus $4$ obtained as the fiber product of two genus-$1$ double covers of $\mathbf{P}^1$. In this paper, we present a simple algorithm for testing isomorphism of Howe curves, and we propose two main algorithms for…

In this paper, we study a problem that is in a sense a reversal of the Hurwitz counting problem. The Hurwitz problem asks: for a generic target -- $\mathbb P^1$ with a list of $n$ points $q_1,\dots,q_n\in \mathbb P^1$ -- and partitions…

How can we use a quantum computer to detect the entanglement structure of a quantum state? Bouland et al. (2024) recently provided an algorithm that, given multiple input copies of the state, finds the "hidden cuts"-partitions into fully…

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

We shall consider the product of complex random matrices from the independent complex Ginibre ensembles. The product includes complex matrices $Z_i, Z_i^\dagger, \, i = 1, \ldots, n$ and $2n$ sources (complex matrices $C_i$ and $C_i^*$).…

We prove the conjectures of Yau-Zaslow and Gottsche concerning the number curves on K3 surfaces. Specifically, let X be a K3 surface and C be a holomorphic curve in X representing a primitive homology class. We count the number of curves of…

Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…

Recent works have explored the use of counting queries coupled with Description Logic ontologies. The answer to such a query in a model of a knowledge base is either an integer or $\infty$, and its spectrum is the set of its answers over…

Let $X$ be a (projective, geometrically irreducible, nonsingular) algebraic curve of genus $g \ge 2$ defined over an algebraically closed field $K$ of odd characteristic $p$. Let $Aut(X)$ be the group of all automorphisms of $X$ which fix…

Reconstructing the missing parts of a curve has been the subject of much computational research, with applications in image inpainting, object synthesis, etc. Different approaches for solving that problem are typically based on processes…

The Eynard-Orantin recursion formula provides an effective tool for certain enumeration problems in geometry. The formula requires a spectral curve and the recursion kernel. We present a uniform construction of the spectral curve and the…

We give a quantum algorithm for a novel type of black-box problem: identifying a hidden $d$-regular base graph $G$ on $n$ vertices from oracle access to an obfuscated version of it, rather than traversing it. From $G$ we build the spired…

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

We construct a class of perturbations of the Cauchy-Riemann equations for maps from curves to a Calabi-Yau threefold. Our perturbations vanish on components of zero symplectic area. For generic 1-parameter families of perturbations, the…

Given a spectral curve with exponential singularities (which we call a "transalgebraic spectral curve"), we extend the definition of topological recursion to include contributions from the exponential singularities in a way that is…