Related papers: Hypergeometric L-functions in average polynomial t…

In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…

Let $p$ be an odd prime and $q=p^r$, $r\geq 1$. For positive integers $n$, let ${_n}G_n[\cdots]_q$ denote McCarthy's $p$-adic hypergeometric functions. In this article, we prove an identity expressing a ${_4}G_4[\cdots]_q$ hypergeometric…

Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

We consider random mappings on n = kr nodes with preimage sizes restricted to a set of the form {0,k}, where k = k(r) is greater than 1. We prove that T, the least common multiple of the cycle lengths, and B= the product of the cycle…

In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…

We present a randomized algorithm for estimating the $p$th moment $F_p$ of the frequency vector of a data stream in the general update (turnstile) model to within a multiplicative factor of $1 \pm \epsilon$, for $p > 2$, with high constant…

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…

This paper addresses a general method of polynomial transformation of hypergeometric equations. Examples of some classical special equations of mathematical physics are generated. Heun's equation and exceptional Jacobi polynomials are also…

In this paper, we study differentially private (DP) algorithms for computing the geometric median (GM) of a dataset: Given $n$ points, $x_1,\dots,x_n$ in $\mathbb{R}^d$, the goal is to find a point $\theta$ that minimizes the sum of the…

We prove a unified trace-average formula for the $k$-th higher trace $\lambda_k(A)=\operatorname{tr}(\Lambda^k A)$ of a linear operator $A$ on a finite-dimensional normed space. The formula averages the matrix coefficient…

Using the Kuznetsov trace formula, we prove a spectral decomposition for the sums of generalized Dirichlet $L$-functions. Among applications are an explicit formula relating norms of prime geodesics to moments of symmetric square…

Let $K$ be a fixed number field, assumed to be Galois over $\mathbb Q$. Let $r$ and $f$ be fixed integers with $f$ positive. Given an elliptic curve $E$, defined over $K$, we consider the problem of counting the number of degree $f$ prime…

The established technique of eliminating upper or lower parameters in a general hypergeometric series is profitably exploited to create pathways among confluent hypergeometric functions, binomial functions, Bessel functions, and exponential…

We prove upper bounds for the mean square of the remainder in the prime geodesic theorem, for every cofinite Fuchsian group, which improve on average on the best known pointwise bounds. The proof relies on the Selberg trace formula. For the…

The generalization of the factorization method performed by Mielnik [J. Math. Phys. {\bf 25}, 3387 (1984)] opened new ways to generate exactly solvable potentials in quantum mechanics. We present an application of Mielnik's method to…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We establish some partial fraction identities for rational functions whose denominators are implicit products of the cyclotomic polynomials. To achieve this, we first develop a general algebraic approach for partial fraction decomposition…

The problem of generating random samples of high-dimensional posterior distributions is considered. The main results consist of non-asymptotic computational guarantees for Langevin-type MCMC algorithms which scale polynomially in key…

We apply transformer models and feedforward neural networks to predict Frobenius traces $a_p$ from elliptic curves given other traces $a_q$. We train further models to predict $a_p \bmod 2$ from $a_q \bmod 2$, and cross-analysis such as…