92 citations · 104 across the 6 of their papers we have counts for
13 papers
Distance Configurations of Points in a Plane with a Galois group that is not Soluble
John C. Owen, Stephen C. Power
We have conjectured that the constraint equations defined by a generic Laman graph are not soluble by radicals when the graph is 3-connected. We prove that this conjecture follows…
The algebras of higher rank graphs
David W. Kribs, Stephen C. Power
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which…
Subalgebras of Graph C*-Algebras
Alan Hopenwasser, Jurtin R. Peters, Stephen C. Power
We prove a spectral theorem for bimodules in the context of graph C*-algebras. A bimodule over a suitable abelian algebra is determined by its spectrum (i.e., its groupoid partial…
Generic 3-connected planar constraint systems are not soluble by radicals
John C. Owen, Stephen C. Power
We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance…
Partly Free Algebras from Directed Graphs
David W. Kribs, Stephen C. Power
We say that a nonselfadjoint operator algebra is partly free if it contains a free semigroup algebra. Motivation for such algebras occurs in the setting of what we call free semigr…
Free Semigroupoid Algebras
David W. Kribs, Stephen C. Power
Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free sem…