The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $\unicode[STIX]{x1D707}$ on the full $d$-ary tree of height $n$. If $\unicode[STIX]{x1D707}=\unicode[STIX]{x1D6FA}(d^{2})$, all of the vertices are visited in time $\unicode[STIX]{x1D6E9}(n\log n)$ with high probability. Conversely, if $\unicode[STIX]{x1D707}=O(d)$ the cover time is $\exp (\unicode[STIX]{x1D6E9}(\sqrt{n}))$ with high probability.

We construct, for any set of primes $S$, a triangulated category (in fact a stable $\infty$-category) whose Grothendieck group is $S^{-1}\mathbf{Z}$. More generally, for any exact $\infty$-category $E$, we construct an exact $\infty$-category $S^{-1}E$ of equivariant sheaves on the Cantor space with respect to an action of a dense subgroup of the circle. We show that this $\infty$-category is precisely the result of categorifying division by the primes in $S$. In particular, $K_{n}(S^{-1}E)\cong S^{-1}K_{n}(E)$.

We show that, if $b\in L^{1}(0,T;L_{\operatorname{loc}}^{1}(\mathbb{R}))$ has a spatial derivative in the John–Nirenberg space $\operatorname{BMO}(\mathbb{R})$, then it generates a unique flow $\unicode[STIX]{x1D719}(t,\cdot )$ which has an $A_{\infty }(\mathbb{R})$ density for each time $t\in [0,T]$. Our condition on the map $b$ is not only optimal but also produces a sharp quantitative estimate for the density. As a killer application we achieve the well-posedness for a Cauchy problem of the transport equation in $\operatorname{BMO}(\mathbb{R})$.

We develop in this work a general version of paracontrolled calculus that allows to treat analytically within this paradigm a whole class of singular partial differential equations with the same efficiency as regularity structures. This work deals with the analytic side of the story and offers a toolkit for the study of such equations, under the form of a number of continuity results for some operators, while emphasizing the simple and systematic mechanics of computations within paracontrolled calculus, via the introduction of two model operations $\mathsf{E}$ and $\mathsf{F}$. We illustrate the efficiency of this elementary approach on the example of the generalized parabolic Anderson model equation

$$\begin{eqnarray}(\unicode[STIX]{x2202}_{t}+L)u=f(u)\unicode[STIX]{x1D701},\end{eqnarray}$$

$$\begin{eqnarray}(\unicode[STIX]{x2202}_{t}+L)u=f(u)\unicode[STIX]{x1D701}+g(u)(\unicode[STIX]{x2202}u)^{2},\end{eqnarray}$$

$(1+1)$

Let $M$ be a regular matroid. The Jacobian group $\text{Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the critical group or sandpile group) $\operatorname{Jac}(G)$ of a graph $G$ (in which case bases of the corresponding regular matroid are spanning trees of $G$). There are many explicit combinatorial bijections in the literature between the Jacobian group of a graph $\text{Jac}(G)$ and spanning trees. However, most of the known bijections use vertices of $G$ in some essential way and are inherently ‘nonmatroidal’. In this paper, we construct a family of explicit and easy-to-describe bijections between the Jacobian group of a regular matroid $M$ and bases of $M$, many instances of which are new even in the case of graphs. We first describe our family of bijections in a purely combinatorial way in terms of orientations; more specifically, we prove that the Jacobian group of $M$ admits a canonical simply transitive action on the set ${\mathcal{G}}(M)$ of circuit–cocircuit reversal classes of $M$, and then define a family of combinatorial bijections $\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D70E},\unicode[STIX]{x1D70E}^{\ast }}$ between ${\mathcal{G}}(M)$ and bases of $M$. (Here $\unicode[STIX]{x1D70E}$ (respectively $\unicode[STIX]{x1D70E}^{\ast }$) is an acyclic signature of the set of circuits (respectively cocircuits) of $M$.) We then give a geometric interpretation of each such map $\unicode[STIX]{x1D6FD}=\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D70E},\unicode[STIX]{x1D70E}^{\ast }}$ in terms of zonotopal subdivisions which is used to verify that $\unicode[STIX]{x1D6FD}$ is indeed a bijection. Finally, we give a combinatorial interpretation of lattice points in the zonotope $Z$; by passing to dilations we obtain a new derivation of Stanley’s formula linking the Ehrhart polynomial of $Z$ to the Tutte polynomial of $M$.

We construct an $S_{3}$-symmetric probability distribution on $\{(a,b,c)\in \mathbb{Z}_{{\geqslant}0}^{3}\,:\,a+b+c=n\}$ such that its marginal achieves the maximum entropy among all probability distributions on $\{0,1,\ldots ,n\}$ with mean $n/3$. Existence of such a distribution verifies a conjecture of Kleinberg et al. [‘The growth rate of tri-colored sum-free sets’, Discrete Anal. (2018), Paper No. 12, arXiv:1607.00047v1], which is motivated by the study of sum-free sets.

We prove a character formula for some closed fine Deligne–Lusztig varieties. We apply it to compute fixed points for fine Deligne–Lusztig varieties arising from the basic loci of Shimura varieties of Coxeter type. As an application, we prove an arithmetic intersection formula for certain diagonal cycles on unitary and GSpin Rapoport–Zink spaces arising from the arithmetic Gan–Gross–Prasad conjectures. In particular, we prove the arithmetic fundamental lemma in the minuscule case, without assumptions on the residual characteristic.