What is a Complete Graph? | Graph Theory
What is a complete graph? That is the subject of today's lesson! A complete graph can be thought of as a graph that has an edge everywhere there can be an edge. This means that a graph is complete if and only if every pair of distinct vertices in the graph is joined by an edge. So if, in a
From playlist Graph Theory
NP-Completeness - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
AQA Decision 1 3.03 Complete Graphs Kn
I introduce the concept of a complete graph and find how many edges there would be for a complete graph with n vertices.
From playlist [OLD SPEC] TEACHING AQA DECISION 1 (D1)
Using indefinite and definite integrals in Sympy
From playlist Introduction to Pyhton for mathematical programming
Using Sympy to solve algebraic expressions and equations.
From playlist Introduction to Pyhton for mathematical programming
Pre-Calculus - The Pythagorean Identities
This video will give you an introduction to the Pythagorean Identities like sin^2(x) + cos^2(x) = 1. Also included in this video is a brief proof why it works, and how they are all connected. Watch near the end for a couple of examples on using these identities. For more videos please v
From playlist Pre-Calculus
Setting up and solving ordinary differential equations with constant coefficients.
From playlist Introduction to Pyhton for mathematical programming
Trig identities and partial fraction decomposition. New math videos every Wednesday. Subscribe to make sure you see them!
From playlist Integrals
Definite Integrals with the Limit Definition - Full Tutorial
This is a complete introduction to definite integrals. It starts with the familiar formulas needed, then goes on to a formal construction of the definite integral using Riemann Sums. Several examples of finding definite integrals with the limit definition are given. If you enjoyed this vi
From playlist Math Tutorials
Higher Algebra 11: p-adic completion (corrected)
In this video we introduce the notion of p-adic completion and p-adic equivalence of spectra. We characterize those notions in concrete terms and give examples. Finally we cover the Hasse-square, which can be used to recover X from it completions and its rationalisation. All the material i
From playlist Higher Algebra
Digression: THH of the integers (corrected)
In this video, we explain how to compute THH of the integers. In order to do this we compute it first relative to the element p and then use a spectral sequence to deduce the final result. This is a corrected version of the old video, in which I got the Hasse-squares at 13:10 and 24:20 w
From playlist Topological Cyclic Homology
Lecture 16: TC of perfect rings
In this video, we compute TC, CT^- and TP of perfect rings of characteristic p. In order to do that we also have to discuss the Witt vectors and their universal property. Feel free to post comments and questions at our public forum at https://www.uni-muenster.de/TopologyQA/index.php?qa=t
From playlist Topological Cyclic Homology
Purity for flat cohomology by Kestutis Cesnavicius
PERFECTOID SPACES ORGANIZERS: Debargha Banerjee, Denis Benois, Chitrabhanu Chaudhuri, and Narasimha Kumar Cheraku DATE & TIME: 09 September 2019 to 20 September 2019 VENUE: Madhava Lecture Hall, ICTS, Bangalore Scientific committee: Jacques Tilouine (University of Paris, France) Eknath
From playlist Perfectoid Spaces 2019
An introduction to perfectoid spaces and the tilting... - M. Morrow - Workshop 2 - CEB T1 2018
Matthew Morrow (CNRS – Sorbonne Université) / 09.03.2018 An introduction to perfectoid spaces and the tilting correspondence. This expository survey will aim to provide an introduction to Scholze’s formalism of tilting, which serves as a sort of transfer principle through which p-adic pr
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Perfectoid spaces (Lecture 1) by Kiran Kedlaya
PERFECTOID SPACES ORGANIZERS: Debargha Banerjee, Denis Benois, Chitrabhanu Chaudhuri, and Narasimha Kumar Cheraku DATE & TIME: 09 September 2019 to 20 September 2019 VENUE: Madhava Lecture Hall, ICTS, Bangalore Scientific committee: Jacques Tilouine (University of Paris, France) Eknath
From playlist Perfectoid Spaces 2019
A Gentle Approach to Crystalline Cohomology - Jacob Lurie
Members’ Colloquium Topic: A Gentle Approach to Crystalline Cohomology Speaker: Jacob Lurie Affiliation: Professor, School of Mathematics Date: February 28, 2022 Let X be a smooth affine algebraic variety over the field C of complex numbers (that is, a smooth submanifold of C^n which can
From playlist Mathematics
Lecture 14: The Definition of TC
In this video, we finally give the definition of topological cyclic homology. In fact, we will give two definitions: the first is abstract in terms of a mapping spectrum spectrum in cyclotomic spectra and then we unfold this to a concrete definition on terms of negative topological cyclic
From playlist Topological Cyclic Homology
Lecture 30: Completing a Rank-One Matrix, Circulants!
MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018 Instructor: Gilbert Strang View the complete course: https://ocw.mit.edu/18-065S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63oMNUHXqIUcrkS2PivhN3k Professor Strang s
From playlist MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018
Akhil Mathew - Some recent advances in syntomic cohomology (3/3)
Bhatt-Morrow-Scholze have defined integral refinements $Z_p(i)$ of the syntomic cohomology of Fontaine-Messing and Kato. These objects arise as filtered Frobenius eigenspaces of absolute prismatic cohomology and should yield a theory of "p-adic étale motivic cohomology" -- for example, the
From playlist Franco-Asian Summer School on Arithmetic Geometry (CIRM)
NP-Complete Explained (Cook-Levin Theorem)
What makes a problem "harder" than another problem? How can we say a problem is the hardest in a complexity class? In this video, we provide a proof sketch of the Cook-Levin theorem, introducing a critical concept known as NP-completeness. Created by: Cory Chang Produced by: Vivian Liu Sc
From playlist P vs NP