Podcast cover
MIT OpenCourseWare · Education

MIT OpenCourseWare

A free and open online publication of educational material from thousands of MIT courses, covering the entire MIT curriculum, ranging from introductory to the most advanced graduate courses. On the OCW website, each course includes a syllabus, instructional material like notes and reading lists, and learning activities like assignments and solutions. Some courses also have videos, online textbooks, and faculty insights on teaching. Knowledge is your reward. There's no signup or enrollment, and no start or end dates. OCW is self-paced learning at its best. Whether you’re a student, a teacher, or simply a curious person that wants to learn, MIT OpenCourseWare (OCW) offers a wealth of insight, inspiration, videos, and a whole lot more! Get the full picture on the OCW website at https://ocw.mit.edu. Accessibility: https://accessibility.mit.edu/ User comments policy: https://ocw.mit.edu/comments/ (Channel banner photo by Nietnagel on Flickr: https://flic.kr/p/8WXxfK.)

Episodes

Episode cover

6. Szemerédi's graph regularity lemma I: statement and proof

12 May 2020
1h 19m
Episode cover

13. Sparse regularity and the Green-Tao theorem

12 May 2020
1h 19m
Episode cover

16. Graph limits III: compactness and applications

12 May 2020
1h 19m
Episode cover

11. Pseudorandom graphs I: quasirandomness

12 May 2020
1h 18m
Episode cover

9. Szemerédi's graph regularity lemma IV: induced removal lemma

12 May 2020
1h 23m
Episode cover

19. Roth's theorem II: Fourier analytic proof in the integers

12 May 2020
1h 20m
Episode cover

2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem

12 May 2020
1h 12m
Episode cover

26. Sum-product problem and incidence geometry

12 May 2020
1h 14m
Episode cover

10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof

12 May 2020
1h 19m
Episode cover

8. Szemerédi's graph regularity lemma III: further applications

12 May 2020
1h 21m
Episode cover

17. Graph limits IV: inequalities between subgraph densities

12 May 2020
1h 19m
Episode cover

3. Forbidding a subgraph II: complete bipartite subgraph

12 May 2020
1h 16m
Episode cover

18. Roth's theorem I: Fourier analytic proof over finite field

12 May 2020
1h 14m
Episode cover

7. Szemerédi's graph regularity lemma II: triangle removal lemma

12 May 2020
1h 14m
Episode cover

5. Forbidding a subgraph IV: dependent random choice

12 May 2020
1h 20m
Episode cover

24. Structure of set addition IV: proof of Freiman's theorem

12 May 2020
1h 19m
Episode cover

20. Roth's theorem III: polynomial method and arithmetic regularity

12 May 2020
1h 20m
Episode cover

23. Structure of set addition III: Bogolyubov's lemma and the geometry of numbers

12 May 2020
1h 18m
Episode cover

15. Graph limits II: regularity and counting

12 May 2020
1h 21m
Episode cover

1. Introduction, Course Organization of MIT 7.016 Introductory Biology, Fall 2018

12 May 2020
38m
Page 100

Follow this podcast in Podwise

Sign in to get AI summaries, transcripts and mind maps for any episode, including new ones.

Open in Podwise