Theorems in discrete mathematics | Ramsey theory | Basic concepts in set theory

Large set (Ramsey theory)

In Ramsey theory, a set S of natural numbers is considered to be a large set if and only if Van der Waerden's theorem can be generalized to assert the existence of arithmetic progressions with common difference in S. That is, S is large if and only if every finite partition of the natural numbers has a cell containing arbitrarily long arithmetic progressions having common differences in S. (Wikipedia).

Video thumbnail

Advances on Ramsey numbers - Jacob Fox

https://www.math.ias.edu/seminars/abstract?event=83564

From playlist Computer Science/Discrete Mathematics

Video thumbnail

Introduction to sets || Set theory Overview - Part 2

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty

From playlist Set Theory

Video thumbnail

Introduction to sets || Set theory Overview - Part 1

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty

From playlist Set Theory

Video thumbnail

How many functions are there?

The answer is: a lot of them! In this video, I show that F(R), the set of functions from R to R, has the same cardinality as P(R), the set of subsets of the real numbers, which, in a previous video, I’ve shown to be much bigger than R. This is set theory at its finest :)

From playlist Set theory

Video thumbnail

Graph Theory: Ramsey Numbers

This video is about some of the basic properties of Ramsey numbers.

From playlist Basics: Graph Theory

Video thumbnail

Proof of Ramsey's theorem

Ramsey theory is based on Ramsey's theorem, because without it, there would be no Ramsey numbers, since they are not well-defined. This is part 2 of the trilogy of the Ramsey numbers. Useful link: https://en.wikipedia.org/wiki/Ramsey%27s_theorem#2-colour_case Other than commenting on the

From playlist Ramsey trilogy

Video thumbnail

What is a Set Complement?

What is the complement of a set? Sets in mathematics are very cool, and one of my favorite thins in set theory is the complement and the universal set. In this video we will define complement in set theory, and in order to do so you will also need to know the meaning of universal set. I go

From playlist Set Theory

Video thumbnail

Introduction to Set Theory (Discrete Mathematics)

Introduction to Set Theory (Discrete Mathematics) This is a basic introduction to set theory starting from the very beginning. This is typically found near the beginning of a discrete mathematics course in college or at the beginning of other advanced mathematics courses. ***************

From playlist Set Theory

Video thumbnail

Find a Set with Greatest Cardinality that is a Subset of Two Given Sets (Lists)

This video explains how to determine a set with greatest cardinality that is a subset of two given sets.

From playlist Sets (Discrete Math)

Video thumbnail

Dependent random choice - Jacob Fox

Marston Morse Lectures Topic: Dependent random choice Speaker: Jacob Fox, Stanford University Date: October 26, 2016 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Amanda Montejano: Zero-sum squares in bounded discrepancy {-1,1}-matrices

A square in a matrix $\mathcal M =(a_{ij})$ is a 2X2 sub-matrix of $\mathcal M$ with entries $a_{ij}, a_{i+s,j}, ai,j+s, a_{i+s,j+s}$s for some $s\geq 1$. An Erickson matrix is a square binary matrix that contains no squares with constant entries. In [Eri96], Erickson asked for the maximum

From playlist Virtual Conference

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics - part 6

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics - part 1

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics - part 7

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics - part 2

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics- part 4

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics - part 5

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Video thumbnail

Introduction to Sets and Set Notation

This video defines a set, special sets, and set notation.

From playlist Sets (Discrete Math)

Video thumbnail

Vitaly Bergelson: Mutually enriching connections between ergodic theory and combinatorics - part 3

Abstract : * The early results of Ramsey theory : Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres. * Three main principles of Ramsey theory : First principl

From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi

Related pages

Complement (set theory) | Natural number | Set (mathematics) | Ramsey theory | Partition of a set | Thick set | Arbitrarily large | Van der Waerden's theorem