/explore
|
You are here 
|
mycqstate.wordpress.com | ||
| | | | |
polymathprojects.org
|
|
| | | | | I've been feeling slightly guilty over the last few days because I've been thinking privately about the problem of improving the Roth bounds. However, the kinds of things I was thinking about felt somehow easier to do on my own, and my plan was always to go public if I had any idea that was... | |
| | | | |
francisbach.com
|
|
| | | | | [AI summary] This mathematical post explores the geometry of positive semi-definite matrices using the von Neumann entropy and related Bregman divergences to derive concentration inequalities for random matrices. | |
| | | | |
lucatrevisan.wordpress.com
|
|
| | | | | (This is the sixth in a series of posts on online optimization techniques and their ``applications'' to complexity theory, combinatorics and pseudorandomness. The plan for this series of posts is to alternate one post explaining a result from the theory of online convex optimization and one post explaining an ``application.'' The first two posts were... | |
| | | | |
djalil.chafai.net
|
|
| | | This post provides the solution to a tiny exercise of probability theory, answering the question asked by a student during the MAP-432 class yesterday. Let \( {(\Omega,\mathcal{F},\mathbb{P})} \) be a probability space equipped with a filtration \( {{(\mathcal{F}_n)}_{n\geq0}} \). Recall that a random variable \( {\tau} \) taking values in \( {\mathbb{N}=\{0,1,\ldots\}} \) is a stopping time when \( {\{\tau=n\}\in\mathcal{F}_n}... | ||
