Related papers: Elementary Integration of Superelliptic Integrals

Consider a hyperelliptic integral $I=\int P/(Q\sqrt{S}) dx$, $P,Q,S\in\mathbb{K}[x]$, with $[\mathbb{K}:\mathbb{Q}]<\infty$. When $S$ is of degree $\leq 4$, such integral can be calculated in terms of elementary functions and elliptic…

We study high dimensional integration in the quantum model of computation. We develop quantum algorithms for integration of functions from Sobolev classes $W^r_p([0,1]^d)$ and analyze their convergence rates. We also prove lower bounds…

We have already dealt with the problem of solving First Order Differential Equations (1ODEs) presenting elementary functions before in [1, 2]. In this present paper, we have established solid theoretical basis through a relation between the…

We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…

The complete elliptic integral of the first and second kind, K(k) and E(k), appear in a multitude of physics and engineering applications. Because there is no known closed-form, the exact values have to be computed numerically. Here,…

We introduce a method for computing some pseudo-elliptic integrals in terms of elementary functions. The method is simple and fast in comparison to the algebraic case of the Risch-Trager-Bronstein algorithm. This method can quickly solve…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…

For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…

Let $\ell$ be an odd prime, $q$ an odd prime power such that $q \not\equiv 0 \pmod \ell$, and $m$ the order of $q$ in $\F_\ell^\times$. We propose an explicit $L$-polynomial of hyperelliptic function field $K:=\F_q(T,…

Let f(x) be a polynomial of degree at least 5 with complex coefficients and without repeated roots. Let p be an odd prime. Suppose that all the coefficients of f(x) lie in a subfield K such that: 1) K contains a primitive p-th root of…

We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…

A variable stepsize exponential multistep integrator, with contour integral approximation of the operator-valued exponential functions, is proposed for solving semilinear parabolic equations with nonsmooth initial data. By this approach,…

Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analysis, discrete geometry and analytic number theory research.…

This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…

In this paper we treat certain elliptic and hyper-elliptic integrals in a unified way. We introduce a new basis of these integrals coming from certain basis ${\phi}_n(x)$ of polynomials and show that the transition matrix between this basis…

Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.

We present a systematic study of integrals over [0,1] where the integrand is of the form Q(x) log log 1/x. Here Q is a rational function.

Here we present an algorithm to find elementary first integrals of rational second order ordinary differential equations (SOODEs). In \cite{PS2}, we have presented the first algorithmic way to deal with SOODEs, introducing the basis for the…

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

The complete elliptic integral of the first kind (CEI-1) plays a significant role in mathematics, physics and engineering. There is no simple formula for its computation, thus numerical algorithms are essential for coping with the practical…