3 citations · 4 across the 4 of their papers we have counts for
4 papers
Whitney Twins, Whitney Duals, and Operadic Partition Posets
Rafael S. González D'León, Joshua Hallam, Yeison A. Quiceno D
We say that a pair of nonnegative integer sequences is Whitney-realizable if there exists a poset for which (the absolute values) of the…
Increasing spanning forests in graphs and simplicial complexes
Joshua Hallam, Jeremy L. Martin, Bruce E. Sagan
Let G be a graph with vertex set {1,...,n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F form an incre…
Applications of Quotient Posets
Joshua Hallam
In this paper we consider the characteristic polynomial of not necessarily ranked posets. We do so by allowing the rank to be an arbitrary function from the poset to the nonnegativ…
Factoring the characteristic polynomial of a lattice
Joshua Hallam, Bruce E. Sagan
We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of…