Related papers: Explicit Coleman Integration in Larger Characteris…

We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…

We derive the recurrence relations for relativistic Coulomb integrals directly from the integral representations with the help of computer algebra methods. In order to manage the computational complexity of this problem, we employ holonomic…

This article presents a compact implementation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. Each iteration of the algorithm consists of applying a pair of complementary Gauss-Jordan…

We consider convolution integral equations on a finite interval with a real-valued kernel of even parity, a problem equivalent to finding a Wiener-Hopf factorisation of a notoriously difficult class of $2\times 2$ matrices. The kernel…

We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…

The $\varepsilon$-form of a system of differential equations for Feynman integrals has led to tremendeous progress in our abilities to compute Feynman integrals, as long as they fall into the class of multiple polylogarithms. It is…

Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. For the first time, the article proposes for arbitrary Hamiltonians similar integrators,…

We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two…

We study fourth-order quasilinear elliptic problems that involve the p-biharmonic operator and Navier boundary conditions. The nonlinear term grows at the critical Sobolev rate. Starting from a Hamiltonian system of two second-order…

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…

Motivated by applications in point counting algorithms using p-adic cohomology, we give an explicit description of integral lattices in rigid cohomology spaces that p-adically approximate logarithmic crystalline cohomology modules. These…

Let $p$ be an odd prime number. In this article, we study the variation of Iwasawa invariants among $p$-congruent elliptic curves over certain $p$-adic Lie extensions. We investigate both the classical Selmer group as well as the fine…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

The main objective of this article is to establish the $p$-adic Artin formalism for the algebraic $p$-adic $L$-functions attached to the adjoint representations of Coleman families of modular forms. In particular, we prove a factorization…

We present a Ritz-Galerkin discretization on sparse grids using pre-wavelets, which allows to solve elliptic differential equations with variable coefficients for dimension $d=2,3$ and higher dimensions $d>3$. The method applies multilinear…

In this study, we address the challenge of solving elliptic equations with quasiperiodic coefficients. To achieve accurate and efficient computation, we introduce the projection method, which enables the embedding of quasiperiodic systems…

We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…

Let $p\ge5$ be a prime number. Let $E/\mathbb{Q}$ be an elliptic curve with complex multiplication by an imaginary quadratic field $K$ such that $p$ is inert in $K$ and that $E$ has good reduction at $p$. Let $K_\infty$ be the…

We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…

We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…