Pamela E. Harris
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 16 co-authors. Here are the top co-authors by number of shared publications:
- Jeb F. Willenbring
University of Wisconsin-Milwaukee
2 shared publications Jillian Cervantes
2 shared publications- Bethany Kubik
Department of Mathematics Department of Mathematics Department of Mathematics and Statistics Christopher O'Neill Mathematics and Statistics Department Department of Mathematics and Computer Science The Ohio State University Ranthony A.C. Edmonds The Ohio State University Bethany Kubik University of Minnesota Duluth San Diego State University Shannon Talbott Moravian College
1 shared publication Brian M. Kamau
1 shared publication- Camilo Barreto
Departamento de Matemáticas, Universidad Nacional de Colombia, Bogotá, Colombia
1 shared publication - Elizabeth Gross
University of Hawai‘i at Mānoa, Hawai‘i, USA
1 shared publication
Latest Publications
- 28 October 2026
- Published by Taylor & Francis in Math Horizons
- Vol. 34 (2) , 28-29
A Little Prep Goes a Long Way to Getting a Great Letter of Rec
- 28 October 2026
- Published by Taylor & Francis in Math Horizons
- Vol. 34 (2) , 28-29
A Little Prep Goes a Long Way to Getting a Great Letter of Rec
- 10 June 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Restricted Fubini rankings and restricted unit interval parking functions
In this paper, we study three natural types of restrictions on Fubini rankings and unit interval parking functions, which are motivated by their correspondence with ordered set partitions. For each restriction type, we define the corresponding subset of Fubini rankings and unit interval parking functions, establish enumerative results, and provide bijections between the restricted families. We also obtain exponential generating functions and combinatorial interpretations, including connections with exceedances in permutations and with the absence of cyclical adjacencies in set partitions.
- 10 June 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Restricted Fubini rankings and restricted unit interval parking functions
In this paper, we study three natural types of restrictions on Fubini rankings and unit interval parking functions, which are motivated by their correspondence with ordered set partitions. For each restriction type, we define the corresponding subset of Fubini rankings and unit interval parking functions, establish enumerative results, and provide bijections between the restricted families. We also obtain exponential generating functions and combinatorial interpretations, including connections with exceedances in permutations and with the absence of cyclical adjacencies in set partitions.
- Open Access
- 18 April 2026
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 13 (2)
(t, r) broadcast domination numbers and densities of the truncated square tiling graph
For a pair of positive integer parameters ( t , r ), a subset T of vertices of a graph G is said to ( t , r ) broadcast dominate a graph G if, for any vertex u in G , we have $$\sum _{v\in T, u\in N_t(v)}(t-d(u,v))\ge r$$ , where $$N_{t}(v)=\{u\in V:d(u,v)<t\}$$ and d ( u , v ) denotes the distance between u and v . This can be interpreted as each vertex v of T sending $$\max (t-\text {d}(u,v),0)$$ signal to vertices within a distance of $$t-1$$ away from v . The signal is additive and we require that every vertex of the graph receives a minimum reception r from all vertices in T . For a finite graph, the smallest cardinality among all ( t , r ) broadcast dominating sets of a graph is called the ( t , r ) broadcast domination number. We remark that the (2, 1) broadcast domination number is the domination number and the ( t , 1) (for $$t\ge 1$$ ) is the distance domination number of a graph. We study a family of graphs that arise as a finite subgraph of the truncated square tiling, which utilizes regular squares and octagons to tile the Euclidean plane. For positive integers m and n , we let $$H_{m,n}$$ be the graph consisting of m rows of n octagons (cycle graph on 8 vertices). For all $$t\ge 2$$ , we provide lower and upper bounds for the ( t , 1) broadcast domination number for $$H_{m,n}$$ for all $$m,n\ge 1$$ . We give exact (2, 1) broadcast domination numbers for $$H_{m,n}$$ when $$(m,n)\in \{(1,1),(1,2),(1,3),(1,4),(2,2)\}$$ . We also consider the infinite truncated square tiling, denoted $$H_{\infty ,\infty }$$ , and we provide constructions of infinite ( t , r ) broadcasts for $$(t,r)\in \{(2,1),(2,2),(3,1),(3,2),(3,3),(4,1)\}$$ . Using these constructions, we give upper bounds on the density of these broadcasts, i.e., the proportion of vertices needed to ( t , r ) broadcast dominate this infinite graph. We end with some directions for future study.- 18 April 2026
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 13 (2)
Open Access(t, r) broadcast domination numbers and densities of the truncated square tiling graph
For a pair of positive integer parameters ( t , r ), a subset T of vertices of a graph G is said to ( t , r ) broadcast dominate a graph G if, for any vertex u in G , we have $$\sum _{v\in T, u\in N_t(v)}(t-d(u,v))\ge r$$ , where $$N_{t}(v)=\{u\in V:d(u,v)<t\}$$ and d ( u , v ) denotes the distance between u and v . This can be interpreted as each vertex v of T sending $$\max (t-\text {d}(u,v),0)$$ signal to vertices within a distance of $$t-1$$ away from v . The signal is additive and we require that every vertex of the graph receives a minimum reception r from all vertices in T . For a finite graph, the smallest cardinality among all ( t , r ) broadcast dominating sets of a graph is called the ( t , r ) broadcast domination number. We remark that the (2, 1) broadcast domination number is the domination number and the ( t , 1) (for $$t\ge 1$$ ) is the distance domination number of a graph. We study a family of graphs that arise as a finite subgraph of the truncated square tiling, which utilizes regular squares and octagons to tile the Euclidean plane. For positive integers m and n , we let $$H_{m,n}$$ be the graph consisting of m rows of n octagons (cycle graph on 8 vertices). For all $$t\ge 2$$ , we provide lower and upper bounds for the ( t , 1) broadcast domination number for $$H_{m,n}$$ for all $$m,n\ge 1$$ . We give exact (2, 1) broadcast domination numbers for $$H_{m,n}$$ when $$(m,n)\in \{(1,1),(1,2),(1,3),(1,4),(2,2)\}$$ . We also consider the infinite truncated square tiling, denoted $$H_{\infty ,\infty }$$ , and we provide constructions of infinite ( t , r ) broadcasts for $$(t,r)\in \{(2,1),(2,2),(3,1),(3,2),(3,3),(4,1)\}$$ . Using these constructions, we give upper bounds on the density of these broadcasts, i.e., the proportion of vertices needed to ( t , r ) broadcast dominate this infinite graph. We end with some directions for future study. - 22 October 2025
- Published by Taylor & Francis in Math Horizons
- Vol. 33 (2) , 12-15
Vacillating Parking Functions and a Fibonacci Surprise
- 22 October 2025
- Published by Taylor & Francis in Math Horizons
- Vol. 33 (2) , 12-15
Vacillating Parking Functions and a Fibonacci Surprise
- Open Access
Tipsy cop and tipsy robber: collisions of biased random walks on graphs
Introduced by Harris, Insko, Prieto Langarica, Stoisavljevic, and Sullivan, the \emph{tipsy cop and drunken robber} is a variant of the cop and robber game on graphs in which the robber simply moves randomly along the graph, while the cop moves directed towards the robber some fixed proportion of the time and randomly the remainder. In this article, we adopt a slightly different interpretation of tipsiness of the cop and robber where we assume that in any round of the game there are four possible outcomes: a sober cop move, a sober robber move, a tipsy (uniformly random) move by the cop, and a tipsy (uniformly random) move by the robber. We study this tipsy cop and tipsy robber game on the infinite grid graph and on certain families of infinite trees including $\delta$-regular trees %infinite binary trees with an infinite path rooted at every vertex, and $\delta$-regular trees rooted to a $\Delta$-regular tree, where $\Delta \geq \delta$. Our main results analyze strategies for the cop and robber on these graphs. We conclude with some directions for further study.Open AccessTipsy cop and tipsy robber: collisions of biased random walks on graphs
Introduced by Harris, Insko, Prieto Langarica, Stoisavljevic, and Sullivan, the \emph{tipsy cop and drunken robber} is a variant of the cop and robber game on graphs in which the robber simply moves randomly along the graph, while the cop moves directed towards the robber some fixed proportion of the time and randomly the remainder. In this article, we adopt a slightly different interpretation of tipsiness of the cop and robber where we assume that in any round of the game there are four possible outcomes: a sober cop move, a sober robber move, a tipsy (uniformly random) move by the cop, and a tipsy (uniformly random) move by the robber. We study this tipsy cop and tipsy robber game on the infinite grid graph and on certain families of infinite trees including $\delta$-regular trees %infinite binary trees with an infinite path rooted at every vertex, and $\delta$-regular trees rooted to a $\Delta$-regular tree, where $\Delta \geq \delta$. Our main results analyze strategies for the cop and robber on these graphs. We conclude with some directions for further study. - Open Access
On the Outcome Map of MVP Parking Functions: Permutations Avoiding 321 and 3412, and Motzkin Paths
We introduce a new parking procedure called MVP parking in which $n$ cars sequentially enter a one-way street with a preferred parking spot from the $n$ parking spots on the street. If their preferred spot is empty, they park there. Otherwise, they park there and the car parked in that spot is bumped to the next unoccupied spot on the street. If all cars can park under this parking procedure, we say the list of preferences of the $n$ cars is an MVP parking function of length $n$. We show that the set of (classical) parking functions is exactly the set of MVP parking functions although the parking outcome (order in which the cars park) is different under each parking process. Motivating the question: Given a permutation describing the outcome of the MPV parking process, what is the number of MVP parking functions resulting in that given outcome? Our main result establishes a bound for this count which is tight precisely when the permutation describing the parking outcome avoids the patterns 321 and 3412. We then consider special cases of permutations and give closed formulas for the number of MVP parking functions with those outcomes. In particular, we show that the number of MVP parking functions which park in reverse order (that is the permutation describing the outcome is the longest word in $\mathfrak{S}_n$, which does not avoid the pattern 321) is given by the $n$th Motzkin number. We also give families of permutations describing the parking outcome for which the cardinality of the set of cars parking in that order is exponential and others in which it is linear.Open AccessOn the Outcome Map of MVP Parking Functions: Permutations Avoiding 321 and 3412, and Motzkin Paths
We introduce a new parking procedure called MVP parking in which $n$ cars sequentially enter a one-way street with a preferred parking spot from the $n$ parking spots on the street. If their preferred spot is empty, they park there. Otherwise, they park there and the car parked in that spot is bumped to the next unoccupied spot on the street. If all cars can park under this parking procedure, we say the list of preferences of the $n$ cars is an MVP parking function of length $n$. We show that the set of (classical) parking functions is exactly the set of MVP parking functions although the parking outcome (order in which the cars park) is different under each parking process. Motivating the question: Given a permutation describing the outcome of the MPV parking process, what is the number of MVP parking functions resulting in that given outcome? Our main result establishes a bound for this count which is tight precisely when the permutation describing the parking outcome avoids the patterns 321 and 3412. We then consider special cases of permutations and give closed formulas for the number of MVP parking functions with those outcomes. In particular, we show that the number of MVP parking functions which park in reverse order (that is the permutation describing the outcome is the longest word in $\mathfrak{S}_n$, which does not avoid the pattern 321) is given by the $n$th Motzkin number. We also give families of permutations describing the parking outcome for which the cardinality of the set of cars parking in that order is exponential and others in which it is linear. - Open Access
Broken Bracelets and Kostant's Partition Function
Inspired by the work of Amdeberhan, Can, and Moll on broken necklaces, we define a broken bracelet as a linear arrangement of marked and unmarked vertices and introduce a generalization called $n$-stars, which is a collection of $n$ broken bracelets whose final (unmarked) vertices are identified. Through these combinatorial objects, we provide a new framework for the study of Kostant's partition function, which counts the number of ways to express a vector as a nonnegative integer linear combination of the positive roots of a Lie algebra. Our main result establishes that (up to reflection) the number of broken bracelets with a fixed number of unmarked vertices with nonconsecutive marked vertices gives an upper bound for the value of Kostant's partition function for multiples of the highest root of a Lie algebra of type $A$. We connect this work to multiplex juggling sequences, as studied by Benedetti, Hanusa, Harris, Morales, and Simpson, by providing a correspondence to an equivalence relation on $n$-stars.Open AccessBroken Bracelets and Kostant's Partition Function
Inspired by the work of Amdeberhan, Can, and Moll on broken necklaces, we define a broken bracelet as a linear arrangement of marked and unmarked vertices and introduce a generalization called $n$-stars, which is a collection of $n$ broken bracelets whose final (unmarked) vertices are identified. Through these combinatorial objects, we provide a new framework for the study of Kostant's partition function, which counts the number of ways to express a vector as a nonnegative integer linear combination of the positive roots of a Lie algebra. Our main result establishes that (up to reflection) the number of broken bracelets with a fixed number of unmarked vertices with nonconsecutive marked vertices gives an upper bound for the value of Kostant's partition function for multiples of the highest root of a Lie algebra of type $A$. We connect this work to multiplex juggling sequences, as studied by Benedetti, Hanusa, Harris, Morales, and Simpson, by providing a correspondence to an equivalence relation on $n$-stars. - Open Access
- 14 October 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 7 (2) , 207-216
Block circulant graphs and the graphs of critical pairs of crowns
Block circulant graphs and the graphs of critical pairs of crowns
- 14 October 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 7 (2) , 207-216
Open AccessBlock circulant graphs and the graphs of critical pairs of crowns
Block circulant graphs and the graphs of critical pairs of crowns
- 2 December 2014
- Published by Springer Nature
- p. 305-326
Sums of squares of Littlewood–Richardson coefficients and GL n -harmonic polynomials
- 2 December 2014
- Published by Springer Nature
- p. 305-326
Sums of squares of Littlewood–Richardson coefficients and GL n -harmonic polynomials
- Open Access
Sums of squares of the Littlewood-Richardson coefficients and GL(n)-harmonic polynomials
We consider the example from invariant theory concerning the conjugation action of the general linear group on several copies of the $n \times n$ matrices, and examine a symmetric function which stably describes the Hilbert series for the invariant ring with respect to the multigradation by degree. The terms of this Hilbert series may be described as a sum of squares of Littlewood-Richardson coefficients. A "principal specialization" of the gradation is then related to the Hilbert series of the $\K$-invariant subring in the $\GL_n$-harmonic polynomials, where $\K$ denotes a block diagonal embedding of a product of general linear groups. We also consider other specializations of this Hilbert series.Open AccessSums of squares of the Littlewood-Richardson coefficients and GL(n)-harmonic polynomials
We consider the example from invariant theory concerning the conjugation action of the general linear group on several copies of the $n \times n$ matrices, and examine a symmetric function which stably describes the Hilbert series for the invariant ring with respect to the multigradation by degree. The terms of this Hilbert series may be described as a sum of squares of Littlewood-Richardson coefficients. A "principal specialization" of the gradation is then related to the Hilbert series of the $\K$-invariant subring in the $\GL_n$-harmonic polynomials, where $\K$ denotes a block diagonal embedding of a product of general linear groups. We also consider other specializations of this Hilbert series.