Related papers: Linear algebra algorithms for divisors on an algeb…
We present quantum algorithms to efficiently perform discriminant analysis for dimensionality reduction and classification over an exponentially large input data set. Compared with the best-known classical algorithms, the quantum algorithms…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…
The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…
In 1955 Kadison \cite{14} asked whether the analogue of the classical Burnside's theorem of the Linear Algebra holds in the infinite dimensional case. We use reproducing kernels method to solve the Kadison question. Namely, we prove that…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
We develop a cohomological description of various explicit descents in terms of generalized Jacobians, generalizing the known description for hyperelliptic curves. Specifically, given an integer $n$ dividing the degree of some reduced…
In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…
For an (imaginary) hyperelliptic curve $\mathcal{H}$ of genus $g$, we determine a basis of the Riemann-Roch space $\mathcal{L}(D)$, where $D$ is a divisor with positive degree $n$, linearly equivalent to $P_1+\cdots+ P_j+(n-j)\Omega$, with…
We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES…
The paper reports on a computer algebra program LSSS (Linear Selective Systems Solver) for solving linear algebraic systems with rational coefficients. The program is especially efficient for very large sparse systems that have a solution…
The Langlands correspondence for complex curves is traditionally formulated in terms of sheaves rather than functions. Recently, Langlands asked whether it is possible to construct a function-theoretic version. In this paper we use the…
We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…
This note is an attempt to extend "Geometric Langlands Conjecture" from algebraic curves to algebraic surfaces. We introduce certain Hecke-type operators on vector bundles on an algebraic surface. The crucial observation is that the algebra…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra…
Variables of separation for classical $GL(3)$ magnetic chain obtained by Sklyanin form a generic positive divisor $D$ of degree $n$ on a genus $g$ non-hyperelliptic algebraic curve. Because $n>g$ this divisor $D$ has unique representative…
We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…
Previous work by the authors (this journal, \vol{60} (2008), 1009-1044) produced equations that hold on certain loci of the Jacobian of a cyclic $C_{rs}$ curve. A curve of this type generalizes elliptic curves, and the equations in question…