4 citations · 4 across the 9 of their papers we have counts for
12 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 (32-1…
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 th…
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…
de Finetti Lattices and Magog Triangles
Andrew Beveridge, Ian Calaway, Kristin Heysse
The order ideal of the Boolean lattice consists of all subsets of size at most . Let denote the poset refinement of induced by the rules: $i…
Eigenvalues, Smith normal form and determinantal ideals
Aida Abiad, Carlos A. Alfaro, Kristin Heysse +1
Determinantal ideals of graphs generalize, among others, the spectrum and the Smith normal form (SNF) of integer matrices associated to graphs. In this work we investigate the rela…
Turán numbers of vertex-disjoint cliques in -partite graphs
Jessica De Silva, Kristin Heysse, Adam Kapilow +2
For two graphs and , the Turán number is the maximum number of edges in a subgraph of that contains no copy of . Chen, Li, and Tu determined the Turán numbe…
A forest building process on simple graphs
Zhanar Berikkyzy, Steve Butler, Jay Cummings +4
Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in…
A construction of distance cospectral graphs
Kristin Heysse
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding…
On the distance spectra of graphs
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8
The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…
A cospectral family of graphs for the normalized Laplacian found by toggling
Steve Butler, Kristin Heysse
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix.…
Discrete approximations of differential equations via trigonometric interpolation
Oksana Bihun, Austin Bren, Michael Dyrud +1
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynom…