ترغب بنشر مسار تعليمي؟ اضغط هنا

From Ramanujan Graphs to Ramanujan Complexes

78   0   0.0 ( 0 )
 نشر من قبل Ori Parzanchevski
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments are surveyed. After explaining their connection to the Ramanujan conjecture we will present some old and new results with an emphasis on random walks on these discrete objects and on the Euclidean spheres. The latter lead to golden gates which are of importance in quantum computation.

قيم البحث

اقرأ أيضاً

In a seminal series of papers from the 80s, Lubotzky, Phillips and Sarnak applied the Ramanujan-Petersson Conjecture for $GL_{2}$ (Delignes theorem), to a special family of arithmetic lattices, which act simply-transitively on the Bruhat-Tits trees a ssociated with $SL_{2}(mathbb{Q}_{p})$. As a result, they obtained explicit Ramanujan Cayley graphs from $PSL_{2}left(mathbb{F}_{p}right)$, as well as optimal topological generators (Golden Gates) for the compact Lie group $PU(2)$. In higher dimension, the naive generalization of the Ramanujan Conjecture fails, due to the phenomenon of endoscopic lifts. In this paper we overcome this problem for $PU_{3}$ by constructing a family of arithmetic lattices which act simply-transitively on the Bruhat-Tits buildings associated with $SL_{3}(mathbb{Q}_{p})$ and $SU_{3}(mathbb{Q}_{p})$, while at the same time do not admit any representation which violates the Ramanujan Conjecture. This gives us Ramanujan complexes from $PSL_{3}(mathbb{F}_{p})$ and $PU_{3}left(mathbb{F}_{p}right)$, as well as golden gates for $PU(3)$.
The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a simple group $ G$ over a local field $F$. We show that if $T$ is any $k$-regular $G$-equivariant operator on the Bruhat-Tits building with a simple combinatorial property (collision-free), the associated random walk on the $n$-vertex Ramanujan complex has cutoff at time $log_k n$. The high dimensional case, unlike that of graphs, requires tools from non-commutative harmonic analysis and the infinite-dimensional representation theory of $G$. Via these, we show that operators $T$ as above on Ramanujan complexes give rise to Ramanujan digraphs with a special property ($r$-normal), implying cutoff. Applications include geodesic flow operators, geometric implications, and a confirmation of the Riemann Hypothesis for the associated zeta functions over every group $G$, previously known for groups of type $widetilde A_n$ and $widetilde C_2$.
The total-variation cutoff phenomenon has been conjectured to hold for simple random walk on all transitive expanders. However, very little is actually known regarding this conjecture, and cutoff on sparse graphs in general. In this paper we establis h total-variation cutoff for simple random walk on Ramanujan complexes of type $tilde{A}_{d}$ ($dgeq1$). As a result, we obtain explicit generators for the finite classical groups $PGL_{n}(mathbb{F}_{q})$ for which the associated Cayley graphs exhibit total-variation cutoff.
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radus algorithms, we present an algorithm to find Ramanujan-type identities for $a(mn+t)$. While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for $p(11n+6)$ with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions $overline{p}(5n+2)$ and $overline{p}(5n+3)$ and Andrews--Paules broken $2$-diamond partition functions $triangle_{2}(25n+14)$ and $triangle_{2}(25n+24)$. It can also be extended to derive Ramanujan-type identities on a more general class of partition functions. For example, it yields the Ramanujan-type identities on Andrews singular overpartition functions $overline{Q}_{3,1}(9n+3)$ and $ overline{Q}_{3,1}(9n+6)$ due to Shen, the $2$-dissection formulas of Ramanujan and the $8$-dissection formulas due to Hirschhorn.
Ramanujan complexes are high dimensional simplical complexes generalizing Ramanujan graphs. A result of Oh on quantitative property (T) for Lie groups over local fields is used to deduce a Mixing Lemma for such complexes. As an application we prove t hat non-partite Ramanujan complexes have high girth and high chromatic number, generalizing a well known result about Ramanujan graphs.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا