{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T21:58:57Z","timestamp":1747173537587,"version":"3.40.5"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:00:00Z","timestamp":1726790400000},"content-version":"unspecified","delay-in-days":19,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S096354832400021X_inline1.png\"\/><jats:tex-math>\n$\\{0,1\\}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-matrices over the rationals. The sufficient condition is generally necessary as well.<\/jats:p>","DOI":"10.1017\/s096354832400021x","type":"journal-article","created":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T09:23:53Z","timestamp":1726824233000},"page":"643-707","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["The full rank condition for sparse random matrices"],"prefix":"10.1017","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7350-1418","authenticated-orcid":false,"given":"Amin","family":"Coja-Oghlan","sequence":"first","affiliation":[]},{"given":"Pu","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Max","family":"Hahn-Klimroth","sequence":"additional","affiliation":[]},{"given":"Joon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Noela","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Rolvien","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2024,9,20]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096354832400021X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T22:46:12Z","timestamp":1728427572000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096354832400021X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["S096354832400021X"],"URL":"https:\/\/doi.org\/10.1017\/s096354832400021x","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"type":"print","value":"0963-5483"},{"type":"electronic","value":"1469-2163"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}