6 citations · 9 across the 8 of their papers we have counts for
8 papers
Toggling, rowmotion, and homomesy on interval-closed sets
Jennifer Elder, Nadia Lafrenière, Erin McNicholas +2
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.…
Parking functions, Fubini rankings, and Boolean intervals in the weak order of
Jennifer Elder, Pamela E. Harris, Jan Kretschmann +1
Let denote the symmetric group and let denote the weak order of . Through a surprising connection to a subset of parking functi…
Flattened Stirling Permutations
Adam Buck, Jennifer Elder, Azia A. Figueroa +3
Recall that a Stirling permutation is a permutation on the multiset such that any numbers appearing between repeated values of must be greater than …
On Flattened Parking Functions
Jennifer Elder, Pamela E. Harris, Zoe Markman +2
A permutation of length is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened…
Homomesies on permutations -- an analysis of maps and statistics in the FindStat database
Jennifer Elder, Nadia Lafrenière, Erin McNicholas +2
In this paper, we perform a systematic study of permutation statistics and bijective maps on permutations in which we identify and prove 122 instances of the homomesy phenomenon. H…
On Graphs of Sets of Reduced Words
Jennifer Elder
Any permutation in the finite symmetric group can be written as a product of simple transpositions . For a fixed permutation the products of mi…
Generalizing the Futurama Theorem
Jennifer Elder, Oscar Vega
The 2010 episode of \emph{Futurama} titled \emph{The Prisoner of Benda} centers around a machine that swaps the brains of any two people who use it. The problem is, once two people…
Combinatorial Analysis of a Subtraction Game on Graphs
Richard Adams, Janae Dixon, Jennifer Elder +3
We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such ver…