47 citations · 95 across the 15 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 2 cited
An improved upper bound on the diameters of subset partition graphs
J. Mackenzie Gallagher, Edward D. Kim
In 1992, Kalai and Kleitman proved the first subexponential upper bound for the diameters of convex polyhedra. Eisenbrand et al. proved this bound holds for connected layer familie…
math.DS2014
Non-archimedean connected Julia sets with branching
Dvij Bajpai, Robert L. Benedetto, Ruqian Chen +4
We construct the first examples of rational functions defined over a non-archimedean field with certain dynamical properties. In particular, we find such functions whose Julia sets…
math.CO2014★ 2 cited
Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
Tristram C. Bogart, Edward D. Kim
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear a…