Abstract
We associate in a natural way to any partially ordered set (P,≤) a directed graph EP (where the vertices of EP correspond to the elements of P, and the edges of EP correspond to related pairs of elements of P), and then describe the prime spectrum Spec(LK(EP)) of the resulting Leavitt path algebra LK(EP). This construction allows us to realize a wide class of partially ordered sets as the prime spectra of rings. More specifically, any partially ordered set in which every downward directed subset has a greatest lower bound, and where these greatest lower bounds satisfy certain compatibility conditions, can be so realized. In particular, any partially ordered set satisfying the descending chain condition is in this class.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
