Algebraic Topology

Αλγεβρική Τοπολογία

A. Hatcher

Δημοσιεύθηκε 20 Απρ 2006

This book was written to be a readable introduction to algebraic topology with rather broad coverage of the subject. The viewpoint is quite classical in spirit, and stays well within the confines of pure algebraic topology. In a sense, the book could have been written thirty or forty years ago since virtually everything in it is at least that old. However, the passage of the intervening years has helped clarify what are the most important results and techniques. For example, CW complexes have proved over time to be the most natural class of spaces for algebraic topology, so they are emphasized here much more than in the books of an earlier generation. This emphasis also illustrates the book’s general slant towards geometric, rather than algebraic, aspects of the subject. The geometry of algebraic topology is so pretty, it would seem a pity to slight it and miss all the intuition it provides.

553 σελίδες

3.3 mb

pdf
Συνέχεια »

Διαφάνειες από το μάθημα Πληροφορική Ι (Matlab)

Matlab

Δημοσιεύθηκε 20 Απρ 2006

102 σελίδες

1.1 mb

pdf
Συνέχεια »

Matlab C++ Math Library. The Language of Technical Computing

Matlab

Δημοσιεύθηκε 20 Απρ 2006

430 σελίδες

0.7 mb

pdf
Συνέχεια »

Xορηγός αριστερά

Handbook of Applied Cryptography

Κρυπτογραφία

Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone

Δημοσιεύθηκε 20 Απρ 2006

website
Συνέχεια »

Υπολογιστική Επιστήμη και Τεχνολογία

Πληροφορική Γενικά

Μ. Δρακόπουλος

Δημοσιεύθηκε 20 Απρ 2006

71 σελίδες

0.3 mb

pdf
Συνέχεια »

Graph Theory

Θεωρία Γραφημάτων

Reinhard Diestel

Δημοσιεύθηκε 20 Απρ 2006

This book is a careful and thorough introduction to Graph Theory. It covers all of the central topics in real depth, always giving plenty of motivation. It also contains some fascinating material not normally found in textbooks, such as Fleischner’s theorem that the square of a 2-connected graph is always Hamiltonian. A highlight of the book is the chapter on graph minors, which contains what is by far the best account in print of the Seymour-Robertson proof of Wagner’s Conjecture. It manages to convey the key ideas behind the proof, while at the same time giving enough of the details that the reader gets a feel for the actual methods involved. Not many authors could have accomplished this!

422 σελίδες

2.3 mb

pdf
Συνέχεια »

Graphentheorie

Θεωρία Γραφημάτων

Reinhard Diestel

Δημοσιεύθηκε 20 Απρ 2006

This book is a careful and thorough introduction to Graph Theory. It covers all of the central topics in real depth, always giving plenty of motivation. It also contains some fascinating material not normally found in textbooks, such as Fleischner’s theorem that the square of a 2-connected graph is always Hamiltonian. A highlight of the book is the chapter on graph minors, which contains what is by far the best account in print of the Seymour-Robertson proof of Wagner’s Conjecture. It manages to convey the key ideas behind the proof, while at the same time giving enough of the details that the reader gets a feel for the actual methods involved. Not many authors could have accomplished this!

326 σελίδες

2.5 mb

pdf
Συνέχεια »