Abstract
If [Formula: see text] is a directed graph and [Formula: see text] is a field, the Leavitt path algebra [Formula: see text] of [Formula: see text] over [Formula: see text] is naturally graded by the group of integers [Formula: see text] We formulate properties of the graph [Formula: see text] which are equivalent with [Formula: see text] being a crossed product, a skew group ring, or a group ring with respect to this natural grading. We state this main result so that the algebra properties of [Formula: see text] are also characterized in terms of the pre-ordered group properties of the Grothendieck [Formula: see text]-group of [Formula: see text]. If [Formula: see text] has finitely many vertices, we characterize when [Formula: see text] is strongly graded in terms of the properties of [Formula: see text] Our proof also provides an alternative to the known proof of the equivalence [Formula: see text] is strongly graded if and only if [Formula: see text] has no sinks for a finite graph [Formula: see text] We also show that, if unital, the algebra [Formula: see text] is strongly graded and graded unit-regular if and only if [Formula: see text] is a crossed product. In the process of showing the main result, we obtain conditions on a group [Formula: see text] and a [Formula: see text]-graded division ring [Formula: see text] equivalent with the requirements that a [Formula: see text]-graded matrix ring [Formula: see text] over [Formula: see text] is strongly graded, a crossed product, a skew group ring, or a group ring. We characterize these properties also in terms of the action of the group [Formula: see text] on the Grothendieck [Formula: see text]-group [Formula: see text]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.