Related papers: A fast algorithm to compute the Ramanujan-Deninger…
We derive a systematic Lagrangian approach for quantum gravity in the super-Planckian limit where $s\gg M_{pl}^2\gg t$. The action can be used to calculate to arbitrary accuracy in the quantum and classical expansion parameters $\alpha_Q=…
We derive a method to efficiently compute the Green function of on arbitrary Hamiltonians defined on semi-infinite and periodic quasi-one-dimensional lattices. Computing the Green function is the backbone of quantum transport, electronic…
Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…
Let $G = (V,E,w)$ be a weighted undirected graph on $|V| = n$ vertices and $|E| = m$ edges, let $k \ge 1$ be any integer, and let $\epsilon < 1$ be any parameter. We present the following results on fast constructions of spanners with…
We prove a formula, with power savings, for the sixth moment of Dirichlet L-functions averaged over moduli $q$, over primitive characters $\chi$ modulo $q$, and over the critical line. Our formula agrees precisely with predictions motivated…
Let $m\ge 1$ be a rational integer. We give an explicit formula for the mean value $$\frac{2}{\phi(f)}\sum_{\chi (-1)=(-1)^m}\vert L(m,\chi )\vert^2,$$ where $\chi$ ranges over the $\phi (f)/2$ Dirichlet characters modulo $f>2$ with the…
We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space $L(D)$ associated to a divisor $D$ on a projective nodal plane curve $\mathcal C$ over a sufficiently large perfect field $k$.…
This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self adjoint positive operators in Hilbert spaces.…
This paper is a sequel to "Computing diagonal form and Jacobson normal form of a matrix using Groebner bases", J. of Symb. Computation, 46 (5), 2011. We present a new fraction-free algorithm for the computation of a diagonal form of a…
As a generalization of the results [KW3],we study the functional equation of the higher Selberg zeta function for congruence subgroups. To obtain the gamma factor of this function, we introduce a higher Dirichlet $L$-function. Then we…
In this paper, we introduce the little $\mu$-function, which is obtained as a degenerate limit of the generalized $\mu$-function. We derive the little $\mu$-function as the image of the $q$-Borel summation of a divergent solution to the…
The need to compute small con-eigenvalues and the associated con-eigenvectors of positive-definite Cauchy matrices naturally arises when constructing rational approximations with a (near) optimally small $L^{\infty}$ error. Specifically,…
The logarithm-determinant is an widely-present operation in many areas of physics and computer science. Derivatives of the logarithm-determinant compute physically relevant quantities in statistical physics models, quantum field theories,…
In this paper, we give a quadratic Goldreich-Levin algorithm that is close to optimal in the following ways. Given a bounded function $f$ on the Boolean hypercube $\mathbb{F}_2^n$ and any $\varepsilon>0$, the algorithm returns a quadratic…
We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…
We introduce the generalized degenerate Euler-Genocchi polynomials as a degenerate version of the Euler-Genocchi polynomials. In addition, we introduce their higher-order version, namely the generalized degenerate Euler-Genocchi polynomials…
The Fokker-Planck equation models rare events across sciences, but its high-dimensional nature challenges classical computers. Quantum algorithms for such non-unitary dynamics often suffer from exponential {decay in} success probability. We…
The Goldreich-Levin algorithm was originally proposed for a cryptographic purpose and then applied to learning. The algorithm is to find some larger Walsh coefficients of an $n$ variable Boolean function. Roughly speaking, it takes a…
GJMS operator determinants in odd dimensions are quickly computed for scalar and spinor fields in both sub- and super-critical cases as sums of Dirichlet eta functions with polynomials in the (integer) operator order as coefficients.
We study recursive algorithm for computing DCT of lengths $N=q 2^m$ ($m,q \in \mathbb{N}$, $q$ is odd) due to C.W.Kok. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor…