11 citations · 59 across the 27 of their papers we have counts for
28 papers
Homological algebra and poset versions of the Garland method
Eric Babson, Volkmar Welker
Garland introduced a vanishing criterion for a characteristic zero cohomology group of a locally finite and locally connected simplicial complex. The criterion is based on the spec…
Higher dimensional connectivity and minimal degree of random graphs with an eye towards minimal free resolutions
Eric Babson, Volkmar Welker
In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our -dimensional cases). These are…
Moduli spaces of graded representations of finite dimensional algebras
E. Babson, B. Huisgen-Zimmermann, R. Thomas
Let be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that is graded by lengths of pat…
Meunier Conjecture
Eric Babson
Frédéric Meunier's question about a multicolored Sperner lemma is addressed, leaving the question of connectivity for the color hypergraphs of such a multicolored simplex. Sperner'…
Dull cut off for circulants
Aaron Abrams, Eric Babson, Henry Landau +2
Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3]…
Random Walks and Mixed Volumes of Hypersimplices
Eric Babson, Einar Steingrimsson
Below is a method for relating a mixed volume computation for polytopes sharing many facet directions to a symmetric random walk. The example of permutahedra and particularly hyper…