In case the previous post concerning concentration on the Boolean hypercube wasn’t enough for you, you can now watch a short, 20-minute animated video that I made for the STOC 2020 conference in theoretical computer science: STOC is a large (by theoretical computer science standards anyway) annual conference, which was supposed to take place in … More STOC 2020 lecture available online
I’m happy to say that my advisor Ronen Eldan and I somewhat recently uploaded a paper to the arXiv under the title “Concentration on the Boolean hypercube via pathwise stochastic analysis” (https://arxiv.org/abs/1909.12067), wherein we prove inequalities on the Boolean hypercube using a cool continuous-time random process. In the previous post, I pretended that I had … More New paper on arXiv: Concentration on the Boolean hypercube via pathwise stochastic analysis
I’m happy to say that my advisor Ronen Eldan and I somewhat recently uploaded a paper to the arXiv under the title “Concentration on the Boolean hypercube via pathwise stochastic analysis” (https://arxiv.org/abs/1909.12067), wherein we prove inequalities on the Boolean hypercube using a cool continuous-time random process. That’s quite a mouthful, I know, and quite unfortunately, … More Catastrophic cubic crash course
The Technion offers many of its mathematics courses, such as infinitesimal calculus and algebra, at several levels, with each course aimed at a different audience. At the lowest level are courses aimed at the “soft sciences”, such as biology, which usually need only elementary, practical calculations. In the middle sit the majority of the Technion’s … More Introduction to sandwich making
This post is about the basics of the “gradient descent” method for finding the minimum of a function. I started writing it mainly to review the optimization material of lectures by Sébastien Bubeck given in Seattle. All of the material can be found elsewhere (for example, Sébastien’s book), but I can assure you that in … More Descent into madness
I’m happy to say that I recently uploaded a paper to the arXiv under the title “A conformal Skorokhod embedding” (https://arxiv.org/abs/1905.00852). In this post, I’d like to explain what the Skorokhod embedding problem is, how I came across it, some previously known solutions, and my own tiny contribution. But really, all of this is just … More New paper on arXiv: A conformal Skorokhod embedding
Part 1: Archery Lately I’ve been interested in archery. The target of target archery is to shoot a circle square in the middle. The target is usually placed quite far away, some 70 meters in the case of the Olympic games, so it’s not always very easy. Here is one of my volleys from 18 … More Low-dimensional archers have it easy
Here is a silly little question that my friend Ori and I ran into. Let be a decreasing sequence of positive real numbers which tends to 0. Perhaps in a more decent universe, the sum would always equal some finite number, but already in kindergarten we learn that that’s not true: For example, the partial … More Converging Bernoulli Series
Last time I introduced a neat little question: Is it true that every infinite path in contains arbitrarily long arithmetic progressions? For example, in the following path, the squares colored in red have coordinates , which form an arithmetic progression of length 3, where every two consecutive points differ by . As it turns out, … More Arithmetic progressions in space!
Here is a neat question that I stumbled upon during my academic random walk. A sequence of vectors is called an arithmetic progression of length k if there exists a vector such that . In other words, an arithmetic progression in is exactly the generalization you would expect of your good ol’ high-school arithmetic progression … More Arithmetic progressions in space?
This is part three in a three-part series about recurrence and transience on the integer lattices. Here is part one. Here is part two. Weary and tired, we are approaching the end of our coin-flipping, lattice-exploring adventures, but with one aching question still burning deep within our hearts: Is the random walk on the three-dimensional … More There and back again, part 3
This is part two in a three-part series about recurrence and transience on the integer lattices. Here is part one. Here is part three. In the previous post, we saw that the integer lattice is recurrent. This means that a simple random walk, when starting at the origin , will return to the origin with … More There and back again, part 2
This is part one in a three-part series about recurrence and transience on the integer lattices. Here is part two. Here is part three. It is a truth universally acknowledged, that a single man in possession of a coin, who repeatedly flips it, taking one step forwards if it comes up heads, and one step … More There and back again, part 1
In spirit of “Animals with Misleading Names” and the discussion about nonstandard adjectives in mathematics, I present: mathematical objects with misleading names: (Non-original images are either in public domain, or can be found here and here.
Look, look! It’s a book! I wonder what’s inside. I sure am glad that the Weizmann mathematics library is “in the know” and keeps only the most updated and useful books around. In case you haven’t heard much about prime numbers, you can read about them in the book’s introduction: The introduction is actually rather … More A Prime Book
A while ago I wrote a post about indistinguishable sceneries on the Boolean hypercube. The post contained this (pretty, if I may so myself) image: This is a three dimensional embedding of the four dimensional Boolean hypercube; by “embedding”, I mean putting the vertices and edges of the 4d cube in some way in space, … More Finding knots in graph embeddings