4 papers
(32-1)-Avoiding Permutations with Maximum Inversion Number
Andrew Beveridge, Kristin Heysse, Paige Robertson
A permutation is (32-1)-avoiding when there do not exist such that . We determine the maximum inversion number for (…
Chip-Firing Games on Banana Trees
Marchelle Beougher, Nila Cibu, Kexin Ding +6
We study chip-firing games on multigraphs whose underlying simple graphs are trees, paths, and stars, denoted as banana trees, paths, and stars respectively. We present a polynomia…
The Exact Mixing Time for Trees with Fixed Diameter
Andrew Beveridge, Kristin Heysse, Rhys O'Higgins +1
We characterize the extremal structure for the exact mixing time for random walks on trees of order with diameter . Given a graph , let denote t…
Defective eigenvalues of the non-backtracking matrix
Kristin Heysse, Kate Lorenzen, Carolyn Reinhart
We consider graphs for which the non-backtracking matrix has defective eigenvalues, or graphs for which the matrix does not have a full set of eigenvectors. The existence of these…