Video Lectures

Separate tags with a comma.

A number is said to be $y$-smooth if all of its prime factors are less than $y$. Such numbers appear in many places throughout analytic and combinatorial number theory, and much work has been done to investigate their distribution.
I will try to...

Locally decodable codes (LDCs) are error-correcting codes that allow for highly-efficient recovery of "pieces" of information even after arbitrary corruption of a codeword. Locally testable codes (LTCs) are those that allow for highly-efficient...