Related papers: An algorithm to compute the Teichmueller polynomia…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
We investigate the representation theory of the polynomial core of the quantum Teichmuller space of a punctured surface S. This is a purely algebraic object, closely related to the combinatorics of the simplicial complex of ideal cell…
We use meromorphic quadratic differentials with higher order poles to parametrize the Teichm\"uller space of crowned hyperbolic surfaces. Such a surface is obtained on uniformizing a compact Riemann surface with marked points on its…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We develop an approach to calculating the cup and cap products on Hochschild cohomology and homology of curved algebras associated with polynomials and their finite abelian symmetry groups. For polynomials with isolated critical points, the…
This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…
An almost-toric hypersurface is parameterized by monomials multiplied by polynomials in one extra variable. We determine the Newton polytope of such a hypersurface, and apply this to give an algorithm for computing the implicit equation.
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
We present a method for calculating the Brauer group of a surface given by a diagonal equation in the projective space. For diagonal quartic surfaces with coefficients in Q we determine the Brauer groups over Q and Q(i).
We construct and study a natural homeomorphism between the moduli space of polynomial cubic differentials of degree d on the complex plane and the space of projective equivalence classes of oriented convex polygons with d+3 vertices. This…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
Let $\Omega$ be a bounded domain of $\mathbb{R}^3$ whose closure $\overline{\Omega}$ is polyhedral, and let $\mathcal{T}$ be a triangulation of $\overline{\Omega}$. Assuming that the boundary of $\Omega$ is sufficiently regular, we provide…
We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…
We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…
The concept of an adapted homology basis for a prime order conformal automorphism of a compact Riemann surface extends to arbitrary finite groups of conformal automorphisms. Here we compute some examples of adapted homology bases for some…