<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Connections between graphs and matrix spaces</dc:title>
   	<dc:creator>Li, Yinan</dc:creator>
   	<dc:creator>Qiao, Youming</dc:creator>
   	<dc:creator>Wigderson, Avi</dc:creator>
   	<dc:creator>Wigderson, Yuval</dc:creator>
   	<dc:creator>Zhang, Chuanqi</dc:creator>
   	<dc:description>Given a bipartite graph G, the graphical matrix space SG consists of
matrices whose non-zero entries can only be at those positions corresponding to edges in G. Tutte (J. London Math. Soc., 1947), Edmonds
(J. Res. Nat. Bur. Standards Sect. B, 1967) and Lov´asz (FCT, 1979) observed connections between perfect matchings in G and full-rank matrices
in SG. Dieudonn´e (Arch. Math., 1948) proved a tight upper bound on
the dimensions of those matrix spaces containing only singular matrices.
The starting point of this paper is a simultaneous generalization of these
two classical results: we show that the largest dimension over subspaces
of SG containing only singular matrices is equal to the maximum size over
subgraphs of G without perfect matchings, based on Meshulam’s proof of
Dieudonn´e’s result (Quart. J. Math., 1985).
Starting from this result, we go on to establish more connections
between properties of graphs and matrix spaces. For example, we
establish connections between acyclicity and nilpotency, between strong
connectivity and irreducibility, and between isomorphism and
conjugacy/congruence. For each connection, we study three types of correspondences, namely the basic correspondence, the inherited correspondence (for subgraphs and subspaces), and the induced correspondence
(for induced subgraphs and restrictions). Some correspondences lead to
intriguing generalizations of classical results, such as Dieudonn´e’s result
mentioned above, and a celebrated theorem of Gerstenhaber regarding the
largest dimension of nil matrix spaces (Amer. J. Math., 1958).
Finally, we show some implications of our results to quantum information and present open problems in computational complexity motivated
by these results.</dc:description>
   	<dc:publisher>Springer Nature</dc:publisher>
   	<dc:date>2023</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:article</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/22162</dc:identifier>
   	<dc:source>Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. Connections between graphs and matrix spaces. &lt;i&gt;Israel Journal of Mathematics&lt;/i&gt;. 2023;256(2):513-580. doi:&lt;a href=&quot;https://doi.org/10.1007/s11856-023-2515-7&quot;&gt;10.1007/s11856-023-2515-7&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/s11856-023-2515-7</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0021-2172</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1565-8511</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2206.04815</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
