PHPamela E. Harris
Pamela E. Harris
*This is an algorithmically generated author record based on publicly available information.
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
Pamela E. Harris has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
- Erik Insko
Florida Gulf Coast University
6 shared publications - Joseph Rennie
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL, United States
6 shared publications - Carolina Benedetti
Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia
5 shared publications - Gordon Rojas Kirby
Department of Mathematics, University of California, Santa Barbara, CA, United States
5 shared publications - Marissa Loving
Department of Mathematics, University of Wisconsin, Madison, USA
5 shared publications - Anthony Simpson
Department of Mathematics and Statistics, Williams College, Williamstown, USA
4 shared publications
Latest Publications
- 20 May 2024
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 17 (2) , 183-215
Visualizing the support of Kostant’s weight multiplicity formula for the rank-2 Lie algebras
- 20 May 2024
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 17 (2) , 183-215
Visualizing the support of Kostant’s weight multiplicity formula for the rank-2 Lie algebras
- 15 May 2023
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 130 (7) , 618-624
On Parking Functions and The Tower of Hanoi
- 15 May 2023
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 130 (7) , 618-624
On Parking Functions and The Tower of Hanoi
- 1 August 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 33 (4) , 353-418
On Kostant's weight q-multiplicity formula for sl4(C)
- 1 August 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 33 (4) , 353-418
On Kostant's weight q-multiplicity formula for sl4(C)
- Open Access
Kostant's partition function and magic multiplex juggling sequences
Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra $\mathfrak{g}$ as a nonnegative integral linear combination of the positive roots of $\mathfrak{g}$. Multiplex juggling sequences are generalizations of juggling sequences that specify an initial and terminal configuration of balls and allow for multiple balls at any particular discrete height. Magic multiplex juggling sequences generalize further to include magic balls, which cancel with standard balls when they meet at the same height. In this paper, we establish a combinatorial equivalence between positive roots of a Lie algebra and throws during a juggling sequence. This provides a juggling framework to calculate Kostant's partition functions, and a partition function framework to compute the number of juggling sequences. From this equivalence we provide a broad range of consequences and applications connecting this work to polytopes, posets, positroids, and weight multiplicities.Open AccessKostant's partition function and magic multiplex juggling sequences
Kostant's partition function is a vector partition function that counts the number of ways one can express a weight of a Lie algebra $\mathfrak{g}$ as a nonnegative integral linear combination of the positive roots of $\mathfrak{g}$. Multiplex juggling sequences are generalizations of juggling sequences that specify an initial and terminal configuration of balls and allow for multiple balls at any particular discrete height. Magic multiplex juggling sequences generalize further to include magic balls, which cancel with standard balls when they meet at the same height. In this paper, we establish a combinatorial equivalence between positive roots of a Lie algebra and throws during a juggling sequence. This provides a juggling framework to calculate Kostant's partition functions, and a partition function framework to compute the number of juggling sequences. From this equivalence we provide a broad range of consequences and applications connecting this work to polytopes, posets, positroids, and weight multiplicities. - 31 March 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (2) , 253-289
On Kostant’s weight q-multiplicity formula for ${{\mathfrak {s}}}{{\mathfrak {p}}}_6({\mathbb {C}})$- 31 March 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (2) , 253-289
On Kostant’s weight q-multiplicity formula for ${{\mathfrak {s}}}{{\mathfrak {p}}}_6({\mathbb {C}})$- Open Access
Very Well-Covered Graphs with the Erdős-Ko-Rado Property
A family of independent $r$-sets of a graph $G$ is an $r$-star if every set in the family contains some fixed vertex $v$. A graph is $r$-EKR if the maximum size of an intersecting family of independent $r$-sets is the size of an $r$-star. Holroyd and Talbot conjecture that a graph is $r$-EKR as long as $1\leq r\leq\frac{\mu(G)}{2}$, where $\mu(G)$ is the minimum size of a maximal independent set. It is suspected that the smallest counterexample to this conjecture is a well-covered graph. Here we consider the class of very well-covered graphs $G^*$ obtained by appending a single pendant edge to each vertex of $G$. We prove that the pendant complete graph $K_n^*$ is $r$-EKR when $n \geq 2r$ and strictly so when $n>2r$. Pendant path graphs $P_n^*$ are also explored and the vertex whose $r$-star is of maximum size is determined.Open AccessVery Well-Covered Graphs with the Erdős-Ko-Rado Property
A family of independent $r$-sets of a graph $G$ is an $r$-star if every set in the family contains some fixed vertex $v$. A graph is $r$-EKR if the maximum size of an intersecting family of independent $r$-sets is the size of an $r$-star. Holroyd and Talbot conjecture that a graph is $r$-EKR as long as $1\leq r\leq\frac{\mu(G)}{2}$, where $\mu(G)$ is the minimum size of a maximal independent set. It is suspected that the smallest counterexample to this conjecture is a well-covered graph. Here we consider the class of very well-covered graphs $G^*$ obtained by appending a single pendant edge to each vertex of $G$. We prove that the pendant complete graph $K_n^*$ is $r$-EKR when $n \geq 2r$ and strictly so when $n>2r$. Pendant path graphs $P_n^*$ are also explored and the vertex whose $r$-star is of maximum size is determined. - 1 January 2022
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 13 (2) , 167-199
On the asymptotic behavior of the $q$-analog of Kostant's partition function
- 1 January 2022
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 13 (2) , 167-199
On the asymptotic behavior of the $q$-analog of Kostant's partition function
- 20 May 2021
- Published by Pushpa Publishing House in Advances and Applications in Discrete Mathematics
- Vol. 27 (1) , 39-72
TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS
- 20 May 2021
- Published by Pushpa Publishing House in Advances and Applications in Discrete Mathematics
- Vol. 27 (1) , 39-72
TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS
- 1 January 2021
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 14 (1) , 103-118
Generalized lattice-point visibility in Nk
- 1 January 2021
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 14 (1) , 103-118
Generalized lattice-point visibility in Nk
- Open Access
Enumerating Parking Completions Using Join and Split
Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le i\}|\ge i$ for all $i$ in $[n]$. We can think of $\mathbf{t}$ as a list of spots already taken in a street with $n$ parking spots and $\mathbf{c}$ as a list of parking preferences where the $i$-th car attempts to park in the $c_i$-th spot and if not available then proceeds up the street to find the next available spot, if any. A parking completion corresponds to a set of preferences $\mathbf{c}$ where all cars park. We relate parking completions to enumerating restricted lattice paths and give formulas for both the ordered and unordered variations of the problem by use of a pair of operations termed \textbf{Join} and \textbf{Split}. Our results give a new volume formula for most Pitman-Stanley polytopes, and enumerate the signature parking functions of Ceballos and Gonz\'alez D'Le\'on.Open AccessEnumerating Parking Completions Using Join and Split
Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le i\}|\ge i$ for all $i$ in $[n]$. We can think of $\mathbf{t}$ as a list of spots already taken in a street with $n$ parking spots and $\mathbf{c}$ as a list of parking preferences where the $i$-th car attempts to park in the $c_i$-th spot and if not available then proceeds up the street to find the next available spot, if any. A parking completion corresponds to a set of preferences $\mathbf{c}$ where all cars park. We relate parking completions to enumerating restricted lattice paths and give formulas for both the ordered and unordered variations of the problem by use of a pair of operations termed \textbf{Join} and \textbf{Split}. Our results give a new volume formula for most Pitman-Stanley polytopes, and enumerate the signature parking functions of Ceballos and Gonz\'alez D'Le\'on.