Related papers: Computing the Teichmueller polynomial
We introduce the notion of a \emph{conic sequence} of a convex polytope. It is a way of building up a polytope starting from a vertex and attaching faces one by one with certain regulations. We apply this to a toric variety to obtain an…
Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…
Bifoliated planes arise naturally in the study of Anosov flows on $3$-manifolds. To any Anosov flow on a $3$-manifold $M$, one can associate a bifoliated plane equipped with an action of the fundamental group of $M$ which encodes the…
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…
A pseudo-Anosov homeomorphism of a surface is a canonical representative of its mapping class. In this paper, we explain that a transitive pseudo-Anosov flow is similarly a canonical representative of its stable Hamiltonian class. It…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We propose an optimization algorithm for computing geodesics on the universal Teichm\"uller space T(1) in the Weil-Petersson ($W P$) metric. Another realization for T(1) is the space of planar shapes, modulo translation and scale, and thus…
Tropical refined invariants of toric surfaces constitute a fascinating interpolation between real and complex enumerative geometries via tropical geometry. They were originally introduced by Block and G\"ottsche, and further extended by…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We consider the problem of recovering a $d-$dimensional manifold $\mathcal{M} \subset \mathbb{R}^n$ when provided with noiseless samples from $\mathcal{M}$. There are many algorithms (e.g., Isomap) that are used in practice to fit manifolds…
An important open problem in geometric complex analysis is to find algorithms for explicit determination of basic functionals intrinsically connected with conformal and quasiconformal maps, such as their Teichmuller and Grunsky norms,…
We develop Teichmuller theoretical methods to construct new minimal surfaces in $\BE^3$ by adding handles and planar ends to existing minimal surfaces in $\BE^3$. We exhibit this method on an interesting class of minimal surfaces which are…
We continue the program of Chinea, De Leon and Marrero who studied the topology of cosymplectic manifolds. We study 3-cosymplectic manifolds which are the closest odd-dimensional analogue of hyper-Kaehler structures. We show that there is…
We introduce a construction of pseudo-Anosov homeomorphisms on n-times punctured spheres and surfaces with higher genus using only sufficiently many positive half-twists. These constructions can produce explicit examples of pseudo-Anosov…
We describe an algorithm computing the monodromy and the pole order filtration on the top Milnor fiber cohomology of hypersurfaces in $\mathbb{P}^n$ whose pole order spectral sequence degenerates at the second page. In the case of…
Nonlinear manifold learning from unorganized data points is a very challenging unsupervised learning and data visualization problem with a great variety of applications. In this paper we present a new algorithm for manifold learning and…
This paper is a comprehensive introduction to the results of [7]. It grew as an expanded version of a talk given at INdAM Meeting Complex and Symplectic Geometry, held at Cortona in June 12-18, 2016. It deals with the construction of the…
We give a formula for the Euler characteristic of a triangulated manifold of even dimension in terms of the numbers of even-dimensional faces only. The coefficients in this formula are universal (they do not depend on the dimension of the…
We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…
We give a new algorithm for constructing Picard curves over a finite field with a given endomorphism ring. This has important applications in cryptography since curves of genus 3 allow for smaller key sizes than elliptic curves. For a…