English
Related papers

Related papers: Rowmotion on 321-avoiding permutations

200 papers

We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating,…

Combinatorics · Mathematics 2021-03-30 Joel Brewster Lewis

A centrosymmetric permutation is one which is invariant under the reverse-complement operation, or equivalently one whose associated standard Young tableaux under the Robinson-Schensted algorithm are both invariant under the Schutzenberger…

Combinatorics · Mathematics 2015-03-13 Mark F. Flanagan , Matteo Silimbani

Let $P$ be a finite poset and $L$ the associated distributive lattice of order ideals of $P$. Let $\rho$ denote the rowmotion bijection of the order ideals of $P$ viewed as a permutation matrix and $C$ the Coxeter matrix for the incidence…

Representation Theory · Mathematics 2024-09-04 René Marczinzik , Hugh Thomas , Emine Yıldırım

The fixed points of a natural torus action on the Hilbert schemes of points in C^2 are quiver varieties of infinite type A. The equivariant cohomology of the Hilbert schemes and quiver varieties can be given the structure of bosonic and…

Representation Theory · Mathematics 2011-07-13 Alistair Savage

Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define…

Combinatorics · Mathematics 2023-09-22 Jennifer Elder , Nadia Lafrenière , Erin McNicholas , Jessica Striker , Amanda Welch

We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a…

Chaotic Dynamics · Physics 2015-05-13 Jesus San Martin , M. Jose Moscoso , A. Gonzalez Gomez

We define a birational map between labelings of a rectangular poset and its associated trapezoidal poset. This map tropicalizes to a bijection between the plane partitions of these posets of fixed height, giving a new bijective proof of a…

Combinatorics · Mathematics 2023-11-14 Joseph Johnson , Ricky Ini Liu

We generalize the notion of the toggle group, as defined in [P. Cameron-D. Fon-der-Flaass '95] and further explored in [J. Striker-N. Williams '12], from the set of order ideals of a poset to any family of subsets of a finite set. We prove…

Combinatorics · Mathematics 2023-06-22 Jessica Striker

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

Combinatorics · Mathematics 2013-01-10 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

A 321-k-gon-avoiding permutation pi avoids 321 and the following four patterns: k(k+2)(k+3)...(2k-1)1(2k)23...(k+1), k(k+2)(k+3)...(2k-1)(2k)123...(k+1), (k+1)(k+2)(k+3)...(2k-1)1(2k)23...k, (k+1)(k+2)(k+3)...(2k-1)(2k)123...k. The…

Combinatorics · Mathematics 2016-09-07 T. Mansour , Z. Stankova

Let I_n(\pi) denote the number of involutions in the symmetric group S_n which avoid the permutation \pi. We say that two permutations \alpha,\beta\in\S{j} may be exchanged if for every n, k, and ordering \tau of j+1,...,k, we have…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

Combinatorics · Mathematics 2010-08-16 David Callan

Given a finite poset $P$, we study the _whirling_ action on vertex-labelings of $P$ with the elements $\{0,1,2,\dotsc ,k\}$. When such labelings are (weakly) order-reversing, we call them $k$-bounded $P$-partitions. We give a general…

Combinatorics · Mathematics 2025-10-06 Matthew Plante , Tom Roby

Let $M$ be a compact, connected symplectic manifold with a Hamiltonian action of a compact $n$-dimensional torus $G=T^n$. Suppose that $\sigma$ is an anti-symplectic involution compatible with the $G$-action. The real locus of $M$ is $X$,…

Symplectic Geometry · Mathematics 2007-05-23 Daniel Biss , Victor W. Guillemin , Tara S. Holm

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Anders Claesson , Mark Dukes , Sergey Kitaev

In a recent preprint, Mike Cummings showed that the smooth components of suitably parametrized Springer fibers are in bijection with contracted, fully reduced Pl\"ucker degree-two $\mathfrak{sl}_r$-webs of standard type and that are…

Combinatorics · Mathematics 2026-03-19 Jessica Striker , Bridget Eileen Tenner

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

Combinatorics · Mathematics 2024-04-17 Abdelmalek Abdesselam , Pedro Brunialti , Tristan Doan , Philip Velie

We define piecewise-linear and birational analogues of the toggle-involutions on order ideals of posets studied by Striker and Williams and use them to define corresponding analogues of rowmotion and promotion that share many of the…

Combinatorics · Mathematics 2018-09-06 David Einstein , James Propp

Rowmotion is a simple cyclic action on the distributive lattice of order ideals of a poset: it sends the order ideal x to the order ideal generated by the minimal elements not in x. It can also be computed in "slow motion" as a sequence of…

Combinatorics · Mathematics 2019-06-19 Hugh Thomas , Nathan Williams

Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman