arXiv (All)
open access
Compressed commuting graphs of matrix rings
In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression is chosen in such a way that it induces a functor from the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
- On the zero ring index of some classes of graphs#293897
- Key exchange protocol based on circulant matrix action over congruence-simple semiring#984045
- Generalized $t$-Fine and Quasi $t$-Fine Rings#1014929
- Compressed Inverse Suffix Arrays#924621
Record · ID 999142
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive