[{"publication_status":"published","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","author":[{"first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","orcid":"0000-0003-2027-5549","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte"}],"file":[{"creator":"choffman","file_name":"2025_Hoffmann_Charlotte_Source.zip","date_updated":"2026-01-02T10:39:16Z","date_created":"2026-01-02T10:39:16Z","checksum":"8a099fbf54963bd0be38f7ce73658682","file_size":8355494,"content_type":"application/x-zip-compressed","file_id":"20921","access_level":"closed","relation":"source_file"},{"checksum":"9521c07bfb2bb5b14a49c09fcfc96474","relation":"main_file","access_level":"open_access","file_size":2258804,"content_type":"application/pdf","file_id":"20922","success":1,"date_created":"2026-01-02T10:39:26Z","date_updated":"2026-01-02T10:39:26Z","file_name":"2025_Hoffmann_Charlotte_Thesis.pdf","creator":"choffman"}],"doi":"10.15479/AT-ISTA-20920","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"13143"},{"id":"12176","status":"public","relation":"part_of_dissertation"},{"id":"20556","status":"public","relation":"earlier_version"},{"id":"19778","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20701"}]},"supervisor":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"Verifiable Delay Functions (VDFs) introduced by Boneh et al. (CRYPTO'18) are functions that require a prescribed number of sequential steps T to evaluate, yet their output can be verified in time much faster than T. Since their introduction, VDFs have gained a lot of attention due to their applications in blockchain protocols, randomness beacons, timestamping and deniability. This thesis explores the theory and applications of VDFs, focusing on enhancing their soundness, efficiency and practicality.\r\n\r\nThe only practical VDFs known to date are based on repeated squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T).\r\nThe iterated squaring assumption states that, for a random group element x, the result of VDF cannot be computed significantly faster than performing T sequential squarings if the group order is unknown. To make the result verifiable a prover can compute a proof of exponentiation (PoE) \\pi. Given \\pi, the output of VDF can be verified in time much less than T.\r\n\r\nWe first present new constructions of statistically sound proofs of exponentiation, which are an important building block in the construction of SNARKs (Succinct Non-Interactive Argument of Knowledge). Statistical soundness means that the proofs remain secure against computationally unbounded adversaries, in particular, it remains secure even when the group order is known. We thereby address limitations in previous PoE protocols which either required (non-standard) hardness assumptions or a lot of parallel repetitions. Our construction significantly reduces the proof size of statistically sound PoEs that allow for a structured exponent, which leads to better efficiency of SNARKs and other applications.\r\n\r\nSecondly, we introduce improved batching techniques for PoEs, which allow multiple proofs to be aggregated and verified with minimal overhead. These protocols optimize communication and computation complexity in large-scale blockchain environments and enable scalable remote benchmarking of parallel computation resources.\r\n\r\nWe then construct VDFs with enhanced properties such as zero-knowledge and watermarkability. It was shown by Arun, Bonneau and Clark (ASIACRYPT'22) that these features enable new cryptographic primitives called short-lived proofs and signatures. The validity of such proofs and signatures expires after a predefined amount of time T, i.e., they are deniable after time T. Our constructions improve upon the constructions by Arun, Bonneau and Clark in several dimensions (faster forging times, arguably weaker assumptions).\r\n\r\nFinally, we apply PoEs in the realm of primality testing, providing cryptographically sound proofs of non-primality for large Proth numbers. This work gives a surprising application of VDFs in the area of computational number theory.\r\n\r\nTogether, our contributions advance both the theoretical foundations and the real-world usability of VDFs in general and in particular of PoEs, making them more adaptable and secure for current and emerging cryptographic applications.","lang":"eng"}],"date_created":"2026-01-02T10:46:47Z","page":"116","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png"},"OA_place":"publisher","_id":"20920","degree_awarded":"PhD","ddc":["004"],"oa":1,"status":"public","month":"12","corr_author":"1","date_published":"2025-12-31T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"has_accepted_license":"1","date_updated":"2026-07-06T13:15:27Z","day":"31","file_date_updated":"2026-01-02T10:39:26Z","type":"dissertation","year":"2025","publication_identifier":{"issn":["2663-337X"]},"citation":{"mla":"Hoffmann, Charlotte. Theory and Applications of Verifiable Delay Functions. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20920.","ista":"Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute of Science and Technology Austria.","short":"C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute of Science and Technology Austria, 2025.","ama":"Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:10.15479/AT-ISTA-20920","ieee":"C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute of Science and Technology Austria, 2025.","apa":"Hoffmann, C. (2025). Theory and applications of verifiable delay functions. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20920","chicago":"Hoffmann, Charlotte. “Theory and Applications of Verifiable Delay Functions.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20920."},"title":"Theory and applications of verifiable delay functions","article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"doi":"10.15479/AT-ISTA-20556","author":[{"last_name":"Hoffmann","orcid":"0000-0003-2027-5549","full_name":"Hoffmann, Charlotte","first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"}],"file":[{"relation":"main_file","access_level":"closed","file_id":"20573","file_size":2259304,"content_type":"application/pdf","checksum":"1fffa4e2c33dd0b9f883d615504a2858","date_created":"2025-10-28T14:33:03Z","date_updated":"2026-01-08T14:11:39Z","creator":"choffman","file_name":"2025_Hoffmann_Charlotte_Thesis.pdf"},{"date_created":"2025-10-28T14:35:06Z","date_updated":"2025-11-11T09:34:54Z","file_name":"2025_Hoffmann_Charlotte_Source.zip","creator":"choffman","checksum":"076ea98a1f0a86c3bbc990b6b9460dc2","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","file_size":9987633,"file_id":"20574"}],"oa_version":"Published Version","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"13143"},{"relation":"part_of_dissertation","status":"public","id":"12176"},{"relation":"later_version","status":"public","id":"20920"},{"id":"19778","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20701"}]},"alternative_title":["ISTA Thesis"],"publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","year":"2025","file_date_updated":"2026-01-08T14:11:39Z","day":"31","date_updated":"2026-07-06T13:15:27Z","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2025-10-31T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No","title":"Theory and applications of verifiable delay functions","citation":{"short":"C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute of Science and Technology Austria, 2025.","mla":"Hoffmann, Charlotte. Theory and Applications of Verifiable Delay Functions. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20556.","ista":"Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute of Science and Technology Austria.","ama":"Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:10.15479/AT-ISTA-20556","ieee":"C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute of Science and Technology Austria, 2025.","chicago":"Hoffmann, Charlotte. “Theory and Applications of Verifiable Delay Functions.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20556.","apa":"Hoffmann, C. (2025). Theory and applications of verifiable delay functions. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20556"},"degree_awarded":"PhD","_id":"20556","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png"},"OA_place":"publisher","date_created":"2025-10-27T14:16:56Z","page":"116","abstract":[{"text":"Verifiable Delay Functions (VDFs) introduced by Boneh et al. (CRYPTO'18) are functions that require a prescribed number of sequential steps T to evaluate, yet their output can be verified in time much faster than T. Since their introduction, VDFs have gained a lot of attention due to their applications in blockchain protocols, randomness beacons, timestamping and deniability. This thesis explores the theory and applications of VDFs, focusing on enhancing their soundness, efficiency and practicality.\r\n\r\nThe only practical VDFs known to date are based on repeated squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T).\r\nThe iterated squaring assumption states that, for a random group element x, the result of VDF cannot be computed significantly faster than performing T sequential squarings if the group order is unknown. To make the result verifiable a prover can compute a proof of exponentiation (PoE) \\pi. Given \\pi, the output of VDF can be verified in time much less than T.\r\n\r\nWe first present new constructions of statistically sound proofs of exponentiation, which are an important building block in the construction of SNARKs (Succinct Non-Interactive Argument of Knowledge). Statistical soundness means that the proofs remain secure against computationally unbounded adversaries, in particular, it remains secure even when the group order is known. We thereby address limitations in previous PoE protocols which either required (non-standard) hardness assumptions or a lot of parallel repetitions. Our construction significantly reduces the proof size of statistically sound PoEs that allow for a structured exponent, which leads to better efficiency of SNARKs and other applications.\r\n\r\nSecondly, we introduce improved batching techniques for PoEs, which allow multiple proofs to be aggregated and verified with minimal overhead. These protocols optimize communication and computation complexity in large-scale blockchain environments and enable scalable remote benchmarking of parallel computation resources.\r\n\r\nWe then construct VDFs with enhanced properties such as zero-knowledge and watermarkability. It was shown by Arun, Bonneau and Clark (ASIACRYPT'22) that these features enable new cryptographic primitives called short-lived proofs and signatures. The validity of such proofs and signatures expires after a predefined amount of time T, i.e., they are deniable after time T. Our constructions improve upon the constructions by Arun, Bonneau and Clark in several dimensions (faster forging times, arguably weaker assumptions).\r\n\r\nFinally, we apply PoEs in the realm of primality testing, providing cryptographically sound proofs of non-primality for large Proth numbers. This work gives a surprising application of VDFs in the area of computational number theory.\r\n\r\nTogether, our contributions advance both the theoretical foundations and the real-world usability of VDFs in general and in particular of PoEs, making them more adaptable and secure for current and emerging cryptographic applications.","lang":"eng"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"corr_author":"1","month":"10","status":"public","ddc":["004"]},{"publisher":"International Press of Boston","ec_funded":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. The content of this paper was developed and parts of it were written during a visit of the first author to the Hausdorff Center of Mathematics (HCM), University of Bonn. The hospitality and the support of HCM are gratefully acknowledged.","article_type":"original","abstract":[{"lang":"eng","text":"We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow-is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle."}],"OA_place":"repository","_id":"10011","page":"209-268","date_created":"2021-09-13T12:17:10Z","scopus_import":"1","keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"],"quality_controlled":"1","month":"05","publication":"Journal of Differential Geometry","status":"public","oa":1,"corr_author":"1","date_published":"2025-05-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"JuFi"}],"day":"01","date_updated":"2026-07-06T13:37:21Z","publication_identifier":{"issn":["0022-040X"],"eissn":["1945-743X"]},"year":"2025","type":"journal_article","title":"A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness","citation":{"apa":"Hensel, S., & Laux, T. (2025). A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. International Press of Boston. https://doi.org/10.4310/jdg/1747065796","chicago":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” Journal of Differential Geometry. International Press of Boston, 2025. https://doi.org/10.4310/jdg/1747065796.","ieee":"S. Hensel and T. Laux, “A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness,” Journal of Differential Geometry, vol. 130. International Press of Boston, pp. 209–268, 2025.","ama":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. 2025;130:209-268. doi:10.4310/jdg/1747065796","short":"S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 209–268.","ista":"Hensel S, Laux T. 2025. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. 130, 209–268.","mla":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” Journal of Differential Geometry, vol. 130, International Press of Boston, 2025, pp. 209–68, doi:10.4310/jdg/1747065796."},"project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","grant_number":"948819","name":"Bridging Scales in Random Materials"}],"volume":130,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2109.04233"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","arxiv":1,"intvolume":" 130","das_tickbox":"1","publication_status":"published","oa_version":"Preprint","author":[{"full_name":"Hensel, Sebastian","orcid":"0000-0001-7252-8072","last_name":"Hensel","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"full_name":"Laux, Tim","last_name":"Laux","first_name":"Tim"}],"doi":"10.4310/jdg/1747065796","external_id":{"arxiv":["2109.04233"]}},{"oa_version":"Published Version","author":[{"first_name":"Keitaro","last_name":"Hashimoto","full_name":"Hashimoto, Keitaro"},{"last_name":"Katsumata","full_name":"Katsumata, Shuichi","first_name":"Shuichi"},{"orcid":"0000-0001-8630-415X","last_name":"Pascual Perez","full_name":"Pascual Perez, Guillermo","first_name":"Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87"}],"file":[{"checksum":"fcfe8851aeb751af98c0b1335a0ef149","file_id":"20671","file_size":710733,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2025-11-24T07:44:08Z","date_created":"2025-11-24T07:44:08Z","success":1,"creator":"dernst","file_name":"2025_Usenix_Hashimoto.pdf"}],"external_id":{"cryptoeprintid":["2025/426"]},"cryptoeprintid":1,"das_tickbox":"1","publication_status":"published","has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2025-01-01T00:00:00Z","publication_identifier":{"isbn":["9781939133526"]},"year":"2025","type":"conference","file_date_updated":"2025-11-24T07:44:08Z","date_updated":"2026-07-07T06:02:03Z","day":"01","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"title":"Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable","citation":{"short":"K. Hashimoto, S. Katsumata, G. Pascual Perez, in:, 34th Usenix Security Symposium, Usenix Association, 2025, pp. 6699–6716.","ista":"Hashimoto K, Katsumata S, Pascual Perez G. 2025. Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable. 34th Usenix Security Symposium. USENIX: Security Symposium, 6699–6716.","mla":"Hashimoto, Keitaro, et al. “Exploring How to Authenticate Application Messages in MLS: More Efficient, Post-Quantum, and Anonymous Blocklistable.” 34th Usenix Security Symposium, Usenix Association, 2025, pp. 6699–716.","ieee":"K. Hashimoto, S. Katsumata, and G. Pascual Perez, “Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable,” in 34th Usenix Security Symposium, Seattle, WA, USA, 2025, pp. 6699–6716.","ama":"Hashimoto K, Katsumata S, Pascual Perez G. Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable. In: 34th Usenix Security Symposium. Usenix Association; 2025:6699-6716.","chicago":"Hashimoto, Keitaro, Shuichi Katsumata, and Guillermo Pascual Perez. “Exploring How to Authenticate Application Messages in MLS: More Efficient, Post-Quantum, and Anonymous Blocklistable.” In 34th Usenix Security Symposium, 6699–6716. Usenix Association, 2025.","apa":"Hashimoto, K., Katsumata, S., & Pascual Perez, G. (2025). Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable. In 34th Usenix Security Symposium (pp. 6699–6716). Seattle, WA, USA: Usenix Association."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"diamond","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/426"}],"conference":{"start_date":"2025-08-13","name":"USENIX: Security Symposium","end_date":"2025-08-15","location":"Seattle, WA, USA"},"ec_funded":1,"abstract":[{"text":"The Message Layer Security (MLS) protocol has recently been standardized by the IETF. MLS is a scalable secure group messaging protocol expected to run more efficiently compared to the Signal protocol at scale, while offering a similar level of strong security. Even though MLS has undergone extensive examination by researchers, the majority of the works have focused on confidentiality.\r\n\r\nIn this work, we focus on the authenticity of the application messages exchanged in MLS. Currently, MLS authenticates every application message with an EdDSA signature and while manageable, the overhead is greatly amplified in the post-quantum setting as the NIST-recommended Dilithium signature results in a 40x increase in size. We view this as an invitation to explore new authentication modes that can be used instead. We start by taking a systematic view on how application messages are authenticated in MLS and categorize authenticity into four different security notions. We then propose several authentication modes, offering a range of different efficiency and security profiles. For instance, in one of our modes, COSMOS++, we replace signatures with one-time tokens and a MAC tag, offering roughly a 75x savings in the post-quantum communication overhead. While this comes at the cost of weakening security compared to the authentication mode used by MLS, the lower communication overhead seems to make it a worthwhile trade-off with security.","lang":"eng"}],"acknowledgement":"This research was partially supported by JST CREST JPMJCR22M1, Japan and funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","publisher":"Usenix Association","_id":"20668","OA_place":"publisher","page":"6699-6716","scopus_import":"1","date_created":"2025-11-23T23:01:40Z","quality_controlled":"1","ddc":["000"],"corr_author":"1","month":"01","publication":"34th Usenix Security Symposium","status":"public","oa":1},{"article_processing_charge":"Yes","conference":{"start_date":"2025-06-23","location":"Kanazawa, Japan","name":"SoCG: Symposium on Computational Geometry","end_date":"2025-06-27"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"gold","title":"Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers","citation":{"short":"E. Streltsova, U. Wagner, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers.” 41st International Symposium on Computational Geometry, vol. 332, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.75.","ista":"Streltsova E, Wagner U. 2025. Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers. 41st International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 75.","chicago":"Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers.” In 41st International Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.75.","ieee":"E. Streltsova and U. Wagner, “Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.","ama":"Streltsova E, Wagner U. Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers. In: 41st International Symposium on Computational Geometry. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.SoCG.2025.75","apa":"Streltsova, E., & Wagner, U. (2025). Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers. In 41st International Symposium on Computational Geometry (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2025.75"},"volume":332,"file_date_updated":"2025-07-14T07:11:04Z","date_updated":"2026-07-07T13:03:16Z","day":"20","type":"conference","year":"2025","publication_identifier":{"isbn":["9783959773706"],"eissn":["1868-8969"]},"date_published":"2025-06-20T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"has_accepted_license":"1","month":"06","publication":"41st International Symposium on Computational Geometry","status":"public","oa":1,"corr_author":"1","quality_controlled":"1","ddc":["510"],"_id":"20004","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"OA_place":"publisher","scopus_import":"1","date_created":"2025-07-13T22:01:22Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"A long-standing conjecture of Eckhoff, Linhart, and Welzl, which would generalize McMullen’s Upper Bound Theorem for polytopes and refine asymptotic bounds due to Clarkson, asserts that for k ⩽ ⌊(n-d-2)/2⌋, the complexity of the (⩽ k)-level in a simple arrangement of n hemispheres in S^d is maximized for arrangements that are polar duals of neighborly d-polytopes. We prove this conjecture in the case n = d+4. By Gale duality, this implies the following result about crossing numbers: In every spherical arc drawing of K_n in S² (given by a set V ⊂ S² of n unit vectors connected by spherical arcs), the number of crossings is at least 1/4 ⌊n/2⌋ ⌊(n-1)/2⌋ ⌊(n-2)/2⌋ ⌊(n-3)/2⌋. This lower bound is attained if every open linear halfspace contains at least ⌊(n-2)/2⌋ of the vectors in V.\r\nMoreover, we determine the space of all linear and affine relations that hold between the face numbers of levels in simple arrangements of n hemispheres in S^d. This completes a long line of research on such relations, answers a question posed by Andrzejak and Welzl in 2003, and generalizes the classical fact that the Dehn-Sommerville relations generate all linear relations between the face numbers of simple polytopes (which correspond to the 0-level).\r\nTo prove these results, we introduce the notion of the g-matrix, which encodes the face numbers of levels in an arrangement and generalizes the classical g-vector of a polytope.","lang":"eng"}],"external_id":{"arxiv":["2504.07752","2504.07770"]},"file":[{"creator":"dernst","file_name":"2025_LIPIcs.SoCG_Streltsova.pdf","date_updated":"2025-07-14T07:11:04Z","success":1,"date_created":"2025-07-14T07:11:04Z","file_id":"20015","file_size":952807,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"a8f7feb1aa3b896e31195841a989d622"}],"author":[{"last_name":"Streltsova","full_name":"Streltsova, Elizaveta","first_name":"Elizaveta","id":"57a170da-dc96-11ea-b7c8-ab3565071bf7"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner"}],"doi":"10.4230/LIPIcs.SoCG.2025.75","oa_version":"Published Version","alternative_title":["LIPIcs"],"article_number":"75","publication_status":"published","intvolume":" 332","das_tickbox":"1","arxiv":1},{"article_type":"letter_note","acknowledgement":"This project has received funding from the European Union's Horizon 2020 and Horizon Europe research and innovation programmes under Grant Agreements No. 899368 (EPIQUS) and No. 101135288 (EPIQUE), the Marie Skłodowska-Curie Grant Agreement No. 956071 (AppQInfo), and the QuantERA II Programme under Grant Agreement No. 101017733 (PhoMemtor). The financial support by the Austrian Federal Ministry of Labour and Economy, the National Foundation for Research, Technology and Development, and the Christian Doppler Research Association is gratefully acknowledged. L.A.R. acknowledges support from the Erwin Schrödinger Center for Quantum Science & Technology (ESQ Discovery). This research was funded in whole or in part from the Austrian Science Fund (FWF) through [Grant No. 10.55776/COE1] (Quantum Science Austria), [Grant No. 10.55776/F71] (BeyondC), [Grant No. 10.55776/FG5] (Research Group 5), [Grant No. 10.55776/I6002] (PhoMemtor), and [Grant No. 10.55776/P36994] (Quantum Interference).","abstract":[{"text":"One of the most striking quantum phenomena is superposition, where one particle simultaneously inhabits different states. Most methods to verify coherent superposition are indirect, in that they require the distinct states to be recombined. Here, we adapt an xor game, in which a “test” photon is placed in a superposition of two orthogonal spatial modes, and each mode is sent to separated parties who perform local measurements on their modes without reinterfering the original modes. We show that by using a second identical “measurement” photon the parties are nonetheless able to verify if the test photon was placed in coherent superposition of the two spatial modes. We then turn this game into a resource-efficient verification scheme, obtaining a confidence that the particle is superposed which approaches unity exponentially fast. We demonstrate our scheme using a single photon, obtaining a 99% confidence that the particle is superposed with only 37 copies. Our work shows the utility of xor games to verify quantum resources, allowing us to efficiently detect quantum superposition without reinterfering the superposed modes.","lang":"eng"}],"publisher":"American Physical Society","scopus_import":"1","date_created":"2025-05-25T22:16:54Z","OA_place":"publisher","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"19733","quality_controlled":"1","ddc":["530"],"dataavailabilitystatement":"Data that support the findings of this study are openly available at Zenodo.","isi":1,"oa":1,"status":"public","month":"05","publication":"Physical Review A","department":[{"_id":"OnHo"}],"has_accepted_license":"1","date_published":"2025-05-16T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","year":"2025","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"date_updated":"2026-07-07T14:05:51Z","day":"16","file_date_updated":"2025-05-28T09:16:03Z","volume":111,"supplementarymaterial":"yes","citation":{"ieee":"D. Kun, K. T. Strömberg, M. Spagnolo, B. Dakić, L. A. Rozema, and P. Walther, “Direct and efficient detection of quantum superposition,” Physical Review A, vol. 111, no. 5. American Physical Society, 2025.","apa":"Kun, D., Strömberg, K. T., Spagnolo, M., Dakić, B., Rozema, L. A., & Walther, P. (2025). Direct and efficient detection of quantum superposition. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.111.L050402","chicago":"Kun, Daniel, Karl T Strömberg, Michele Spagnolo, Borivoje Dakić, Lee A. Rozema, and Philip Walther. “Direct and Efficient Detection of Quantum Superposition.” Physical Review A. American Physical Society, 2025. https://doi.org/10.1103/PhysRevA.111.L050402.","ama":"Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. Direct and efficient detection of quantum superposition. Physical Review A. 2025;111(5). doi:10.1103/PhysRevA.111.L050402","ista":"Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. 2025. Direct and efficient detection of quantum superposition. Physical Review A. 111(5), L050402.","mla":"Kun, Daniel, et al. “Direct and Efficient Detection of Quantum Superposition.” Physical Review A, vol. 111, no. 5, L050402, American Physical Society, 2025, doi:10.1103/PhysRevA.111.L050402.","short":"D. Kun, K.T. Strömberg, M. Spagnolo, B. Dakić, L.A. Rozema, P. Walther, Physical Review A 111 (2025)."},"title":"Direct and efficient detection of quantum superposition","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","OA_type":"hybrid","article_processing_charge":"No","arxiv":1,"das_tickbox":"1","intvolume":" 111","publication_status":"published","article_number":"L050402","issue":"5","oa_version":"Published Version","doi":"10.1103/PhysRevA.111.L050402","author":[{"first_name":"Daniel","last_name":"Kun","full_name":"Kun, Daniel"},{"full_name":"Strömberg, Karl T","last_name":"Strömberg","id":"68011cd2-da32-11ee-a930-b2774c7aba5f","first_name":"Karl T"},{"first_name":"Michele","last_name":"Spagnolo","full_name":"Spagnolo, Michele"},{"first_name":"Borivoje","full_name":"Dakić, Borivoje","last_name":"Dakić"},{"first_name":"Lee A.","full_name":"Rozema, Lee A.","last_name":"Rozema"},{"full_name":"Walther, Philip","last_name":"Walther","first_name":"Philip"}],"file":[{"creator":"dernst","file_name":"2025_PhysReviewA_Kun.pdf","date_updated":"2025-05-28T09:16:03Z","success":1,"date_created":"2025-05-28T09:16:03Z","checksum":"b83295a8f597b7781d8e7bfa3b393b42","file_size":571784,"file_id":"19755","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"researchdata_availability":"yes","related_material":{"record":[{"id":"22142","relation":"research_data","status":"public"}]},"external_id":{"arxiv":["2405.08065"],"isi":["001501941500006"]}},{"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.13375452","open_access":"1"}],"OA_type":"green","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Direct And Efficient Detection of Quantum Superposition - Data and Figures","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"19733"}]},"citation":{"ama":"Kun D. Direct And Efficient Detection of Quantum Superposition - Data and Figures. 2025. doi:10.5281/zenodo.13375452","apa":"Kun, D. (2025). Direct And Efficient Detection of Quantum Superposition - Data and Figures. Zenodo. https://doi.org/10.5281/zenodo.13375452","chicago":"Kun, Daniel. “Direct And Efficient Detection of Quantum Superposition - Data and Figures.” Zenodo, 2025. https://doi.org/10.5281/zenodo.13375452.","ieee":"D. Kun, “Direct And Efficient Detection of Quantum Superposition - Data and Figures.” Zenodo, 2025.","mla":"Kun, Daniel. Direct And Efficient Detection of Quantum Superposition - Data and Figures. Zenodo, 2025, doi:10.5281/zenodo.13375452.","ista":"Kun D. 2025. Direct And Efficient Detection of Quantum Superposition - Data and Figures, Zenodo, 10.5281/zenodo.13375452.","short":"D. Kun, (2025)."},"date_updated":"2026-07-07T14:05:51Z","author":[{"last_name":"Kun","full_name":"Kun, Daniel","first_name":"Daniel"}],"day":"24","contributor":[{"last_name":"Rozema","contributor_type":"researcher","first_name":"Lee"},{"contributor_type":"researcher","last_name":"Stroemberg","first_name":"Teodor"},{"first_name":"Philip","contributor_type":"supervisor","last_name":"Walther"},{"first_name":"Borivoje","last_name":"Dakic","contributor_type":"supervisor"}],"doi":"10.5281/zenodo.13375452","type":"research_data_reference","year":"2025","oa_version":"Published Version","date_published":"2025-04-24T00:00:00Z","department":[{"_id":"OnHo"}],"month":"4","status":"public","oa":1,"ddc":["530"],"OA_place":"repository","_id":"22142","date_created":"2026-06-25T11:08:53Z","publisher":"Zenodo","abstract":[{"text":"Data to generate Figures from the Letter \"Direct and Efficient Detection of Quantum Superposition\" published in APS Physical Review A.\r\nThe code can be found on the provided GitLab repository.","lang":"eng"}]},{"OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.08644"}],"article_processing_charge":"No","volume":39,"title":"Canonical Ramsey numbers of sparse graphs","citation":{"ista":"Gishboliner L, Milojević A, Sudakov B, Wigderson Y. 2025. Canonical Ramsey numbers of sparse graphs. SIAM Journal on Discrete Mathematics. 39(3), 1491–1519.","mla":"Gishboliner, Lior, et al. “Canonical Ramsey Numbers of Sparse Graphs.” SIAM Journal on Discrete Mathematics, vol. 39, no. 3, Society for Industrial & Applied Mathematics, 2025, pp. 1491–519, doi:10.1137/24m1714964.","short":"L. Gishboliner, A. Milojević, B. Sudakov, Y. Wigderson, SIAM Journal on Discrete Mathematics 39 (2025) 1491–1519.","ieee":"L. Gishboliner, A. Milojević, B. Sudakov, and Y. Wigderson, “Canonical Ramsey numbers of sparse graphs,” SIAM Journal on Discrete Mathematics, vol. 39, no. 3. Society for Industrial & Applied Mathematics, pp. 1491–1519, 2025.","ama":"Gishboliner L, Milojević A, Sudakov B, Wigderson Y. Canonical Ramsey numbers of sparse graphs. SIAM Journal on Discrete Mathematics. 2025;39(3):1491-1519. doi:10.1137/24m1714964","chicago":"Gishboliner, Lior, Aleksa Milojević, Benny Sudakov, and Yuval Wigderson. “Canonical Ramsey Numbers of Sparse Graphs.” SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics, 2025. https://doi.org/10.1137/24m1714964.","apa":"Gishboliner, L., Milojević, A., Sudakov, B., & Wigderson, Y. (2025). Canonical Ramsey numbers of sparse graphs. SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/24m1714964"},"type":"journal_article","publication_identifier":{"eissn":["1095-7146"],"issn":["0895-4801"]},"year":"2025","day":"01","date_updated":"2026-07-08T07:38:44Z","language":[{"iso":"eng"}],"date_published":"2025-09-01T00:00:00Z","mathsc":["05D10"],"month":"09","publication":"SIAM Journal on Discrete Mathematics","status":"public","oa":1,"quality_controlled":"1","_id":"22155","OA_place":"repository","date_created":"2026-06-29T10:49:48Z","page":"1491-1519","scopus_import":"1","article_type":"original","abstract":[{"lang":"eng","text":"The canonical Ramsey theorem of Erdős and Rado implies that for any graph 𝐻, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph 𝐾𝑁 contains a monochromatic, lexicographic, or rainbow copy of 𝐻. The least such 𝑁 is called the Erdős–Rado number of 𝐻, denoted by 𝐸𝑅(𝐻). Erdős–Rado numbers of cliques have received considerable attention, and in this paper we extend this line of research by studying Erdős–Rado numbers of sparse graphs. For example, we prove that if 𝐻 has bounded degree, then 𝐸𝑅(𝐻) is polynomial in |𝑉(𝐻)| if 𝐻 is bipartite but exponential in general. We also study the closely related problem of constrained Ramsey numbers. For a given tree S and given path 𝑃𝑡, we study the minimum 𝑁 such that every edge-coloring of 𝐾𝑁 contains a monochromatic copy of S or a rainbow copy of 𝑃𝑡. We prove a nearly optimal upper bound for this problem, which differs from the best known lower bound by a function of inverse Ackermann type."}],"publisher":"Society for Industrial & Applied Mathematics","external_id":{"arxiv":["2410.08644"]},"doi":"10.1137/24m1714964","author":[{"full_name":"Gishboliner, Lior","last_name":"Gishboliner","first_name":"Lior"},{"first_name":"Aleksa","last_name":"Milojević","full_name":"Milojević, Aleksa"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"oa_version":"Preprint","issue":"3","publication_status":"published","intvolume":" 39","arxiv":1,"extern":"1"},{"external_id":{"arxiv":["2412.14960"],"isi":["001489653300001"]},"DOAJ_listed":"1","oa_version":"Published Version","doi":"10.1140/epjqt/s40507-025-00344-3","researchdata_availability":"no","file":[{"date_updated":"2025-05-05T10:52:52Z","date_created":"2025-05-05T10:52:52Z","success":1,"creator":"dernst","file_name":"2025_EPJQuantumTech_Abdalla.pdf","relation":"main_file","access_level":"open_access","file_id":"19653","file_size":14352192,"content_type":"application/pdf","checksum":"00c7a97d87f7a6314df5b0c2213fbb02"}],"author":[{"first_name":"Adam","last_name":"Abdalla","full_name":"Abdalla, Adam"},{"first_name":"Mahiro","full_name":"Abe, Mahiro","last_name":"Abe"},{"last_name":"Abend","full_name":"Abend, Sven","first_name":"Sven"},{"first_name":"Mouine","last_name":"Abidi","full_name":"Abidi, Mouine"},{"first_name":"Monika","full_name":"Aidelsburger, Monika","last_name":"Aidelsburger"},{"last_name":"Alibabaei","full_name":"Alibabaei, Ashkan","first_name":"Ashkan"},{"first_name":"Baptiste","full_name":"Allard, Baptiste","last_name":"Allard"},{"first_name":"John","last_name":"Antoniadis","full_name":"Antoniadis, John"},{"first_name":"Gianluigi","full_name":"Arduini, Gianluigi","last_name":"Arduini"},{"first_name":"Nadja","last_name":"Augst","full_name":"Augst, Nadja"},{"first_name":"Philippos","last_name":"Balamatsias","full_name":"Balamatsias, Philippos"},{"last_name":"Balaž","full_name":"Balaž, Antun","first_name":"Antun"},{"first_name":"Hannah","last_name":"Banks","full_name":"Banks, Hannah"},{"full_name":"Barcklay, Rachel L.","last_name":"Barcklay","first_name":"Rachel L."},{"full_name":"Barone, Michele","last_name":"Barone","first_name":"Michele"},{"first_name":"Michele","full_name":"Barsanti, Michele","last_name":"Barsanti"},{"last_name":"Bason","full_name":"Bason, Mark G.","first_name":"Mark G."},{"last_name":"Bassi","full_name":"Bassi, Angelo","first_name":"Angelo"},{"last_name":"Bayle","full_name":"Bayle, Jean Baptiste","first_name":"Jean Baptiste"},{"first_name":"Charles F.A.","full_name":"Baynham, Charles F.A.","last_name":"Baynham"},{"first_name":"Quentin","last_name":"Beaufils","full_name":"Beaufils, Quentin"},{"first_name":"Sélyan","full_name":"Beldjoudi, Sélyan","last_name":"Beldjoudi"},{"last_name":"Belić","full_name":"Belić, Aleksandar","first_name":"Aleksandar"},{"last_name":"Bennetts","full_name":"Bennetts, Shayne","first_name":"Shayne"},{"first_name":"Jose","last_name":"Bernabeu","full_name":"Bernabeu, Jose"},{"full_name":"Bertoldi, Andrea","last_name":"Bertoldi","first_name":"Andrea"},{"first_name":"Clara","last_name":"Bigard","full_name":"Bigard, Clara"},{"first_name":"N. P.","last_name":"Bigelow","full_name":"Bigelow, N. P."},{"first_name":"Robert","full_name":"Bingham, Robert","last_name":"Bingham"},{"full_name":"Blas, Diego","last_name":"Blas","first_name":"Diego"},{"full_name":"Bobrick, Alexey","last_name":"Bobrick","first_name":"Alexey"},{"first_name":"Samuel","last_name":"Boehringer","full_name":"Boehringer, Samuel"},{"last_name":"Bogojević","full_name":"Bogojević, Aleksandar","first_name":"Aleksandar"},{"full_name":"Bongs, Kai","last_name":"Bongs","first_name":"Kai"},{"first_name":"Daniela","last_name":"Bortoletto","full_name":"Bortoletto, Daniela"},{"first_name":"Philippe","full_name":"Bouyer, Philippe","last_name":"Bouyer"},{"last_name":"Brand","full_name":"Brand, Christian","first_name":"Christian"},{"last_name":"Buchmueller","full_name":"Buchmueller, Oliver","first_name":"Oliver"},{"first_name":"Gabriela","full_name":"Buica, Gabriela","last_name":"Buica"},{"first_name":"Sergio","full_name":"Calatroni, Sergio","last_name":"Calatroni"},{"first_name":"Léo","full_name":"Calmels, Léo","last_name":"Calmels"},{"last_name":"Canizares","full_name":"Canizares, Priscilla","first_name":"Priscilla"},{"first_name":"Benjamin","last_name":"Canuel","full_name":"Canuel, Benjamin"},{"first_name":"Ana","last_name":"Caramete","full_name":"Caramete, Ana"},{"full_name":"Caramete, Laurentiu Ioan","last_name":"Caramete","first_name":"Laurentiu Ioan"},{"last_name":"Carlesso","full_name":"Carlesso, Matteo","first_name":"Matteo"},{"first_name":"John","full_name":"Carlton, John","last_name":"Carlton"},{"first_name":"Samuel P.","last_name":"Carman","full_name":"Carman, Samuel P."},{"first_name":"Andrew","full_name":"Carroll, Andrew","last_name":"Carroll"},{"first_name":"Mateo","full_name":"Casariego, Mateo","last_name":"Casariego"},{"full_name":"Chairetis, Minoas","last_name":"Chairetis","first_name":"Minoas"},{"full_name":"Charmandaris, Vassilis","last_name":"Charmandaris","first_name":"Vassilis"},{"first_name":"Upasna","last_name":"Chauhan","full_name":"Chauhan, Upasna"},{"last_name":"Chen","full_name":"Chen, Jiajun","first_name":"Jiajun"},{"first_name":"Maria Luisa Maria Luisa Marilù","full_name":"Chiofalo, Maria Luisa Maria Luisa Marilù","last_name":"Chiofalo"},{"full_name":"Ciampini, Donatella","last_name":"Ciampini","first_name":"Donatella"},{"full_name":"Cimbri, Alessia","last_name":"Cimbri","first_name":"Alessia"},{"first_name":"Pierre","last_name":"Cladé","full_name":"Cladé, Pierre"},{"first_name":"Jonathon","full_name":"Coleman, Jonathon","last_name":"Coleman"},{"first_name":"Florin Lucian","last_name":"Constantin","full_name":"Constantin, Florin Lucian"},{"full_name":"Contaldi, Carlo R.","last_name":"Contaldi","first_name":"Carlo R."},{"first_name":"Robin","full_name":"Corgier, Robin","last_name":"Corgier"},{"full_name":"Dash, Bineet","last_name":"Dash","first_name":"Bineet"},{"first_name":"G. J.","full_name":"Davies, G. J.","last_name":"Davies"},{"first_name":"Claudia","full_name":"De Rham, Claudia","last_name":"De Rham"},{"last_name":"De Roeck","full_name":"De Roeck, Albert","first_name":"Albert"},{"full_name":"Derr, Daniel","last_name":"Derr","first_name":"Daniel"},{"first_name":"Soumyodeep","full_name":"Dey, Soumyodeep","last_name":"Dey"},{"full_name":"Di Pumpo, Fabio","last_name":"Di Pumpo","first_name":"Fabio"},{"full_name":"Djordjevic, Goran S.","last_name":"Djordjevic","first_name":"Goran S."},{"last_name":"Döbrich","full_name":"Döbrich, Babette","first_name":"Babette"},{"first_name":"Peter","full_name":"Dornan, Peter","last_name":"Dornan"},{"last_name":"Doser","full_name":"Doser, Michael","first_name":"Michael"},{"full_name":"Drougakis, Giannis","last_name":"Drougakis","first_name":"Giannis"},{"last_name":"Dunningham","full_name":"Dunningham, Jacob","first_name":"Jacob"},{"first_name":"Alisher","full_name":"Duspayev, Alisher","last_name":"Duspayev"},{"full_name":"Easo, Sajan","last_name":"Easo","first_name":"Sajan"},{"full_name":"Eby, Joshua","last_name":"Eby","first_name":"Joshua"},{"first_name":"Maxim","full_name":"Efremov, Maxim","last_name":"Efremov"},{"last_name":"Elertas","full_name":"Elertas, Gedminas","first_name":"Gedminas"},{"first_name":"John","last_name":"Ellis","full_name":"Ellis, John"},{"last_name":"Entin","full_name":"Entin, Nicholas","first_name":"Nicholas"},{"full_name":"Fairhurst, Stephen","last_name":"Fairhurst","first_name":"Stephen"},{"last_name":"Fanì","full_name":"Fanì, Mattia","first_name":"Mattia"},{"first_name":"Farida","full_name":"Fassi, Farida","last_name":"Fassi"},{"last_name":"Fayet","full_name":"Fayet, Pierre","first_name":"Pierre"},{"full_name":"Felea, Daniel","last_name":"Felea","first_name":"Daniel"},{"last_name":"Feng","full_name":"Feng, Jie","first_name":"Jie"},{"last_name":"Flack","full_name":"Flack, Robert","first_name":"Robert"},{"full_name":"Foot, Chris","last_name":"Foot","first_name":"Chris"},{"last_name":"Freegarde","full_name":"Freegarde, Tim","first_name":"Tim"},{"first_name":"Elina","full_name":"Fuchs, Elina","last_name":"Fuchs"},{"full_name":"Gaaloul, Naceur","last_name":"Gaaloul","first_name":"Naceur"},{"first_name":"Dongfeng","last_name":"Gao","full_name":"Gao, Dongfeng"},{"full_name":"Gardner, Susan","last_name":"Gardner","first_name":"Susan"},{"first_name":"Barry M.","last_name":"Garraway","full_name":"Garraway, Barry M."},{"last_name":"Garrido Alzar","full_name":"Garrido Alzar, Carlos L.","first_name":"Carlos L."},{"full_name":"Gauguet, Alexandre","last_name":"Gauguet","first_name":"Alexandre"},{"last_name":"Giese","full_name":"Giese, Enno","first_name":"Enno"},{"first_name":"Patrick","last_name":"Gill","full_name":"Gill, Patrick"},{"first_name":"Gian F.","last_name":"Giudice","full_name":"Giudice, Gian F."},{"first_name":"Eric P.","full_name":"Glasbrenner, Eric P.","last_name":"Glasbrenner"},{"full_name":"Glick, Jonah","last_name":"Glick","first_name":"Jonah"},{"first_name":"Peter W.","last_name":"Graham","full_name":"Graham, Peter W."},{"first_name":"Eduardo","full_name":"Granados, Eduardo","last_name":"Granados"},{"full_name":"Griffin, Paul F.","last_name":"Griffin","first_name":"Paul F."},{"first_name":"Jordan","full_name":"Gué, Jordan","last_name":"Gué"},{"first_name":"Saïda","full_name":"Guellati-Khelifa, Saïda","last_name":"Guellati-Khelifa"},{"full_name":"Gupta, Subhadeep","last_name":"Gupta","first_name":"Subhadeep"},{"last_name":"Gupta","full_name":"Gupta, Vishu","first_name":"Vishu"},{"last_name":"Hackermueller","full_name":"Hackermueller, Lucia","first_name":"Lucia"},{"last_name":"Haehnelt","full_name":"Haehnelt, Martin","first_name":"Martin"},{"first_name":"Timo","last_name":"Hakulinen","full_name":"Hakulinen, Timo"},{"first_name":"Klemens","full_name":"Hammerer, Klemens","last_name":"Hammerer"},{"last_name":"Hanımeli","full_name":"Hanımeli, Ekim T.","first_name":"Ekim T."},{"first_name":"Tiffany","last_name":"Harte","full_name":"Harte, Tiffany"},{"last_name":"Hartmann","full_name":"Hartmann, Sabrina","first_name":"Sabrina"},{"first_name":"Leonie","last_name":"Hawkins","full_name":"Hawkins, Leonie"},{"full_name":"Hees, Aurelien","last_name":"Hees","first_name":"Aurelien"},{"last_name":"Herbst","full_name":"Herbst, Alexander","first_name":"Alexander"},{"first_name":"Thomas M.","full_name":"Hird, Thomas M.","last_name":"Hird"},{"last_name":"Hobson","full_name":"Hobson, Richard","first_name":"Richard"},{"last_name":"Hogan","full_name":"Hogan, Jason","first_name":"Jason"},{"first_name":"Bodil","last_name":"Holst","full_name":"Holst, Bodil"},{"first_name":"Michael","full_name":"Holynski, Michael","last_name":"Holynski"},{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","full_name":"Hosten, Onur","orcid":"0000-0002-2031-204X","last_name":"Hosten"},{"first_name":"Chung Chuan","last_name":"Hsu","full_name":"Hsu, Chung Chuan"},{"full_name":"Huang, Wayne Cheng Wei","last_name":"Huang","first_name":"Wayne Cheng Wei"},{"last_name":"Hughes","full_name":"Hughes, Kenneth M.","first_name":"Kenneth M."},{"full_name":"Hussain, Kamran","last_name":"Hussain","first_name":"Kamran"},{"first_name":"Gert","last_name":"Hütsi","full_name":"Hütsi, Gert"},{"last_name":"Iovino","full_name":"Iovino, Antonio","first_name":"Antonio"},{"first_name":"Maria Catalina","last_name":"Isfan","full_name":"Isfan, Maria Catalina"},{"first_name":"Gregor","last_name":"Janson","full_name":"Janson, Gregor"},{"first_name":"Peter","full_name":"Jeglič, Peter","last_name":"Jeglič"},{"first_name":"Philippe","full_name":"Jetzer, Philippe","last_name":"Jetzer"},{"first_name":"Yijun","last_name":"Jiang","full_name":"Jiang, Yijun"},{"last_name":"Juzeliūnas","full_name":"Juzeliūnas, Gediminas","first_name":"Gediminas"},{"first_name":"Wilhelm","full_name":"Kaenders, Wilhelm","last_name":"Kaenders"},{"first_name":"Matti","last_name":"Kalliokoski","full_name":"Kalliokoski, Matti"},{"first_name":"Alex","full_name":"Kehagias, Alex","last_name":"Kehagias"},{"last_name":"Kilian","full_name":"Kilian, Eva","first_name":"Eva"},{"first_name":"Carsten","last_name":"Klempt","full_name":"Klempt, Carsten"},{"full_name":"Knight, Peter","last_name":"Knight","first_name":"Peter"},{"full_name":"Koley, Soumen","last_name":"Koley","first_name":"Soumen"},{"full_name":"Konrad, Bernd","last_name":"Konrad","first_name":"Bernd"},{"first_name":"Tim","last_name":"Kovachy","full_name":"Kovachy, Tim"},{"first_name":"Markus","full_name":"Krutzik, Markus","last_name":"Krutzik"},{"first_name":"Mukesh","full_name":"Kumar, Mukesh","last_name":"Kumar"},{"first_name":"Pradeep","full_name":"Kumar, Pradeep","last_name":"Kumar"},{"first_name":"Hamza","full_name":"Labiad, Hamza","last_name":"Labiad"},{"last_name":"Lan","full_name":"Lan, Shau Yu","first_name":"Shau Yu"},{"first_name":"Arnaud","full_name":"Landragin, Arnaud","last_name":"Landragin"},{"last_name":"Landsberg","full_name":"Landsberg, Greg","first_name":"Greg"},{"first_name":"Mehdi","full_name":"Langlois, Mehdi","last_name":"Langlois"},{"full_name":"Lanigan, Bryony","last_name":"Lanigan","first_name":"Bryony"},{"first_name":"Bruno","full_name":"Leone, Bruno","last_name":"Leone"},{"last_name":"Le Poncin-Lafitte","full_name":"Le Poncin-Lafitte, Christophe","first_name":"Christophe"},{"first_name":"Samuel","last_name":"Lellouch","full_name":"Lellouch, Samuel"},{"first_name":"Marek","last_name":"Lewicki","full_name":"Lewicki, Marek"},{"first_name":"Yu Hung","last_name":"Lien","full_name":"Lien, Yu Hung"},{"first_name":"Lucas","full_name":"Lombriser, Lucas","last_name":"Lombriser"},{"first_name":"Elias Lopez","last_name":"Asamar","full_name":"Asamar, Elias Lopez"},{"first_name":"J. Luis","full_name":"Lopez-Gonzalez, J. Luis","last_name":"Lopez-Gonzalez"},{"first_name":"Chen","full_name":"Lu, Chen","last_name":"Lu"},{"last_name":"Luciano","full_name":"Luciano, Giuseppe Gaetano","first_name":"Giuseppe Gaetano"},{"last_name":"Lundblad","full_name":"Lundblad, Nathan","first_name":"Nathan"},{"last_name":"De J. López Monjaraz","full_name":"De J. López Monjaraz, Cristian","first_name":"Cristian"},{"first_name":"Adam","last_name":"Lowe","full_name":"Lowe, Adam"},{"full_name":"Mackoit-Sinkevičienė, Mažena","last_name":"Mackoit-Sinkevičienė","first_name":"Mažena"},{"full_name":"Maggiore, Michele","last_name":"Maggiore","first_name":"Michele"},{"first_name":"Anirban","full_name":"Majumdar, Anirban","last_name":"Majumdar"},{"first_name":"Konstantinos","full_name":"Makris, Konstantinos","last_name":"Makris"},{"full_name":"Maleknejad, Azadeh","last_name":"Maleknejad","first_name":"Azadeh"},{"first_name":"Anna L.","full_name":"Marchant, Anna L.","last_name":"Marchant"},{"first_name":"Agnese","last_name":"Mariotti","full_name":"Mariotti, Agnese"},{"last_name":"Markou","full_name":"Markou, Christos","first_name":"Christos"},{"last_name":"Matthews","full_name":"Matthews, Barnaby","first_name":"Barnaby"},{"first_name":"Anupam","last_name":"Mazumdar","full_name":"Mazumdar, Anupam"},{"first_name":"Christopher","full_name":"Mccabe, Christopher","last_name":"Mccabe"},{"full_name":"Meister, Matthias","last_name":"Meister","first_name":"Matthias"},{"last_name":"Mentasti","full_name":"Mentasti, Giorgio","first_name":"Giorgio"},{"last_name":"Menu","full_name":"Menu, Jonathan","first_name":"Jonathan"},{"full_name":"Messineo, Giuseppe","last_name":"Messineo","first_name":"Giuseppe"},{"first_name":"Bernd","last_name":"Meyer-Hoppe","full_name":"Meyer-Hoppe, Bernd"},{"first_name":"Salvatore","last_name":"Micalizio","full_name":"Micalizio, Salvatore"},{"first_name":"Federica","full_name":"Migliaccio, Federica","last_name":"Migliaccio"},{"last_name":"Millington","full_name":"Millington, Peter","first_name":"Peter"},{"full_name":"Milosevic, Milan","last_name":"Milosevic","first_name":"Milan"},{"first_name":"Abhay","full_name":"Mishra, Abhay","last_name":"Mishra"},{"full_name":"Mitchell, Jeremiah","last_name":"Mitchell","first_name":"Jeremiah"},{"last_name":"Morley","full_name":"Morley, Gavin W.","first_name":"Gavin W."},{"first_name":"Noam","full_name":"Mouelle, Noam","last_name":"Mouelle"},{"first_name":"Jürgen","last_name":"Müller","full_name":"Müller, Jürgen"},{"first_name":"David","full_name":"Newbold, David","last_name":"Newbold"},{"full_name":"Ni, Wei Tou","last_name":"Ni","first_name":"Wei Tou"},{"last_name":"Niehof","full_name":"Niehof, Christian","first_name":"Christian"},{"last_name":"Noller","full_name":"Noller, Johannes","first_name":"Johannes"},{"first_name":"Senad","last_name":"Odžak","full_name":"Odžak, Senad"},{"full_name":"Oi, Daniel K.L.","last_name":"Oi","first_name":"Daniel K.L."},{"last_name":"Oikonomou","full_name":"Oikonomou, Andreas","first_name":"Andreas"},{"first_name":"Yasser","full_name":"Omar, Yasser","last_name":"Omar"},{"full_name":"Overstreet, Chris","last_name":"Overstreet","first_name":"Chris"},{"first_name":"Vishnupriya","last_name":"Puthiya Veettil","full_name":"Puthiya Veettil, Vishnupriya"},{"full_name":"Pahl, Julia","last_name":"Pahl","first_name":"Julia"},{"first_name":"Sean","full_name":"Paling, Sean","last_name":"Paling"},{"full_name":"Pan, Zhongyin","last_name":"Pan","first_name":"Zhongyin"},{"first_name":"George","full_name":"Pappas, George","last_name":"Pappas"},{"first_name":"Vinay","full_name":"Pareek, Vinay","last_name":"Pareek"},{"first_name":"Elizabeth","last_name":"Pasatembou","full_name":"Pasatembou, Elizabeth"},{"first_name":"Mauro","last_name":"Paternostro","full_name":"Paternostro, Mauro"},{"full_name":"Pathak, Vishal K.","last_name":"Pathak","first_name":"Vishal K."},{"first_name":"Emanuele","last_name":"Pelucchi","full_name":"Pelucchi, Emanuele"},{"full_name":"Pereira Dos Santos, Franck","last_name":"Pereira Dos Santos","first_name":"Franck"},{"first_name":"Achim","last_name":"Peters","full_name":"Peters, Achim"},{"first_name":"Annie","full_name":"Pichery, Annie","last_name":"Pichery"},{"full_name":"Pikovski, Igor","last_name":"Pikovski","first_name":"Igor"},{"full_name":"Pilaftsis, Apostolos","last_name":"Pilaftsis","first_name":"Apostolos"},{"first_name":"Florentina Crenguta","full_name":"Pislan, Florentina Crenguta","last_name":"Pislan"},{"full_name":"Plunkett, Robert","last_name":"Plunkett","first_name":"Robert"},{"first_name":"Rosa","last_name":"Poggiani","full_name":"Poggiani, Rosa"},{"first_name":"Marco","full_name":"Prevedelli, Marco","last_name":"Prevedelli"},{"first_name":"Johann","last_name":"Rafelski","full_name":"Rafelski, Johann"},{"first_name":"Juhan","last_name":"Raidal","full_name":"Raidal, Juhan"},{"first_name":"Martti","last_name":"Raidal","full_name":"Raidal, Martti"},{"full_name":"Rasel, Ernst Maria","last_name":"Rasel","first_name":"Ernst Maria"},{"first_name":"Sébastien","full_name":"Renaux-Petel, Sébastien","last_name":"Renaux-Petel"},{"full_name":"Richaud, Andrea","last_name":"Richaud","first_name":"Andrea"},{"full_name":"Rivero-Antunez, Pedro","last_name":"Rivero-Antunez","first_name":"Pedro"},{"first_name":"Tangui","full_name":"Rodzinka, Tangui","last_name":"Rodzinka"},{"full_name":"Roura, Albert","last_name":"Roura","first_name":"Albert"},{"full_name":"Rudolph, Jan","last_name":"Rudolph","first_name":"Jan"},{"first_name":"Dylan","full_name":"Sabulsky, Dylan","last_name":"Sabulsky"},{"full_name":"Safronova, Marianna S.","last_name":"Safronova","first_name":"Marianna S."},{"first_name":"Mairi","last_name":"Sakellariadou","full_name":"Sakellariadou, Mairi"},{"first_name":"Leonardo","last_name":"Salvi","full_name":"Salvi, Leonardo"},{"full_name":"Sameed, Muhammed","last_name":"Sameed","first_name":"Muhammed"},{"full_name":"Sarkar, Sumit","last_name":"Sarkar","first_name":"Sumit"},{"first_name":"Patrik","full_name":"Schach, Patrik","last_name":"Schach"},{"last_name":"Schäffer","full_name":"Schäffer, Stefan Alaric","first_name":"Stefan Alaric"},{"first_name":"Jesse","full_name":"Schelfhout, Jesse","last_name":"Schelfhout"},{"first_name":"Manuel","full_name":"Schilling, Manuel","last_name":"Schilling"},{"first_name":"Vladimir","full_name":"Schkolnik, Vladimir","last_name":"Schkolnik"},{"last_name":"Schleich","full_name":"Schleich, Wolfgang P.","first_name":"Wolfgang P."},{"first_name":"Dennis","full_name":"Schlippert, Dennis","last_name":"Schlippert"},{"last_name":"Schneider","full_name":"Schneider, Ulrich","first_name":"Ulrich"},{"last_name":"Schreck","full_name":"Schreck, Florian","first_name":"Florian"},{"first_name":"Ariel","last_name":"Schwartzman","full_name":"Schwartzman, Ariel"},{"first_name":"Nico","last_name":"Schwersenz","full_name":"Schwersenz, Nico"},{"full_name":"Sergijenko, Olga","last_name":"Sergijenko","first_name":"Olga"},{"full_name":"Sfar, Haifa Rejeb","last_name":"Sfar","first_name":"Haifa Rejeb"},{"first_name":"Lijing","last_name":"Shao","full_name":"Shao, Lijing"},{"last_name":"Shipsey","full_name":"Shipsey, Ian","first_name":"Ian"},{"first_name":"Jing","last_name":"Shu","full_name":"Shu, Jing"},{"first_name":"Yeshpal","last_name":"Singh","full_name":"Singh, Yeshpal"},{"full_name":"Sopuerta, Carlos F.","last_name":"Sopuerta","first_name":"Carlos F."},{"first_name":"Marianna","full_name":"Sorba, Marianna","last_name":"Sorba"},{"full_name":"Sorrentino, Fiodor","last_name":"Sorrentino","first_name":"Fiodor"},{"last_name":"Spallicci","full_name":"Spallicci, Alessandro D.A.M.","first_name":"Alessandro D.A.M."},{"full_name":"Stefanescu, Petruta","last_name":"Stefanescu","first_name":"Petruta"},{"first_name":"Nikolaos","last_name":"Stergioulas","full_name":"Stergioulas, Nikolaos"},{"last_name":"Stoerk","full_name":"Stoerk, Daniel","first_name":"Daniel"},{"last_name":"Thaivalappil Sunilkumar","full_name":"Thaivalappil Sunilkumar, Hrudya","first_name":"Hrudya"},{"full_name":"Ströhle, Jannik","last_name":"Ströhle","first_name":"Jannik"},{"first_name":"Zoie","last_name":"Tam","full_name":"Tam, Zoie"},{"last_name":"Tandon","full_name":"Tandon, Dhruv","first_name":"Dhruv"},{"last_name":"Tang","full_name":"Tang, Yijun","first_name":"Yijun"},{"first_name":"Dorothee","full_name":"Tell, Dorothee","last_name":"Tell"},{"last_name":"Tempere","full_name":"Tempere, Jacques","first_name":"Jacques"},{"full_name":"Temples, Dylan J.","last_name":"Temples","first_name":"Dylan J."},{"last_name":"Thampy","full_name":"Thampy, Rohit P.","first_name":"Rohit P."},{"full_name":"Tietje, Ingmari C.","last_name":"Tietje","first_name":"Ingmari C."},{"full_name":"Tino, Guglielmo M.","last_name":"Tino","first_name":"Guglielmo M."},{"last_name":"Tinsley","full_name":"Tinsley, Jonathan N.","first_name":"Jonathan N."},{"first_name":"Ovidiu","last_name":"Tintareanu Mircea","full_name":"Tintareanu Mircea, Ovidiu"},{"first_name":"Kimberly","full_name":"Tkalčec, Kimberly","last_name":"Tkalčec"},{"last_name":"Tolley","full_name":"Tolley, Andrew J.","first_name":"Andrew J."},{"first_name":"Vincenza","last_name":"Tornatore","full_name":"Tornatore, Vincenza"},{"last_name":"Torres-Orjuela","full_name":"Torres-Orjuela, Alejandro","first_name":"Alejandro"},{"full_name":"Treutlein, Philipp","last_name":"Treutlein","first_name":"Philipp"},{"full_name":"Trombettoni, Andrea","last_name":"Trombettoni","first_name":"Andrea"},{"last_name":"Ufrecht","full_name":"Ufrecht, Christian","first_name":"Christian"},{"first_name":"Juan","last_name":"Urrutia","full_name":"Urrutia, Juan"},{"first_name":"Tristan","last_name":"Valenzuela","full_name":"Valenzuela, Tristan"},{"full_name":"Valerio, Linda R.","last_name":"Valerio","first_name":"Linda R."},{"first_name":"Maurits","full_name":"Van Der Grinten, Maurits","last_name":"Van Der Grinten"},{"last_name":"Vaskonen","full_name":"Vaskonen, Ville","first_name":"Ville"},{"last_name":"Vázquez-Aceves","full_name":"Vázquez-Aceves, Verónica","first_name":"Verónica"},{"first_name":"Hardi","full_name":"Veermäe, Hardi","last_name":"Veermäe"},{"first_name":"Flavio","last_name":"Vetrano","full_name":"Vetrano, Flavio"},{"last_name":"Vitanov","full_name":"Vitanov, Nikolay V.","first_name":"Nikolay V."},{"last_name":"Von Klitzing","full_name":"Von Klitzing, Wolf","first_name":"Wolf"},{"full_name":"Wald, Sebastian","orcid":"0000-0002-5869-1604","last_name":"Wald","id":"133F200A-B015-11E9-AD41-0EDAE5697425","first_name":"Sebastian"},{"first_name":"Thomas","last_name":"Walker","full_name":"Walker, Thomas"},{"last_name":"Walser","full_name":"Walser, Reinhold","first_name":"Reinhold"},{"first_name":"Jin","last_name":"Wang","full_name":"Wang, Jin"},{"first_name":"Yan","full_name":"Wang, Yan","last_name":"Wang"},{"full_name":"Weidner, C. A.","last_name":"Weidner","first_name":"C. A."},{"last_name":"Wenzlawski","full_name":"Wenzlawski, André","first_name":"André"},{"full_name":"Werner, Michael","last_name":"Werner","first_name":"Michael"},{"last_name":"Wörner","full_name":"Wörner, Lisa","first_name":"Lisa"},{"full_name":"Yahia, Mohamed E.","last_name":"Yahia","first_name":"Mohamed E."},{"first_name":"Efe","last_name":"Yazgan","full_name":"Yazgan, Efe"},{"last_name":"Zambrini Cruzeiro","full_name":"Zambrini Cruzeiro, Emmanuel","first_name":"Emmanuel"},{"full_name":"Zarei, M.","last_name":"Zarei","first_name":"M."},{"full_name":"Zhan, Mingsheng","last_name":"Zhan","first_name":"Mingsheng"},{"first_name":"Shengnan","last_name":"Zhang","full_name":"Zhang, Shengnan"},{"last_name":"Zhou","full_name":"Zhou, Lin","first_name":"Lin"},{"first_name":"Erik","last_name":"Zupanič","full_name":"Zupanič, Erik"}],"intvolume":" 12","das_tickbox":"1","publication_status":"published","article_number":"42","arxiv":1,"volume":12,"title":"Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop","citation":{"ista":"Abdalla A et al. 2025. Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop. EPJ Quantum Technology. 12, 42.","mla":"Abdalla, Adam, et al. “Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the Second Workshop.” EPJ Quantum Technology, vol. 12, 42, Springer Nature, 2025, doi:10.1140/epjqt/s40507-025-00344-3.","short":"A. Abdalla, M. Abe, S. Abend, M. Abidi, M. Aidelsburger, A. Alibabaei, B. Allard, J. Antoniadis, G. Arduini, N. Augst, P. Balamatsias, A. Balaž, H. Banks, R.L. Barcklay, M. Barone, M. Barsanti, M.G. Bason, A. Bassi, J.B. Bayle, C.F.A. Baynham, Q. Beaufils, S. Beldjoudi, A. Belić, S. Bennetts, J. Bernabeu, A. Bertoldi, C. Bigard, N.P. Bigelow, R. Bingham, D. Blas, A. Bobrick, S. Boehringer, A. Bogojević, K. Bongs, D. Bortoletto, P. Bouyer, C. Brand, O. Buchmueller, G. Buica, S. Calatroni, L. Calmels, P. Canizares, B. Canuel, A. Caramete, L.I. Caramete, M. Carlesso, J. Carlton, S.P. Carman, A. Carroll, M. Casariego, M. Chairetis, V. Charmandaris, U. Chauhan, J. Chen, M.L.M.L.M. Chiofalo, D. Ciampini, A. Cimbri, P. Cladé, J. Coleman, F.L. Constantin, C.R. Contaldi, R. Corgier, B. Dash, G.J. Davies, C. De Rham, A. De Roeck, D. Derr, S. Dey, F. Di Pumpo, G.S. Djordjevic, B. Döbrich, P. Dornan, M. Doser, G. Drougakis, J. Dunningham, A. Duspayev, S. Easo, J. Eby, M. Efremov, G. Elertas, J. Ellis, N. Entin, S. Fairhurst, M. Fanì, F. Fassi, P. Fayet, D. Felea, J. Feng, R. Flack, C. Foot, T. Freegarde, E. Fuchs, N. Gaaloul, D. Gao, S. Gardner, B.M. Garraway, C.L. Garrido Alzar, A. Gauguet, E. Giese, P. Gill, G.F. Giudice, E.P. Glasbrenner, J. Glick, P.W. Graham, E. Granados, P.F. Griffin, J. Gué, S. Guellati-Khelifa, S. Gupta, V. Gupta, L. Hackermueller, M. Haehnelt, T. Hakulinen, K. Hammerer, E.T. Hanımeli, T. Harte, S. Hartmann, L. Hawkins, A. Hees, A. Herbst, T.M. Hird, R. Hobson, J. Hogan, B. Holst, M. Holynski, O. Hosten, C.C. Hsu, W.C.W. Huang, K.M. Hughes, K. Hussain, G. Hütsi, A. Iovino, M.C. Isfan, G. Janson, P. Jeglič, P. Jetzer, Y. Jiang, G. Juzeliūnas, W. Kaenders, M. Kalliokoski, A. Kehagias, E. Kilian, C. Klempt, P. Knight, S. Koley, B. Konrad, T. Kovachy, M. Krutzik, M. Kumar, P. Kumar, H. Labiad, S.Y. Lan, A. Landragin, G. Landsberg, M. Langlois, B. Lanigan, B. Leone, C. Le Poncin-Lafitte, S. Lellouch, M. Lewicki, Y.H. Lien, L. Lombriser, E.L. Asamar, J.L. Lopez-Gonzalez, C. Lu, G.G. Luciano, N. Lundblad, C. De J. López Monjaraz, A. Lowe, M. Mackoit-Sinkevičienė, M. Maggiore, A. Majumdar, K. Makris, A. Maleknejad, A.L. Marchant, A. Mariotti, C. Markou, B. Matthews, A. Mazumdar, C. Mccabe, M. Meister, G. Mentasti, J. Menu, G. Messineo, B. Meyer-Hoppe, S. Micalizio, F. Migliaccio, P. Millington, M. Milosevic, A. Mishra, J. Mitchell, G.W. Morley, N. Mouelle, J. Müller, D. Newbold, W.T. Ni, C. Niehof, J. Noller, S. Odžak, D.K.L. Oi, A. Oikonomou, Y. Omar, C. Overstreet, V. Puthiya Veettil, J. Pahl, S. Paling, Z. Pan, G. Pappas, V. Pareek, E. Pasatembou, M. Paternostro, V.K. Pathak, E. Pelucchi, F. Pereira Dos Santos, A. Peters, A. Pichery, I. Pikovski, A. Pilaftsis, F.C. Pislan, R. Plunkett, R. Poggiani, M. Prevedelli, J. Rafelski, J. Raidal, M. Raidal, E.M. Rasel, S. Renaux-Petel, A. Richaud, P. Rivero-Antunez, T. Rodzinka, A. Roura, J. Rudolph, D. Sabulsky, M.S. Safronova, M. Sakellariadou, L. Salvi, M. Sameed, S. Sarkar, P. Schach, S.A. Schäffer, J. Schelfhout, M. Schilling, V. Schkolnik, W.P. Schleich, D. Schlippert, U. Schneider, F. Schreck, A. Schwartzman, N. Schwersenz, O. Sergijenko, H.R. Sfar, L. Shao, I. Shipsey, J. Shu, Y. Singh, C.F. Sopuerta, M. Sorba, F. Sorrentino, A.D.A.M. Spallicci, P. Stefanescu, N. Stergioulas, D. Stoerk, H. Thaivalappil Sunilkumar, J. Ströhle, Z. Tam, D. Tandon, Y. Tang, D. Tell, J. Tempere, D.J. Temples, R.P. Thampy, I.C. Tietje, G.M. Tino, J.N. Tinsley, O. Tintareanu Mircea, K. Tkalčec, A.J. Tolley, V. Tornatore, A. Torres-Orjuela, P. Treutlein, A. Trombettoni, C. Ufrecht, J. Urrutia, T. Valenzuela, L.R. Valerio, M. Van Der Grinten, V. Vaskonen, V. Vázquez-Aceves, H. Veermäe, F. Vetrano, N.V. Vitanov, W. Von Klitzing, S. Wald, T. Walker, R. Walser, J. Wang, Y. Wang, C.A. Weidner, A. Wenzlawski, M. Werner, L. Wörner, M.E. Yahia, E. Yazgan, E. Zambrini Cruzeiro, M. Zarei, M. Zhan, S. Zhang, L. Zhou, E. Zupanič, EPJ Quantum Technology 12 (2025).","ieee":"A. Abdalla et al., “Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop,” EPJ Quantum Technology, vol. 12. Springer Nature, 2025.","apa":"Abdalla, A., Abe, M., Abend, S., Abidi, M., Aidelsburger, M., Alibabaei, A., … Zupanič, E. (2025). Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop. EPJ Quantum Technology. Springer Nature. https://doi.org/10.1140/epjqt/s40507-025-00344-3","chicago":"Abdalla, Adam, Mahiro Abe, Sven Abend, Mouine Abidi, Monika Aidelsburger, Ashkan Alibabaei, Baptiste Allard, et al. “Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the Second Workshop.” EPJ Quantum Technology. Springer Nature, 2025. https://doi.org/10.1140/epjqt/s40507-025-00344-3.","ama":"Abdalla A, Abe M, Abend S, et al. Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop. EPJ Quantum Technology. 2025;12. doi:10.1140/epjqt/s40507-025-00344-3"},"supplementarymaterial":"no","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","OA_type":"gold","article_processing_charge":"Yes","department":[{"_id":"OnHo"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2025-04-03T00:00:00Z","type":"journal_article","year":"2025","publication_identifier":{"eissn":["2196-0763"]},"file_date_updated":"2025-05-05T10:52:52Z","date_updated":"2026-07-08T09:29:52Z","day":"03","quality_controlled":"1","ddc":["530"],"dataavailabilitystatement":"No datasets were generated or analysed during the current study.","isi":1,"month":"04","publication":"EPJ Quantum Technology","oa":1,"status":"public","abstract":[{"lang":"eng","text":"This summary of the second Terrestrial Very-Long-Baseline Atom Interferometry (TVLBAI) Workshop provides a comprehensive overview of our meeting held in London in April 2024 (Second Terrestrial Very-Long-Baseline Atom Interferometry Workshop, Imperial College, April 2024), building on the initial discussions during the inaugural workshop held at CERN in March 2023 (First Terrestrial Very-Long-Baseline Atom Interferometry Workshop, CERN, March 2023). Like the summary of the first workshop (Abend et al. in AVS Quantum Sci. 6:024701, 2024), this document records a critical milestone for the international atom interferometry community. It documents our concerted efforts to evaluate progress, address emerging challenges, and refine strategic directions for future large-scale atom interferometry projects. Our commitment to collaboration is manifested by the integration of diverse expertise and the coordination of international resources, all aimed at advancing the frontiers of atom interferometry physics and technology, as set out in a Memorandum of Understanding signed by over 50 institutions (Memorandum of Understanding for the Terrestrial Very Long Baseline Atom Interferometer Study)."}],"acknowledgement":"We acknowledge the support of the CERN Physics Beyond Collider activity, the CERN Quantum Technology Initiative, the Long Range Broad Agency Announcement (BAA) for the Navy and Marine Corps Science and Technology programme, Hannover Leibniz University, and the Physics Department at Imperial College London, whose contributions were instrumental in supporting the workshop that laid the foundation for this paper.\r\nThe workshop was partially funded by contributions from the Long Range Broad Agency Announcement (BAA) for the Navy and Marine Corps Science and Technology programme, Hannover Leibniz University, and the Physics Department at Imperial College London.","article_type":"review","publisher":"Springer Nature","OA_place":"publisher","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"19636","date_created":"2025-05-04T22:02:30Z","scopus_import":"1"},{"day":"01","date_updated":"2026-07-08T10:24:21Z","publication_identifier":{"eissn":["1460-244X"],"issn":["0024-6115"]},"year":"2025","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2025-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.03045"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","citation":{"ama":"Christoph M, Martinsson A, Steiner R, Wigderson Y. Resolution of the Kohayakawa–Kreuter conjecture. Proceedings of the London Mathematical Society. 2025;130(1). doi:10.1112/plms.70013","apa":"Christoph, M., Martinsson, A., Steiner, R., & Wigderson, Y. (2025). Resolution of the Kohayakawa–Kreuter conjecture. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.70013","chicago":"Christoph, Micha, Anders Martinsson, Raphael Steiner, and Yuval Wigderson. “Resolution of the Kohayakawa–Kreuter Conjecture.” Proceedings of the London Mathematical Society. Wiley, 2025. https://doi.org/10.1112/plms.70013.","ieee":"M. Christoph, A. Martinsson, R. Steiner, and Y. Wigderson, “Resolution of the Kohayakawa–Kreuter conjecture,” Proceedings of the London Mathematical Society, vol. 130, no. 1. Wiley, 2025.","ista":"Christoph M, Martinsson A, Steiner R, Wigderson Y. 2025. Resolution of the Kohayakawa–Kreuter conjecture. Proceedings of the London Mathematical Society. 130(1), e70013.","mla":"Christoph, Micha, et al. “Resolution of the Kohayakawa–Kreuter Conjecture.” Proceedings of the London Mathematical Society, vol. 130, no. 1, e70013, Wiley, 2025, doi:10.1112/plms.70013.","short":"M. Christoph, A. Martinsson, R. Steiner, Y. Wigderson, Proceedings of the London Mathematical Society 130 (2025)."},"title":"Resolution of the Kohayakawa–Kreuter conjecture","volume":130,"scopus_import":"1","date_created":"2026-06-29T10:50:35Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"22157","OA_place":"repository","publisher":"Wiley","abstract":[{"lang":"eng","text":"A graph 𝐺 is said to be Ramsey for a tuple of graphs(𝐻 1 , … , 𝐻𝑟 ) if every 𝑟-coloring of the edges of 𝐺 con-tains a monochromatic copy of 𝐻𝑖 in color 𝑖, for some 𝑖.A fundamental question at the intersection of Ramseytheory and the theory of random graphs is to deter-mine the threshold at which the binomial randomgraph 𝐺𝑛,𝑝 becomes asymptotically almost surely Ram-sey for a fixed tuple (𝐻 1 , … , 𝐻𝑟 ), and a famous conjectureof Kohayakawa and Kreuter predicts this threshold.Earlier work of Mousset–Nenadov–Samotij, Bowtell–Hancock–Hyde, and Kuperwasser–Samotij–Wigdersonhas reduced this probabilistic problem to a determinis-tic graph decomposition conjecture. In this paper, weresolve this deterministic problem, thus proving theKohayakawa–Kreuter conjecture. Along the way, weprove a number of novel graph decomposition resultsthat may be of independent interest."}],"article_type":"original","oa":1,"status":"public","publication":"Proceedings of the London Mathematical Society","month":"01","mathsc":["05C70","05D10","05C80"],"ddc":["500"],"quality_controlled":"1","author":[{"first_name":"Micha","last_name":"Christoph","full_name":"Christoph, Micha"},{"first_name":"Anders","full_name":"Martinsson, Anders","last_name":"Martinsson"},{"first_name":"Raphael","last_name":"Steiner","full_name":"Steiner, Raphael"},{"first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson","full_name":"Wigderson, Yuval"}],"doi":"10.1112/plms.70013","oa_version":"Preprint","external_id":{"arxiv":["2402.03045"]},"extern":"1","arxiv":1,"article_number":"e70013","publication_status":"published","issue":"1","intvolume":" 130"},{"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.07693","open_access":"1"}],"OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"An efficient asymmetric removal lemma and its limitations","citation":{"mla":"Gishboliner, Lior, et al. “An Efficient Asymmetric Removal Lemma and Its Limitations.” Forum of Mathematics, Sigma, vol. 13, e38, Cambridge University Press, 2025, doi:10.1017/fms.2024.68.","ista":"Gishboliner L, Shapira A, Wigderson Y. 2025. An efficient asymmetric removal lemma and its limitations. Forum of Mathematics, Sigma. 13, e38.","short":"L. Gishboliner, A. Shapira, Y. Wigderson, Forum of Mathematics, Sigma 13 (2025).","apa":"Gishboliner, L., Shapira, A., & Wigderson, Y. (2025). An efficient asymmetric removal lemma and its limitations. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2024.68","chicago":"Gishboliner, Lior, Asaf Shapira, and Yuval Wigderson. “An Efficient Asymmetric Removal Lemma and Its Limitations.” Forum of Mathematics, Sigma. Cambridge University Press, 2025. https://doi.org/10.1017/fms.2024.68.","ama":"Gishboliner L, Shapira A, Wigderson Y. An efficient asymmetric removal lemma and its limitations. Forum of Mathematics, Sigma. 2025;13. doi:10.1017/fms.2024.68","ieee":"L. Gishboliner, A. Shapira, and Y. Wigderson, “An efficient asymmetric removal lemma and its limitations,” Forum of Mathematics, Sigma, vol. 13. Cambridge University Press, 2025."},"volume":13,"day":"10","date_updated":"2026-07-08T10:31:22Z","type":"journal_article","year":"2025","publication_identifier":{"issn":["2050-5094"]},"date_published":"2025-02-10T00:00:00Z","language":[{"iso":"eng"}],"publication":"Forum of Mathematics, Sigma","month":"02","oa":1,"status":"public","mathsc":["05C35","11B75"],"quality_controlled":"1","OA_place":"repository","_id":"22158","date_created":"2026-06-29T10:51:07Z","scopus_import":"1","publisher":"Cambridge University Press","article_type":"original","abstract":[{"text":"The triangle removal states that if G contains edge-disjoint triangles, then G contains triangles. Unfortunately, there are no sensible bounds on the order of growth of , and at any rate, it is known that is not polynomial in . Csaba recently obtained an asymmetric variant of the triangle removal, stating that if G contains edge-disjoint triangles, then G contains copies of . To this end, he devised a new variant of Szemerédi’s regularity lemma. We obtain the following results:\r\n\r\n• We first give a regularity-free proof of Csaba’s theorem, which improves the number of copies of to the optimal number .\r\n\r\n• We say that H is -abundant if every graph containing edge-disjoint triangles has copies of H. It is easy to see that a -abundant graph must be triangle-free and tripartite. Given our first result, it is natural to ask if all triangle-free tripartite graphs are -abundant. Our second result is that assuming a well-known conjecture of Ruzsa in additive number theory, the answer to this question is negative.\r\n\r\nOur proofs use a mix of combinatorial, number-theoretic, probabilistic and Ramsey-type arguments.","lang":"eng"}],"external_id":{"arxiv":["2301.07693"]},"author":[{"first_name":"Lior","full_name":"Gishboliner, Lior","last_name":"Gishboliner"},{"last_name":"Shapira","full_name":"Shapira, Asaf","first_name":"Asaf"},{"full_name":"Wigderson, Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval"}],"doi":"10.1017/fms.2024.68","oa_version":"Preprint","publication_status":"published","article_number":"e38","intvolume":" 13","extern":"1","arxiv":1},{"external_id":{"arxiv":["2404.01057"]},"oa_version":"Preprint","author":[{"last_name":"Haviv","full_name":"Haviv, Ishay","first_name":"Ishay"},{"first_name":"Sam","full_name":"Mattheus, Sam","last_name":"Mattheus"},{"first_name":"Aleksa","full_name":"Milojević, Aleksa","last_name":"Milojević"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"doi":"10.1016/j.disc.2024.114373","das_tickbox":"1","intvolume":" 348","article_number":"114373","publication_status":"published","issue":"4","extern":"1","arxiv":1,"citation":{"short":"I. Haviv, S. Mattheus, A. Milojević, Y. Wigderson, Discrete Mathematics 348 (2025).","mla":"Haviv, Ishay, et al. “Larger Nearly Orthogonal Sets over Finite Fields.” Discrete Mathematics, vol. 348, no. 4, 114373, Elsevier, 2025, doi:10.1016/j.disc.2024.114373.","ista":"Haviv I, Mattheus S, Milojević A, Wigderson Y. 2025. Larger nearly orthogonal sets over finite fields. Discrete Mathematics. 348(4), 114373.","ama":"Haviv I, Mattheus S, Milojević A, Wigderson Y. Larger nearly orthogonal sets over finite fields. Discrete Mathematics. 2025;348(4). doi:10.1016/j.disc.2024.114373","chicago":"Haviv, Ishay, Sam Mattheus, Aleksa Milojević, and Yuval Wigderson. “Larger Nearly Orthogonal Sets over Finite Fields.” Discrete Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.disc.2024.114373.","ieee":"I. Haviv, S. Mattheus, A. Milojević, and Y. Wigderson, “Larger nearly orthogonal sets over finite fields,” Discrete Mathematics, vol. 348, no. 4. Elsevier, 2025.","apa":"Haviv, I., Mattheus, S., Milojević, A., & Wigderson, Y. (2025). Larger nearly orthogonal sets over finite fields. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.114373"},"title":"Larger nearly orthogonal sets over finite fields","volume":348,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2404.01057 "}],"OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2025-04-01T00:00:00Z","date_updated":"2026-07-14T08:17:17Z","day":"01","year":"2025","publication_identifier":{"issn":["0012-365X"]},"type":"journal_article","quality_controlled":"1","oa":1,"status":"public","month":"04","publication":"Discrete Mathematics","publisher":"Elsevier","article_type":"original","abstract":[{"lang":"eng","text":"For a field F and integers d and k, a set A ⊆ Fd is called k-nearly orthogonal if its\r\nmembers are non-self-orthogonal and every k + 1 vectors of A include an orthogonal pair.\r\nWe prove that for every prime p there exists some δ = δ(p)> 0, such that for every field\r\nF of characteristic p and for all integers k ≥ 2 and d ≥ k, there exists a k-nearly orthogonal\r\nset of at least dδ·k/ logk vectors of Fd. The size of the set is optimal up to the logk term\r\nin the exponent. We further prove two extensions of this result. In the first, we provide a\r\nlarge set A of non-self-orthogonal vectors of Fd such that for every two subsets of A of\r\nsize k+1 each, some vector of one of the subsets is orthogonal to some vector of the other.\r\nIn the second extension, every k + 1 vectors of the produced set A include ℓ + 1 pairwise\r\northogonal vectors for an arbitrary fixed integer 1 ≤ ℓ ≤ k. The proofs involve probabilistic\r\nand spectral arguments and the hypergraph container method"}],"date_created":"2026-06-29T10:53:05Z","scopus_import":"1","_id":"22163","OA_place":"repository","keyword":["Nearly orthogonal sets","Ramsey theory","Finite fields"]},{"doi":"10.1017/s0305004125000143","author":[{"first_name":"EDEN","full_name":"KUPERWASSER, EDEN","last_name":"KUPERWASSER"},{"last_name":"SAMOTIJ","full_name":"SAMOTIJ, WOJCIECH","first_name":"WOJCIECH"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","full_name":"Wigderson, Yuval","last_name":"Wigderson"}],"oa_version":"Preprint","external_id":{"arxiv":["2307.16611"]},"arxiv":1,"extern":"1","issue":"3","publication_status":"published","intvolume":" 178","publication_identifier":{"issn":["0305-0041"],"eissn":["1469-8064"]},"type":"journal_article","year":"2025","date_updated":"2026-07-14T08:38:08Z","day":"28","language":[{"iso":"eng"}],"date_published":"2025-04-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.16611"}],"article_processing_charge":"No","volume":178,"title":"On the Kohayakawa–Kreuter conjecture","citation":{"ieee":"E. KUPERWASSER, W. SAMOTIJ, and Y. Wigderson, “On the Kohayakawa–Kreuter conjecture,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 178, no. 3. Cambridge University Press, pp. 293–320, 2025.","chicago":"KUPERWASSER, EDEN, WOJCIECH SAMOTIJ, and Yuval Wigderson. “On the Kohayakawa–Kreuter Conjecture.” Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press, 2025. https://doi.org/10.1017/s0305004125000143.","ama":"KUPERWASSER E, SAMOTIJ W, Wigderson Y. On the Kohayakawa–Kreuter conjecture. Mathematical Proceedings of the Cambridge Philosophical Society. 2025;178(3):293-320. doi:10.1017/s0305004125000143","apa":"KUPERWASSER, E., SAMOTIJ, W., & Wigderson, Y. (2025). On the Kohayakawa–Kreuter conjecture. Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/s0305004125000143","short":"E. KUPERWASSER, W. SAMOTIJ, Y. Wigderson, Mathematical Proceedings of the Cambridge Philosophical Society 178 (2025) 293–320.","ista":"KUPERWASSER E, SAMOTIJ W, Wigderson Y. 2025. On the Kohayakawa–Kreuter conjecture. Mathematical Proceedings of the Cambridge Philosophical Society. 178(3), 293–320.","mla":"KUPERWASSER, EDEN, et al. “On the Kohayakawa–Kreuter Conjecture.” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 178, no. 3, Cambridge University Press, 2025, pp. 293–320, doi:10.1017/s0305004125000143."},"_id":"22168","OA_place":"repository","scopus_import":"1","page":"293-320","date_created":"2026-06-29T10:55:00Z","article_type":"original","abstract":[{"text":"Let us say that a graph G is Ramsey for a tuple (H1, ... , Hr) of graphs if every r-colouring\r\nof the edges of G contains a monochromatic copy of Hi in colour i, for some i ∈ [[r]].\r\nA famous conjecture of Kohayakawa and Kreuter, extending seminal work of Rödl and\r\nRucinski, predicts the threshold at which the binomial random graph ´ Gn,p becomes Ramsey\r\nfor (H1, ... , Hr) asymptotically almost surely.\r\nIn this paper, we resolve the Kohayakawa–Kreuter conjecture for almost all tuples of\r\ngraphs. Moreover, we reduce its validity to the truth of a certain deterministic statement,\r\nwhich is a clear necessary condition for the conjecture to hold. All of our results actually hold in greater generality, when one replaces the graphs H1, ... , Hr by finite families\r\nH1, ... , Hr. Additionally, we pose a natural (deterministic) graph-partitioning conjecture,\r\nwhich we believe to be of independent interest, and whose resolution would imply the\r\nKohayakawa–Kreuter conjecture.","lang":"eng"}],"publisher":"Cambridge University Press","mathsc":["05C80","05C55","05D10"],"month":"04","publication":"Mathematical Proceedings of the Cambridge Philosophical Society","status":"public","oa":1,"quality_controlled":"1"},{"volume":10,"title":"Blowups of triangle-free graphs","citation":{"mla":"Girão, António, et al. “Blowups of Triangle-Free Graphs.” Advances in Combinatorics, vol. 10, Alliance of Diamond Open Access Journals, 2025, doi:10.19086/aic.2025.10.","ista":"Girão A, Hunter Z, Wigderson Y. 2025. Blowups of triangle-free graphs. Advances in Combinatorics. 10.","short":"A. Girão, Z. Hunter, Y. Wigderson, Advances in Combinatorics 10 (2025).","apa":"Girão, A., Hunter, Z., & Wigderson, Y. (2025). Blowups of triangle-free graphs. Advances in Combinatorics. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/aic.2025.10","chicago":"Girão, António, Zach Hunter, and Yuval Wigderson. “Blowups of Triangle-Free Graphs.” Advances in Combinatorics. Alliance of Diamond Open Access Journals, 2025. https://doi.org/10.19086/aic.2025.10.","ieee":"A. Girão, Z. Hunter, and Y. Wigderson, “Blowups of triangle-free graphs,” Advances in Combinatorics, vol. 10. Alliance of Diamond Open Access Journals, 2025.","ama":"Girão A, Hunter Z, Wigderson Y. Blowups of triangle-free graphs. Advances in Combinatorics. 2025;10. doi:10.19086/aic.2025.10"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2408.12913","open_access":"1"}],"language":[{"iso":"eng"}],"date_published":"2025-12-19T00:00:00Z","year":"2025","type":"journal_article","date_updated":"2026-07-14T08:50:55Z","day":"19","quality_controlled":"1","publication":"Advances in Combinatorics","month":"12","status":"public","oa":1,"article_type":"original","abstract":[{"lang":"eng","text":"A highly influential result of Nikiforov states that if an n-vertex graph G contains\r\nat least γnh copies of a fixed h-vertex graph H, then G contains a blowup of H of order\r\nΩγ,H(logn). While the dependence on n is optimal, the correct dependence on γ is unknown;\r\nall known proofs yield bounds that are polynomial in γ, but the best known upper bound,\r\ncoming from random graphs, is only logarithmic in γ. It is a major open problem to narrow\r\nthis gap.\r\nWe prove that if H is triangle-free, then the logarithmic behavior of the upper bound\r\nis the truth. That is, under the assumptions above, G contains a blowup of H of order\r\nΩH(logn/log(1/γ)). This is the first non-trivial instance where the optimal dependence in\r\nNikiforov’s theorem is known.\r\nAs a consequence, we also prove an upper bound on multicolor Ramsey numbers of\r\nblowups of triangle-free graphs, proving that the dependence on the number of colors is\r\npolynomial once the blowup is sufficiently large. This shows that, from the perspective\r\nof multicolor Ramsey numbers, blowups of fixed triangle-free graphs behave like bipartite\r\ngraphs."}],"publisher":"Alliance of Diamond Open Access Journals","_id":"22172","OA_place":"repository","date_created":"2026-06-29T10:56:44Z","scopus_import":"1","external_id":{"arxiv":["2408.12913"]},"oa_version":"Preprint","doi":"10.19086/aic.2025.10","author":[{"full_name":"Girão, António","last_name":"Girão","first_name":"António"},{"first_name":"Zach","full_name":"Hunter, Zach","last_name":"Hunter"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"intvolume":" 10","publication_status":"published","arxiv":1,"extern":"1"},{"language":[{"iso":"eng"}],"date_published":"2025-08-01T00:00:00Z","date_updated":"2026-07-14T09:13:09Z","day":"01","year":"2025","publication_identifier":{"issn":["0195-6698"]},"type":"journal_article","title":"Infinitely many minimally non-Ramsey size-linear graphs","citation":{"ama":"Wigderson Y. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 2025;128. doi:10.1016/j.ejc.2025.104175","chicago":"Wigderson, Yuval. “Infinitely Many Minimally Non-Ramsey Size-Linear Graphs.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104175.","ieee":"Y. Wigderson, “Infinitely many minimally non-Ramsey size-linear graphs,” European Journal of Combinatorics, vol. 128. Elsevier, 2025.","apa":"Wigderson, Y. (2025). Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104175","ista":"Wigderson Y. 2025. Infinitely many minimally non-Ramsey size-linear graphs. European Journal of Combinatorics. 128, 104175.","mla":"Wigderson, Yuval. “Infinitely Many Minimally Non-Ramsey Size-Linear Graphs.” European Journal of Combinatorics, vol. 128, 104175, Elsevier, 2025, doi:10.1016/j.ejc.2025.104175.","short":"Y. Wigderson, European Journal of Combinatorics 128 (2025)."},"volume":128,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2409.05931 "}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","publisher":"Elsevier","abstract":[{"lang":"eng","text":"A graph G is said to be Ramsey size-linear if r(G, H) = OG(e(H))\r\nfor every graph H with no isolated vertices. Erdős, Faudree,\r\nRousseau, and Schelp observed that K4 is not Ramsey size-linear,\r\nbut each of its proper subgraphs is, and they asked whether there\r\nexist infinitely many such graphs. In this short note, we answer\r\nthis question in the affirmative"}],"article_type":"original","OA_place":"repository","_id":"22181","date_created":"2026-06-29T10:59:47Z","scopus_import":"1","quality_controlled":"1","month":"08","publication":"European Journal of Combinatorics","status":"public","oa":1,"oa_version":"Preprint","author":[{"last_name":"Wigderson","full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"doi":"10.1016/j.ejc.2025.104175","external_id":{"arxiv":["2409.05931"]},"extern":"1","arxiv":1,"intvolume":" 128","article_number":"104175","publication_status":"published"},{"doi":"10.4086/toc.2025.v021a001","author":[{"full_name":"Li, Yinan","last_name":"Li","first_name":"Yinan"},{"first_name":"Youming","full_name":"Qiao, Youming","last_name":"Qiao"},{"first_name":"Avi","last_name":"Wigderson","full_name":"Wigderson, Avi"},{"full_name":"Wigderson, Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval"},{"first_name":"Chuanqi","full_name":"Zhang, Chuanqi","last_name":"Zhang"}],"oa_version":"Preprint","external_id":{"arxiv":["2212.13154"]},"arxiv":1,"extern":"1","publication_status":"published","article_number":"1","intvolume":" 21","type":"journal_article","year":"2025","publication_identifier":{"issn":["1557-2862"]},"date_updated":"2026-07-14T09:47:56Z","day":"12","language":[{"iso":"eng"}],"date_published":"2025-04-12T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2212.13154"}],"article_processing_charge":"No","volume":21,"title":"On linear-algebraic notions of expansion","citation":{"ista":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. 2025. On linear-algebraic notions of expansion. Theory of Computing. 21, 1.","mla":"Li, Yinan, et al. “On Linear-Algebraic Notions of Expansion.” Theory of Computing, vol. 21, 1, Theory of Computing Exchange, 2025, doi:10.4086/toc.2025.v021a001.","short":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, C. Zhang, Theory of Computing 21 (2025).","apa":"Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., & Zhang, C. (2025). On linear-algebraic notions of expansion. Theory of Computing. Theory of Computing Exchange. https://doi.org/10.4086/toc.2025.v021a001","ieee":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, and C. Zhang, “On linear-algebraic notions of expansion,” Theory of Computing, vol. 21. Theory of Computing Exchange, 2025.","chicago":"Li, Yinan, Youming Qiao, Avi Wigderson, Yuval Wigderson, and Chuanqi Zhang. “On Linear-Algebraic Notions of Expansion.” Theory of Computing. Theory of Computing Exchange, 2025. https://doi.org/10.4086/toc.2025.v021a001.","ama":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. On linear-algebraic notions of expansion. Theory of Computing. 2025;21. doi:10.4086/toc.2025.v021a001"},"keyword":["linear algebraic expansion","quantum expanders","dimension expanders"],"_id":"22188","OA_place":"repository","date_created":"2026-06-29T12:14:06Z","scopus_import":"1","abstract":[{"text":"A fundamental fact about bounded-degree graph expanders is that three notions of expansion—vertex expansion, edge expansion, and spectral expansion—are all equivalent. In this paper, we study to what extent such a statement is true for linear-algebraic notions of expansion.\r\n\r\nThere are two well-studied notions of linear-algebraic expansion, namely, dimension expansion (defined in analogy to vertex expansion of graphs) and quantum expansion (defined in analogy to spectral expansion of graphs). Lubotzky and Zelmanov proved that the latter implies the former. We prove that the converse is false: There are dimension expanders which are not quantum expanders. This also answers in the negative questions of Lubotzky--Zelmanov and Dvir--Shpilka on the relation between dimension expansion and Kazhdan's property T.\r\n\r\nMoreover, this asymmetry is explained by the fact that there are two distinct linear-algebraic analogues of edge expansion of graphs. The first of these is quantum edge expansion, which was introduced by Hastings, and which he proved to be equivalent to quantum expansion. We introduce a new notion, termed dimension edge expansion, which we prove is equivalent to dimension expansion and which is implied by quantum edge expansion. Thus, the separation above is implied by a finer one: dimension edge expansion is strictly weaker than quantum edge expansion. This new notion also leads to a new, more modular proof of the Lubotzky--Zelmanov result that quantum expanders are dimension expanders.","lang":"eng"}],"article_type":"original","publisher":"Theory of Computing Exchange","mathsc":["05C18","68R10"],"month":"04","publication":"Theory of Computing","oa":1,"status":"public","quality_controlled":"1"},{"article_type":"original","abstract":[{"lang":"eng","text":"Montgomery and Soundararajan showed that the distribution of ψ(x+H)−ψ(x), for 0≤ x ≤ N, is approximately normal with mean ∼ H and variance ∼ H log(N/H), when N\r\nδ ≤ H ≤ N\r\n1−δ\r\n. Their work depends\r\non showing that sums Rk (h) of k-term singular series are µk (−h log h + Ah)\r\nk/2 + Ok (h\r\nk/2−1/(7k)+ε\r\n),\r\nwhere A is a constant and µk are the Gaussian moment constants. We study lower-order terms in the size\r\nof these moments. We conjecture that when k is odd, Rk (h) ≍ h\r\n(k−1)/2\r\n(log h)\r\n(k+1)/2\r\n. We prove an upper\r\nbound with the correct power of h when k = 3, and prove analogous upper bounds in the function field\r\nsetting when k = 3 and k = 5. We provide further evidence for this conjecture in the form of numerical\r\ncomputations."}],"publisher":"Mathematical Sciences Publishers","scopus_import":"1","page":"617-666","date_created":"2026-06-29T12:56:09Z","_id":"22191","OA_place":"repository","quality_controlled":"1","mathsc":["11N05","11N13"],"oa":1,"status":"public","month":"03","publication":"Algebra & Number Theory","date_published":"2025-03-24T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","year":"2025","publication_identifier":{"issn":["1937-0652"],"eissn":["1944-7833"]},"date_updated":"2026-07-14T10:52:02Z","day":"24","volume":19,"citation":{"short":"V.Z. Kuperberg, Algebra & Number Theory 19 (2025) 617–666.","ista":"Kuperberg VZ. 2025. Odd moments in the distribution of primes. Algebra & Number Theory. 19(4), 617–666.","mla":"Kuperberg, Vivian Zieve. “Odd Moments in the Distribution of Primes.” Algebra & Number Theory, vol. 19, no. 4, Mathematical Sciences Publishers, 2025, pp. 617–66, doi:10.2140/ant.2025.19.617.","chicago":"Kuperberg, Vivian Zieve. “Odd Moments in the Distribution of Primes.” Algebra & Number Theory. Mathematical Sciences Publishers, 2025. https://doi.org/10.2140/ant.2025.19.617.","ieee":"V. Z. Kuperberg, “Odd moments in the distribution of primes,” Algebra & Number Theory, vol. 19, no. 4. Mathematical Sciences Publishers, pp. 617–666, 2025.","apa":"Kuperberg, V. Z. (2025). Odd moments in the distribution of primes. Algebra & Number Theory. Mathematical Sciences Publishers. https://doi.org/10.2140/ant.2025.19.617","ama":"Kuperberg VZ. Odd moments in the distribution of primes. Algebra & Number Theory. 2025;19(4):617-666. doi:10.2140/ant.2025.19.617"},"title":"Odd moments in the distribution of primes","OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2109.03767","open_access":"1"}],"extern":"1","intvolume":" 19","publication_status":"published","issue":"4","oa_version":"Preprint","doi":"10.2140/ant.2025.19.617","author":[{"last_name":"Kuperberg","full_name":"Kuperberg, Vivian Zieve","first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697"}],"external_id":{"unknown":["2109.03767"]}},{"extern":"1","arxiv":1,"issue":"01","publication_status":"published","intvolume":" 21","author":[{"first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697","last_name":"Kuperberg","full_name":"Kuperberg, Vivian Zieve"}],"doi":"10.1142/s1793042125500046","oa_version":"Preprint","external_id":{"arxiv":["2301.06095"]},"OA_place":"repository","_id":"22195","page":"53-74","scopus_import":"1","date_created":"2026-06-29T12:57:46Z","publisher":"World Scientific Publishing","abstract":[{"text":"Sums of the singular series constants that appear in the Hardy–Littlewood k-tuples conjectures have long been studied in connection to the distribution of primes. We study constrained sums of singular series, where the sum is taken over sets whose elements are specified modulo r or weighted by smooth functions. We show that the value of the sum is governed by incidences modulo r of elements of the set in the case of arithmetic progressions and by pairings of the smooth functions in the case of weights. These sums shed light on sums of singular series in other formats. ","lang":"eng"}],"article_type":"original","month":"01","publication":"International Journal of Number Theory","oa":1,"status":"public","quality_controlled":"1","day":"01","date_updated":"2026-07-14T11:04:58Z","year":"2025","type":"journal_article","publication_identifier":{"eissn":["1793-7310"],"issn":["1793-0421"]},"language":[{"iso":"eng"}],"date_published":"2025-01-01T00:00:00Z","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.06095","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","title":"Sums of singular series along arithmetic progressions and with smooth weights","citation":{"ama":"Kuperberg VZ. Sums of singular series along arithmetic progressions and with smooth weights. International Journal of Number Theory. 2025;21(01):53-74. doi:10.1142/s1793042125500046","apa":"Kuperberg, V. Z. (2025). Sums of singular series along arithmetic progressions and with smooth weights. International Journal of Number Theory. World Scientific Publishing. https://doi.org/10.1142/s1793042125500046","chicago":"Kuperberg, Vivian Zieve. “Sums of Singular Series along Arithmetic Progressions and with Smooth Weights.” International Journal of Number Theory. World Scientific Publishing, 2025. https://doi.org/10.1142/s1793042125500046.","ieee":"V. Z. Kuperberg, “Sums of singular series along arithmetic progressions and with smooth weights,” International Journal of Number Theory, vol. 21, no. 01. World Scientific Publishing, pp. 53–74, 2025.","ista":"Kuperberg VZ. 2025. Sums of singular series along arithmetic progressions and with smooth weights. International Journal of Number Theory. 21(01), 53–74.","mla":"Kuperberg, Vivian Zieve. “Sums of Singular Series along Arithmetic Progressions and with Smooth Weights.” International Journal of Number Theory, vol. 21, no. 01, World Scientific Publishing, 2025, pp. 53–74, doi:10.1142/s1793042125500046.","short":"V.Z. Kuperberg, International Journal of Number Theory 21 (2025) 53–74."},"volume":21},{"issue":"10","publication_status":"published","intvolume":" 12","arxiv":1,"extern":"1","external_id":{"arxiv":["2212.04969"]},"doi":"10.1090/btran/186","author":[{"last_name":"Kuperberg","full_name":"Kuperberg, Vivian Zieve","first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697"},{"first_name":"Matilde","last_name":"Lalín","full_name":"Lalín, Matilde"}],"oa_version":"Preprint","mathsc":["11N60","05A15","11M50","11N56"],"publication":"Transactions of the American Mathematical Society, Series B","month":"03","status":"public","oa":1,"quality_controlled":"1","OA_place":"repository","_id":"22200","page":"323-370","date_created":"2026-06-29T12:59:46Z","scopus_import":"1","article_type":"original","abstract":[{"lang":"eng","text":"In Kuperberg and Lal´ın [Forum Math. 34 (2022), pp. 711–747],\r\nthe authors studied the mean-square of certain sums of the divisor function\r\ndk(f) over the function field Fq[T] in the limit as q →∞ and related these\r\nsums to integrals over the ensemble of symplectic matrices, along similar lines\r\nas previous work of Keating, Rodgers, Roditty-Gershon and Rudnick [Math. Z.\r\n288 (2018), pp. 167–198] for unitary matrices. We present an analogous problem yielding an integral over the ensemble of orthogonal matrices and pursue\r\na more detailed study of both the symplectic and orthogonal matrix integrals,\r\nrelating them to symmetric function theory. The function field results lead to\r\nconjectures concerning analogous questions over number fields."}],"publisher":"American Mathematical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2212.04969"}],"article_processing_charge":"No","volume":12,"title":"Symplectic conjectures for sums of divisor functions and explorations of an orthogonal regime","citation":{"ieee":"V. Z. Kuperberg and M. Lalín, “Symplectic conjectures for sums of divisor functions and explorations of an orthogonal regime,” Transactions of the American Mathematical Society, Series B, vol. 12, no. 10. American Mathematical Society, pp. 323–370, 2025.","ama":"Kuperberg VZ, Lalín M. Symplectic conjectures for sums of divisor functions and explorations of an orthogonal regime. Transactions of the American Mathematical Society, Series B. 2025;12(10):323-370. doi:10.1090/btran/186","chicago":"Kuperberg, Vivian Zieve, and Matilde Lalín. “Symplectic Conjectures for Sums of Divisor Functions and Explorations of an Orthogonal Regime.” Transactions of the American Mathematical Society, Series B. American Mathematical Society, 2025. https://doi.org/10.1090/btran/186.","apa":"Kuperberg, V. Z., & Lalín, M. (2025). Symplectic conjectures for sums of divisor functions and explorations of an orthogonal regime. Transactions of the American Mathematical Society, Series B. American Mathematical Society. https://doi.org/10.1090/btran/186","short":"V.Z. Kuperberg, M. Lalín, Transactions of the American Mathematical Society, Series B 12 (2025) 323–370.","ista":"Kuperberg VZ, Lalín M. 2025. Symplectic conjectures for sums of divisor functions and explorations of an orthogonal regime. Transactions of the American Mathematical Society, Series B. 12(10), 323–370.","mla":"Kuperberg, Vivian Zieve, and Matilde Lalín. “Symplectic Conjectures for Sums of Divisor Functions and Explorations of an Orthogonal Regime.” Transactions of the American Mathematical Society, Series B, vol. 12, no. 10, American Mathematical Society, 2025, pp. 323–70, doi:10.1090/btran/186."},"year":"2025","type":"journal_article","publication_identifier":{"issn":["2330-0000"]},"day":"20","date_updated":"2026-07-14T11:24:55Z","date_published":"2025-03-20T00:00:00Z","language":[{"iso":"eng"}]},{"quality_controlled":"1","month":"05","publication":"Mathematika","oa":1,"status":"public","mathsc":["11N60","05A15","11M50","11N56"],"publisher":"Wiley","abstract":[{"text":"Kuperberg and Lalín stated some conjectures on the variance of certain sums of the divisor function dk(n) over number fields, which were inspired by analogous results over function fields proven by the authors. These problems are related to certain symplectic matrix integrals. While the function field results can be directly related to the random matrix integrals, the connection between the random matrix integrals and the number field results is less direct and involves arithmetic factors. The goal of this article is to give heuristic arguments for the formulas of these arithmetic factors.","lang":"eng"}],"article_type":"original","_id":"22199","OA_place":"repository","scopus_import":"1","date_created":"2026-06-29T12:59:16Z","title":"Arithmetic constants for symplectic variances of the divisor function","citation":{"short":"V.Z. Kuperberg, M. Lalín, Mathematika 71 (2025).","mla":"Kuperberg, Vivian Zieve, and Matilde Lalín. “Arithmetic Constants for Symplectic Variances of the Divisor Function.” Mathematika, vol. 71, no. 3, e70029, Wiley, 2025, doi:10.1112/mtk.70029.","ista":"Kuperberg VZ, Lalín M. 2025. Arithmetic constants for symplectic variances of the divisor function. Mathematika. 71(3), e70029.","apa":"Kuperberg, V. Z., & Lalín, M. (2025). Arithmetic constants for symplectic variances of the divisor function. Mathematika. Wiley. https://doi.org/10.1112/mtk.70029","chicago":"Kuperberg, Vivian Zieve, and Matilde Lalín. “Arithmetic Constants for Symplectic Variances of the Divisor Function.” Mathematika. Wiley, 2025. https://doi.org/10.1112/mtk.70029.","ieee":"V. Z. Kuperberg and M. Lalín, “Arithmetic constants for symplectic variances of the divisor function,” Mathematika, vol. 71, no. 3. Wiley, 2025.","ama":"Kuperberg VZ, Lalín M. Arithmetic constants for symplectic variances of the divisor function. Mathematika. 2025;71(3). doi:10.1112/mtk.70029"},"volume":71,"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2410.17939","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","date_published":"2025-05-01T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2026-07-14T11:20:10Z","day":"01","year":"2025","type":"journal_article","publication_identifier":{"issn":["0025-5793","2041-7942"]},"intvolume":" 71","issue":"3","article_number":"e70029","publication_status":"published","extern":"1","arxiv":1,"external_id":{"arxiv":["2410.17939"]},"oa_version":"Preprint","author":[{"full_name":"Kuperberg, Vivian Zieve","last_name":"Kuperberg","id":"c3bac823-112d-11f0-a3f5-c264f852e697","first_name":"Vivian Zieve"},{"first_name":"Matilde","last_name":"Lalín","full_name":"Lalín, Matilde"}],"doi":"10.1112/mtk.70029"}]