LibreTimes

Search results for “формула Стокса”

18 results

Topology 2. Lecture 3

2026LectureФёдор Вылегжанин

Singular homology — standard simplices and the inclusions of facets, singular simplices and chains, the differential; zeroth homology and path components, the homology of a point, reduced homology; chain maps and maps of homology, functoriality, the chain map induced by a continuous map; chain homotopies and the prism; the homotopy invariance theorem with a full proof via the prism operator; subcomplexes, quotient complexes and the homology of a pair.
1
550

Евклидовы пространства

2026LectureTaras Panov

Евклидовы и эрмитовы пространства, скалярное произведение, неравенство Коши–Буняковского и неравенство треугольника, ортогональные системы векторов.
1
190

Geometry. Lecture 2

2026LectureФёдор Попеленский

Finite geometries — the Platonic solids. A reminder — right actions, orbits, stabilisers, fundamental domains (corrected definition) and the example of Z+Z\mathbb{Z} + \mathbb{Z} on the plane; the formula ∣G∣=∣Orb⁡(x)∣⋅∣Stab⁡(x)∣|G| = |\operatorname{Orb}(x)| \cdot |\operatorname{Stab}(x)| and the 48 symmetries of the cube; regular polyhedra — Sosinsky's definition and the definition via flags, a stellated counterexample; the five Platonic solids; regular polytopes in R4\mathbb{R}^4 (six) and in Rn\mathbb{R}^n for n≥5n \ge 5 (the cube, the simplex, the hyperoctahedron) with the coordinates of their vertices; why there are no more than five — face angles and the Schläfli symbol; uniqueness of the gluing and the rigidity theorem; Euler's formula; the finite subgroups of SO(3)SO(3) — Zn\mathbb{Z}_n, DnD_n and the rotation groups of the tetrahedron, cube and icosahedron; the duality cube–octahedron, icosahedron–dodecahedron; which figures on the sphere realise Zn\mathbb{Z}_n, DnD_n and Z2\mathbb{Z}_2.

0
380

Probability Theory. Lecture 1

2026LectureСтанислав Шапошников

The finite probability space and five properties of probability, a description of all probability measures on a finite set, equally likely outcomes and the choice of a model, classical paradoxes (two dice, the division of the stakes, Bertrand's paradox), conditional probability and the product rule, the law of total probability as a way to define a measure, Bayes' formula, independence of events.
0
170

Инкрементное и онлайновое обучение

2026LectureКонстантин Вячеславович Воронцов

Инкрементное и онлайновое обучение. Лекция курса «Машинное обучение» К. В. Воронцова. Задачи инкрементного и онлайнового обучения. Оценивание инкрементного обучения. Кривые обучения.
1
170

Аффинные пространства

2026LectureTaras Panov

Аффинные пространства и подпространства, аффинные системы координат и формулы их замены, прямые и плоскости в аффинных пространствах.
1
460

Algebra 1. Lecture 1

2026LectureАртём Авилов

What algebra studies — algebraic structures. Groups (definition, examples, additive notation, uniqueness of the identity and of inverses), rings (variants of the axioms, rings with and without identity), fields and division rings, vector spaces and modules, algebras over a field. The symmetric group SnS_n — permutations, non-commutativity, two-row notation, cycles and transpositions, decomposition into transpositions, disjoint permutations commute, decomposition into disjoint cycles and its uniqueness, powers, inversions, parity and the sign of a permutation, multiplying by a transposition changes the sign.

0
310

Алгебра 1. Лекция 4. Формальные степенные ряды и производящие функции

2026LectureAlexey Ilyin

В этой лекции рассматриваются формальные степенные ряды как алгебраический объект. Вводятся операции сложения, умножения, а также аналоги производной и интеграла. Ключевая идея лекции — применение этого аппарата для решения линейно-рекуррентных соотношений с помощью производящих функций, что демонстрируется на классическом примере чисел Фибоначчи.
2
240

Topology 2. Lecture 2

2026LectureФёдор Вылегжанин

Where simplicial homology shows up in real life — topological data analysis. The union of balls around a point cloud, persistence modules and their decomposition into a sum of interval modules over a field (the structure theorem and the algorithm), the barcode; the Vietoris–Rips and Čech complexes; the stability theorem for barcodes, the Hausdorff, Gromov–Hausdorff and Wasserstein distances; open covers and their nerves, Leray covers and the nerve theorem, the category of covers, paracompactness, Lebesgue covering dimension, Čech homology and cohomology.
1
520

Mathematical Analysis 1. Lecture 1

2026LectureСтанислав Шапошников

Naive set theory and Russell's paradox, Kuratowski's ordered pair and the Cartesian product, a function as a subset of a product, composition, injections, surjections and bijections, the group of bijections and the embedding of any group into it, equinumerosity and indicator functions, the Cantor–Bernstein and Cantor theorems.
0
290