2000 character limit reached
Some remarks related to Maeda's conjecture
Published 2 Mar 2016 in math.NT | (1603.00813v1)
Abstract: In this article we deal with the problem of counting the number of pairs of normalized eigenforms $ (f,g) $ of weight $k$ and level $N$ such that $ a_p (f) = a_p (g) $ where $a_p (f) $ denotes the $p-$th Fourier coefficient of $f$. Here $p$ is a fixed prime.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
