Completeness and Orthogonality
A discussion of the properties of Completeness and Orthogonality of special functions, such as Legendre Polynomials and Bessel functions.
From playlist Mathematical Physics II Uploads
Empty Graph, Trivial Graph, and the Null Graph | Graph Theory
Whenever we talk about something that is defined by sets, it is important to consider the empty set and how it fits into the definition. In graph theory, empty sets in the definition of a particular graph can bring on three types/categories of graphs. The empty graphs, the trivial graph, a
From playlist Graph Theory
The hardest concept in Calculus? #SoME2
The ε-δ definition of limits is infamous among calculus students for being confusing to understand and cumbersome to use. In this video I show what is the geometrical interpretation of that definition and give an example of how it is actually used in practice connecting the steps of the re
From playlist Summer of Math Exposition 2 videos
Why is the Empty Set a Subset of Every Set? | Set Theory, Subsets, Subset Definition
The empty set is a very cool and important part of set theory in mathematics. The empty set contains no elements and is denoted { } or with the empty set symbol ∅. As a result of the empty set having no elements is that it is a subset of every set. But why is that? We go over that in this
From playlist Set Theory
Math 101 Fall 2017 112917 Introduction to Compact Sets
Definition of an open cover. Definition of a compact set (in the real numbers). Examples and non-examples. Properties of compact sets: compact sets are bounded. Compact sets are closed. Closed subsets of compact sets are compact. Infinite subsets of compact sets have accumulation poi
From playlist Course 6: Introduction to Analysis (Fall 2017)
How to Set Up the Partial Fraction Decomposition
Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys How to Set Up the Partial Fraction Decomposition. Just setting them up. See my other videos for actual solved problems.
From playlist Partial Fraction Decomposition
!!Con 2016 - My favorite NP-complete problem! By Mark Dominus
My favorite NP-complete problem! By Mark Dominus NP-complete problems are the hardest problems whose solutions can be efficiently checked for correctness. An efficient method of solving any NP-complete problem would translate directly into efficient solutions for all of them. Many famous
From playlist !!Con 2016
Karthik C. S.: Recent Hardness of Approximation results in Parameterized Complexity
In this talk, we survey some recent hardness of approximation results in parameterized complexity such as the inapproximability of the k-clique problem, provide some technical insights, and also highlight some open problems.
From playlist Workshop: Parametrized complexity and discrete optimization
Dmitriy Zhuk: Quantified constraint satisfaction problem: towards the classification of complexity
HYBRID EVENT Recorded during the meeting "19th International Conference on Relational and Algebraic Methods in Computer Science" the November 2, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other t
From playlist Virtual Conference
Total Functions in the Polynomial Hierarchy - Robert Kleinberg
Computer Science/Discrete Mathematics Seminar I Topic: Total Functions in the Polynomial Hierarchy Speaker: Robert Kleinberg Affiliation: Cornell University Date: February 08, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Power Set of the Power Set of the Power Set of the Empty Set | Set Theory
The power set of the power set of the power set of the empty set, we'll go over how to find just that in today's set theory video lesson! We'll also go over the power set of the empty set, the power set of the power set of the empty set, and we'll se the power set of the power set of the p
From playlist Set Theory
Exponential-time algorithms for NP problems: prospects and limits - Andrew Drucker
Andrew Drucker Institute for Advanced Study; Member, School of Mathematics October 4, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
On the Communication Complexity of Classification Problems - Roi Livni
Computer Science/Discrete Mathematics Seminar II Topic: On the Communication Complexity of Classification Problems Speaker: Roi Livni Affiliation: Princeton University Date: Febuary 27, 2018 For more videos, please visit http://video.ias.edu
From playlist Mathematics
This lecture is an informal introduction to the P=NP question in computer science: are nondeterministic polynomial time problems (NP) the same as polynomial time problems (P)? We describe what these terms mean, give a brief history, and examine some of the arguments for and against this qu
From playlist Math talks
Mod-01 Lec-36 Syntax: Case Assignment
Introduction to Modern Linguistics by Prof.Shreesh Chaudhary & Prof. Rajesh Kumar,Department of Humanities and Social Sciences,IIT Madras.For more details on NPTEL visit http://nptel.ac.in
From playlist IIT Madras: Introduction to Modern Linguistics | CosmoLearning.org English Language
The Limit Does NOT Exist (Limit Example 4)
Epsilon Definition of a Limit In this video, I illustrate the epsilon-N definition of a limit by showing that the limit of (-1)^n as n goes to infinity does NOT exist. The method I present is more generally useful to show that a limit does not exist. Other examples of limits can be seen
From playlist Sequences
The Minimum Formula Size Problem is (ETH) Hard - Rahul Ilango
Computer Science/Discrete Mathematics Seminar I Topic: The Minimum Formula Size Problem is (ETH) Hard Speaker: Rahul Ilango Affiliation: Massachusetts Institute of Technology Date: March 7, 2022 Understanding the complexity of the Minimum Circuit Size Problem (MCSP) is a longstanding mys
From playlist Mathematics
How difficult is it to certify that a random 3SAT formula is unsatisfiable? - Toniann Pitassi
Computer Science/Discrete Mathematics Seminar II Topic: How difficult is it to certify that a random 3SAT formula is unsatisfiable? Speaker: Toniann Pitassi Affiliation: Member, School of Mathematics Date: April 06, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Empty Set vs Set Containing Empty Set | Set Theory
What's the difference between the empty set and the set containing the empty set? We'll look at {} vs {{}} in today's set theory video lesson, discuss their cardinalities, and look at their power sets. As we'll see, the power set of the empty set is our friend { {} }! The river runs peacef
From playlist Set Theory
Oracle Separation of Quantum Polynomial time and the Polynomial Hierarchy - Avishay Tal
Computer Science/Discrete Mathematics Seminar I Topic: Oracle Separation of Quantum Polynomial time and the Polynomial Hierarchy Speaker: Avishay Tal Affiliation: University of California, Berkeley Date: Oct 1, 2018 For more video please visit http://video.ias.edu
From playlist Mathematics