Strongly explicit Ramanujan 2-lift towers via Hilbert modular formsResearch Paper
An expander graph supports walks that move through a large state space while using few random choices per step. Local access matters when a vertex has an -bit name: a graph on vertices is useful to an algorithm only if its next neighbor can be computed without first constructing the entire graph. A compatible hierarchy adds another requirement. A walk…
19 thms1 active userReviewed