Related papers: Rowmotion on 321-avoiding permutations

We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…

We show that the space of anti-symplectic involutions of a monotone $S^2\times S^2$ whose fixed points set is a Lagrangian sphere is connected. This follows from a stronger result, namely that any two anti-symplectic involutions in that…

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

A Weierstrass Prym eigenform is an Abelian differential with a single zero on a Riemann surface possessing some special kinds of symmetries. Such surfaces come equipped with an involution, known as a Prym involution. They were originally…

The Fon-Der-Flaass action partitions the order ideals of a poset into disjoint orbits. For a product of two chains, Propp and Roby observed --- across orbits --- the mean cardinality of the order ideals within an orbit to be invariant. That…

A collection $B$ of patterns is called inversion monotone if $\mathrm{av}_n^k(B)$, the number of $B$-avoiding permutations of length $n$ with $k$ inversions, is weakly increasing in $n$ for any fixed $k$. In 2012, Claesson, Jel\'inek and…

We prove that the homology of the mapping class groups of non-orientable surfaces stabilizes with the genus of the surface. Combining our result with recent work of Madsen and Weiss, we obtain that the classifying space of the stable…

In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing…

West's stack-sorting map involves a stack which avoids the permutation $21$ consecutively. Defant and Zheng extended this to a consecutive-pattern-avoiding stack-sorting map $SC_\sigma$, where the stack must always avoid a given permutation…

Using a smooth version of the Connes--Thom isomorphism in Grensing's bivariant K-theory for locally convex algebras, we prove an equivariant version of the Connes--Thom isomorphism in periodic cyclic homology. As an application, we prove…

We give a combinatorial formula for the Kazhdan-Lusztig polynomials $P_{x,w}$ in the symmetric group when $w$ is a 321-hexagon-avoiding permutation. Our formula, which depends on a combinatorial framework developed by Deodhar, can be…

We consider the class $S_n(1324)$ of permutations of size $n$ that avoid the pattern 1324 and examine the subset $S_n^{a\prec n}(1324)$ of elements for which $a\prec n\prec [a-1]$, $a\ge 1$. This notation means that, when written in one…

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

More than a century ago, L. E. J. Brouwer proved a famous theorem, which says that any orientation preserving homeomorphism of the plane having a periodic point must have a fixed point. In recent years, there are still some authors giving…

We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which…

In 2012 B\'ona showed the rather surprising fact that the cumulative number of occurrences of the classical patterns $231$ and $213$ are the same on the set of permutations avoiding $132$, beside the pattern based statistics $231$ and $213$…

We describe additive (unstable) operations from a theory A^* obtained from Algebraic Cobordism of M.Levine-F.Morel by change of coefficients to any oriented cohomology theory B^*. We prove that there is 1-to-1 correspondence between the set…

Birational rowmotion is a discrete dynamical system on the set of all positive real-valued functions on a finite poset, which is a birational lift of combinatorial rowmotion on order ideals. It is known that combinatorial rowmotion for a…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$. We first enumerate the permutation class…