10 citations · 12 across the 12 of their papers we have counts for
15 papers
Young tableau reconstruction via minors
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +4
The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau , a 1-minor of is a tableau obtained by first deleting…
Specification and -chaos in non-compact systems
Cordell Hammon, Jonathan Meddaugh, Jasmin Mohn +1
In this paper, we demonstrate conditions under which a Lindelöf dynamical system exhibits -chaos. In particular, if a system exhibits a generalized version of the specification…
Klein cordial trees and odd cyclic cordial friendship graphs
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +7
For a graph and an abelian group , a labeling of the vertices of induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an…
Vertex-edge marking score of certain triangular lattices
Daniel Herden, Jonathan Meddaugh, Mark Sepanski +8
The vertex-edge marking game is played between two players on a graph, , with one player marking vertices and the other marking edges. The players want to minimize/maximiz…
On the -hull number and infecting times of generalized Petersen graphs
Daniel Herden, Jonathan Meddaugh, Mark Sepanski +8
The -hull number of a graph is the minimum cardinality of an infecting set of vertices that will eventually infect the entire graph under the rule that uninfected nodes become…
Shadowing, recurrence, and rigidity in dynamical systems
Jonathan Meddaugh
In this paper we examine the interplay between recurrence properties and the shadowing property in dynamical systems on compact metric spaces. In particular, we demonstrate that if…