On composition and decomposition operations for vector spaces, graphs and matroids
The research creates a unified framework for composition and decomposition across vector spaces, graphs, and matroids by defining analogous operations for each structure. It develops polynomial-time algorithms for graph decomposition and establishes structural conditions like 'S, Q'-completeness to find minimal overlap sets in matroid linking operations.