Related papers: Computing isolated coefficients of the $j$-functio…
In this expository paper, we illustrate two explicit methods which lead to special $L$-values of certain modular forms admitting complex multiplication (CM), motivated in part by properties of $L$-functions obtained from Calabi-Yau…
By means of a Fourier optimization framework, we improve the current asymptotic bounds under GRH for two classical problems in number theory: the problem of estimating the least quadratic non-residue modulo a prime, and the problem of…
We study complexified elliptic Calogero-Moser integrable systems. We determine the value of the potential at isolated extrema, as a function of the modular parameter of the torus on which the integrable system lives. We calculate the…
Let $\mathcal{E}$ be an elliptic curve over a field $\mathbf{K}$ and $\ell$ a prime. There exists an elliptic curve $\mathcal{E}^*$ related to $\mathcal{E}$ by an isogeny of degree $\ell$ only if $\Phi_\ell^t(X, j(\mathcal{E})) = 0$, where…
Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…
Let $h(x,y)$ be a non-degenerate binary cubic form with integral coefficients, and let $S$ be an arbitrary finite set of prime numbers. By a classical theorem of Mahler, there are only finitely many pairs of relatively prime integers $x,y$…
We present an algorithm that computes the composition factors of the n-th tensor power of the free associative algebra on a vector space. The composition factors admit a description in terms of certain coefficients $c_{\lambda\mu}$…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
Prunescu and Sauras-Altuzarra showed that all C-recursive sequences of natural numbers have an arithmetic div-mod representation that can be derived from their generating function. This representation consists of computing the quotient of…
We compute the coefficients of the polynomials $C_n(q)$ defined by the equation \begin{equation*} 1 + \sum_{n\geq 1} \, \frac{C_n(q)}{q^n} \, t^n = \prod_{i\geq 1}\, \frac{(1-t^i)^2}{1-(q+q^{-1})t^i + t^{2i}} \, . \end{equation*} As an…
We show that on the $d$-dimensional cube $I^d\equiv [0,1]^d$ the discrete moduli of smoothness which use only the values of the function on a diadic mesh are sufficient to determine the moduli of smoothness of that function. As an important…
We study certain cases of convoluted Fourier coefficients of $GL_n$-automorphic functions. We establish identities that express them in terms of Fourier coefficients related to unipotent orbits. The most general case that is studied is…
In this paper, we study polynomials of the form $f(x)=(x^n+x^{n-1}+...+1)^l$ for $l=1,2,3,4$ to generate a pattern titled "unique coefficient pattern". Namely, we analyze each unique coefficient patterns of $f(x)$ and generate functions…
We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…
In this paper, we introduce quotients of \'etale groupoids. Using the notion of quotients, we describe the abelianizations of groupoid C*-algebras. As another application, we obtain a simple proof that effectiveness of an \'etale groupoid…
Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…
A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…
Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…