Rowmotion on the Chain of V's Poset and Whirling Dynamics

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 equivariant bijection between $k$-bounded $P$-partitions and order ideals of the poset $P\times [k]$ which conveys whirling to the well-studied rowmotion operator. As an application, we derive periodicity and homomesy results for rowmotion acting on the chain of V's poset $\sf V \times [k]$. We are able to generalize some of these results to the more complicated dynamics of rowmotion on $\sf C _{n}\times [k]$, where $\sf C _{n}$ is the claw poset with $n$ unrelated elements each covering $\widehat{0}$.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-07-17
DOI
https://doi.org/10.37236/14686
Primary Topic
Artificial Intelligence in Games
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rowmotion on the Chain of V's Poset and Whirling Dynamics

Matthew Plante, Tom Roby
The Electronic Journal of Combinatorics
Artificial Intelligence in Games
article

Rowmotion on the Chain of V's Poset and Whirling Dynamics

Matthew Plante, Tom Roby
article en

Abstract

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 equivariant bijection between $k$-bounded $P$-partitions and order ideals of the poset $P\times [k]$ which conveys whirling to the well-studied rowmotion operator. As an application, we derive periodicity and homomesy results for rowmotion acting on the chain of V's poset $\sf V \times [k]$. We are able to generalize some of these results to the more complicated dynamics of rowmotion on $\sf C _{n}\times [k]$, where $\sf C _{n}$ is the claw poset with $n$ unrelated elements each covering $\widehat{0}$.

The Electronic Journal of CombinatoricsVol. 33(3)
Alpena Community College (US)
Johns Hopkins University, Banff International Research Station for Mathematical Innovation and Discovery
Openalex Percentile: Top 100%
Artificial Intelligence in Games
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.