Numerical simulation of the geometrical-optics reduction of CE2 and comparisons to quasilinear dynamics

Zonal flows have been observed to appear spontaneously from turbulence in a number of physical settings. A complete theory for their behavior is still lacking. Recently, a number of studies have investigated the dynamics of zonal flows using quasilinear theories and the statistical framework of a second-order cumulant expansion (CE2). A geometrical-optics (GO) reduction of CE2, derived under an assumption of separation of scales between the fluctuations and the zonal flow, is studied here numerically. The reduced model, CE2-GO, has a similar phase-space mathematical structure to the traditional wave-kinetic equation, but that wave-kinetic equation has been shown to fail to preserve enstrophy conservation and to exhibit an ultraviolet catastrophe. CE2-GO, in contrast, preserves nonlinear conservation of both energy and enstrophy. We show here how to retain these conservation properties in a pseudospectral simulation of CE2-GO. We then present nonlinear simulations of CE2-GO and compare with direct simulations of quasilinear (QL) dynamics. We find that CE2-GO retains some similarities to QL. The partitioning of energy that resides in the zonal flow is in good quantitative agreement between CE2-GO and QL. On the other hand, the length scale of the zonal flow does not follow the same qualitative trend in the two models. Overall, these simulations indicate that CE2-GO provides a simpler and more tractable statistical paradigm than CE2, but CE2-GO is missing important physics.Comment: 8 pages, 5 figure

Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in $S_j$ is at least $3 -e$. Given a permutation $\sigma$, we let $\text{Des}(\sigma)$ denote the set of descents of $\sigma$. We study the class of permutations $\sigma \in S_{kn}$ whose descent set is contained in the set $\{k,2k, \ldots (n-1)k\}$. For example, up-down permutations in $S_{2n}$ are the set of permutations whose descent equal $\sigma$ such that $\text{Des}(\sigma) = \{2,4, \ldots, 2n-2\}$. There are natural analogues of the minimal overlapping permutations for such classes of permutations and we study the proportion of minimal overlapping patterns for each such class. We show that the proportion of minimal overlapping permutations in such classes approaches $1$ as $k$ goes to infinity. We also study the proportion of minimal overlapping patterns in standard Young tableaux of shape $(n^k)$.Comment: Accepted by Discrete Math and Theoretical Computer Science. Thank referees' for their suggestion

Quadrant marked mesh patterns in 123-avoiding permutations

Given a permutation $\sigma = \sigma_1 \ldots \sigma_n$ in the symmetric group $\mathcal{S}_{n}$, we say that $\sigma_i$ matches the quadrant marked mesh pattern $\mathrm{MMP}(a,b,c,d)$ in $\sigma$ if there are at least $a$ points to the right of $\sigma_i$ in $\sigma$ which are greater than $\sigma_i$, at least $b$ points to the left of $\sigma_i$ in $\sigma$ which are greater than $\sigma_i$, at least $c$ points to the left of $\sigma_i$ in $\sigma$ which are smaller than $\sigma_i$, and at least $d$ points to the right of $\sigma_i$ in $\sigma$ which are smaller than $\sigma_i$. Kitaev, Remmel, and Tiefenbruck systematically studied the distribution of the number of matches of $\mathrm{MMP}(a,b,c,d)$ in 132-avoiding permutations. The operation of reverse and complement on permutations allow one to translate their results to find the distribution of the number of $\mathrm{MMP}(a,b,c,d)$ matches in 231-avoiding, 213-avoiding, and 312-avoiding permutations. In this paper, we study the distribution of the number of matches of $\mathrm{MMP}(a,b,c,d)$ in 123-avoiding permutations. We provide explicit recurrence relations to enumerate our objects which can be used to give closed forms for the generating functions associated with such distributions. In many cases, we provide combinatorial explanations of the coefficients that appear in our generating functions