Functions and mappings | Computability theory | Theorems in the foundations of mathematics
In mathematics, Richardson's theorem establishes the undecidability of the equality of real numbers defined by expressions involving integers, π, and exponential and sine functions. It was proved in 1968 by mathematician and computer scientist Daniel Richardson of the University of Bath. Specifically, the class of expressions for which the theorem holds is that generated by rational numbers, the number π, the number ln 2, the variable x, the operations of addition, subtraction, multiplication, composition, and the sin, exp, and abs functions. For some classes of expressions (generated by other primitives than in Richardson's theorem) there exist algorithms that can determine whether an expression is zero. (Wikipedia).
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
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
Theory of numbers: Congruences: Euler's theorem
This lecture is part of an online undergraduate course on the theory of numbers. We prove Euler's theorem, a generalization of Fermat's theorem to non-prime moduli, by using Lagrange's theorem and group theory. As an application of Fermat's theorem we show there are infinitely many prim
From playlist Theory of numbers
Martin Gander: On the invention of iterative methods for linear systems
HYBRID EVENT Recorded during the meeting "1Numerical Methods and Scientific Computing" the November 9, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on
From playlist Numerical Analysis and Scientific Computing
Lecture 03: Dynamic Programming
Third lecture video on the course "Reinforcement Learning" at Paderborn University during the summer term 2020. Source files are available here: https://github.com/upb-lea/reinforcement_learning_course_materials
From playlist Reinforcement Learning Course: Lectures (Summer 2020)
The Orientation Dynamics of Sedimenting Anisotropic Particles in a Stratified by Ganesh Subramanian
DISCUSSION MEETING WAVES, INSTABILITIES AND MIXING IN ROTATING AND STRATIFIED FLOWS (ONLINE) ORGANIZERS: Thierry Dauxois (CNRS & ENS de Lyon, France), Sylvain Joubaud (ENS de Lyon, France), Manikandan Mathur (IIT Madras, India), Philippe Odier (ENS de Lyon, France) and Anubhab Roy (IIT M
From playlist Waves, Instabilities and Mixing in Rotating and Stratified Flows (ONLINE)
The Second Fundamental Theorem of Calculus
This video introduces and provides some examples of how to apply the Second Fundamental Theorem of Calculus. Site: http://mathispower4u.com
From playlist The Second Fundamental Theorem of Calculus
What is the max and min of a horizontal line on a closed interval
👉 Learn how to find the extreme values of a function using the extreme value theorem. The extreme values of a function are the points/intervals where the graph is decreasing, increasing, or has an inflection point. A theorem which guarantees the existence of the maximum and minimum points
From playlist Extreme Value Theorem of Functions
Damir Yeliussizov: "Bounds and inequalities for the Littlewood-Richardson coefficients"
Asymptotic Algebraic Combinatorics 2020 "Bounds and inequalities for the Littlewood-Richardson coefficients" Damir Yeliussizov - Kazakh-British Technical University Abstract: I will talk about various bounds, inequalities, and asymptotic estimates for the Littlewood-Richardson (LR) coeff
From playlist Asymptotic Algebraic Combinatorics 2020
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
Geometric complexity theory from a combinatorial viewpoint - Greta Panova
Computer Science/Discrete Mathematics Seminar II Topic: Lattices: from geometry to cryptography Speaker: Greta Panova Affiliation: University of Pennsylvania; von Neumann Fellow, School of Mathematics Date: November 28, 2017 For more videos, please visit http://video.ias.edu
From playlist Mathematics
Open questions in turbulent stratified mixing:Do we even know what we do not know? by C.P. Caulfield
ABSTRACT: Understanding how turbulence leads to the enhanced irreversible transport of heat and other scalars (such as salt and pollutants) in density-stratified fluids is a fundamental and central problem in geophysical and environmental fluid dynamics. There is a wide range of highly im
From playlist ICTS Colloquia
Cayley-Hamilton Theorem: Example 1
Matrix Theory: We verify the Cayley-Hamilton Theorem for the real 3x3 matrix A = [ / / ]. Then we use CHT to find the inverse of A^2 + I.
From playlist Matrix Theory
Cayley-Hamilton Theorem Example 2
Matrix Theory: Let A be the 3x3 matrix A = [1 2 2 / 2 0 1 / 1 3 4] with entries in the field Z/5. We verify the Cayley-Hamilton Theorem for A and compute the inverse of I + A using a geometric power series.
From playlist Matrix Theory
Intermittency, Cascades and Thin Sets in Three-Dimensional Navier-Stokes Turbulenc by John D. Gibbon
Program Turbulence: Problems at the Interface of Mathematics and Physics (ONLINE) ORGANIZERS: Uriel Frisch (Observatoire de la Côte d'Azur and CNRS, France), Konstantin Khanin (University of Toronto, Canada) and Rahul Pandit (Indian Institute of Science, Bengaluru) DATE: 07 December 202
From playlist Turbulence: Problems at The Interface of Mathematics and Physics (Online)
Cayley-Hamilton Theorem: General Case
Matrix Theory: We state and prove the Cayley-Hamilton Theorem over a general field F. That is, we show each square matrix with entries in F satisfies its characteristic polynomial. We consider the special cases of diagonal and companion matrices before giving the proof.
From playlist Matrix Theory
Logarithmic concavity of Schur polynomials - June Huh
Members' Seminar Topic: Logarithmic concavity of Schur polynomials Speaker: June Huh Visiting Professor, School of Mathematics Date: October 7, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Geometric deformations of orthogonal and symplectic Galois representations - Jeremy Booher
Jeremy Booher Stanford University November 19, 2015 https://www.math.ias.edu/seminars/abstract?event=87395 For a representation of the absolute Galois group of the rationals over a finite field of characteristic p, we would like to know if there exists a lift to characteristic zero with
From playlist Joint IAS/PU Number Theory Seminar
Introduction to Laplacian Linear Systems for Undirected Graphs - John Peebles
Computer Science/Discrete Mathematics Seminar II Topic: Introduction to Laplacian Linear Systems for Undirected Graphs Speaker: John Peebles Affiliation: Member, School of Mathematics Date: February 23, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Introduction to additive combinatorics lecture 10.8 --- A weak form of Freiman's theorem
In this short video I explain how the proof of Freiman's theorem for subsets of Z differs from the proof given earlier for subsets of F_p^N. The answer is not very much: the main differences are due to the fact that cyclic groups of prime order do not have lots of subgroups, so one has to
From playlist Introduction to Additive Combinatorics (Cambridge Part III course)