arXiv (All)
open access
On composition and decomposition operations for vector spaces, graphs and matroids
In this paper, we study the ideas of composition and decomposition in the context of vector spaces, graphs and matroids. For vector spaces $\V_{AB},$ treated as collection of row vectors, with specified column set $A\uplus B,$ we define $\V_{SP}\lrarv \V_{PQ}, S\cap Q= \emptyset, $ to be the collect
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
- New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids#1200268
- Completely regular codes in graphs covered by a Hamming graph#1356995
- Binary Multiple-Node-Erasure-Correcting Codes over Complete Graphs: Constructions, q-Ary Metric Balls, and Duality#821512
- A search-to-decision reduction for the linear code equivalence problem#1106216
- Key exchange protocol based on circulant matrix action over congruence-simple semiring#984045
Record · ID 1354052
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