Related papers: Semi-Baxter and strong-Baxter: two relatives of th…

We study permutations that are sorted by operators of the form $\mathbf{S} \circ \alpha \circ \mathbf{S}$, where $\mathbf{S}$ is the usual stack sorting operator introduced by D. Knuth and $\alpha$ is any $D_8$-symmetry obtained combining…

We review and extend what is known about the generating functions for consecutive pattern-avoiding permutations of length 4, 5 and beyond, and their asymptotic behaviour. There are respectively, seven length-4 and twenty-five length-5…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

For the quantum walled Brauer algebra, we construct its Specht modules and (for generic parameters of the algebra) seminormal modules. The latter construction yields the spectrum of a commuting family of Jucys--Murphy elements. We also…

Recently, B\'ona and Smith defined strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\tau$ if $\pi$ and $\pi^2$ both avoid $\tau$. They conjectured that for every positive integer $k$, there is a…

We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…

We construct large Salem sets avoiding patterns, complementing previous constructions of pattern avoiding sets with large Hausdorff dimension. For a (possibly uncountable) family of uniformly Lipschitz functions $\{ f_i :…

We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…

This paper is one of a series whose goal is to enumerate the avoiders, in the sense of classical pattern avoidance, for each triple of 4-letter patterns. There are 317 symmetry classes of triples of 4-letter patterns, avoiders of 267 of…

A new class of indecomposable, irretractable, involutive, non-degenerate set-theoretic solutions of the Yang--Baxter equation is constructed. This class complements the class of such solutions constructed in \cite{CO22} and together they…

In 2019, B\'ona and Smith introduced the notion of \emph{strong pattern avoidance}, that is, a permutation and its square both avoid a given pattern. In this paper, we enumerate the set of permutations $\pi$ which not only strongly avoid…

A dual weak brace is an algebraic structure $\left(S,\,+,\,\circ\right)$ including skew braces and giving rise to a set-theoretic solution of the Yang-Baxter equation. We show that such a map belongs to a family of set-theoretic solutions,…

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of…

We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima,…

We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.

We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…

Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with natural involutions. In this paper, we add a combinatorial family to the list, and show that the known bijections between these…

Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…

We study the structure and enumeration of the final two 2x4 permutation classes, completing a research program that has spanned almost two decades. For both classes, careful structural analysis produces a complicated functional equation.…