6 citations · 16 across the 13 of their papers we have counts for
4 papers · 2 filters
Avoidable sets in groups
Mike Develin
In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two disti…
A general notion of visiblity graphs
Mike Develin, Stephen Hartke, David Petrie Moulton
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of co…
On LP-orientations of cubes and crosspolytopes
Mike Develin
We show that the Holt-Klee conditions are very insufficient for an orientation of the graph of a polytope to be an LP-orientation in the case of the n-cube. We also give a strength…
Cayley compactifications of abelian groups
Mike Develin
Following work of Rieffel, we define the Cayley compactification of an abelian group with specified generating set. We investigate its structure using methods from discrete geometr…