| 1 | -- | 20 | Persi Diaconis, Ronald L. Graham, Xiaoyu He, Sam Spiro. Card guessing with partial feedback |
| 21 | -- | 28 | Asaf Ferber, Matthew Kwan, Lisa Sauermann. Singularity of sparse random matrices: simple proofs |
| 29 | -- | 53 | Catherine S. Greenhill, Mikhail Isaev, Gary Liang. Spanning trees in random regular uniform hypergraphs |
| 54 | -- | 72 | Sergey G. Bobkov, Arnaud Marsiglietti, James Melbourne. Concentration functions and entropy bounds for discrete log-concave distributions |
| 73 | -- | 100 | Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester. The power of two choices for random walks |
| 101 | -- | 108 | Boris Bukh, Ting-Wei Chao, Ron Holzman. On convex holes in d-dimensional point sets |
| 109 | -- | 122 | József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu. Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree |
| 123 | -- | 135 | Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood. Clustered 3-colouring graphs of bounded degree |
| 136 | -- | 143 | Bojan Mohar, Hehui Wu. Triangle-free subgraphs with large fractional chromatic number |
| 144 | -- | 165 | Thibaut Lemoine. Large N behaviour of the two-dimensional Yang-Mills partition function |
| 166 | -- | 183 | Nardo Giménez, Guillermo Matera, Mariana Pérez, Melina Privitelli. Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field |