Erin McNicholas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Erin McNicholas has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Amanda Welch
Department of Mathematics and Computer Science, Eastern Illinois University, Charleston, USA
4 shared publications - Jessica Striker
Department of Mathematics, North Dakota State University, Fargo, USA
4 shared publications - Nadia Lafrenière
Department of Mathematics Dartmouth College
3 shared publications - Jennifer Elder
Department of Computer Science Mathematics and Physics Missouri Western State University 3 64507 46143 St. Joseph Greenwood MO IN
2 shared publications - Kathryn Nyman
Willamette Univ, Salem, OR USA
2 shared publications - Abra Brisbin
University of Wisconsin
1 shared publication
Latest Publications
- Open Access
On statistics of prime parking functions, Łukasiewicz paths, and quasisymmetric functions
We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit formula for the average value of the total displacement of prime parking functions. We present a formula for the displacement-enumerator of prime parking functions that involves a sum over Łukasiewicz paths. We describe the one-to-one correspondence between parking functions and labeledŁukasiewicz paths via Dyck paths. We introduce the concept of $\ell$-forward differences and use this as a vehicle for examining ties, ascents, and descents in prime parking functions. We establish a link between Schur functions corresponding to the partition $(i,1^{n-i})$ and fundamental quasisymmetric functions indexed by prime parking function tie sets of size $n-i.$Open AccessOn statistics of prime parking functions, Łukasiewicz paths, and quasisymmetric functions
We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit formula for the average value of the total displacement of prime parking functions. We present a formula for the displacement-enumerator of prime parking functions that involves a sum over Łukasiewicz paths. We describe the one-to-one correspondence between parking functions and labeledŁukasiewicz paths via Dyck paths. We introduce the concept of $\ell$-forward differences and use this as a vehicle for examining ties, ascents, and descents in prime parking functions. We establish a link between Schur functions corresponding to the partition $(i,1^{n-i})$ and fundamental quasisymmetric functions indexed by prime parking function tie sets of size $n-i.$ - 1 October 2025
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 72 (09)
Voting on Relations Using Pairs Information
Rather than analyzing the attributes of voting procedures, we present a common framework within which to understand and juxtapose various methods. This framework allows us to draw surprising connections between disparate procedures presented in a wide range of papers spanning several decades.
- 1 October 2025
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 72 (09)
Voting on Relations Using Pairs Information
Rather than analyzing the attributes of voting procedures, we present a common framework within which to understand and juxtapose various methods. This framework allows us to draw surprising connections between disparate procedures presented in a wide range of papers spanning several decades.
- Open Access
Enumeration of interval-closed sets via Motzkin paths and quarter-plane walks
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 equation for the generating function of interval-closed sets of truncated rectangle posets, including the type $A$ root poset, by constructing a bijection to certain quarter-plane walks.Open AccessEnumeration of interval-closed sets via Motzkin paths and quarter-plane walks
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 equation for the generating function of interval-closed sets of truncated rectangle posets, including the type $A$ root poset, by constructing a bijection to certain quarter-plane walks. - 4 December 2024
- Published by Springer Nature
- p. 191-216
Finding Your Path
- Open Access
- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 1-14
Approval Gap of Weighted k-Majority Tournaments
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the vertices of $T$ as candidates, with an edge $u \to v$ in $T$ if a majority of voters prefer candidate $u$ to candidate $v$. In this paper we introduce weighted $k$-majority tournaments, with each edge $u \to v$ weighted by the number of voters preferring $u$. We define the maximum approval gap $\gamma_w(T)$, a measure by which any dominating set of $T$ beats the next most popular candidate. This parameter is analogous to previous work on the size of minimum dominating sets of (unweighted) $k$-majority tournaments. We prove that $k/2 \leq \gamma_w(T) \leq 2k-1$ for any weighted $k$-majority tournament $T$, and construct tournaments with $\gamma_w(T)=q$ for any rational number $k/2 \leq q \leq 2k-1$. We also consider the minimum number of vertices $m(q,k)$ in a $k$-majority tournament with $\gamma_w(T)=q$.- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 1-14
Open AccessApproval Gap of Weighted k-Majority Tournaments
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the vertices of $T$ as candidates, with an edge $u \to v$ in $T$ if a majority of voters prefer candidate $u$ to candidate $v$. In this paper we introduce weighted $k$-majority tournaments, with each edge $u \to v$ weighted by the number of voters preferring $u$. We define the maximum approval gap $\gamma_w(T)$, a measure by which any dominating set of $T$ beats the next most popular candidate. This parameter is analogous to previous work on the size of minimum dominating sets of (unweighted) $k$-majority tournaments. We prove that $k/2 \leq \gamma_w(T) \leq 2k-1$ for any weighted $k$-majority tournament $T$, and construct tournaments with $\gamma_w(T)=q$ for any rational number $k/2 \leq q \leq 2k-1$. We also consider the minimum number of vertices $m(q,k)$ in a $k$-majority tournament with $\gamma_w(T)=q$. - Open Access
Toggling, rowmotion, and homomesy on interval-closed sets
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 rowmotion on interval-closed sets as a product of these toggles. Our main theorem is an intricate global characterization of rowmotion on interval-closed sets, which we show is equivalent to the toggling definition. We also study specific posets; we enumerate interval-closed sets of ordinal sums of antichains, completely describe their rowmotion orbits, and prove a homomesy result involving the signed cardinality statistic. Finally, we study interval-closed sets of product of chains posets, proving further results about enumeration and homomesy.
Open AccessToggling, rowmotion, and homomesy on interval-closed sets
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 rowmotion on interval-closed sets as a product of these toggles. Our main theorem is an intricate global characterization of rowmotion on interval-closed sets, which we show is equivalent to the toggling definition. We also study specific posets; we enumerate interval-closed sets of ordinal sums of antichains, completely describe their rowmotion orbits, and prove a homomesy result involving the signed cardinality statistic. Finally, we study interval-closed sets of product of chains posets, proving further results about enumeration and homomesy.
- 22 June 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (346) , 921-976
Homomesies on permutations: An analysis of maps and statistics in the FindStat database
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. Homomesy occurs when the average value of a statistic is the same on each orbit of a given map. The maps we investigate include the Lehmer code rotation, the reverse, the complement, the Foata bijection, and the Kreweras complement. The statistics studied relate to familiar notions such as inversions, descents, and permutation patterns, and also more obscure constructs. Besides the many new homomesy results, we discuss our research method, in which we used SageMath to search the FindStat combinatorial statistics database to identify potential homomesies.
- 22 June 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (346) , 921-976
Homomesies on permutations: An analysis of maps and statistics in the FindStat database
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. Homomesy occurs when the average value of a statistic is the same on each orbit of a given map. The maps we investigate include the Lehmer code rotation, the reverse, the complement, the Foata bijection, and the Kreweras complement. The statistics studied relate to familiar notions such as inversions, descents, and permutation patterns, and also more obscure constructs. Besides the many new homomesy results, we discuss our research method, in which we used SageMath to search the FindStat combinatorial statistics database to identify potential homomesies.
- Open Access
Homomesies on permutations -- an analysis of maps and statistics in the FindStat database
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. Homomesy occurs when the average value of a statistic is the same on each orbit of a given map. The maps we investigate include the Lehmer code rotation, the reverse, the complement, the Foata bijection, and the Kreweras complement. The statistics studied relate to familiar notions such as inversions, descents, and permutation patterns, and also more obscure constructs. Beside the many new homomesy results, we discuss our research method, in which we used SageMath to search the FindStat combinatorial statistics database to identify potential homomesies.
Open AccessHomomesies on permutations -- an analysis of maps and statistics in the FindStat database
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. Homomesy occurs when the average value of a statistic is the same on each orbit of a given map. The maps we investigate include the Lehmer code rotation, the reverse, the complement, the Foata bijection, and the Kreweras complement. The statistics studied relate to familiar notions such as inversions, descents, and permutation patterns, and also more obscure constructs. Beside the many new homomesy results, we discuss our research method, in which we used SageMath to search the FindStat combinatorial statistics database to identify potential homomesies.
- 1 January 2017
- Published by Springer Nature
- p. 127-144
Matroids
- 7 May 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 977-1002
Graph Invertibility
- 7 May 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 977-1002
Graph Invertibility