activity
20032024
most citedA non-partitionable Cohen-Macaulay simplicial complex

72 citations · 139 across the 32 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

math.CO2016

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…

math.SP2016

Oscillation estimates of eigenfunctions via the combinatorics of noncrossing partitions

Vera Mikyoung Hur, Mathew A. Johnson, Jeremy L. Martin

We study oscillations in the eigenfunctions for a fractional Schrödinger operator on the real line. An argument in the spirit of Courant's nodal domain theorem applies to an associ…