Related papers: Certified algebraic curve projections by path trac…
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 present an algorithm for projecting superoperators onto the set of completely positive, trace-preserving maps. When combined with gradient descent of a cost function, the procedure results in an algorithm for quantum process tomography:…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
We consider efficient route planning for robots in applications such as infrastructure inspection and automated surgical imaging. These tasks can be modeled via the combinatorial problem Graph Inspection. The best known algorithms for this…
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
The aim of this paper is to associate a measure for certain sets of paths in the Euclidean plane $\mathbb{R}^2$ with fixed starting and ending points. Then, working on parameterized surfaces with a specific Riemannian metric, we define and…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees,…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
For a smooth plane cubic $B$, we count curves $C$ of degree $d$ such that the normalizations of $C\backslash B$ are isomorphic to $\Bbb A^1$, for $d\leq7$ (for $d=7$ under some assumption). We also count plane rational quartic curves…
We consider least squares approximation of a function of one variable by a continuous, piecewise-linear approximand that has a small number of breakpoints. This problem was notably considered by Bellman who proposed an approximate algorithm…
We propose a new algorithm for numerical path tracking in polynomial homotopy continuation. The algorithm is `robust' in the sense that it is designed to prevent path jumping and in many cases, it can be used in (only) double precision…
Applications from manipulation to autonomous vehicles rely on robust and general object tracking to safely perform tasks in dynamic environments. We propose the first certifiably optimal category-level approach for simultaneous shape…
The graph isomorphism, subgraph isomorphism, and graph edit distance problems are combinatorial problems with many applications. Heuristic exact and approximate algorithms for each of these problems have been developed for different kinds…