Weight-only modularity recognition has a finite-data obstruction
Statement
Problem 1.1. Given a q-series, determine fast methods to find (heuristically) if it is modular.
The method should require knowledge of the weight, but not require knowledge of the level or group.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.