Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

A short note on inadmissible coefficients of weight 2 and 2k+1 newforms

2021
Journal Articles

Abstract

Let f(z)=q+∑n≥2a(n)qn be a weight k normalized newform with integer coefficients and trivial residual mod 2 Galois representation. We extend the results of Amir and Hong in Amir and Hong (On L-functions of modular elliptic curves and certain K3 surfaces, Ramanujan J, 2021) for k=2 by ruling out or locating all odd prime values |ℓ|

Official source

2021
Journal Articles

Abstract

Official source

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Related concepts (27)

Quadratic residue

In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract mathematical concept from the branch of number theory known as modular arithmetic, quadratic residues are now used in applications ranging from acoustical engineering to cryptography and the factoring of large numbers.

Quadratic reciprocity

In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is: Let p and q be distinct odd prime numbers, and define the Legendre symbol as: Then: This law, together with its supplements, allows the easy calculation of any Legendre symbol, making it possible to determine whether there is an integer solution for any quadratic equation of the form for an odd prime ; that is, to determine the "perfect squares" modulo .

Dirichlet character

In analytic number theory and related branches of mathematics, a complex-valued arithmetic function is a Dirichlet character of modulus (where is a positive integer) if for all integers and : that is, is completely multiplicative. (gcd is the greatest common divisor) that is, is periodic with period . The simplest possible character, called the principal character, usually denoted , (see Notation below) exists for all moduli: The German mathematician Peter Gustav Lejeune Dirichlet—for whom the character is named—introduced these functions in his 1837 paper on primes in arithmetic progressions.

Related publications (31)

A short note on inadmissible coefficients of weight 2 and 2k+1 newforms

Graph Chatbot

Toroidal families and averages of L-functions, I

Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS

Isogeny Problems with Level Structure