Elementary Number Theory, Group Theory and Ramanujan Graphs

Giuliana Davidoff

ISBN 10: 0521824265 / ISBN 13: 9780521824262

Published by Cambridge University Press, 2003

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering. The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background material from graph theory, number theory, group theory and representation theory. The text can therefore be used as a brief introduction to these subjects as well as an illustration of how such topics are synthesised in modern mathematics.

Seller Inventory # 9780521824262

Bibliographic Details

• Title: Elementary Number Theory, Group Theory and Ramanujan Graphs
• Publisher: Cambridge University Press
• Publication Date: 2003
• Language: English
• ISBN 10: 0521824265
• ISBN 13: 9780521824262
• Binding: Buch
• Condition: Neu
• Dimensions: 235W x 157H x 13D millimeters 235 millimeters width by 157 millimeters height by 13 millimeters depth
• Weight: 387 grams

About this title

Synopsis

This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.

Book Description

This text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering.The reader needs only a background in elementary algebra, analysis and combinatorics; the authors supply the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.