9780521824262 - Elementary Number Theory, Group Theory and Ramanujan Graphs (London Mathematical Society Student Texts, 55) von Davidoff, Giuliana; Sarnak, Peter; Valette, Alain (14 Ergebnisse)

Hardcover. Zustand: Good. Zustand des Schutzumschlags: No Dust Jacket. First Edition. Hardcover. An ex-library copy in original laminated blue hard covers. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, apparently as issued. Book.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Buch. Zustand: Neu. 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.

Zustand: New. A self-contained treatment of expander graphs which are important in computer science, engineering and mathematics. Series: London Mathematical Society Student Texts. Num Pages: 156 pages, Illustrations. BIC Classification: PBG; PBH; PBV. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 13. Weight in Grams: 339. . 2003. Illustrated. hardcover. . . . . Books ship from the US and Ireland.

Zustand: New. A self-contained treatment of expander graphs which are important in computer science, engineering and mathematics. Series: London Mathematical Society Student Texts. Num Pages: 156 pages, Illustrations. BIC Classification: PBG; PBH; PBV. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 13. Weight in Grams: 339. . 2003. Illustrated. hardcover. . . . .

Hardcover. Zustand: new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Zustand: Brand New. 144 pages. 9.00x6.25x0.50 inches. In Stock. This item is printed on demand.

Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 applicat.

Hardcover. Zustand: new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Buch. Zustand: Neu. Elementary Number Theory, Group Theory and Ramanujan Graphs | Giuliana Davidoff (u. a.) | Buch | Gebunden | Englisch | 2010 | Cambridge University Press | EAN 9780521824262 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Hardcover. Zustand: new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.