Unsolved problems in graph theory | Algebraic graph theory

Babai's problem

In algebraic graph theory, Babai's problem was proposed in 1979 by László Babai. (Wikipedia).

Video thumbnail

B25 Example problem solving for a Bernoulli equation

See how to solve a Bernoulli equation.

From playlist Differential Equations

Video thumbnail

Solve a Bernoulli Differential Equation Initial Value Problem

This video provides an example of how to solve an Bernoulli Differential Equations Initial Value Problem. The solution is verified graphically. Library: http://mathispower4u.com

From playlist Bernoulli Differential Equations

Video thumbnail

Graph isomorphism in quasipolynomial time - László Babai

Computer Science/Discrete Mathematics Seminar I Topic: Graph isomorphism in quasipolynomial time I Speaker: László Babai Date: Monday, February 29 The algorithm indicated in the title builds on Luks's classical framework and introduces new group theoretic and combinatorial tools. In the f

From playlist Mathematics

Video thumbnail

Graph isomorphism in quasipolynomial time II - László Babai

Computer Science/Discrete Mathematics Seminar II Topic:Graph isomorphism in quasipolynomial time II Speaker: László Babai Date:Tuesday, March 1 The algorithm indicated in the title builds on Luks's classical framework and introduces new group theoretic and combinatorial tools. In the firs

From playlist Mathematics

Video thumbnail

[BOURBAKI 2017] 14/01/2017 - 4/4 - Harald A. HELFGOTT

Isomorphismes de graphes en temps quasi-polynomial, d’après Babai et Luks Soient donnés deux graphes Γ1, Γ2 à n sommets. Y a-t-il une permutation des sommets qui envoie Γ1 sur Γ2 ? Si de telles permutations existent, elles forment une classe H · π du groupe symétrique sur n éléments. Comm

From playlist BOURBAKI - 2017

Video thumbnail

A Multi-Prover Interactive proof for NEXP Sound Against Entangled Provers - Tsuyoshi Ito

Tsuyoshi Ito NEC Laboratories America, Inc. October 15, 2012 We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with en

From playlist Mathematics

Video thumbnail

Global symmetry from local information: The Graph Isomorphism Problem – László Babai – ICM2018

Combinatorics | Mathematical Aspects of Computer Science Invited Lecture 13.4 | 14.5 Global symmetry from local information: The Graph Isomorphism Problem László Babai Abstract: Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity stat

From playlist Combinatorics

Video thumbnail

Problem #3 - Swinging Pendulum

Problem #3 - Swinging Pendulum

From playlist Bi-weekly Physics Problems

Video thumbnail

Phong NGUYEN - Recent progress on lattices's computations 2

This is an introduction to the mysterious world of lattice algorithms, which have found many applications in computer science, notably in cryptography. We will explain how lattices are represented by computers. We will present the main hard computational problems on lattices: SVP, CVP and

From playlist École d'Été 2022 - Cohomology Geometry and Explicit Number Theory

Video thumbnail

Solve a Bernoulli Differential Equation (Part 2)

This video provides an example of how to solve an Bernoulli Differential Equation. The solution is verified graphically. Library: http://mathispower4u.com

From playlist Bernoulli Differential Equations

Video thumbnail

Interleaved products in special linear groups: mixing and communication complexity - Emanuele Viola

Emanuele Viola Northeastern University April 7, 2015 Let SS and TT be two dense subsets of GnGn, where GG is the special linear group SL(2,q)SL(2,q) for a prime power qq. If you sample uniformly a tuple (s1,…,sn)(s1,…,sn) from SS and a tuple (t1,…,tn)(t1,…,tn) from TT then their interleav

From playlist Mathematics

Video thumbnail

Phong NGUYEN - Recent progress on lattices's computations 1

This is an introduction to the mysterious world of lattice algorithms, which have found many applications in computer science, notably in cryptography. We will explain how lattices are represented by computers. We will present the main hard computational problems on lattices: SVP, CVP and

From playlist École d'Été 2022 - Cohomology Geometry and Explicit Number Theory

Video thumbnail

B06 Example problem with separable variables

Solving a differential equation by separating the variables.

From playlist Differential Equations

Video thumbnail

B24 Introduction to the Bernoulli Equation

The Bernoulli equation follows from a linear equation in standard form.

From playlist Differential Equations

Video thumbnail

Ex: Solve a Bernoulli Differential Equation Using an Integrating Factor

This video explains how to solve a Bernoulli differential equation. http://mathispower4u.com

From playlist Bernoulli Differential Equations

Video thumbnail

Alessandro Goffi: "Some new regularity results for viscous Hamilton-Jacobi equations with unboun..."

High Dimensional Hamilton-Jacobi PDEs 2020 Workshop III: Mean Field Games and Applications "Some new regularity results for viscous Hamilton-Jacobi equations with unbounded right-hand side" Alessandro Goffi - Università di Padova Abstract: The talk will be devoted to the study of regular

From playlist High Dimensional Hamilton-Jacobi PDEs 2020

Video thumbnail

Solve a Bernoulli Differential Equation (Part 1)

This video provides an example of how to solve an Bernoulli Differential Equation. The solution is verified graphically. Library: http://mathispower4u.com

From playlist Bernoulli Differential Equations

Video thumbnail

Turing Machines and The Halting Problem (Part 2)

The Halting Problem has fascinated thousands of computer scientists from around the world. A major part of Computing Logic, the proof of the halting problem proves that computers can't do everything. Check out the video to learn more about why computers work the way they do! For Turing Ma

From playlist Math

Video thumbnail

Researchers Use Group Theory to Speed Up Algorithms — Introduction to Groups

This is the most information-dense introduction to group theory you'll see on this website. If you're a computer scientist like me and have always wondered what group theory is useful for and why it even exists and furthermore don't want to bother spending hours learning the basics, this i

From playlist Summer of Math Exposition 2 videos

Related pages

Lovász conjecture | Invariant (mathematics) | Generating set of a group | List of unsolved problems in mathematics | Algebraic graph theory | Cayley graph