We report on a symbolic-numeric algorithm for computing the Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with...
-
September 23, 2010 (v1)Conference paperUploaded on: December 3, 2022
-
2020 (v1)Journal article
Rigid graph theory is an active area with many open problems, especially regarding embeddings in R^d or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number of embeddings to that of solutions of a well-constrained algebraic system and exploit progress in the latter domain. ...
Uploaded on: December 4, 2022 -
2022 (v1)Journal article
A tri-linear rational map in dimension three is a rational map $\phi: (\mathbb{P}_\mathbb{C}^1)^3 \dashrightarrow \mathbb{P}_\mathbb{C}^3$ defined by four tri-linear polynomials without a common factor. If $\phi$ admits an inverse rational map $\phi^{-1}$, it is a tri-linear birational map. In this paper, we address computational and geometric...
Uploaded on: December 3, 2022