{"paper":{"title":"Leavitt path algebras with bounded index of nilpotence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Ashish K. Srivastava, K. M. Rangaswamy","submitted_at":"2018-08-30T01:50:08Z","abstract_excerpt":"In this paper we completely describe graphically Leavitt path algebras with bounded index of nilpotence. We show that the Leavitt path algebra $L_{K}(E)$ has index of nilpotence at most $n$ if and only if no cycle in the graph $E$ has an exit and there is a fixed positive integer $n$ such that the number of distinct paths that end at any given vertex $v$ (including $v$, but not including the entire cycle $c$ in case $v$ lies on $c$) is less than or equal to $n$. Interestingly, the Leavitt path algebras having bounded index of nilpotence turn out to be precisely those that satisfy a polynomial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10756","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}