92 citations · 104 across the 6 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
math.CO2003★ 2 cited
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…
math.OA2003
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…
math.OA2003★ 92 cited
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…