Related papers: Rowmotion on 321-avoiding permutations

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding…

For a Weyl group $W$ of rank $r$, the $W$-Catalan number is the number of antichains of the poset of positive roots, and the $W$-Narayana numbers refine the $W$-Catalan number by keeping track of the cardinalities of these antichains. The…

We study maps on the set of permutations of n generated by the R\'enyi-Foata map intertwined with other dihedral symmetries (of a permutation considered as a 0-1 matrix). Iterating these maps leads to dynamical systems that in some cases…

Motivated by recent results on quasi-Stirling permutations, which are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid the "crossing" patterns 1212 and 2121, we consider nonnesting permutations, defined as those that avoid…

Given a permutation $\tau$ defined on a set of combinatorial objects $S$, together with some statistic $f:S\rightarrow \mathbb{R}$, we say that the triple $\langle S, \tau,f \rangle$ exhibits homomesy if $f$ has the same average along all…

In this paper, we construct bijections between Dyck paths, noncrossing partitions, and 231-avoiding permutations, which send the area statistic on Dyck paths to the inversion number on noncrossing partitions and on 231-avoiding…

In this paper, we perform a systematic study of permutation statistics and bijective maps on permutations in which we identify and prove 122 instances of the homomesy phenomenon. Homomesy occurs when the average value of a statistic is the…

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…

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 have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with…

We study the asymptotic stability of periodic solutions for sweeping processes defined by a polyhedron with translationally moving faces. Previous results are improved by obtaining a stronger $W^{1,2}$ convergence. Then we present an…

A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…

This article illustrates the dynamical concept of $homomesy$ in three kinds of dynamical systems -- combinatorial, piecewise-linear, and birational -- and shows the relationship between these three settings. In particular, we show how the…

A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Elizalde, Roby, Plante and Sagan considered rowmotion on fences…

We construct a bijection between 231-avoiding permutations and Dyck paths that sends the sum of the major index and the inverse major index of a 231-avoiding permutation to the major index of the corresponding Dyck path. Furthermore, we…

We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…

We continue our study of a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We focus on bounded affine permutations of size $N$ that avoid the…

We study rowmotion dynamics on interval-closed sets. Our first main result proves a simplification of the global definition of interval-closed set rowmotion from (Elder, Lafreni\`ere, McNicholas, Striker, and Welch 2024). We then completely…

Homomesy is an invariance phenomenon in dynamical algebraic combinatorics which occurs when the average value of some statistic on a set of combinatorial objects is the same over each orbit generated by a map on these objects. In this paper…