6 citations · 10 across the 9 of their papers we have counts for
10 papers
Interval-closed set rowmotion and homomesy on products of two chains
Nadia Lafrenière, Joel Brewster Lewis, Erin McNicholas +2
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ère…
Enumeration of interval-closed sets via Motzkin paths and quarter-plane walks
Sergi Elizalde, Nadia Lafrenière, Joel Brewster Lewis +3
We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional…
Cyclic sieving on permutations -- an analysis of maps and statistics in the FindStat database
Ashleigh Adams, Jennifer Elder, Nadia Lafrenière +3
We perform a systematic study of permutation statistics and bijective maps on permutations using SageMath to search the FindStat combinatorial statistics database to identify appar…
Homomesy on permutations with toggling actions
William Dowling, Nadia Lafreniere
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 e…
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.…
On the statistic and valley-hopping
Nadia Lafrenière, Yan Zhuang
This paper studies the relationship between the modified Foata$\unicode{x2013}$Strehl action (a.k.a. valley-hopping)$\unicode{x2014}$a group action on permutations used to demonstr…
The one-sided cycle shuffles in the symmetric group algebra
Darij Grinberg, Nadia Lafrenière
We study a family of shuffling operators on the symmetric group , which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a tim…
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…
Eigenvalues of symmetrized shuffling operators
Nadia Lafrenière
This paper describes a combinatorial way of obtaining all the eigenvalues of the symmetrized shuffling operators introduced by Victor Reiner, Franco Saliola and Volkmar Welker. It…
Palindromic complexity of trees
Srečko Brlek, Nadia Lafrenière, Xavier Provençal
We consider finite trees with edges labeled by letters on a finite alphabet . Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $…