Related papers: Hypergeometric L-functions in average polynomial t…
Consider the problem of finding a point in an ultrametric space with the minimum average distance to all points. We give this problem a Monte Carlo $O((\log^2(1/\epsilon))/\epsilon^3)$-time $(1+\epsilon)$-approximation algorithm for all…
Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.
We study a modification of the hyperbolic circle problem: instead of all elements of a Fuchsian group $\Gamma$, we consider the double cosets by two hyperbolic subgroups. This has a geometric interpretation in terms of the number of common…
Exploiting the equidistribution properties of polynomial sequences, following the methods developed by Leibman ("Pointwise Convergence of ergodic averages for polynomial sequences of translations on a nilmanifold. Ergodic Theory Dynam.…
We use the relative trace formula to obtain exact formulas for central values of certain twisted quadratic base change L-functions averaged over Hilbert modular forms of a fixed weight and level. We apply these formulas to the subconvexity…
Let $A$ be a Dedekind domain, $K$ the fraction field, $\p$ a non-zero prime ideal of $A$, and $K_\pp$ the completion of $K$ with respect to the $\p$-adic topology. At the input of a monic irreducible separable polynomial, $f(x)\in A[x]$,…
We study the task of learning latent-variable models. A common algorithmic technique for this task is the method of moments. Unfortunately, moment-based approaches are hampered by the fact that the moment tensors of super-constant degree…
Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian which gave, together with G.Singh, an algorithm to compute their Groebner bases. Although their algorithm has polynomial complexity when the chain modules are…
A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…
Consider positive integral solutions $x \in \mathbb{Z}^{n+1}$ to the equation $a_0 x_0 + \ldots + a_n x_n = t$. In the so called unbounded subset sum problem, the objective is to decide whether such a solution exists, whereas in the…
We give an exposition of Dwork's construction of Frobenius structures associated to generalized hypergeometric equations via the interpretation of the latter due to Gelfand-Kapranov-Zelevinsky in the language of A-hypergeometric systems. As…
In this paper, we present a probabilistic algorithm to compute the number of $\mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes…
We prove a general formula for the $p$-adic heights of Heegner points on modular abelian varieties with potentially ordinary (good or semistable) reduction at the primes above $p$. The formula is in terms of the cyclotomic derivative of a…
We describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
A simple algorithm with quasi-linear time complexity and linear space complexity for the evaluation of the hypergeometric series with rational coefficients is constructed. It is shown that this algorithm is suitable in practical informatics…
In the combinatorial method proving of $L^p$-improving estimates for averages along curves pioneered by Christ (IMRN, 1998), it is desirable to estimate the average modulus (with respect to some uniform measure on a set) of a…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
A standard observation in algebraic geometry and number theory is that a ramified cover of an algebraic variety $\widetilde{X}\rightarrow X$ over a finite field $F_q$ furnishes the rational points $x\in X(F_q)$ with additional arithmetic…