相关论文: Ramunajan $(n_1,n_2,...,n_{d-1})$-regular hypergra…

We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs. They are obtained as quotients of the buildings of type $\tilde{A}_{d-1}$ associated with…

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…

In this paper we present for every $d \geq 2$ and every local field $F$ of positive characteristic, explicit constructions of Ramanujan complexes which are quotients of the Bruhat-Tits building $\B_d(F)$ associated with…

In this article, we construct new families of Ramanujan complexes with local structure distinct from all previously known examples. Our approach is based on unitary groups over number fields, more specifically on what we call super-definite…

This paper considers a higher-dimensional generalization of the notion of Ramanujan graphs, defined by Lubotzky, Phillips, and Sarnak. Specifically the Ramanujan property is studied for cubical complexes which are uniformized by an ordered…

The objectives of this article are three-fold. Firstly, we present for the first time explicit constructions of an infinite family of \textit{unbalanced} Ramanujan bigraphs. Secondly, we revisit some of the known methods for constructing…

We use the representation theory of the quasisplit form G of SU(3) over a p-adic field to investigate whether certain quotients of the Bruhat--Tits tree associated to this form are Ramanujan bigraphs. We show that a quotient of the tree…

We outline an elementary method for proving numerical hypergeometric identities, in particular, Ramanujan-type identities for $1/\pi$. The principal idea is using algebraic transformations of arithmetic hypergeometric series to translate…

In this paper we construct explicit LPS-type Ramanujan graphs from each definite quaternion algebra over $\mathbb Q$ of class number 1, extending the constructions of Lubotzky, Phillips, Sarnak, and later Chiu, and answering in the…

We construct an infinite family of (q+1)-regular Ramanujan graphs X_n of girth 1. We also give covering maps X_{n+1} --> X_n such that the minimal common covering of all the graphs is the universal covering tree.

This paper is based on the author's talk at the Arbeitstagung 2017. It discusses some general approaches to the construction of classical and quantum holographic codes on Bruhat-Tits trees and buildings and on Drinfeld symmetric spaces, in…

Ramanujan complexes were defined as high dimensional analogues of the optimal expanders, Ramanujan graphs. They were constructed as quotients of the Euclidean building (also called the affine building and the Bruhat-Tits building) of…

We generalize the patterns of supercongruences of Ramanujan-type observed by L. Van Hamme and W. Zudilin to series involving simple square roots anywhere and not only in the result of the sum. To support our observations we give some…

A finite, connected, $(d+1)$-regular graph $G$ is called Ramanujan if every its eigenvalue $\lambda$ satisfies either $\lambda=\pm (d+1)$ or $|\lambda|\leq 2\sqrt{d}$. The Ramanujan condition corresponds to the optimal rate of decay of…

We consider the routing of neutral atoms on a reconfigurable lattice in terms of hypergraph transformations. We prove the routing number of a Ramanujan $(d,r)$-regular hypergraph on $N$ vertices satisfies $\mathrm{rt}(H) = \Theta(\log N)$,…

This is an item on Ramanujan Graphs for a planned encyclopedia on Ramanujan. The notion of Ramanujan graphs is explained, as well as the reason to name these graphs after Ramanujan.

We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…

In this article we use theoretical and numerical methods to evaluate in a closed-exact form the parameters of Ramanujan type $1/\pi$ formulas.

In a breakthrough work, Marcus-Spielman-Srivastava recently showed that every $d$-regular bipartite Ramanujan graph has a 2-lift that is also $d$-regular bipartite Ramanujan. As a consequence, a straightforward iterative brute-force search…

In their seminal paper, Lubotzky, Phillips and Sarnak (LPS) defined the notion of regular Ramanujan graphs and gave an explicit construction of infinite families of $(p+1)$-regular Ramanujan Cayley graphs, for infinitely many primes $p$. In…