Related papers: Rowmotion on 321-avoiding permutations

The bounded orbit conjecture says that every homeomorphism on the plane with each of its orbits being bounded must have a fixed point. Brouwer's translation theorem asserts that the conjecture is true for orientation preserving…

A bijection between $(31245,32145,31254,32154)$-avoiding permutations and $(31425,32415,31524,32514)$-avoiding permutations is constructed, which preserves five classical set-valued statistics. Combining with two codings of permutations due…

We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric…

Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…

Shallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy…

We study the number of 231-avoiding permutations with $j$-descents and maximum drop is less than or equal to $k$ which we denote by $a_{n,231,j}^{(k)}$. We show that $a_{n,231,j}^{(k)}$ also counts the number of Dyck paths of length $2n$…

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…

A rational pseudo-rotation $f$ of the torus is a homeomorphism homotopic to the identity with a rotation set consisting of a single vector $v$ of rational coordinates. We give a classification for rational pseudo-rotations with an invariant…

We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…

The fundamental bijection is a bijection $\theta:\mathcal{S}_n\to\mathcal{S}_n$ in which one uses the standard cycle form of one permutation to obtain another permutation in one-line form. In this paper, we enumerate the set of permutations…

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…

We introduce the notion of 321-avoiding permutations in the affine Weyl group $W$ of type $A_{n-1}$ by considering the group as a George group (in the sense of Eriksson and Eriksson). This enables us to generalize a result of Billey,…

In this paper we prove a refined major-balance identity on the $321$-avoiding involutions of length $n$, respecting the leading element of permutations. The proof is based on a sign-reversing involution on the lattice paths within a…

We prove the crepant resolution conjecture for Donaldson-Thomas invariants of hard Lefschetz CY3 orbifolds, formulated by Bryan-Cadman-Young, interpreting the statement as an equality of rational functions. In order to do so, we show that…

This study presents a study of equilibrium points, periodic orbits, stabilities, and manifolds in a rotating plane symmetric potential field. It has been found that the dynamical behaviour near equilibrium points is completely determined by…

We develop an analytical Hamiltonian formalism adapted to the study of the motion of two planets in co-orbital resonance. The Hamiltonian, averaged over one of the planetary mean longitude, is expanded in power series of eccentricities and…

Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results. The first is a simplified enumeration of the 3124, 1234-avoiding permutations,…

We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…