Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Serre J.-P. — Trees
Serre J.-P. — Trees



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Trees

Автор: Serre J.-P.

Аннотация:

In the case of an author like Serre, there is almost no need to underline the book's qualities of elegance and precision: over and above these, it provides abundant links to other topics, particularly by means of the remarks and the numerous exercises which, for the most part, are not easy to solve, but genuinely augment the content of the book. The greatest quality of this book however, is, in my opinion, that one finds in it many new and interesting ideas of very considerable substance, but presented in their very simplest form.


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1980

Количество страниц: 141

Добавлена в каталог: 21.05.2007

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$I_p$-equivalent (vector bundles)      97
Adjacent (vertices)      13
Amalgam      2
Amalgamated sum      2
Backtracking      15
Barycentric subdivision      14
Bounded (subset of a tree)      20 36
Circuit      15
Coherent (edges)      62
Combinatorial graph      16
Contraction (of subtrees)      22
Cusp      104
Decomposable (vector bundle)      101
Determinant (of a vector bundle)      97
Diagram (representing a graph)      13
Diameter      20
Direct limit      1
Discrete (valuation)      69
Distance (in a tree)      18
Edge (of a graph)      13
End (of a tree)      21 72
Euler — Poincare (characteristic)      22 131
Euler — Poincare (measure)      83
Fixed point property      58
Free (action of a group)      27
Free product      2
Fundamental (domain)      32
Geodesic      18 61
Geometric edge      16
Graph      13
Graph defined by a group      16 26
Graph of groups      37 41
Hecke (operators)      73
HNN (construction)      9 44
Hyperbolic (automorphism)      64 77
Ihara’s theorem      12 79 82
Incoherent (edges)      62
Index (of a vertex)      19
Infinite path      15
Injective (morphism of graphs)      13
Inverse (edge)      13
inversion      25
Iwahori (subgroup)      77
Kurosh’s theorem      57
Lattice      69
Length (of an element of an amalgam)      5
Limit (of a tree of groups)      37
Line bundle      97
Locally injective (morphism of graphs)      39
Loop      15
Margulis — Tits’ theorem      68
Maximal (tree)      21
Nagao’s theorem      11 85
Orientation (of a graph)      13
Oriented (graph)      13
Origin (of an edge)      13
Parabolic (subgroup)      90
Path (in a graph)      14
Property (FA)      58
Quotient (graph)      25
Rank (of a free group)      29
Realization (of a graph)      14
Reduced (word)      2 45
Relative (homology)      133
Representatives (tree of)      25
Residually finite (group)      122
Schreier’s theorem      29
Segment      32
Semistablc (vector bundle)      101
Stable (vector bundle)      101
Steinberg (module)      132
Straight path      62
Subbundle (of a vector bundle)      100
Tannaka — Artin (problem)      74
Terminal (vertex)      19
Terminus (of an edge)      13 20
Tits system      89
TREE      17
Trefoil knot (group)      11
Type (of a reduced word)      3 42 45
Type (of an element of an amalgam)      5
Universal covering      50
van Kampen’s theorem      1
Vector bundle      96
Vertex (of a graph)      13
Virtual (property)      121
Weyl group      90
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте