Media Summary: This is a graduate course that I taught at Sungkyunkwan University in 2017. We closely follow the book: Proofs and Confirmations ... This is an introduction to the concept of entropy (in the information-theoretic sense of the word). In the next few videos I shall say ... Let X be a subset of R^n such that there are only two possible distances between distinct elements of X. How large can X be?
Topics In Combinatorics Lecture 8 - Detailed Analysis & Overview
This is a graduate course that I taught at Sungkyunkwan University in 2017. We closely follow the book: Proofs and Confirmations ... This is an introduction to the concept of entropy (in the information-theoretic sense of the word). In the next few videos I shall say ... Let X be a subset of R^n such that there are only two possible distances between distinct elements of X. How large can X be? We prove that the number of k-dimensional subspaces of a finite vector space F_q^n is a q-binomial coefficients. We discuss ... A result that has played a central role in additive MIT 6.1200J Mathematics for Computer Science, Spring 2024 Instructor: Erik Demaine View the complete course: ...
An introduction to the Fibonacci numbers and how they can be used to count. Also, we explore recursion in general and do some ... A line in F_p^n is a set of the form {x+ty: t=0,1,...,p-1}. We call y the direction of the line. How small can a subset A of F_p^n be if it ... NSF/CBMS Conference: Applications of Polynomial Systems, TCU, June 4- Introduction to Probabilistic Combinatorics (Lecture 8) The main result discussed here is a beautiful proof by Gyula Katona of the Erdos-Ko-Rado theorem, which answers the following ...
![[Topics in Combinatorics] Lecture 8. q binomial theorem and inversions of permutations](https://i.ytimg.com/vi/DMlS-5R8kbg/mqdefault.jpg)
