We improve the upper bound on worst case trace reconstruction from $\exp(O(n^{1/3}))$ to $\exp(\widetilde{O}(n^{1/5}))$ for any deletion probability $q \le \frac{1}{2}$.
Upper bound of loss probability in an OFDMA system with randomly located users
An upper bound on the number of self-avoiding polygons via joining
An upper bound on the size of avoidance couplings on $K_n$
![QR code for arXiv:2009.03296 [math.PR]](http://oss.arxitics.com/images/favicon.svg)