Numerical analysis | Floating point | Computer arithmetic
In floating-point arithmetic, the Sterbenz lemma or Sterbenz's lemma is a theorem giving conditions under which floating-point differences are computed exactly.It is named after Pat H. Sterbenz, who published a variant of it in 1974. Sterbenz lemma — In a floating-point number system with subnormal numbers, if and are floating-point numbers such that then is also a floating-point number.Thus, a correctly rounded floating-point subtraction is computed exactly. The Sterbenz lemma applies to IEEE 754, the most widely used floating-point number system in computers. (Wikipedia).
This lecture is part of an online course on the Zermelo Fraenkel axioms of set theory. This lecture gives an overview of the axioms, describes the von Neumann hierarchy, and sketches several approaches to interpreting the axioms (Platonism, von Neumann hierarchy, multiverse, formalism, pra
From playlist Zermelo Fraenkel axioms
This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the powerset axiom, the strongest of the ZF axioms, and explain why the notion of a powerset is so hard to pin down precisely. For the other lectures in the course see https://www.youtube.com
From playlist Zermelo Fraenkel axioms
This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We dicuss the axiom of chice, and sketch why it is independent of the other axioms of set theory. For the other lectures in the course see https://www.youtube.com/playlist?list=PL8yHsr3EFj52EKVgPi-p50f
From playlist Zermelo Fraenkel axioms
Set Theory (Part 2): ZFC Axioms
Please feel free to leave comments/questions on the video and practice problems below! In this video, I introduce some common axioms in set theory using the Zermelo-Fraenkel w/ choice (ZFC) system. Five out of nine ZFC axioms are covered and the remaining four will be introduced in their
From playlist Set Theory by Mathoma
Zermelo Fraenkel Pairing and union
This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. We discuss the axioms of pairing and union, the two easiest axioms of ZFC, and consider whether they are really needed. For the other lectures in the course see https://www.youtube.com/playlist?list=PL
From playlist Zermelo Fraenkel axioms
Nonlinear Long-Range Resonant Scattering and Kink Dynamics - Avy Soffer
Avy Soffer Rutgers, The State University of New Jersey December 7, 2012 We study the nonlinear Klein-Gordon equation, in one dimension, with a qudratic term and variable coefficient qubic term. This equation arises from the asymptotic stability theory of the kink solution.Our main result i
From playlist Mathematics
Berge's lemma, an animated proof
Berge's lemma is a mathematical theorem in graph theory which states that a matching in a graph is of maximum cardinality if and only if it has no augmenting paths. But what do those terms even mean? And how do we prove Berge's lemma to be true? == CORRECTION: at 7:50, the red text should
From playlist Summer of Math Exposition Youtube Videos
In this video, I prove the famous Riemann-Lebesgue lemma, which states that the Fourier transform of an integrable function must go to 0 as |z| goes to infinity. This is one of the results where the proof is more important than the theorem, because it's a very classical Lebesgue integral
From playlist Real Analysis
Zermelo Fraenkel Extensionality
This is part of a series of lectures on the Zermelo-Fraenkel axioms for set theory. In this lecture we discuss the axiom of extensionality, which says that two sets are equal if they have the same elements. For the other lectures in the course see https://www.youtube.com/playlist?list
From playlist Zermelo Fraenkel axioms
Graph regularity and counting lemmas - Jacob Fox
Conference on Graphs and Analysis Jacob Fox June 5, 2012 More videos on http://video.ias.edu
From playlist Mathematics
Regularity methods in combinatorics, number theory, and computer science - Jacob Fox
Marston Morse Lectures Topic: Regularity methods in combinatorics, number theory, and computer science Speaker: Jacob Fox Affiliation: Stanford University Date: October 24, 2016 For more videos, visit http://video.ias.edu
From playlist Mathematics
9. Szemerédi's graph regularity lemma IV: induced removal lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Prof. Zhao explains a strengthening of the graph regulari
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
6. Szemerédi's graph regularity lemma I: statement and proof
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Szemerédi's graph regularity lemma is a powerful tool in
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
A stable arithmetic regularity lemma in finite (...) - C. Terry - Workshop 1 - CEB T1 2018
Caroline Terry (Maryland) / 01.02.2018 A stable arithmetic regularity lemma in finite-dimensional vector spaces over fields of prime order In this talk we present a stable version of the arithmetic regularity lemma for vector spaces over fields of prime order. The arithmetic regularity l
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
7. Szemerédi's graph regularity lemma II: triangle removal lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Continuing the discussion of Szemerédi's graph regularity
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
László Lovász: The many facets of the Regularity Lemma
Abstract: The Regularity Lemma of Szemerédi, first obtained in the context of his theorem on arithmetic progressions in dense sequences, has become one of the most important and most powerful tools in graph theory. It is basic in extremal graph theory and in the theory of property testing.
From playlist Abel Lectures
10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX In this first half of this lecture, Prof. Zhao shows how
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
15. Graph limits II: regularity and counting
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Prof. Zhao explains how graph limits can be used to gener
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019