◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

G. Abrams

4 papers hereh-index 210 citations5 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.RA4
same name
  • G. Abrams — 103 papers, h 53
  • G. Abrams — 62 papers, h 14
  • G. Abrams — 55 papers, h 20
  • G. Abrams — 31 papers, h 17
  • G. Abrams — 3 papers, h 3
  • G. Abrams — 1 paper, h 6

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20222026
most citedInjectives over Leavitt path algebras of graphs with disjoint cycles

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.RA2026

The injective envelope of simple modules over Leavitt path algebras II: simples arising from exclusive cycles

G. Abrams, F. Mantese, A. Tonolo

Let K be any field, E any directed graph, and LK​(E) the associated Leavitt path algebra. As described first by Chen, and subsequently generalized by Ara and Rangaswamy, for…

math.RA2026

The injective envelope of simple modules over Leavitt path algebras I: simple left ideals

G. Abrams, F. Mantese, A. Tonolo

Let K be any field and E any directed graph. We characterize up to isomorphism the simple (i.e., minimal) left ideals of the Leavitt path algebra LK​(E). Then, for each simpl…

math.RA2023

Recasting the Hazrat Conjecture: Relating Shift Equivalence to Graded Morita Equivalence

Gene Abrams, Efren Ruiz, Mark Tomforde

Let E and F be finite graphs with no sinks, and k any field. We show that shift equivalence of the adjacency matrices AE​ and AF​, together with an additional compatibili…

math.RA2022★ 1 cited

Injectives over Leavitt path algebras of graphs with disjoint cycles

Gene Abrams, Francesca Mantese, Alberto Tonolo

Let K be any field, and let E be a finite graph with the property that every vertex in E is the base of at most one cycle (we say such a graph satisfies Condition (AR)). We e…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.