Related papers: An algorithm to compute the differential equations…
The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier…
Let $O_X$ (resp. $D_X$) be the sheaf of holomorphic functions (resp. the sheaf of linear differential operators with holomorphic coefficients) on $X$ (=the complex affine n-space). Let $Y$ be a locally weakly quasi-homogeneous free divisor…
For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
We give an algorithm to compute the local $b$ function. In this algorithm, we use the Mora division algorithm in the ring of differential operators and an approximate division algorithm in the ring of differential operators with power…
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…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…
Feynman integrals are solutions to linear partial differential equations with polynomial coefficients. Using a triangle integral with general exponents as a case in point, we compare $D$-module methods to dedicated methods developed for…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…
Given an n x n matrix over the ring of differential polynomials F(t)[\D;\delta], we show how to compute the Hermite form H of A, and a unimodular matrix U such that UA=H. The algorithm requires a polynomial number of operations in terms of…
We give an approximate algorithm of computing holonomic systems of linear differential equations for definite integrals with parameters. We show that this algorithm gives a correct answer in finite steps, but we have no general stopping…
The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…
In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric…
We give an algorithm to compute the following cohomology groups on $U = \C^n \setminus V(f)$ for any non-zero polynomial $f \in \Q[x_1, ..., x_n]$; 1. $H^k(U, \C_U)$, $\C_U$ is the constant sheaf on $U$ with stalk $\C$. 2. $H^k(U, \Vsc)$,…
In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…
In the first part we deepen the six-functor theory of (holonomic) logarithmic D-modules, in particular with respect to duality and pushforward along projective morphisms. Then, inspired by work of Ogus, we define a logarithmic analogue of…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…