Related papers: A fast algorithm to compute the Ramanujan-Deninger…

Grover's algorithm is a fundamental quantum algorithm that achieves a quadratic speedup for unstructured search problems of size $N$. Recent studies have reformulated this task as a maximization problem on the unitary manifold and solved it…

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

In this paper, we investigate large values of Dirichlet character sums with multiplicative coefficients $\sum_{n\le N}f(n)\chi(n)$. We prove a new Omega result in the region $\exp((\log q)^{\frac12+\delta})\le N\le\sqrt q$, where $q$ is the…

For a positive integer $q\not\equiv 2 \pmod 4$, this work considers the fourth moment of Dirichlet $L$-functions averaged over both $t\in [0,T]$ and primitive characters to modulus $q$. An asymptotic formula with a power saving from both…

Let $\chi$ be a primitive Dirichlet character whose conductor $q$ is a prime number. For the certain averages of values of $\log |L(s, \chi)|$ in $q$-aspect at a fixed $s=\sigma>1/2$, under Generalized Riemann Hypothesis (GRH), we explain…

We generalize Ramanujan's expansions of the fractional-power Euler functions (q^{1/5})_{\infty} = [ J_1 - q^{1/5} + q^{2/5} J_2 ](q^5)_{\infty} and (q^{1/7})_{\infty} = [ J_1 + q^{1/7} J_2 - q^{2/7} + q^{5/7} J_3 ] (q^7)_{\infty} to…

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

A unified fast time-stepping method for both fractional integral and derivative operators is proposed. The fractional operator is decomposed into a local part with memory length $\Delta T$ and a history part, where the local part is…

This paper contains new explicit upper bounds for the number of zeroes of Dirichlet L-functions and Dedekind zeta-functions in rectangles.

For each primitive Dirichlet character $\chi$, a hypothesis ${\rm GRH}^\dagger[\chi]$ is formulated in terms of zeros of the associated $L$-function $L(s,\chi)$. It is shown that for any such character, ${\rm GRH}^\dagger[\chi]$ is…

We present an algorithm to compute the Hecke operators on the equivariant cohomology of an arithmetic subgroup $\Gamma$ of the general linear group $\mathrm{GL}_n$. This includes $\mathrm{GL}_n$ over a number field or a finite-dimensional…

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…

We have used the first 2600 nontrivial zeros gamma_l of the Riemann zeta function calculated with 1000 digits accuracy and developed them into the continued fractions. We calculated the geometrical means of the denominators of these…

We study the 2k-th power moment of Dirichlet L-functions L(s,\chi) at the centre of the critical strip (s=1/2), where the average is over all primitive characters \chi (mod q). We extend to this case the hybrid Euler-Hadamard product…

We study the problem of detecting outlier pairs of strongly correlated variables among a collection of $n$ variables with otherwise weak pairwise correlations. After normalization, this task amounts to the geometric task where we are given…

Let ${\mathfrak S}_n$ denote the symmetric group with $n$ letters, and $g(n)$ the maximal order of an element of ${\mathfrak S}_n$. If the standard factorization of $M$ into primes is $M=q_1^{\al_1}q_2^{\al_2}... q_k^{\al_k}$, we define…

Let $q$ be a positive integer ($\geq 2$), $\chi$ be a Dirichlet character modulo $q$, $L(s, \chi)$ be the attached Dirichlet $L$-function, and let $L^\prime(s, \chi)$ denote its derivative with respect to the complex variable $s$. Let $t_0$…

Random matrix theory has successfully modeled many systems in physics and mathematics, and often the analysis and results in one area guide development in the other. Hughes and Rudnick computed $1$-level density statistics for low-lying…

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…