2000 character limit reached
Explicit construction of Ramanujan bigraphs
Published 9 Feb 2015 in math.NT | (1502.02739v1)
Abstract: We construct explicitly an infinite family of Ramanujan graphs which are bipartite and biregular. Our construction starts with the Bruhat-Tits building of an inner form of $SU_3(\mathbb Q_p)$. To make the graphs finite, we take successive quotients by infinitely many discrete co-compact subgroups of decreasing size.
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.