Related papers: An algorithm to compute the Teichmueller polynomia…
We first introduce global arithmetic cohomology groups for quasi-coherent sheaves on arithmetic varieties, adopting an adelic approach. Then, we establish fundamental properties, such as topological duality and inductive long exact…
We give a formula to estimate the number of fixed points of a pseudo-Anosov homeomorphism of a surface. When the homeomorphism satisfies a mild property called strong irreducibility, the log of the number of fixed points is coarsely equal…
The purpose of this paper is to lay the foundations of a theory of invariants in \'etale cohomology for smooth Artin stacks. We compute the invariants in the case of the stack of elliptic curves, and we use the theory we developed to get…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
We construct a graph complex calculating the integral ho- mology of the bordered mapping class groups. We compute the ho- mology of the bordered mapping class groups of various surfaces. Using the circle action on this graph complex, we…
We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
Let $f:\CN \rightarrow \C $ be a polynomial, which is transversal (or regular) at infinity. Let $\U=\CN\setminus f^{-1}(0)$ be the corresponding affine hypersurface complement. By using the peripheral complex associated to $f$, we give…
We define twisted Alexander polynomials of a complex hypersurface with arbitrary singularities. These generalize the classical Alexander polynomials of high dimensional hypersurfaces and the twisted Alexander polynomial of plane curves. We…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
The simplest version of the Spin-polynomial invariants of the underlying differentiable structures of algebraic surfaces were considered and the simplest arguments were used in order to distinguish the underlying smooth structures of…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
A method is presented for constructing closed surfaces out of Euclidean polygons with infinitely many segment identifications along the boundary. The metric on the quotient is identified. A sufficient condition is presented which guarantees…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…