{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T21:58:51Z","timestamp":1747173531345,"version":"3.40.5"},"reference-count":19,"publisher":"Cambridge University Press (CUP)","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"abstract":"<jats:title>Abstract<\/jats:title>\n\t  <jats:p>For a <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline1.png\"\/>\n\t\t<jats:tex-math>\n$k$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula>-uniform hypergraph <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline2.png\"\/>\n\t\t<jats:tex-math>\n$\\mathcal{H}$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula> on vertex set <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline3.png\"\/>\n\t\t<jats:tex-math>\n$\\{1, \\ldots, n\\}$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula> we associate a particular signed incidence matrix <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline4.png\"\/>\n\t\t<jats:tex-math>\n$M(\\mathcal{H})$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula> over the integers. For <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline5.png\"\/>\n\t\t<jats:tex-math>\n$\\mathcal{H} \\sim \\mathcal{H}_k(n, p)$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula> an Erd\u0151s\u2013R\u00e9nyi random <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline6.png\"\/>\n\t\t<jats:tex-math>\n$k$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula>-uniform hypergraph, <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline7.png\"\/>\n\t\t<jats:tex-math>\n${\\mathrm{coker}}(M(\\mathcal{H}))$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula> is then a model for random abelian groups. Motivated by conjectures from the study of random simplicial complexes we show that for <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline8.png\"\/>\n\t\t<jats:tex-math>\n$p = \\omega (1\/n^{k - 1})$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula>, <jats:inline-formula>\n\t      <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548323000056_inline9.png\"\/>\n\t\t<jats:tex-math>\n${\\mathrm{coker}}(M(\\mathcal{H}))$\n<\/jats:tex-math>\n\t      <\/jats:alternatives>\n\t    <\/jats:inline-formula> is torsion-free.<\/jats:p>","DOI":"10.1017\/s0963548323000056","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T07:16:34Z","timestamp":1681974994000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Abelian groups from random hypergraphs"],"prefix":"10.1017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4666-0218","authenticated-orcid":false,"given":"Andrew","family":"Newman","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"S0963548323000056_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0099440"},{"key":"S0963548323000056_ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20495"},{"key":"S0963548323000056_ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20061"},{"key":"S0963548323000056_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-015-0598-x"},{"key":"S0963548323000056_ref16","unstructured":"[16] Newman, A. and Paquette, E. (2018) The integer homology threshold in Yd (n, p). arXiv:1808.10647. To appear in Proceedings of the AMS."},{"key":"S0963548323000056_ref11","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2016.184.3.3"},{"key":"S0963548323000056_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000097"},{"key":"S0963548323000056_ref14","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/8127"},{"key":"S0963548323000056_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0027-9"},{"key":"S0963548323000056_ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20585"},{"key":"S0963548323000056_ref9","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2018.1473821"},{"volume-title":"GAP \u2013 Groups, Algorithms, and Programming, Version 4.11.1","year":"2021","key":"S0963548323000056_ref8"},{"key":"S0963548323000056_ref19","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/866"},{"key":"S0963548323000056_ref18","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1999.095"},{"key":"S0963548323000056_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-017-9938-z"},{"key":"S0963548323000056_ref6","doi-asserted-by":"publisher","DOI":"10.37236\/8092"},{"key":"S0963548323000056_ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S1793525312500197"},{"key":"S0963548323000056_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20238"},{"key":"S0963548323000056_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9483-8"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548323000056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T07:16:39Z","timestamp":1681974999000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548323000056\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":19,"alternative-id":["S0963548323000056"],"URL":"https:\/\/doi.org\/10.1017\/s0963548323000056","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"type":"print","value":"0963-5483"},{"type":"electronic","value":"1469-2163"}],"subject":[],"published":{"date-parts":[[2023,4,20]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. 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"}]}}