Mathematical problems | Unsolved problems in graph theory
The Oberwolfach problem is an unsolved problem in mathematics that may be formulated either as a problem of scheduling seating assignments for diners,or more abstractly as a problem in graph theory, on the edge cycle covers of complete graphs. It is named after the Oberwolfach Research Institute for Mathematics, where the problem was posed in 1967 by Gerhard Ringel. It is known to be true for all sufficiently-large complete graphs. (Wikipedia).
Separation of variables and the Schrodinger equation
A brief explanation of separation of variables, application to the time-dependent Schrodinger equation, and the solution to the time part. (This lecture is part of a series for a course based on Griffiths' Introduction to Quantum Mechanics. The Full playlist is at http://www.youtube.com/
From playlist Mathematical Physics II - Youtube
Ivan Guo: Financial models of the future
Dr Ivan Guo's research lies predominantly in the areas of stochastic control and financial mathematics. In this interview, he reflects on his SMRI visit and explains the models behind financial mathematics. Find out how transport theory applies to quantitative finance (as well as logisti
From playlist SMRI Interviews
Interview at CIRM : Herwig Hauser
Herwig Hauser (Chair) and Guillaume Rond (Local Project Leader) held a Jean Morlet semester at CIRM from mid January to mid July 2015. Their scientific programme focused on 'Artin Approximation and Singularity Theory'. Artin Approximation concerns the solvability of algebraic equations in
From playlist Jean-Morlet Chair's holders - Interviews
I continue the look at higher-order, linear, ordinary differential equations. This time, though, they have variable coefficients and of a very special kind.
From playlist Differential Equations
8ECM Plenary Lecture: Monika Ludwig
From playlist 8ECM Plenary Lectures
Physicist Explains Wikipedia Page: The Schrodinger Equation
Why are Wikipedia Physics pages so difficult to understand? Hey guys, I'm back with a new video! This time, I'm looking at how certain Wikipedia pages can be so complicated to understand, and so here's a Wikipedia page made easy! Now I can totally understand that a wiki page is meant to p
From playlist Quantum Physics by Parth G
C44 Example problem solving a Cauchy Euler equation
Getting more example problems done! Solving Cauchy-Euler equations is easy and fun.
From playlist Differential Equations
B04 Example problem of simple harmonic oscillation
Solving an example problem of simple harmonic oscillation, which requires calculating the solution to a second order ordinary differential equation.
From playlist Physics ONE
C43 Example problem solving a Cauchy Euler equation
Another Cauchy-Euler equation example problem solved.
From playlist Differential Equations
C46 Solving the previous problem by another method
There are more ways than one to solve Cauchy-Euler equations. In this video I revert to the substitution method.
From playlist Differential Equations
Feuerbach Action! (GoGeometry Action 167)
Link to GeoGebra Resource: https://www.geogebra.org/m/san7ehan
From playlist Geometry: Challenge Problems
C36 Example problem solving a Cauchy Euler equation
An example problem of a homogeneous, Cauchy-Euler equation, with constant coefficients.
From playlist Differential Equations
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS - Alexandros Hollender
Computer Science/Discrete Mathematics Seminar I Topic: The Complexity of Gradient Descent: CLS = PPAD ∩ PLS Speaker: Alexandros Hollender Affiliation: University of Oxford Date: October 11, 2021 We consider the problem of computing a Gradient Descent solution of a continuously different
From playlist Mathematics
Lecture 20 - Introduction to NP-completeness
This is Lecture 20 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture22.pdf
From playlist CSE373 - Analysis of Algorithms - 1997 SBU
MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Erik Demaine View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This lecture discusses computational complexity and introduces termi
From playlist MIT 6.006 Introduction to Algorithms, Spring 2020
Problem Solving Skills | How to Improve Your Problem Solving Skills? | Softskills | Simplilearn
This video on how to improve your problem-solving skills is focused on excellent tips that will enhance your Problem-Solving skill like Decision making, Critical Thinking, Active listening, Creativity, and many more, both in your personal and professional life. In this tutorial, we will se
From playlist Interview Tips | Interview Tips in English | Simplilearn 🔥[2022 Updated]
Defining Problems as a Tool for Maximizing Systemic Impact
This webinar will explain the relationship between how we define problems and our ability to forecast the positive and negative externalities associated with a problem’s potential solution set. Matt will draw on his personal experience and background in commodity corn farming to demonst
From playlist Leadership & Management
Triangle Median: Challenge Problem
Link: https://www.geogebra.org/m/jESRWymr BGM: Andy Hunter
From playlist Geometry: Challenge Problems
5 Simple Steps for Solving Dynamic Programming Problems
In this video, we go over five steps that you can use as a framework to solve dynamic programming problems. You will see how these steps are applied to two specific dynamic programming problems: the longest increasing subsequence problem and optimal box stacking. The five steps in order ar
From playlist Problem Solving