Related papers: Maps between curves and arithmetic obstructions

Let $X$ and $Y$ be rational functions of degree at least two with complex coefficients such that $\mathbb{C}(X,Y)=\mathbb{C}(z)$. We study the problem of determining when the field extension $[\mathbb{C}(z):\mathbb{C}(X)\cap\mathbb{C}(Y)]$…

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

We show that if f: X --> Y is a finite, separable morphism of smooth curves defined over a finite field F_q, where q is larger than an explicit constant depending only on the degree of f and the genus of X, then f maps X(F_q) surjectively…

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…

In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…

In this paper, we investigate the possibility of constructing isomonodromic deformations of logarithmic connections on curves by using ramified covers. We give new examples and prove a classification result.

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

This paper studies the obstructions to deforming a map from a complex variety to another variety which is an immersion of codimension one. We extend the classical notion of semiregularity of subvarieties to maps between varieties, and show…

Suppose that $F$ is a smooth and connected complex surface (not necessarily compact) containing a smooth rational curve with positive self-intersection. We prove that if there exists a non-constant meromorphic function on $F$, then the…

Let $X$ and $Y$ be finite complexes. When $Y$ is a nilpotent space, it has a rationalization $Y \to Y_{(0)}$ which is well-understood. Early on it was found that the induced map $[X,Y] \to [X,Y_{(0)}]$ on sets of mapping classes is…

We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.

We consider all genus 2 curves over Q given by an equation y^2 = f(x) with f a squarefree polynomial of degree 5 or 6, with integral coefficients of absolute value at most 3. For each of these roughly 200000 isomorphism classes of curves,…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

We give necessary and sufficient topological conditions for a simple closed curve on a real rational surface to be approximable by smooth rational curves. We also study approximation by smooth rational curves with given complex…

We present a method for computing projective isomorphisms between rational surfaces that are given in terms of their parametrizations. The main idea is to reduce the computation of such projective isomorphisms to five base cases by…

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…

For complete metric spaces $X$ and $Y$, a description of linear biseparating maps between spaces of vector-valued Lipschitz functions defined on $X$ and $Y$ is provided. In particular it is proved that $X$ and $Y$ are bi-Lipschitz…

We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.

Given two irreducible curves of the plane which have isomorphic complements, it is natural to ask whether there exists an automorphism of the plane that sends one curve on the other. This question has a positive answer for a large family of…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…