https://m.youtube.com/watch?v=HYsv5DRl8L4 Second talk by Misha Gromov at Stanford. Nov 11. I really enjoyed the talk, truly inspiring. He walked through different scientific fields including biology, linguistics, and psychology across several centuries, analyzing how people studied science and gave his insights (from the perspective of a mathematician I think). -worth noticing how rephrasing a finding in … Continue reading The Unknown Unknown in the Logic of the Mind

Tag: Stanford

# Scalar Curvature, Convex Polyhedra & Differential Operators

Prof Misha Gromov gave two lectures at Stanford on Nov 10 and Nov 11. Here is a brief summary of his Nov 10 lecture: Scalar curvature influences topology and asymptotic geometry of Riemannian manifolds, it is associated with the Einstein equation, it controls the Hamilton-Ricci flow. Yet, the geometric meaning of the scalar curvature remains … Continue reading Scalar Curvature, Convex Polyhedra & Differential Operators

# 7 Shuffles is Enough

A famous result by our mathemagician Persi Diaconis: 7 shuffles is enough. Put it in everyday words, to randomize one set of Poker cards, you need to (Riffle) shuffle at least 7 times. *Side note: according to this lecture notes, the interpretation is not correct. To completely randomize the deck, you need 11 or more. … Continue reading 7 Shuffles is Enough

# Non-Measuable Ghost: Persi’s Halloween Talk

It was a ghostful Monday--a Monday full of non-measurable ghosts. You've probably heard of this one sphere cut into five pieces becomes two spheres story. This Monday Professor Persi Diaconis gave a public Halloween lecture about these ghosts. I would love to share an amazing proof that shows 0.5=0.99 or 0.999 or 0.9999. Well, with … Continue reading Non-Measuable Ghost: Persi’s Halloween Talk

# Bolloba’s First Theorem

From Don Knuth‘s Theory Lunch Talk at Stanford on Oct 6. I found a blog post talking about the exact same thing, so won’t repeat. The idea behind the proof of this rather combinatorial theorem is interesting. The main idea is to construct a nice mapping between a permutation of (1,2, …., n) and a pair of (finite) sets: (A, B) based on the elements inside the sets.

You can try to figure out and prove when the equality holds by yourself as an exercise.

When is this Theorem useful? For example, in making representative families <– so that we have better memory performance. Think about it!

Too lazy D:< Plzzzz let me know if you made a nice drawing for the proof of the theorem (Shouldn’t be too hard) so that I can include your image here rather than this textbook cover.

The following theorem of Bollobas is an important result from extremal set theory. It has apparently been rediscovered several times by others. It implies certain classical results, such as Sperner’s Theorem, and has some interesting extensions.

**Theorem** (Bollobas). Let $latex A_1, ldots, A_m$ and $latex B_1, ldots, B_m$ be sequences of $latex a$-element and $latex b$-element sets respectively. Suppose that $latex A_i cap B_i = emptyset$ and $latex A_i cap B_j neq emptyset$ whenever $latex i neq j$. Then $latex m leq {a+b choose a}$.

*Proof*. Let $latex X$ be the union of all the $latex A_i$’s and $latex B_i$’s. Consider an arbitrary permutation $latex pi$ of $latex X$. We claim that there is at most one pair $latex (A_i, B_i)$ such that all of the elements of $latex A_i$ precede those of $latex B_i$ in the ordering $latex pi$. Suppose to the contrary that there are two…

View original post 301 more words