2000 character limit reached
Isomorphisms of graded semiconnected algebras
Published 3 Sep 2026 in math.RA | (2609.03288v1)
Abstract: Let and be nonnegatively graded algebras, finitely generated in degrees less than $2$ and with semisimple base rings and . We prove that if as ungraded algebras, then as graded algebras. This generalises a theorem of Bell and Zhang arXiv:1509.08812 in the connected case , and the path-algebra version when and are -elementary due to Gaddis arXiv:1712.01650. We also discuss some related open problems for graded algebras.
Paper Prompts
Sign up for free to create and run prompts on this paper.