Graph theory

Nash-Williams theorem

In graph theory, the Nash-Williams theorem is a theorem that describes how many edge-disjoint spanning trees (and more generally forests) a graph can have: A graph G has t edge-disjoint spanning trees iff for every partition where there are at least t(k − 1) crossing edges (Tutte 1961, Nash-Williams 1961). For this article, we will say that such a graph has arboricity t or is t-arboric. (The actual definition of arboricity is slightly different and applies to forests rather than trees.) (Wikipedia).

Video thumbnail

Fourier series + Fourier's theorem

Free ebook http://tinyurl.com/EngMathYT A basic lecture on how to calculate Fourier series and a discussion of Fourier's theorem, which gives conditions under which a Fourier series will converge to a given function.

From playlist Engineering Mathematics

Video thumbnail

Calculus 5.3 The Fundamental Theorem of Calculus

My notes are available at http://asherbroberts.com/ (so you can write along with me). Calculus: Early Transcendentals 8th Edition by James Stewart

From playlist Calculus

Video thumbnail

Theory of numbers: Gauss's lemma

This lecture is part of an online undergraduate course on the theory of numbers. We describe Gauss's lemma which gives a useful criterion for whether a number n is a quadratic residue of a prime p. We work it out explicitly for n = -1, 2 and 3, and as an application prove some cases of Di

From playlist Theory of numbers

Video thumbnail

Convolution Theorem: Fourier Transforms

Free ebook https://bookboon.com/en/partial-differential-equations-ebook Statement and proof of the convolution theorem for Fourier transforms. Such ideas are very important in the solution of partial differential equations.

From playlist Partial differential equations

Video thumbnail

Lecture: Numerical Differentiation Methods

From simple Taylor series expansions, the theory of numerical differentiation is developed.

From playlist Beginning Scientific Computing

Video thumbnail

Camillo De Lellis: Surely you're joking, Mr. Nash?

Abstract: Nash Equilibria, Nash functions, Nash manifolds, the Nash-Moser iteration, the Nash embedding theorems, the De Giorgi-Nash Theorem. These names will remain in the history of science to testify to the extreme originality of a mathematician who has tackled and solved some of the ha

From playlist Abel Lectures

Video thumbnail

Calculus - The Fundamental Theorem, Part 1

The Fundamental Theorem of Calculus. First video in a short series on the topic. The theorem is stated and two simple examples are worked.

From playlist Calculus - The Fundamental Theorem of Calculus

Video thumbnail

Univers Convergents 2016 - séance 1/6 - "A Beautiful Mind"

A Beautiful Mind de Ron Howard (USA - 2001 - 2h15) avec Russell Crowe, Ed Harris, Jennifer Connelly Mardi 26 janvier 2016 - 19h30 John Forbes Nash Jr (1928-2015) est un des plus grands génies mathématiques du XXème siècle. Chercheur surdoué, il est le père d’une « théorie économiq

From playlist Ciné-Club Univers Convergents

Video thumbnail

Math 131 111416 Sequences of Functions: Pointwise and Uniform Convergence

Definition of pointwise convergence. Examples, nonexamples. Pointwise convergence does not preserve continuity, differentiability, or integrability, or commute with differentiation or integration. Uniform convergence. Cauchy criterion for uniform convergence. Weierstrass M-test to imp

From playlist Course 7: (Rudin's) Principles of Mathematical Analysis

Video thumbnail

The Fourier Transform and Derivatives

This video describes how the Fourier Transform can be used to accurately and efficiently compute derivatives, with implications for the numerical solution of differential equations. Book Website: http://databookuw.com Book PDF: http://databookuw.com/databook.pdf These lectures follow

From playlist Fourier

Video thumbnail

What is the Riemann Hypothesis?

This video provides a basic introduction to the Riemann Hypothesis based on the the superb book 'Prime Obsession' by John Derbyshire. Along the way I look at convergent and divergent series, Euler's famous solution to the Basel problem, and the Riemann-Zeta function. Analytic continuation

From playlist Mathematics

Video thumbnail

Louis Nirenberg: Some remarks on Mathematics

Abel Laureate Louis Nirenberg, Courant Institute, New York University: Some remarks on Mathematics This lecture was held by Abel Laurate Louis Nirenberg at The University of Oslo, May 20, 2015 and was part of the Abel Prize Lectures in connection with the Abel Prize Week celebrations. P

From playlist Louis Nirenberg

Video thumbnail

Frank Morgan: Soap Bubbles and Mathematics

Summary: Soap bubbles, with applications from cappuccino to universes, illustrate some fundamental questions in mathematics. The show will include some demonstrations. Frank Morgan is an American mathematician and the Webster Atwell '21 Professor of Mathematics at Williams College, specia

From playlist Popular presentations

Video thumbnail

Nevanlinna Prize Lecture: Equilibria and fixed points — Constantinos Daskalakis — ICM2018

Equilibria, fixed points, and computational complexity Constantinos Daskalakis Abstract: The concept of equilibrium, in its various forms, has played a central role in the development of Game Theory and Economics. The mathematical properties and computational complexity of equilibria are

From playlist Special / Prizes Lectures

Video thumbnail

Analysis of Mean-Field Games (Lecture 1) by Kavita Ramanan

PROGRAM: ADVANCES IN APPLIED PROBABILITY ORGANIZERS: Vivek Borkar, Sandeep Juneja, Kavita Ramanan, Devavrat Shah, and Piyush Srivastava DATE & TIME: 05 August 2019 to 17 August 2019 VENUE: Ramanujan Lecture Hall, ICTS Bangalore Applied probability has seen a revolutionary growth in resear

From playlist Advances in Applied Probability 2019

Video thumbnail

The Abel Prize announcement 2015 - John Nash & Louis Nirenberg

0:42 The Abel Prize announced by Kirsti Strøm Bull, President of The Norwegian Academy of Science and Letters 2:31 Citation by John Rognes, Chair of the Abel committee 8:50 Popular presentation of the prize winners work by Alex Bellos, British writer, and science communicator 23:09 Phone i

From playlist The Abel Prize announcements

Video thumbnail

Theoretical Computer Science and Economics - Tim Roughgarden

Lens of Computation on the Sciences - November 22, 2014 Theoretical Computer Science and Economics - Tim Roughgarden, Stanford University Theoretical computer science offers a number of tools to reason about economic problems in novel ways. For example, complexity theory sheds new light

From playlist Lens of Computation on the Sciences

Video thumbnail

Zoltán Szigeti: Connectivity Problems (Part 3)

We will present two topics concerning the connectivity of graphs: orientation and augmentation. The basic problems are the following: Does a given undirected graph have a k-arc-connected orientation? Can a given undirected graph be made k-edge-connected by adding L edges? The two main t

From playlist HIM Lectures 2015

Video thumbnail

The Campbell-Baker-Hausdorff and Dynkin formula and its finite nature

In this video explain, implement and numerically validate all the nice formulas popping up from math behind the theorem of Campbell, Baker, Hausdorff and Dynkin, usually a.k.a. Baker-Campbell-Hausdorff formula. Here's the TeX and python code: https://gist.github.com/Nikolaj-K/8e9a345e4c932

From playlist Algebra

Video thumbnail

Zoltán Szigeti: Connectivity Problems (Part 1)

We will present two topics concerning the connectivity of graphs: orientation and augmentation. The basic problems are the following: Does a given undirected graph have a k-arc-connected orientation? Can a given undirected graph be made k-edge-connected by adding L edges? The two main t

From playlist HIM Lectures 2015

Related pages

Spanning tree | Graph theory | Bridge (graph theory) | Induced subgraph | Arboricity | Menger's theorem | Crispin Nash-Williams | W. T. Tutte | K-edge-connected graph