Metadata
Mathematics Graduate Create Hard-
Subject
Mathematics
-
Education level
Graduate
-
Cognitive goals
Create
-
Difficulty estimate
Hard
-
Tags
Ramanujan graphs, quaternion algebras, automorphic representations, spectral graph theory, LPS construction
-
Number of questions
5
-
Created on
-
Generation source
-
License
CC0 Public domain
-
Prompt
Assess the student's ability to construct explicit infinite families of k‑regular Ramanujan graphs using quaternion algebras and automorphic representations. Tasks include: formulate the arithmetic/quaternionic setup (orders, reduction mod p, Cayley/quotient graphs); produce an explicit infinite family (e.g., LPS or function‑field analogues) and give generators; prove the Ramanujan eigenvalue bounds by relating adjacency spectra to Hecke eigenvalues via the Jacquet–Langlands correspondence and Deligne/Drinfeld bounds; compute spectra for sample primes and discuss parameter choices, limitations, and variations. Emphasis is on construction, rigorous spectral proof, and explicit examples suitable for graduate research.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.