Related papers: Rigorous expansions of modular forms at CM points,…
Added a short section to show as to calculate the $p$-term of the Hasse-Weil $L$-function of certain modular curves.
We consider probabilistic shaping to maximize the achievable information rate of coded modulation (CM) with hard decision decoding. The proposed scheme using binary staircase codes outperforms its uniform CM counterpart by more than 1.3 dB…
We give an algorithm to compute term by term multivariate Puiseux series expansions of series arising as local parametrizations of zeroes of systems of algebraic equations at singular points. The algorithm is an extension of Newton's method…
We describe the complex multiplication (CM) values of modular functions for $\Gamma_0(N)$ whose divisor is given by a linear combination of Heegner divisors in terms of special cycles on the stack of CM elliptic curves. In particular, our…
We study the possible weights of an irreducible 2-dimensional modular mod p representation of the absolute Galois group of F, where F is a totally real field which is totally ramified at p, and the representation is tamely ramified at the…
Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…
We show that an iterative method for computing the center of mass (CM) of q units of mass, placed on a unit interval [0, 1] along the x- axis, give rise to a simple procedure for expanding rational numbers less than unity in powers of r/s <…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
We study the equation $(x-4r)^3 + (x-3r)^3 + (x-2r)^3+(x-r)^3 + x^3 + (x+r)^3+(x+2r)^3 + (x+3r)^3 + (x+4r)^3 = y^p$, which is a natural continuation of previous works carried out by A. Arg\'{a}ez-Garc\'{i}a and the fourth author (perfect…
In this article we study the fields generated by the Fourier coefficients of modular forms at arbitrary cusps. We prove that these fields are contained in certain cyclotomic extensions of the field generated by the Fourier coefficients at…
We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…
In the present paper, we introduce meromorphic Drinfeld modular forms of arbitrary rank equipped with a particular arithmeticity property. We also study their special values at CM points and show the algebraic independence of these values…
We present an algorithm to compute all Borcherds product paramodular cusp forms of a specified weight and level, describing its implementation in some detail and giving examples of its use.
Let $\Gamma$ be a cocompact, oriented Fuchsian group which is not on an explicit finite list of possible exceptions and $q$ a sufficiently large prime power not divisible by the order of any non-trivial torsion element of $\Gamma$. Then…
This paper discusses an efficient implementation of the generation of order conditions for the construction of exponential integrators like exponential splitting and Magnus-type methods in the computer algebra system Maple. At the core of…
Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…
The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…
Laguerre and Laguerre-type polynomials are orthogonal polynomials on the interval $[0,\infty)$ with respect to a weight function of the form $w(x) = x^{\alpha} e^{-Q(x)}, Q(x) = \sum_{k=0}^m q_k x^k, \alpha > -1, q_m > 0$. The classical…
The exact semiclassical quantization condition represents a cumbersome series expansion, so that only the main term of it is usually taken into account. We propose a way to find next terms without new additional calculations. Results are…