Baer and Baer *-ring characterizations of Leavitt path algebras

Our characterizations provide a quick way to generate a wide variety of examples of rings. For example, creating a Baer and not a Baer ⁎-ring, a Rickart ⁎-ring which is not Baer, or a Baer and not a Rickart ⁎-ring, is straightforward using the graph-theoretic properties from our results. In addition, our characterizations showcase more properties which distinguish behavior of Leavitt path algebras from their C⁎-algebra counterparts. For example, while a graph C⁎-algebra is Baer (and a Baer ⁎-ring) if and only if the underlying graph is finite and acyclic, a Leavitt path algebra is Baer if and only if the graph is finite and no cycle has an exit, and it is a Baer ⁎-ring if and only if the graph is a finite disjoint union of graphs which are finite and acyclic or loops.