Related papers: An algorithm to compute the Teichmueller polynomia…
We present a simple method to compute the Teichm\"uller polynomial of the fibered face of a hyperbolic $3$-manifold $M_\phi$ obtained as the mapping torus of a pseudo-Anosov homeomorphism $\phi$ of a closed surface. We assume $\phi$ has…
The Teichmueller polynomial of a fibered 3-manifold plays a useful role in the construction of mapping class having small stretch factor. We provide an algorithm that computes this polynomial of the fibered face associated to a…
The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in…
We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…
In this note we explore a connection between finite covers of surfaces and the Teichm\"uller polynomial of a fibered face of a hyperbolic 3--manifold. We consider the action of a homological pseudo-Anosov homeomorphism $\psi$ on the…
We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…
We present an algorithm for computing equations of canonically embedded Riemann surfaces with automorphisms. A variant of this algorithm with many heuristic improvements is used to produce equations of Riemann surfaces $X$ with large…
In this work we compute the first integral cohomology of the pure mapping class group of a non-orientable surface of infinite topological type and genus at least 3. To this purpose, we also prove several other results already known for…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We present an algorithm for the computation of the topological type of a real compact Riemann surface associated to an algebraic curve, i.e., its genus and the properties of the set of fixed points of the anti-holomorphic involution $\tau$,…
In this paper we present an algorithm for computing a matrix representation for a surface in P^3 parametrized over a 2-dimensional toric variety T. This algorithm follows the ideas of [Botbol-Dickenstein-Dohm-09] and it was implemented in…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
We compute the class of arithmetic genus two Teichmueller curves in the Picard group of pseudo-Hilbert modular surfaces, distinguished according to their torsion order and spin invariant. As an application, we compute the number of genus…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
Given a set of $n$ distinct real numbers, our goal is to form a symmetric, unreduced, tridiagonal, matrix with those numbers as eigenvalues. We give an algorithm which is a stable implementation of a naive algorithm forming the…
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
New algorithms are presented for computing annihilating polynomials of Toeplitz, Hankel, and more generally Toeplitz+ Hankel-like matrices over a field. Our approach follows works on Coppersmith's block Wiedemann method with structured…
In this note, we study properties of the gradient map of the isoparametric polynomial. For a given isoparametric hypersurface in sphere, we calculate explicitly the gradient map of its isoparametric polynomial which turns out many…