Related papers: A nearly-optimal method to compute the truncated t…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We present a randomised algorithm to compute the local zeta function of a fixed smooth, projective surface over $\mathbb{Q}$, at any large prime $p$ of good reduction. The runtime of our algorithm is polynomial in $\log p$, resolving a…
We present a simple, general technique for reducing the sample complexity of matrix and tensor decomposition algorithms applied to distributions. We use the technique to give a polynomial-time algorithm for standard ICA with sample…
We prove tail and moment inequalities for multiple stochastic integrals on the Poisson space and for Poisson $U$-statistics. We use them to demonstrate the Law of the Iterated Logarithm for these processes when the intensity of the Poisson…
We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and…
We give a weighted sum formula for the double polylogarithm in two variables, from which we can recover the classical weighted sum formulas for double zeta values, double $T$-values, and some double $L$-values. Also presented is a…
The aim of this paper is to develop analytic techniques to deal with certain monotonicity of combinatorial sequences. (1) A criterion for the monotonicity of the function $\sqrt[x]{f(x)}$ is given, which is a continuous analog for one…
The solution of the Poisson equation is a ubiquitous problem in computational astrophysics. Most notably, the treatment of self-gravitating flows involves the Poisson equation for the gravitational field. In hydrodynamics codes using…
We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…
We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse…
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.…
An algorithm to compute Dirichlet $L$-functions for many quadratic characters is derived. The algorithm is optimal (up to logarithmic factors) provided that the conductors of the characters under consideration span a dyadic window.
We improve upon the traditional error term in the truncated Perron formula for the logarithm of an $L$-function. All our constants are explicit.
For a sample of Exponentially distributed durations we aim at point estimation and a confidence interval for its parameter. A duration is only observed if it has ended within a certain time interval, determined by a Uniform distribution.…
We obtain formulas for the coefficients of positive and negative powers of a partial theta function.
We generalize techniques of Addison to a vastly larger context. We obtain integral representations in terms of the first periodic Bernoulli polynomial for a number of important special functions including the Lerch zeta, polylogarithm,…
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step.…
We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
Simple unsmoothed formulas to compute the Riemann zeta function, and Dirichlet $L$-functions to a power-full modulus, are derived by elementary means (Taylor expansions and the geometric series). The formulas enable square-root of the…