[{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2305.02662"}],"status":"public","publisher":"Springer Nature","date_created":"2026-06-29T13:00:06Z","month":"06","title":"Lower bounds on weighted moments of primes in short intervals in number fields","intvolume":"       267","fulldoi":"https://doi.org/10.1007/s11856-024-2711-0","external_id":{"arxiv":["2305.02662"]},"doi":"10.1007/s11856-024-2711-0","day":"01","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","extern":"1","volume":267,"type":"journal_article","publication":"Israel Journal of Mathematics","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"date_updated":"2026-07-14T11:28:49Z","citation":{"ista":"de la Bretèche R, Kuperberg VZ. 2025. Lower bounds on weighted moments of primes in short intervals in number fields. Israel Journal of Mathematics. 267(1), 437–461.","short":"R. de la Bretèche, V.Z. Kuperberg, Israel Journal of Mathematics 267 (2025) 437–461.","ama":"de la Bretèche R, Kuperberg VZ. Lower bounds on weighted moments of primes in short intervals in number fields. <i>Israel Journal of Mathematics</i>. 2025;267(1):437-461. doi:<a href=\"https://doi.org/10.1007/s11856-024-2711-0\">10.1007/s11856-024-2711-0</a>","chicago":"Bretèche, Régis de la, and Vivian Zieve Kuperberg. “Lower Bounds on Weighted Moments of Primes in Short Intervals in Number Fields.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s11856-024-2711-0\">https://doi.org/10.1007/s11856-024-2711-0</a>.","mla":"de la Bretèche, Régis, and Vivian Zieve Kuperberg. “Lower Bounds on Weighted Moments of Primes in Short Intervals in Number Fields.” <i>Israel Journal of Mathematics</i>, vol. 267, no. 1, Springer Nature, 2025, pp. 437–61, doi:<a href=\"https://doi.org/10.1007/s11856-024-2711-0\">10.1007/s11856-024-2711-0</a>.","ieee":"R. de la Bretèche and V. Z. Kuperberg, “Lower bounds on weighted moments of primes in short intervals in number fields,” <i>Israel Journal of Mathematics</i>, vol. 267, no. 1. Springer Nature, pp. 437–461, 2025.","apa":"de la Bretèche, R., &#38; Kuperberg, V. Z. (2025). Lower bounds on weighted moments of primes in short intervals in number fields. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-024-2711-0\">https://doi.org/10.1007/s11856-024-2711-0</a>"},"article_type":"original","abstract":[{"text":"We consider an analog of a conjecture of Montgomery and Soundararajan on the moments of primes in short intervals in number fields; this analog was discussed and heuristically derived in a paper of the second author, Rodgers, and Roditty-Gershon. Adapting work of the first author and Fiorilli in the integer case, we establish lower bounds on a weighted version of these moments which agree with the conjectured values.","lang":"eng"}],"issue":"1","date_published":"2025-06-01T00:00:00Z","arxiv":1,"_id":"22201","language":[{"iso":"eng"}],"article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","publication_status":"published","OA_place":"repository","page":"437-461","year":"2025","OA_type":"green","author":[{"full_name":"de la Bretèche, Régis","first_name":"Régis","last_name":"de la Bretèche"},{"last_name":"Kuperberg","id":"c3bac823-112d-11f0-a3f5-c264f852e697","first_name":"Vivian Zieve","full_name":"Kuperberg, Vivian Zieve"}]},{"doi":"10.1007/s11856-024-2624-y","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","volume":263,"extern":"1","oa_version":"Preprint","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2105.02383","open_access":"1"}],"status":"public","date_created":"2026-06-29T10:59:02Z","publisher":"Springer Nature","month":"10","intvolume":"       263","title":"Ramsey numbers of sparse digraphs","fulldoi":"https://doi.org/10.1007/s11856-024-2624-y","external_id":{"arxiv":["2105.02383"]},"article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","publication_status":"published","OA_place":"repository","page":"1-48","year":"2024","author":[{"last_name":"Fox","first_name":"Jacob","full_name":"Fox, Jacob"},{"last_name":"He","first_name":"Xiaoyu","full_name":"He, Xiaoyu"},{"first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval","last_name":"Wigderson"}],"OA_type":"green","publication":"Israel Journal of Mathematics","citation":{"chicago":"Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey Numbers of Sparse Digraphs.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s11856-024-2624-y\">https://doi.org/10.1007/s11856-024-2624-y</a>.","short":"J. Fox, X. He, Y. Wigderson, Israel Journal of Mathematics 263 (2024) 1–48.","ama":"Fox J, He X, Wigderson Y. Ramsey numbers of sparse digraphs. <i>Israel Journal of Mathematics</i>. 2024;263(1):1-48. doi:<a href=\"https://doi.org/10.1007/s11856-024-2624-y\">10.1007/s11856-024-2624-y</a>","ista":"Fox J, He X, Wigderson Y. 2024. Ramsey numbers of sparse digraphs. Israel Journal of Mathematics. 263(1), 1–48.","ieee":"J. Fox, X. He, and Y. Wigderson, “Ramsey numbers of sparse digraphs,” <i>Israel Journal of Mathematics</i>, vol. 263, no. 1. Springer Nature, pp. 1–48, 2024.","apa":"Fox, J., He, X., &#38; Wigderson, Y. (2024). Ramsey numbers of sparse digraphs. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-024-2624-y\">https://doi.org/10.1007/s11856-024-2624-y</a>","mla":"Fox, Jacob, et al. “Ramsey Numbers of Sparse Digraphs.” <i>Israel Journal of Mathematics</i>, vol. 263, no. 1, Springer Nature, 2024, pp. 1–48, doi:<a href=\"https://doi.org/10.1007/s11856-024-2624-y\">10.1007/s11856-024-2624-y</a>."},"article_type":"original","abstract":[{"lang":"eng","text":"Burr and Erd˝os in 1975 conjectured, and Chv´atal, R¨odl, Szemer´edi and\r\nTrotter later proved, that the Ramsey number of any bounded degree\r\ngraph is linear in the number of vertices. In this paper, we disprove\r\nthe natural directed analogue of the Burr–Erd˝os conjecture, answering a\r\nquestion of Buci´c, Letzter, and Sudakov. If H is an acyclic digraph, the\r\noriented Ramsey number of H, denoted −→r1(H), is the least N such that\r\nevery tournament on N vertices contains a copy of H. We show that for\r\nany Δ ≥ 2 and any sufficiently large n, there exists an acyclic digraph H\r\nwith n vertices and maximum degree Δ such that\r\n−→r1(H) ≥ nΩ(Δ2/3/ log5/3 Δ).\r\nThis proves that −→r1(H) is not always linear in the number of vertices for\r\nbounded-degree H. On the other hand, we show that −→r1(H) is nearly linear\r\nin the number of vertices for typical bounded-degree acyclic digraphs H,\r\nand obtain linear or nearly linear bounds for several natural families of\r\nbounded-degree acyclic digraphs.\r\nFor multiple colors, we prove a quasi-polynomial upper bound −→rk(H)=\r\n2(log n)Ok(1) for all bounded-degree acyclic digraphs H on n vertices, where −→rk(H) is the least N such that every k-edge-colored tournament on N\r\nvertices contains a monochromatic copy of H. For k ≥ 2 and n ≥ 4, we\r\nexhibit an acyclic digraph H with n vertices and maximum degree 3 such\r\nthat −→rk(H) ≥ nΩ(log n/ log log n), showing that these Ramsey numbers can\r\ngrow faster than any polynomial in the number of vertices."}],"publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"date_updated":"2026-07-14T09:08:32Z","issue":"1","arxiv":1,"date_published":"2024-10-01T00:00:00Z","language":[{"iso":"eng"}],"_id":"22179"},{"acknowledgement":"Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302. Sah was supported by the PD Soros Fellowship. Simkin was supported by the Center of Mathematical Sciences and Applications at Harvard University.","type":"journal_article","volume":256,"oa_version":"Preprint","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","doi":"10.1007/s11856-023-2513-9","external_id":{"arxiv":["2202.05088"],"isi":["001081646400001"]},"fulldoi":"https://doi.org/10.1007/s11856-023-2513-9","intvolume":"       256","title":"Substructures in Latin squares","month":"09","date_created":"2023-10-22T22:01:14Z","publisher":"Springer Nature","isi":1,"status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2202.05088","open_access":"1"}],"author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan"},{"last_name":"Sah","full_name":"Sah, Ashwin","first_name":"Ashwin"},{"first_name":"Mehtaab","full_name":"Sawhney, Mehtaab","last_name":"Sawhney"},{"full_name":"Simkin, Michael","first_name":"Michael","last_name":"Simkin"}],"year":"2023","page":"363-416","publication_status":"published","scopus_import":"1","quality_controlled":"1","article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"MaKw"}],"language":[{"iso":"eng"}],"_id":"14444","arxiv":1,"date_published":"2023-09-01T00:00:00Z","issue":"2","article_type":"original","citation":{"mla":"Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:<a href=\"https://doi.org/10.1007/s11856-023-2513-9\">10.1007/s11856-023-2513-9</a>.","apa":"Kwan, M. A., Sah, A., Sawhney, M., &#38; Simkin, M. (2023). Substructures in Latin squares. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-023-2513-9\">https://doi.org/10.1007/s11856-023-2513-9</a>","ieee":"M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2. Springer Nature, pp. 363–416, 2023.","chicago":"Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-023-2513-9\">https://doi.org/10.1007/s11856-023-2513-9</a>.","ista":"Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares. Israel Journal of Mathematics. 256(2), 363–416.","ama":"Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. <i>Israel Journal of Mathematics</i>. 2023;256(2):363-416. doi:<a href=\"https://doi.org/10.1007/s11856-023-2513-9\">10.1007/s11856-023-2513-9</a>","short":"M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 363–416."},"abstract":[{"lang":"eng","text":"We prove several results about substructures in Latin squares. First, we explain how to adapt our recent work on high-girth Steiner triple systems to the setting of Latin squares, resolving a conjecture of Linial that there exist Latin squares with arbitrarily high girth. As a consequence, we see that the number of order- n  Latin squares with no intercalate (i.e., no  2×2 Latin subsquare) is at least  (e−9/4n−o(n))n2. Equivalently,  P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN\r\n , where  N is the number of intercalates in a uniformly random order- n Latin square. \r\nIn fact, extending recent work of Kwan, Sah, and Sawhney, we resolve the general large-deviation problem for intercalates in random Latin squares, up to constant factors in the exponent: for any constant  0<δ≤1 we have  P[N≤(1−δ)EN]=exp(−Θ(n2)) and for any constant  δ>0 we have  P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). \r\nFinally, as an application of some new general tools for studying substructures in random Latin squares, we show that in almost all order- n Latin squares, the number of cuboctahedra (i.e., the number of pairs of possibly degenerate  2×2 submatrices with the same arrangement of symbols) is of order  n4, which is the minimum possible. As observed by Gowers and Long, this number can be interpreted as measuring ``how associative'' the quasigroup associated with the Latin square is."}],"date_updated":"2025-09-09T13:08:47Z","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"publication":"Israel Journal of Mathematics"},{"type":"journal_article","ddc":["510"],"doi":"10.1007/s11856-023-2521-9","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"oa_version":"Published Version","volume":256,"month":"09","title":"Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes","intvolume":"       256","file":[{"access_level":"open_access","date_updated":"2023-10-31T11:20:31Z","creator":"dernst","date_created":"2023-10-31T11:20:31Z","file_id":"14475","checksum":"fbb05619fe4b650f341cc730425dd9c3","file_size":623787,"content_type":"application/pdf","relation":"main_file","file_name":"2023_IsraelJourMath_Wagner.pdf","success":1}],"external_id":{"isi":["001081646400010"]},"fulldoi":"https://doi.org/10.1007/s11856-023-2521-9","has_accepted_license":"1","status":"public","isi":1,"publisher":"Springer Nature","date_created":"2023-10-22T22:01:14Z","page":"675-717","year":"2023","author":[{"orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"},{"first_name":"Pascal","id":"4C20D868-F248-11E8-B48F-1D18A9856A87","full_name":"Wild, Pascal","last_name":"Wild"}],"file_date_updated":"2023-10-31T11:20:31Z","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"UlWa"}],"scopus_import":"1","quality_controlled":"1","publication_status":"published","date_published":"2023-09-01T00:00:00Z","_id":"14445","language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"publication":"Israel Journal of Mathematics","date_updated":"2024-10-09T21:07:12Z","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"abstract":[{"text":"We prove the following quantitative Borsuk–Ulam-type result (an equivariant analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with 0 ∈ F (σ) is at least 2−d Π d−1k=0ηk.\r\n\r\nAs an application, we show that for every sufficiently thick d-dimensional spherical building Y and every map f: Y → ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ} of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d, which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical buildings.\r\n\r\nWe complement these results by upper bounds on the coboundary expansion of two families of simplicial complexes; this indicates some limitations to the bounds one can obtain by straighforward applications of the quantitative Borsuk–Ulam theorem. Specifically, we prove\r\n\r\n• an upper bound of (d + 1)/2d on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite d-dimensional complexes (under a mild divisibility assumption on the sizes of the parts); and\r\n\r\n• an upper bound of (d + 1)/2d + ε on the normalized (d − 1)-th coboundary expansion of the d-dimensional spherical building associated with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather strong sense, a conjecture of Lubotzky, Meshulam and Mozes.","lang":"eng"}],"citation":{"mla":"Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:<a href=\"https://doi.org/10.1007/s11856-023-2521-9\">10.1007/s11856-023-2521-9</a>.","apa":"Wagner, U., &#38; Wild, P. (2023). Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-023-2521-9\">https://doi.org/10.1007/s11856-023-2521-9</a>","ieee":"U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes,” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2. Springer Nature, pp. 675–717, 2023.","ista":"Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.","ama":"Wagner U, Wild P. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. <i>Israel Journal of Mathematics</i>. 2023;256(2):675-717. doi:<a href=\"https://doi.org/10.1007/s11856-023-2521-9\">10.1007/s11856-023-2521-9</a>","short":"U. Wagner, P. Wild, Israel Journal of Mathematics 256 (2023) 675–717.","chicago":"Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-023-2521-9\">https://doi.org/10.1007/s11856-023-2521-9</a>."},"article_type":"original","corr_author":"1","issue":"2"},{"date_updated":"2023-08-14T11:26:34Z","publication_identifier":{"eissn":["1565-8511"]},"abstract":[{"lang":"eng","text":"In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate that such notions also give rise to distinct equivalence classes. Put differently, we find occurrences of particularly strong divergence of separated nets from the integer lattice. Our approach generalises that of Burago and Kleiner and McMullen which takes place largely in a continuous setting. Existence of irregular separated nets is verified via the existence of non-realisable density functions ρ:[0,1]d→(0,∞). In the present work we obtain stronger types of non-realisable densities."}],"citation":{"mla":"Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel Journal of Mathematics</i>, vol. 253, Springer Nature, 2023, pp. 501–54, doi:<a href=\"https://doi.org/10.1007/s11856-022-2448-6\">10.1007/s11856-022-2448-6</a>.","apa":"Dymond, M., &#38; Kaluza, V. (2023). Highly irregular separated nets. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-022-2448-6\">https://doi.org/10.1007/s11856-022-2448-6</a>","ieee":"M. Dymond and V. Kaluza, “Highly irregular separated nets,” <i>Israel Journal of Mathematics</i>, vol. 253. Springer Nature, pp. 501–554, 2023.","chicago":"Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-022-2448-6\">https://doi.org/10.1007/s11856-022-2448-6</a>.","ista":"Dymond M, Kaluza V. 2023. Highly irregular separated nets. Israel Journal of Mathematics. 253, 501–554.","short":"M. Dymond, V. Kaluza, Israel Journal of Mathematics 253 (2023) 501–554.","ama":"Dymond M, Kaluza V. Highly irregular separated nets. <i>Israel Journal of Mathematics</i>. 2023;253:501-554. doi:<a href=\"https://doi.org/10.1007/s11856-022-2448-6\">10.1007/s11856-022-2448-6</a>"},"article_type":"original","publication":"Israel Journal of Mathematics","_id":"9652","language":[{"iso":"eng"}],"date_published":"2023-03-01T00:00:00Z","arxiv":1,"publication_status":"published","file_date_updated":"2021-07-14T07:41:50Z","article_processing_charge":"No","department":[{"_id":"UlWa"}],"quality_controlled":"1","scopus_import":"1","keyword":["Lipschitz","bilipschitz","bounded displacement","modulus of continuity","separated net","non-realisable density","Burago--Kleiner construction"],"year":"2023","author":[{"full_name":"Dymond, Michael","first_name":"Michael","last_name":"Dymond"},{"last_name":"Kaluza","orcid":"0000-0002-2512-8698","first_name":"Vojtech","id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","full_name":"Kaluza, Vojtech"}],"page":"501-554","status":"public","isi":1,"publisher":"Springer Nature","date_created":"2021-07-14T07:01:28Z","title":"Highly irregular separated nets","intvolume":"       253","file":[{"content_type":"application/pdf","file_size":900422,"file_name":"separated_nets.pdf","relation":"main_file","date_updated":"2021-07-14T07:41:50Z","creator":"vkaluza","access_level":"open_access","date_created":"2021-07-14T07:41:50Z","file_id":"9653","checksum":"6fa0a3207dd1d6467c309fd1bcc867d1"}],"has_accepted_license":"1","fulldoi":"https://doi.org/10.1007/s11856-022-2448-6","external_id":{"arxiv":["1903.05923"],"isi":["000904950300003"]},"month":"03","oa_version":"Submitted Version","volume":253,"doi":"10.1007/s11856-022-2448-6","ddc":["515","516"],"day":"01","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was done while both authors were employed at the University of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.","type":"journal_article"},{"date_created":"2026-06-29T10:52:37Z","publisher":"Springer Nature","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2206.04815"}],"external_id":{"arxiv":["2206.04815"]},"fulldoi":"https://doi.org/10.1007/s11856-023-2515-7","intvolume":"       256","title":"Connections between graphs and matrix spaces","month":"09","extern":"1","volume":256,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"01","doi":"10.1007/s11856-023-2515-7","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"Given a bipartite graph G, the graphical matrix space SG consists of\r\nmatrices whose non-zero entries can only be at those positions corresponding to edges in G. Tutte (J. London Math. Soc., 1947), Edmonds\r\n(J. Res. Nat. Bur. Standards Sect. B, 1967) and Lov´asz (FCT, 1979) observed connections between perfect matchings in G and full-rank matrices\r\nin SG. Dieudonn´e (Arch. Math., 1948) proved a tight upper bound on\r\nthe dimensions of those matrix spaces containing only singular matrices.\r\nThe starting point of this paper is a simultaneous generalization of these\r\ntwo classical results: we show that the largest dimension over subspaces\r\nof SG containing only singular matrices is equal to the maximum size over\r\nsubgraphs of G without perfect matchings, based on Meshulam’s proof of\r\nDieudonn´e’s result (Quart. J. Math., 1985).\r\nStarting from this result, we go on to establish more connections\r\nbetween properties of graphs and matrix spaces. For example, we\r\nestablish connections between acyclicity and nilpotency, between strong\r\nconnectivity and irreducibility, and between isomorphism and\r\nconjugacy/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\r\n(for induced subgraphs and restrictions). Some correspondences lead to\r\nintriguing generalizations of classical results, such as Dieudonn´e’s result\r\nmentioned above, and a celebrated theorem of Gerstenhaber regarding the\r\nlargest dimension of nil matrix spaces (Amer. J. Math., 1958).\r\nFinally, we show some implications of our results to quantum information and present open problems in computational complexity motivated\r\nby these results."}],"article_type":"original","citation":{"mla":"Li, Yinan, et al. “Connections between Graphs and Matrix Spaces.” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2, Springer Nature, 2023, pp. 513–80, doi:<a href=\"https://doi.org/10.1007/s11856-023-2515-7\">10.1007/s11856-023-2515-7</a>.","apa":"Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., &#38; Zhang, C. (2023). Connections between graphs and matrix spaces. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-023-2515-7\">https://doi.org/10.1007/s11856-023-2515-7</a>","ieee":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, and C. Zhang, “Connections between graphs and matrix spaces,” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2. Springer Nature, pp. 513–580, 2023.","ista":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. 2023. Connections between graphs and matrix spaces. Israel Journal of Mathematics. 256(2), 513–580.","ama":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. Connections between graphs and matrix spaces. <i>Israel Journal of Mathematics</i>. 2023;256(2):513-580. doi:<a href=\"https://doi.org/10.1007/s11856-023-2515-7\">10.1007/s11856-023-2515-7</a>","short":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, C. Zhang, Israel Journal of Mathematics 256 (2023) 513–580.","chicago":"Li, Yinan, Youming Qiao, Avi Wigderson, Yuval Wigderson, and Chuanqi Zhang. “Connections between Graphs and Matrix Spaces.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-023-2515-7\">https://doi.org/10.1007/s11856-023-2515-7</a>."},"publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"date_updated":"2026-07-08T10:44:50Z","publication":"Israel Journal of Mathematics","language":[{"iso":"eng"}],"_id":"22162","arxiv":1,"date_published":"2023-09-01T00:00:00Z","publication_status":"published","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","author":[{"full_name":"Li, Yinan","first_name":"Yinan","last_name":"Li"},{"last_name":"Qiao","full_name":"Qiao, Youming","first_name":"Youming"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"},{"full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson"},{"full_name":"Zhang, Chuanqi","first_name":"Chuanqi","last_name":"Zhang"}],"OA_type":"green","year":"2023","page":"513-580","OA_place":"repository"},{"acknowledgement":"Research supported by the Swiss National Science Foundation (Project SNSF-PP00P2-138948), by the Austrian Science Fund (FWF Project P31312-N35), by the Russian Foundation for Basic Research (Grants No. 15-01-06302 and 19-01-00169), by a Simons-IUM Fellowship, and by the D. Zimin Dynasty Foundation Grant. We would like to thank E. Alkin, A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful comments and discussions.","related_material":{"record":[{"id":"9308","relation":"earlier_version","status":"public"},{"status":"public","id":"8183","relation":"earlier_version"}]},"type":"journal_article","oa_version":"Preprint","volume":245,"day":"30","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"doi":"10.1007/s11856-021-2216-z","fulldoi":"https://doi.org/10.1007/s11856-021-2216-z","external_id":{"isi":["000712942100013"],"arxiv":["1511.03501"]},"title":"Eliminating higher-multiplicity intersections. III. Codimension 2","intvolume":"       245","month":"10","project":[{"call_identifier":"FWF","grant_number":"P31312","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory"}],"isi":1,"publisher":"Springer Nature","date_created":"2021-11-07T23:01:24Z","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"author":[{"orcid":"0000-0002-7840-5062","last_name":"Avvakumov","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey"},{"first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Mabillard, Isaac","last_name":"Mabillard"},{"first_name":"Arkadiy B.","full_name":"Skopenkov, Arkadiy B.","last_name":"Skopenkov"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568"}],"year":"2021","page":"501–534 ","publication_status":"published","quality_controlled":"1","scopus_import":"1","department":[{"_id":"UlWa"}],"article_processing_charge":"No","_id":"10220","language":[{"iso":"eng"}],"date_published":"2021-10-30T00:00:00Z","arxiv":1,"publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"date_updated":"2025-07-02T10:54:52Z","abstract":[{"lang":"eng","text":"We study conditions under which a finite simplicial complex K can be mapped to ℝd without higher-multiplicity intersections. An almost r-embedding is a map f: K → ℝd such that the images of any r pairwise disjoint simplices of K do not have a common point. We show that if r is not a prime power and d ≥ 2r + 1, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost r-embedding of the (d +1)(r − 1)-simplex in ℝd. This improves on previous constructions of counterexamples (for d ≥ 3r) based on a series of papers by M. Özaydin, M. Gromov, P. Blagojević, F. Frick, G. Ziegler, and the second and fourth present authors.\r\n\r\nThe counterexamples are obtained by proving the following algebraic criterion in codimension 2: If r ≥ 3 and if K is a finite 2(r − 1)-complex, then there exists an almost r-embedding K → ℝ2r if and only if there exists a general position PL map f: K → ℝ2r such that the algebraic intersection number of the f-images of any r pairwise disjoint simplices of K is zero. This result can be restated in terms of a cohomological obstruction and extends an analogous codimension 3 criterion by the second and fourth authors. As another application, we classify ornaments f: S3 ⊔ S3 ⊔ S3 → ℝ5 up to ornament concordance.\r\n\r\nIt follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for r = 2 is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample."}],"corr_author":"1","citation":{"apa":"Avvakumov, S., Mabillard, I., Skopenkov, A. B., &#38; Wagner, U. (2021). Eliminating higher-multiplicity intersections. III. Codimension 2. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-021-2216-z\">https://doi.org/10.1007/s11856-021-2216-z</a>","ieee":"S. Avvakumov, I. Mabillard, A. B. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections. III. Codimension 2,” <i>Israel Journal of Mathematics</i>, vol. 245. Springer Nature, pp. 501–534, 2021.","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.” <i>Israel Journal of Mathematics</i>, vol. 245, Springer Nature, 2021, pp. 501–534, doi:<a href=\"https://doi.org/10.1007/s11856-021-2216-z\">10.1007/s11856-021-2216-z</a>.","chicago":"Avvakumov, Sergey, Isaac Mabillard, Arkadiy B. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11856-021-2216-z\">https://doi.org/10.1007/s11856-021-2216-z</a>.","ama":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. Eliminating higher-multiplicity intersections. III. Codimension 2. <i>Israel Journal of Mathematics</i>. 2021;245:501–534. doi:<a href=\"https://doi.org/10.1007/s11856-021-2216-z\">10.1007/s11856-021-2216-z</a>","short":"S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.","ista":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 501–534."},"article_type":"original","publication":"Israel Journal of Mathematics"},{"publication_status":"published","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","year":"2020","author":[{"last_name":"Bucić","full_name":"Bucić, Matija","first_name":"Matija"},{"full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","orcid":"0000-0002-4003-7567"},{"full_name":"Pokrovskiy, Alexey","first_name":"Alexey","last_name":"Pokrovskiy"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"},{"full_name":"Tran, Tuan","first_name":"Tuan","last_name":"Tran"},{"first_name":"Adam Zsolt","full_name":"Wagner, Adam Zsolt","last_name":"Wagner"}],"page":"663-685","citation":{"mla":"Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” <i>Israel Journal of Mathematics</i>, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:<a href=\"https://doi.org/10.1007/s11856-020-2035-7\">10.1007/s11856-020-2035-7</a>.","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” <i>Israel Journal of Mathematics</i>, vol. 238, no. 2. Springer, pp. 663–685, 2020.","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., &#38; Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-020-2035-7\">https://doi.org/10.1007/s11856-020-2035-7</a>","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” <i>Israel Journal of Mathematics</i>. Springer, 2020. <a href=\"https://doi.org/10.1007/s11856-020-2035-7\">https://doi.org/10.1007/s11856-020-2035-7</a>.","ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel Journal of Mathematics 238 (2020) 663–685.","ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear monotone paths in edge-ordered graphs. <i>Israel Journal of Mathematics</i>. 2020;238(2):663-685. doi:<a href=\"https://doi.org/10.1007/s11856-020-2035-7\">10.1007/s11856-020-2035-7</a>"},"article_type":"original","abstract":[{"lang":"eng","text":"How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971, and has since attracted the attention of many researchers, inspiring a variety of related problems. The prevailing conjecture is that one can always find a monotone path of linear length, but until now the best known lower bound was n2/3-o(1). In this paper we almost close this gap, proving that any edge-ordering of the complete graph contains a monotone path of length n1-o(1)."}],"date_updated":"2023-02-23T14:01:35Z","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"issue":"2","publication":"Israel Journal of Mathematics","language":[{"iso":"eng"}],"_id":"9578","arxiv":1,"date_published":"2020-07-01T00:00:00Z","volume":238,"extern":"1","oa_version":"Preprint","doi":"10.1007/s11856-020-2035-7","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"day":"01","type":"journal_article","status":"public","date_created":"2021-06-21T13:24:35Z","publisher":"Springer","main_file_link":[{"url":"https://arxiv.org/abs/1809.01468","open_access":"1"}],"intvolume":"       238","title":"Nearly-linear monotone paths in edge-ordered graphs","fulldoi":"https://doi.org/10.1007/s11856-020-2035-7","external_id":{"arxiv":["1809.01468"]},"month":"07"},{"date_updated":"2023-02-23T14:01:41Z","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"article_type":"original","citation":{"chicago":"Conlon, David, Jacob Fox, Matthew Alan Kwan, and Benny Sudakov. “Hypergraph Cuts above the Average.” <i>Israel Journal of Mathematics</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s11856-019-1897-z\">https://doi.org/10.1007/s11856-019-1897-z</a>.","ista":"Conlon D, Fox J, Kwan MA, Sudakov B. 2019. Hypergraph cuts above the average. Israel Journal of Mathematics. 233(1), 67–111.","ama":"Conlon D, Fox J, Kwan MA, Sudakov B. Hypergraph cuts above the average. <i>Israel Journal of Mathematics</i>. 2019;233(1):67-111. doi:<a href=\"https://doi.org/10.1007/s11856-019-1897-z\">10.1007/s11856-019-1897-z</a>","short":"D. Conlon, J. Fox, M.A. Kwan, B. Sudakov, Israel Journal of Mathematics 233 (2019) 67–111.","mla":"Conlon, David, et al. “Hypergraph Cuts above the Average.” <i>Israel Journal of Mathematics</i>, vol. 233, no. 1, Springer, 2019, pp. 67–111, doi:<a href=\"https://doi.org/10.1007/s11856-019-1897-z\">10.1007/s11856-019-1897-z</a>.","apa":"Conlon, D., Fox, J., Kwan, M. A., &#38; Sudakov, B. (2019). Hypergraph cuts above the average. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-019-1897-z\">https://doi.org/10.1007/s11856-019-1897-z</a>","ieee":"D. Conlon, J. Fox, M. A. Kwan, and B. Sudakov, “Hypergraph cuts above the average,” <i>Israel Journal of Mathematics</i>, vol. 233, no. 1. Springer, pp. 67–111, 2019."},"abstract":[{"text":"An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2+Ω)(m−−√) and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m−−√) larger than the expected size of a random r-cut. Moreover, in the case where k = 3 and r = 2 this bound is best possible and is attained by Steiner triple systems. Surprisingly, for all other cases (that is, if k ≥ 4 or r ≥ 3), we show that every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m5/9) larger than the expected size of a random r-cut. This is a significant difference in behaviour, since the amount by which the size of the largest cut exceeds the expected size of a random cut is now considerably larger than the standard deviation.","lang":"eng"}],"issue":"1","publication":"Israel Journal of Mathematics","_id":"9580","language":[{"iso":"eng"}],"date_published":"2019-08-01T00:00:00Z","arxiv":1,"publication_status":"published","article_processing_charge":"No","quality_controlled":"1","scopus_import":"1","year":"2019","author":[{"full_name":"Conlon, David","first_name":"David","last_name":"Conlon"},{"first_name":"Jacob","full_name":"Fox, Jacob","last_name":"Fox"},{"last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"page":"67-111","status":"public","publisher":"Springer","date_created":"2021-06-21T13:36:02Z","main_file_link":[{"url":"https://arxiv.org/abs/1803.08462","open_access":"1"}],"title":"Hypergraph cuts above the average","intvolume":"       233","external_id":{"arxiv":["1803.08462"]},"fulldoi":"https://doi.org/10.1007/s11856-019-1897-z","month":"08","oa_version":"Preprint","extern":"1","volume":233,"doi":"10.1007/s11856-019-1897-z","day":"01","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"journal_article"}]
