<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>On random matrices with large corank</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Zach</namePart>
  <namePart type="family">Hunter</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Matthew Alan</namePart>
  <namePart type="family">Kwan</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">5fca0887-a1db-11eb-95d1-ca9d5e0453b3</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-4003-7567</description></name>
<name type="personal">
  <namePart type="given">Lisa</namePart>
  <namePart type="family">Sauermann</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Mehtaab</namePart>
  <namePart type="family">Sawhney</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MaKw</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Randomness and structure in combinatorics</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">Let 1 ≤ k ≤ n and M be a random n × n matrix with independent uniformly random {±1}-entries. We
show that there exists an absolute constant c &gt; 0 such that
P[rank(M) ≤ n − k] ≤ exp(−cnk).
This confirms a well-known prediction in the area, extending a result of Rudelson (who previously
proved this same result under the restriction k ≤ √n, via different methods).</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_IMRN_Hunter.pdf">https://research-explorer.ista.ac.at/download/22147/22151/2026_IMRN_Hunter.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Oxford University Press</publisher><dateIssued encoding="w3cdtf">2026</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>International Mathematics Research Notices</title></titleInfo>
  <identifier type="issn">1073-7928</identifier>
  <identifier type="eIssn">1687-0247</identifier>
  <identifier type="arXiv">2510.12933</identifier><identifier type="doi">10.1093/imrn/rnag126</identifier>
<part><detail type="volume"><number>2026</number></detail><detail type="issue"><number>12</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<mla>Hunter, Zach, et al. “On Random Matrices with Large Corank.” &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;, vol. 2026, no. 12, rnag126, Oxford University Press, 2026, doi:&lt;a href=&quot;https://doi.org/10.1093/imrn/rnag126&quot;&gt;10.1093/imrn/rnag126&lt;/a&gt;.</mla>
<short>Z. Hunter, M.A. Kwan, L. Sauermann, M. Sawhney, International Mathematics Research Notices 2026 (2026).</short>
<ista>Hunter Z, Kwan MA, Sauermann L, Sawhney M. 2026. On random matrices with large corank. International Mathematics Research Notices. 2026(12), rnag126.</ista>
<apa>Hunter, Z., Kwan, M. A., Sauermann, L., &amp;#38; Sawhney, M. (2026). On random matrices with large corank. &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;. Oxford University Press. &lt;a href=&quot;https://doi.org/10.1093/imrn/rnag126&quot;&gt;https://doi.org/10.1093/imrn/rnag126&lt;/a&gt;</apa>
<ama>Hunter Z, Kwan MA, Sauermann L, Sawhney M. On random matrices with large corank. &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;. 2026;2026(12). doi:&lt;a href=&quot;https://doi.org/10.1093/imrn/rnag126&quot;&gt;10.1093/imrn/rnag126&lt;/a&gt;</ama>
<ieee>Z. Hunter, M. A. Kwan, L. Sauermann, and M. Sawhney, “On random matrices with large corank,” &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;, vol. 2026, no. 12. Oxford University Press, 2026.</ieee>
<chicago>Hunter, Zach, Matthew Alan Kwan, Lisa Sauermann, and Mehtaab Sawhney. “On Random Matrices with Large Corank.” &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;. Oxford University Press, 2026. &lt;a href=&quot;https://doi.org/10.1093/imrn/rnag126&quot;&gt;https://doi.org/10.1093/imrn/rnag126&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22147</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-28T22:01:35Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-06-29T09:19:14Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
