Related papers: An algorithm to compute the differential equations…
Based on functional analysis, we propose an algorithm for finite-norm solutions of higher-order linear Fuchsian-type ordinary differential equations (ODEs) P(x,d/dx)f(x)=0 with P(x,d/dx):=[\sum_m p_m (x) (d/dx)^m] by using only the four…
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method which first projects the solutions of a system onto the $x$-…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
We consider deep neural networks, in which the output of each node is a quadratic function of its inputs. Similar to other deep architectures, these networks can compactly represent any function on a finite training set. The main goal of…
The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial…
We present a method to compute the Fermi function of the Hamiltonian for a system of independent fermions, based on an exact decomposition of the grand-canonical potential. This scheme does not rely on the localization of the orbitals and…
A method for construction of analytic function f of the annihilation operator is given for the first time. f(z) is analytic on some compact domain that does not separate the complex plane. A new form of the identity is given, which is well…
In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We present a quantum algorithm for estimating the matrix determinant based on quantum spectral sampling. The algorithm estimates the logarithm of the determinant of an $n \times n$ positive sparse matrix to an accuracy $\epsilon$ in time…
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We present an efficient algorithm for calculating multiloop Feynman integrals perturbatively.
In algebraic geometry, one studies the solutions to polynomial equations, or, equivalently, to linear partial differential equations with constant coefficients. These lecture notes address the more general case when the coefficients are…
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…
We present a method to compute the holonomic extension of a $D$-module from a Zariski open set in affine space to the whole space. A particular application is the localization of coherent $D$-modules which are holonomic on the complement of…
We study a generalized Chebyshev oscillator [1] associated with a point interaction for the discrete Schr\"odinger equation. Our goal is to find a realization of the annihilation operator for this oscillator by a differential operator. This…
We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…