Article ID: | iaor20084092 |
Country: | Japan |
Volume: | 50 |
Issue: | 4 |
Start Page Number: | 315 |
End Page Number: | 324 |
Publication Date: | Dec 2007 |
Journal: | Journal of the Operations Research Society of Japan |
Authors: | Iwata Satoru |
Keywords: | programming: assignment |
A matroid pencil is a pair of linking systems having the same ground sets in common. It provides a combinatorial abstraction of matrix pencils. This paper investigates the properties of matroid pencils analogous to the theory of Kronecker canonical form. As an application, we give a simple alternative proof for a theorem of Murota on power products of linking systems.