{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T05:47:15Z","timestamp":1775800035169,"version":"3.50.1"},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    For each uniformity\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline1.png\"\/>\n                        <jats:tex-math>$k \\geq 3$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , we construct\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline2.png\"\/>\n                        <jats:tex-math>$k$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    uniform linear hypergraphs\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline3.png\"\/>\n                        <jats:tex-math>$G$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    with arbitrarily large maximum degree\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline4.png\"\/>\n                        <jats:tex-math>$\\Delta$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    whose independence polynomial\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline5.png\"\/>\n                        <jats:tex-math>$Z_G$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    has a zero\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline6.png\"\/>\n                        <jats:tex-math>$\\lambda$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548324000464_inline7.png\"\/>\n                        <jats:tex-math>$\\left \\vert \\lambda \\right \\vert = O\\left (\\frac {\\log \\Delta }{\\Delta }\\right )$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . This disproves a recent conjecture of Galvin, McKinley, Perkins, Sarantis, and Tetali.\n                  <\/jats:p>","DOI":"10.1017\/s0963548324000464","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T03:20:33Z","timestamp":1737516033000},"page":"486-490","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["Hypergraph independence polynomials with a zero close to the origin"],"prefix":"10.1017","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0744-5515","authenticated-orcid":false,"given":"Shengtong","family":"Zhang","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"S0963548324000464_ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.34"},{"key":"S0963548324000464_ref5","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOP1371"},{"key":"S0963548324000464_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01877590"},{"key":"S0963548324000464_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"},{"key":"S0963548324000464_ref6","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1541667626"},{"key":"S0963548324000464_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519957"},{"key":"S0963548324000464_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1466220"},{"key":"S0963548324000464_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-004-2055-4"},{"key":"S0963548324000464_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579368"},{"key":"S0963548324000464_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548323000330"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548324000464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:49:51Z","timestamp":1775796591000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548324000464\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["S0963548324000464"],"URL":"https:\/\/doi.org\/10.1017\/s0963548324000464","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}