Related papers: Efficient computation of the Euler-Kronecker const…

We consider a general class of Fourier coefficients for an automorphic form on a finite cover of a reductive adelic group ${\bf G}(\mathbb{A}_{\mathbb{K}})$, associated to the data of a `Whittaker pair'. We describe a quasi-order on Fourier…

We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr\"obner bases. We present a novel scalable algorithm which combines the two approaches and leads to the…

Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…

The rich history of prime numbers includes great names such as Euclid, who first analytically studied the prime numbers and proved that there is an infinite number of them, Euler, who introduced the function $\zeta(s)\equiv\sum_{n=1}^\infty…

We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from…

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

In computational molecular science, calculation of electrostatic interactions involving charged atoms - the strongest interactions in condensed phases, is a major bottleneck. We propose a quantum-classical algorithm for fast, yet, accurate…

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…

An efficient decoder for the generalized first-order Reed-Muller code RM_q(1,m) is essential for the decoding of various block-coding schemes for orthogonal frequency-division multiplexing with reduced peak-to-mean power ratio. We present…

Let $$ T(q)=\sum_{k=1}^\infty d(k) q^k, \quad |q|<1, $$ where $d(k)$ denotes the number of positive divisors of the natural number $k$. We present monotonicity properties of functions defined in terms of $T$. More specifically, we proved…

We describe modern variants of Monte Carlo methods for Uncertainty Quantification (UQ) of the Neutron Transport Equation, when it is approximated by the discrete ordinates method with diamond differencing. We focus on the mono-energetic 1D…

Optimizing quantum circuits is critical: the number of quantum operations needs to be minimized for a successful evaluation of a circuit on a quantum processor. In this paper we unify two disparate ideas for optimizing quantum circuits,…

In this note, we obtain an exact formula for the $q$-adic valuation of $\sigma_k(n)$ where $q$ is an odd prime, allowing us to derive an explicit upper bound which is asymptotically better than the previous bound obtained by Zhao when $n$…

Let $q=p^{e}$ be a prime power, $\ell$ be a prime number different from $p$, and $n$ be a positive integer divisible by neither $p$ nor $\ell$. In this paper we define the $\ell$-adic $q$-cyclotomic system $\mathcal{PC}(\ell,q,n)$ with base…

In this paper, we prove that $K_G(3)<K_G(4)$, where $K_G(d)$ denotes the Grothendieck constant of order $d$. To this end, we use a branch-and-bound algorithm commonly used in the solution of NP-hard problems. It has recently been proven…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

In this paper, we define a new subclass of $k$-uniformly starlike functions of order $\gamma,\ (0\leq\gamma<1)$ by using certain generalized $q$-integral operator. We explore geometric interpretation of the functions in this class by…

Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…

We provide several new $q$-congruences for truncated basic hypergeometric series with the base being an even power of $q$. Our results mainly concern congruences modulo the square or the cube of a cyclotomic polynomial and complement…

We prove a higher order generalization of Glaeser inequality, according to which one can estimate the first derivative of a function in terms of the function itself, and the Holder constant of its k-th derivative. We apply these…