Related papers: An algorithm to compute the Teichmueller polynomia…
We propose a general framework for studying pseudo-Anosov homeomorphisms on translation surfaces. This new approach, among other consequences, allows us to compute the systole of the Teichmueller geodesic flow restricted to the…
We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
In this paper, we presents a method for factoring morphisms between arithmetic surfaces based on the regularity of arithmetic surfaces. Using this factorization, we derive a Riemann-Hurwitz formula satisfied by the ramification divisor and…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.
This paper extends the decorated Teichm\"uller theory developed before for punctured surfaces to the setting of ``bordered'' surfaces, i.e., surfaces with boundary, and there is non-trivial new structure discovered. The main new result…
Methods of parabolic geometries have been recently used to construct a class of elliptic complexes on quaternionic manifolds, the Salamon's complex being the simplest case. The purpose of this paper is to describe an algorithm how to…
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
In this note we consider the Milnor fiber $F$ associated to a reduced projective plane curve $C$. A computational approach for the determination of the characteristic polynomial of the monodromy action on the first cohomology group of $F$,…
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We survey our recently proposed method for constructing biholomorphic invariants of quasihomogeneous isolated hypersurface singularities and, more generally, invariants of graded Artinian Gorenstein algebras. The method utilizes certain…
Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…
The A-polynomial encodes hyperbolic geometric information on knots and related manifolds. Historically, it has been difficult to compute, and particularly difficult to determine A-polynomials of infinite families of knots. Here, we compute…
In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when…
A parameterized surface can be represented as a projection from a certain toric surface. This generalizes the classical homogeneous and bihomogeneous parameterizations. We extend to the toric case two methods for computing the implicit…
We give an approximate algorithm of computing holonomic systems of linear differential equations for definite integrals with parameters. We show that this algorithm gives a correct answer in finite steps, but we have no general stopping…