English
Related papers

Related papers: Rowmotion on fences

200 papers

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…

Combinatorics · Mathematics 2022-08-26 Pranjal Dangwal , Jamie Kimble , Jinting Liang , Jianzhi Lou , Bruce E. Sagan , Zach Stewart

We completely describe the order ideal (resp. antichain) toggleability space for general fences: the space of statistics which are linear combinations of order ideal (antichain) indicator functions and equal to a constant plus a linear…

Combinatorics · Mathematics 2024-06-05 Alec Mertin , Svetlana Poznanović

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

The rowmotion operator acting on the set of order ideals of a finite poset has been the focus of a significant amount of recent research. One of the major goals has been to exhibit homomesies: statistics that have the same average along…

Combinatorics · Mathematics 2023-12-21 Colin Defant , Sam Hopkins , Svetlana Poznanović , James Propp

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…

Combinatorics · Mathematics 2016-04-05 Shahrzad Haddadan

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

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…

Combinatorics · Mathematics 2025-05-08 Nadia Lafrenière , Joel Brewster Lewis , Erin McNicholas , Jessica Striker , Amanda Welch

Birational rowmotion is an action on the space of assignments of rational functions to the elements of a finite partially-ordered set (poset). It is lifted from the well-studied rowmotion map on order ideals (equivariantly on antichains) of…

Combinatorics · Mathematics 2018-08-13 Gregg Musiker , Tom Roby

J. Propp and T. Roby isolated a phenomenon in which a statistic on a set has the same average value over any orbit as its global average, naming it homomesy. They proved that the cardinality statistic on order ideals of the product of two…

Combinatorics · Mathematics 2019-11-21 Corey Vorland

Many invertible actions $\tau$ on a set ${\mathcal{S}}$ of combinatorial objects, along with a natural statistic $f$ on ${\mathcal{S}}$, exhibit the following property which we dub \textbf{homomesy}: the average of $f$ over each…

Combinatorics · Mathematics 2015-06-22 James Propp , Tom Roby

We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal…

Combinatorics · Mathematics 2025-08-28 Esther Banaian , Emily Barnard , Sunita Chepuri , Jessica Striker

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…

Combinatorics · Mathematics 2025-11-19 William Dowling , Nadia Lafreniere

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

In this paper, we analyze the toggle group on the set of antichains of a poset. Toggle groups, generated by simple involutions, were first introduced by Cameron and Fon-Der-Flaass for order ideals of posets. Recently Striker has motivated…

Combinatorics · Mathematics 2019-02-26 Michael Joseph

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…

Combinatorics · Mathematics 2015-09-29 David B. Rush , Kelvin Wang

The rowmotion action on order ideals or on antichains of a finite partially ordered set has been studied (under a variety of names) by many authors. Depending on the poset, one finds unexpectedly interesting orbit structures, instances of…

Combinatorics · Mathematics 2020-04-28 Michael Joseph , Tom Roby

This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy…

Combinatorics · Mathematics 2018-07-16 Michael Joseph , Tom Roby

The dynamics of certain combinatorial actions and their liftings to actions at the piecewise-linear and birational level have been studied lately with an eye towards questions of periodicity, orbit structure, and invariants. One key…

Combinatorics · Mathematics 2023-06-22 Michael Joseph , Tom Roby

This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as…

Combinatorics · Mathematics 2025-12-10 Michael Joseph , James Propp , Tom Roby

We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distributive lattices of lower ideals of fence posets are unimodal. We do this by introducing a related class of circular fence posets and proving a…

Combinatorics · Mathematics 2025-04-08 Ezgi Kantarcı Oğuz , Mohan Ravichandran
‹ Prev 1 2 3 10 Next ›