Related papers: An algorithm to compute the Teichmueller polynomia…
Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
Recent discoveries make it possible to compute the K-theory of certain rings from their cyclic homology and certain versions of their cdh-cohomology. We extend the work of G. Corti\~nas et al. who calculated the K-theory of, in addition to…
We continue with the ideas of Bonatti-Langevin-Jeandenans towards a constructive and algorithmic classification of pseudo-Anosov homeomorphisms (possibly with spines), up to topological conjugacy. We begin by indicating how to assign to…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chv\'atal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a…
Thom polynomial describes the cohomology class Poincar\'e dual to the locus of particular singularity of a generic holomorphic map. In this paper we derive a closed formula for the generating function of its coefficients. The method is…
We classify hyperbolic polynomials in two real variables that admit a transitive action on some component of their hyperbolic level sets. Such surfaces are called special homogeneous surfaces, and they are equipped with a natural Riemannian…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…
In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
The numerical values extracted from a graph that indicates its topology are called topological indices. A contemporary and efficient method is to compute a graph's topological indices using the graph polynomial that corresponds to it. This…
The purpose of this article is to show how one might compute the \'etale cohomology groups $H^p_{\acute{e}t}(X,G_m)$ in degrees $p=0$, $1$ and $2$ of a toric variety $X$ with coefficients in the sheaf of units. The method is to reduce the…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
A simple algorithm to compute all the zeros of a generic polynomial is proposed.
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…