Related papers: An algorithm to compute the Teichmueller polynomia…

For each closed orientable surface we introduce a simplical complex with some additional structure which is a version of the complex of curves of this surface adjusted to investigation of its Torelli group. We call this complex the Torelli…

Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…

A construction of algebraic surfaces based on two types of simple arrangements of lines, containing the prototiles of substitution tilings, has been proposed recently. The surfaces are derived with the help of polynomials obtained from…

We develop an algorithm computing the transcendental lattice and the Mordell--Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces

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…

In this paper a generalization of the Gram-Schmidt Algorithm is presented. Actually we provide an algorithm to construct a set of equiangular vectors with a given angle $\theta\in(0,\arccos(\frac{-1}{n-1}))$ using a set of input independent…

We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…

Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…

We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…

We present an algorithm to compute the torsion component $\mathrm{Pic}^\tau X$ of the Picard scheme of a smooth projective variety $X$ over a field $k$. Specifically, we describe $\mathrm{Pic}^\tau X$ as a closed subscheme of a projective…

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…

In this paper, we give a method to construct holonomy matrices of hyperbolic 3-manifolds by extending the known method of hyperbolic 2-manifolds. It enables us to consider hyperbolic 3-manifolds with nontrivial holonomies. We apply our…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

We present an efficient computational representation of central simple algebras using Brauer factor sets. Using this representation and polynomial quantum algorithms for number theoretical tasks such as factoring and $S$-unit group…

This paper solves the problem of computing conformal structures of general 2-manifolds represented as triangle meshes. We compute conformal structures in the following way: first compute homology bases from simplicial complex structures,…

This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…

Motivated by an application to LDPC (low density parity check) algebraic geometry codes described by Voloch and Zarzar, we describe a computational procedure for establishing an upper bound on the arithmetic or geometric Picard number of a…