Related papers: Computing tropical curves via homotopy continuatio…

We study the tropical Dolbeault cohomology of non-archimedean curves as defined by Chambert-Loir and Ducros. We give a precise condition for when this cohomology satisfies Poincar\'e duality. The condition is always satisfied when the…

We present a new perspective on the Schottky problem that links numerical computing with tropical geometry. The task is to decide whether a symmetric matrix defines a Jacobian, and, if so, to compute the curve and its canonical embedding.…

In this paper we study topology of moduli spaces of tropical curves of genus $g$ with $n$ marked points. We view the moduli spaces as being imbedded in a larger space, which we call the {\it moduli space of metric graphs with $n$ marked…

Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several…

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

Measuring the similarity of curves is a fundamental problem arising in many application fields. There has been considerable interest in several such measures, both in Euclidean space and in more general setting such as curves on Riemannian…

We describe a new method for computing tropical linear spaces and more general duals of polyhedral subdivisions. It is based on Ganter's algorithm (1984) for finite closure systems.

Much like in the theory of algebraic geometry, we develop a correspondence between certain types of algebraic and geometric objects. The basic algebraic environment we work in is the a semifield of fractions H(x1,...,xn) of the polynomial…

Researchers working with mathematical models are often confronted by the related problems of parameter estimation, model validation, and model selection. These are all optimization problems, well-known to be challenging due to…

This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.

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…

In this paper we discuss an approach to calculate knot polynomials on a photonic processor. Calculations of knot polynomials is a computationally difficult problem and therefore it is interesting to use new advanced calculation methods to…

The eigenvalues of a matrix polynomial can be determined classically by solving a generalized eigenproblem for a linearized matrix pencil, for instance by writing the matrix polynomial in companion form. We introduce a general scaling…

Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…

We establish the equality of classical and tropical curve counts for elliptic curves on toric surfaces with fixed $j$-invariant, refining results of Mikhalkin and Nishinou--Siebert. As an application, we determine a formula for such counts…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…

We introduce the notion of tropical curves of hyperelliptic type. These are tropical curves whose Jacobian is isomorphic to that of a hyperelliptic tropical curve, as polarized tropical abelian varieties. We show that this property depends…

We derive efficient algorithms for coarse approximation of algebraic hypersurfaces, useful for estimating the distance between an input polynomial zero set and a given query point. Our methods work best on sparse polynomials of high degree…