Related papers: On computations of Hurwitz-Hodge integrals
In this paper we describe various applications of the Riemann-Hilbert method to the theory of orthogonal polynomials on the line and on the circle.
The Hodge-FVH correspondence establishes a relationship between the special cubic Hodge integrals and an integrable hierarchy, which is called the fractional Volterra hierarchy. In this paper we prove this correspondence. As an application…
Hodge classes on the moduli space of admissible covers with monodromy group G are associated to irreducible representations of G. We evaluate all linear Hodge integrals over moduli spaces of admissible covers with abelian monodromy in terms…
Ribbon decomposition is a way to obtain a surface with boundary (compact, not necessarily oriented) from a collection of disks by joining them with narrow ribbons attached to segments of the boundary. Counting ribbon decompositions gives…
We prove sum formulas for double polylogarithms of Hurwitz type, that is, involving a shifting parameter $b$ in the denominator. These formulas especially imply well-known sum formulas for double zeta values, and sum formulas for double…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
A method for computing integrals of polynomial functions on compact symmetric spaces is given. Those integrals are expressed as sums of functions on symmetric groups.
In this study, we obtain new classes of linear codes over Hurwitz integers equipped with a new metric. We refer to the metric as Hurwitz metric. The codes with respect to Hurwitz metric use in coded modu- lation schemes based on quadrature…
We compute the integrals of products of Hermite functions using the generating functions. The precise asymptotics of 4 Hermite functions are presented below. This estimate is relevant for the corresponding cubic nonlinear equation.
On construit les champs de Hurwitz et on en donne quelques propri\'et\'es, essentiellement contenues dans SGA 1. Quelques applications de nature arithm\'etique en sont d\'eduites. We propose a construction of Hurwitz stacks and give some…
We provide a closed form expression for linear Hodge integrals on the hyperelliptic locus. Specifically, we find a succinct combinatorial formula for all intersection numbers on the hyperelliptic locus with one $\lambda$-class, and powers…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
We propose a method for obtaining rigorous and accurate upper and lower bounds on the eigenvalues of ordinary and partial differential operators in bounded regions of Euclidean space. It uses a boundary condition homotopy method starting…
In this review article, we report on some recent advances on the computational aspects of cohomology intersection numbers of GKZ systems developed in \cite{GM}, \cite{MH}, \cite{MT} and \cite{MT2}. We also discuss the relation between…
In this paper we construct a $\hat\mathbb{Z}$-valued measure on $\hat\mathbb{Z}$ which interpolates $p$-adic Hurwitz zeta functions for all $p$.
We describe a method to compute the inverse Mellin transform of holonomic sequences, that is based on a method to compute the Mellin transform of holonomic functions. Both methods are implemented in the computer algebra package…
A systematic procedure to numerically compute a horseshoe map is presented. This new method uses piecewise functions and expresses the required operations by means of elementary transformations, such as translations, scalings, projections…
In this note, we give a simple method for computing the column sums of the Sonnenschein summability matrices.
We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound. Earlier computational…
We give some formulas of the James-Hopf maps by using combinatorial methods. An application is to give a product decomposition of the spaces $\Omega\Sigma^2(X)$.