The unbounded denominators conjecture (Q6998215)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8026280
Language Label Description Also known as
default for all languages
No label defined
    English
    The unbounded denominators conjecture
    scientific article; zbMATH DE number 8026280

      Statements

      The unbounded denominators conjecture (English)
      0 references
      0 references
      0 references
      0 references
      11 April 2025
      0 references
      The Unbounded Denominators Conjecture asserts that bounded denominators characterize congruence modular forms: a modular form with algebraic Fourier coefficients belongs to a congruence subgroup if and only if its denominators remain bounded. As a contrapositive we can say that, if \(f(\tau) \in \mathbb{Q}[|q^{1/N}|]\) is a modular form which is not modular for some congruence subgroup, then the coefficients of \(f(\tau)\) have unbounded denominators. Furthermore, the corresponding statement remains true if one replaces \(\mathbb{Q}\) by any number field. In the paper under review, the authors prove this conjecture. The proof is based on Diophantine analysis, named, the arithmetic algebraization method.
      0 references
      0 references
      modular forms
      0 references
      unbounded denominators
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references