Amanda Welch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Amanda Welch has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Cristina Ballantine
Department of Mathematics and Computer Science, College of The Holy Cross, Worcester, USA
5 shared publications - Erin McNicholas
Willamette University
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 Cristina Ballantine
1 shared publication
Latest Publications
- 23 May 2025
- Published by Springer Nature in The Ramanujan Journal
- Vol. 67 (3) , 1-23
Combinatorial proofs of inequalities involving the number of partitions with parts separated by parity
- 23 May 2025
- Published by Springer Nature in The Ramanujan Journal
- Vol. 67 (3) , 1-23
Combinatorial proofs of inequalities involving the number of partitions with parts separated by parity
- 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. - 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.
- Open Access
Generalizations of POD and PED partitions
Partitions with even (respectively odd) parts distinct and all other parts unrestricted are often referred to as PED (respectively POD) partitions. In this article, we generalize these notions and study sets of partitions in which parts with fixed residue(s) modulo r are distinct while all other parts are unrestricted. We also study partitions in which parts divisible by r (respectively congruent to r modulo 2r) must occur with multiplicity greater than one.
Open AccessGeneralizations of POD and PED partitions
Partitions with even (respectively odd) parts distinct and all other parts unrestricted are often referred to as PED (respectively POD) partitions. In this article, we generalize these notions and study sets of partitions in which parts with fixed residue(s) modulo r are distinct while all other parts are unrestricted. We also study partitions in which parts divisible by r (respectively congruent to r modulo 2r) must occur with multiplicity greater than one.
- Open Access
PED and POD partitions: combinatorial proofs of recurrence relations
PED partitions are partitions with even parts distinct while odd parts are unrestricted. Similarly, POD partitions have distinct odd parts while even parts are unrestricted. Merca proved several recurrence relations analytically for the number of PED partitions of $n$. They are similar to the recurrence relation for the number of partitions of $n$ given by Euler's pentagonal number theorem. We provide combinatorial proofs for all of these theorems and also for the pentagonal number theorem for PED partitions proved analytically by Fink, Guy, and Krusemeyer. Moreover, we prove combinatorially a recurrence for POD partitions given by Ballantine and Merca, Beck-type identities involving PED and POD partitions, and several other results about PED and POD partitions.Open AccessPED and POD partitions: combinatorial proofs of recurrence relations
PED partitions are partitions with even parts distinct while odd parts are unrestricted. Similarly, POD partitions have distinct odd parts while even parts are unrestricted. Merca proved several recurrence relations analytically for the number of PED partitions of $n$. They are similar to the recurrence relation for the number of partitions of $n$ given by Euler's pentagonal number theorem. We provide combinatorial proofs for all of these theorems and also for the pentagonal number theorem for PED partitions proved analytically by Fink, Guy, and Krusemeyer. Moreover, we prove combinatorially a recurrence for POD partitions given by Ballantine and Merca, Beck-type identities involving PED and POD partitions, and several other results about PED and POD partitions. - 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.
- Open Access
- 30 April 2023
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 18 (1) , 53-65
Beck-type companion identities for Franklin's identity
In 2017, Beck conjectured that the difference in the number of parts in all partitions of $n$ into odd parts and the number of parts in all strict partitions of $n$ is equal to the number of partitions of $n$ whose set of even parts has one element, and also to the number of partitions of $n$ with exactly one part repeated. Andrews proved the conjecture using generating functions. Beck's identity is a companion identity to Euler's identity. The theorem has been generalized (with a combinatorial proof) by Yang to a companion identity to Glaisher's identity. Franklin generalized Glaisher's identity, and in this article, we provide a Beck-type companion identity to Franklin's identity and prove it both analytically and combinatorially. Andrews' and Yang's respective theorems fit naturally into this very general frame. We also discuss how Franklin's identity and the companion Beck-type identities can be further generalized to Euler pairs of any order.- 30 April 2023
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 18 (1) , 53-65
Open AccessBeck-type companion identities for Franklin's identity
In 2017, Beck conjectured that the difference in the number of parts in all partitions of $n$ into odd parts and the number of parts in all strict partitions of $n$ is equal to the number of partitions of $n$ whose set of even parts has one element, and also to the number of partitions of $n$ with exactly one part repeated. Andrews proved the conjecture using generating functions. Beck's identity is a companion identity to Euler's identity. The theorem has been generalized (with a combinatorial proof) by Yang to a companion identity to Glaisher's identity. Franklin generalized Glaisher's identity, and in this article, we provide a Beck-type companion identity to Franklin's identity and prove it both analytically and combinatorially. Andrews' and Yang's respective theorems fit naturally into this very general frame. We also discuss how Franklin's identity and the companion Beck-type identities can be further generalized to Euler pairs of any order. - 18 November 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (3)
PED and POD partitions: Combinatorial proofs of recurrence relations
- 18 November 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (3)
PED and POD partitions: Combinatorial proofs of recurrence relations
- Open Access
- 3 November 2021
- Published by Springer Nature
- p. 141-161
Beck-Type Identities for Euler Pairs of Order r
- 3 November 2021
- Published by Springer Nature
- p. 141-161
Open AccessBeck-Type Identities for Euler Pairs of Order r