14.10 Ramanujan and expander graphs
نویسندگان
چکیده
Case f(x) g(x) 1.1 −1 + bxm/2 + xm 1− bxm/2 + x3m 1.2 1 + bxm/2 + xm b+ xm/2 + x5m/2 1.3 −1 + bxm/2 + xm b− bxm + x5m/2 1.4 −1 + bxm/2 + xm −b− x3m/2 + x5m/2 1.5 1 + bxm/2 + xm b+ bx4m/2 + x5m/2 1.6 1 + bxm/2 + xm 1 + xm + x2m 1.7 −1 + bxm/2 + xm b+ xm + x3m/2 1.8 −1 + bxm/2 + xm −b− bxm + x3m/2 1.9 a− xm/3 + xm −a− xm/3 + x3m 1.10 a− xm/3 + xm 1 + x2m/3 + x8m/3 1.11 a+ xm/3 + xm a+ ax2m/3 + x7m/3 1.12 a− xm/3 + xm a− ax4m/3 + x7m/3 1.13 a− xm/3 + xm −a+ x5m/3 + x7m/3 1.14 a+ xm/3 + xm 1 + ax5m/3 + x2m 1.15 a− xm/3 + xm a+ ax4m/3 + x5m/3 1.16 −1 + bxm/4 + xm −b+ bx6m/4 + x11m/4 1.17 1 + bxm/4 + xm 1 + bx9m/4 + x10m/4
منابع مشابه
Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes
Expander graphs are highly connected sparse nite graphs. The property of being an expander seems signi cant in many of these mathematical, computational and physical contexts. For practical applications it is very important to construct expander and Ramanujan graphs with given regularity and order. In general, constructions of the best expander graphs with a given regularity and order is no eas...
متن کاملA Class of Real Expander Codes Based on Projective- Geometrically Constructed Ramanujan Graphs
Quite recently, codes based on real field are gaining momentum in terms of research and applications. In high-performance computing, these codes are being explored to provide fault tolerance under node failures. In this paper, we propose novel real cycle codes based on expander graphs. The requisite graphs are the Ramanujan graphs constructed using incidence matrices of the appropriate projecti...
متن کاملRamanujan Graphs and Shimura Curves
What follows are some long, rambling notes of mine on Ramanujan graphs. For a period of about two months in 2006 I thought very intensely on this subject and had thoughts running in several different directions. In paricular this document contains the most complete exposition so far of my construction of expander graphs using Hecke operators on Shimura curves. I am posting this document now (Ma...
متن کاملExpander graphs and gaps between primes * Sebastian
The explicit construction of infinite families of d-regular graphs which are Ramanujan is known only in the case d 1 is a prime power. In this paper, we consider the case when d 1 is not a prime power. The main result is that by perturbing known Ramanujan graphs and using results about gaps between consecutive primes, we are able to construct infinite families of ‘‘almost’’ Ramanujan graphs for...
متن کاملThe zig-zag product
The expander constructions based on algebraic methods can give expanders that are both explicit (i.e. we can quickly construct the graph, or even obtain neighborhood information without constructing the entire graph, and Ramanujan, meaning that the spectral gap is essentially as large as possible. It also follows from this spectral bound that the edge expansion of Ramanujan graphs is essentiall...
متن کاملHighly Symmetric Expanders
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and analyzing switching and routing algorithms. We give explicit constructions of expander graphs that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013