TAILIEUCHUNG - Đề tài " Uniform expansion bounds for Cayley graphs of SL2(Fp) "

We prove that Cayley graphs of SL2 (Fp ) are expanders with respect to the projection of any fixed elements in SL(2, Z) generating a non-elementary subgroup, and with respect to generators chosen at random in SL2 (Fp ). 1. Introduction Expanders are highly-connected sparse graphs widely used in computer science, in areas ranging from parallel computation to complexity theory and cryptography; recently they also have found some remarkable applications in pure mathematics; see [5],[10], [15], [20], [21] and references therein. . | Annals of Mathematics Uniform expansion bounds for Cayley graphs of SL2 Fp By Jean Bourgain and Alex Gamburd Annals of Mathematics 167 2008 625 642 Uniform expansion bounds for Cayley graphs of SL2 Fp By Jean Bourgain and Alex Gamburd Abstract We prove that Cayley graphs of SL2 Fp are expanders with respect to the projection of any fixed elements in SL 2 Z generating a non-elementary subgroup and with respect to generators chosen at random in SL2 Fp . 1. Introduction Expanders are highly-connected sparse graphs widely used in computer science in areas ranging from parallel computation to complexity theory and cryptography recently they also have found some remarkable applications in pure mathematics see 5 10 15 20 21 and references therein. Given an undirected d-regular graph G and a subset X of V the expansion of X c X is defined to be the ratio Ỡ X XI where d X fy eỹ distance y X 1g. The expansion coefficient of a graph G is defined as follows c G fc X I XI 110 . A family of d-regular graphs Gn d forms a family of C-expanders if there is a fixed positive constant C such that 1 liminf c Gn d C. nn The adjacency matrix of G A G is the G by G matrix with rows and columns indexed by vertices of G such that the x y entry is 1 if and only if x and y are adjacent and 0 otherwise. By the discrete analogue of Cheeger-Buser inequality proved by Alon and Milman the condition 1 can be rewritten in terms of the second largest eigenvalue of the adjacency matrix A G as follows 2 limsup Ai An d d. The first author was supported in part by NSF Grant DMS-0627882. The second author was supported in part by NSF Grants DMS-0111298 and DMS-0501245. 626 JEAN BOURGAIN AND ALEX GAMBURD Given a finite group G with a symmetric set of generators S the Cayley graph G G S is a graph which has elements of G as vertices and which has an edge from x to y if and only if x ơy for some Ơ 2 S. Let S be a set of elements in SL2 Z . If S the group generated by S is a finite index subgroup of SL2 Z .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.