--- OA_place: repository OA_type: green _id: '19399' abstract: - lang: eng text: Phytohormone auxin and its directional transport mediate much of the remarkably plastic development of higher plants. Positive feedback between auxin signaling and transport is a key prerequisite for (i) self-organizing processes including vascular tissue formation and (ii) directional growth responses such as gravitropism. Here we identify a mechanism, by which auxin signaling directly targets PIN auxin transporters. Via the cell-surface ABP1-TMK1 receptor module, auxin rapidly induces phosphorylation and thus stabilization of PIN2. Following gravistimulation, initial auxin asymmetry activates autophosphorylation of the TMK1 kinase. This induces TMK1 interaction with and phosphorylation of PIN2, stabilizing PIN2 at the lower root side, thus reinforcing asymmetric auxin flow for root bending. Upstream of TMK1 in this regulation, ABP1 acts redundantly with the root-expressed ABP1-LIKE auxin receptor ABL3. Such positive feedback between cell-surface auxin signaling and PIN-mediated polar auxin transport is fundamental for robust root gravitropism and presumably also for other self-organizing developmental phenomena. acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: 'We thank W. Gray for providing material; N. Gnyliukh and E. Cervenova for help with manuscript preparation; J. Schmid for help with cloning. We thank Dolf Weijers, Mark Roosjen, and Andre Kuhn for discussions and support with phospho-proteomic analyses. We thank the Bioimaging and Life Science facilities at ISTA for their excellent service and assistance. The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program grant agreement No 742985 and Austrian Science Fund (FWF): I3630-775 B25 to J.F; National Natural Science Foundation of China (Grant 32130010, 31422008), start-up funds from FAFU to T.X., Y.J. was funded by ERC no. 3363360-APPL under FP/2007-2013. L.R. was supported by FP7-PEOPLE-2011-COFUND ISTFELLOW program (IC1023FELL01) and the European Molecular Biology Organization (EMBO) long-term postdoctoral fellowship (ALTF 985- 2016). S.T. was supported by the National Natural Science Foundation of China (32321001).' article_processing_charge: No author: - first_name: Lesia full_name: Rodriguez Solovey, Lesia id: 3922B506-F248-11E8-B48F-1D18A9856A87 last_name: Rodriguez Solovey orcid: 0000-0002-7244-7237 - first_name: Lukas full_name: Fiedler, Lukas id: 7c417475-8972-11ed-ae7b-8b674ca26986 last_name: Fiedler - first_name: Minxia full_name: Zou, Minxia id: 5c243f41-03f3-11ec-841c-96faf48a7ef9 last_name: Zou - first_name: Caterina full_name: Giannini, Caterina id: e3fdddd5-f6e0-11ea-865d-ca99ee6367f4 last_name: Giannini - first_name: Aline full_name: Monzer, Aline id: 2DB5D88C-D7B3-11E9-B8FD-7907E6697425 last_name: Monzer - first_name: Dmitrii full_name: Vladimirtsev, Dmitrii id: 60466724-5355-11ee-ae5a-fa55e8f99c3d last_name: Vladimirtsev - first_name: Marek full_name: Randuch, Marek id: 6ac4636d-15b2-11ec-abd3-fb8df79972ae last_name: Randuch - first_name: Yongfan full_name: Yu, Yongfan last_name: Yu - first_name: Zuzana full_name: Gelová, Zuzana id: 0AE74790-0E0B-11E9-ABC7-1ACFE5697425 last_name: Gelová orcid: 0000-0003-4783-1752 - first_name: Inge full_name: Verstraeten, Inge id: 362BF7FE-F248-11E8-B48F-1D18A9856A87 last_name: Verstraeten orcid: 0000-0001-7241-2328 - first_name: Jakub full_name: Hajny, Jakub id: 4800CC20-F248-11E8-B48F-1D18A9856A87 last_name: Hajny orcid: 0000-0003-2140-7195 - first_name: Meng full_name: Chen, Meng last_name: Chen - first_name: Shutang full_name: Tan, Shutang id: 2DE75584-F248-11E8-B48F-1D18A9856A87 last_name: Tan orcid: 0000-0002-0471-8285 - first_name: Lukas full_name: Hörmayer, Lukas id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87 last_name: Hörmayer orcid: 0000-0001-8295-2926 - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Maria Mar full_name: Marques-Bueno, Maria Mar last_name: Marques-Bueno - first_name: Zainab full_name: Quddoos, Zainab id: 32ff3c64-04a0-11f0-a50f-d0c45bfac466 last_name: Quddoos - first_name: Gergely full_name: Molnar, Gergely id: 34F1AF46-F248-11E8-B48F-1D18A9856A87 last_name: Molnar - first_name: Tongda full_name: Xu, Tongda last_name: Xu - first_name: Ivan full_name: Kulich, Ivan id: 57a1567c-8314-11eb-9063-c9ddc3451a54 last_name: Kulich - first_name: Yvon full_name: Jaillais, Yvon last_name: Jaillais - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Rodriguez Solovey L, Fiedler L, Zou M, et al. ABP1/ABL3-TMK1 cell-surface auxin signaling directly targets PIN2-mediated auxin fluxes for root gravitropism. bioRxiv. doi:10.1101/2022.11.30.518503 apa: Rodriguez Solovey, L., Fiedler, L., Zou, M., Giannini, C., Monzer, A., Vladimirtsev, D., … Friml, J. (n.d.). ABP1/ABL3-TMK1 cell-surface auxin signaling directly targets PIN2-mediated auxin fluxes for root gravitropism. bioRxiv. https://doi.org/10.1101/2022.11.30.518503 chicago: Rodriguez Solovey, Lesia, Lukas Fiedler, Minxia Zou, Caterina Giannini, Aline Monzer, Dmitrii Vladimirtsev, Marek Randuch, et al. “ABP1/ABL3-TMK1 Cell-Surface Auxin Signaling Directly Targets PIN2-Mediated Auxin Fluxes for Root Gravitropism.” BioRxiv, n.d. https://doi.org/10.1101/2022.11.30.518503. ieee: L. Rodriguez Solovey et al., “ABP1/ABL3-TMK1 cell-surface auxin signaling directly targets PIN2-mediated auxin fluxes for root gravitropism,” bioRxiv. . ista: Rodriguez Solovey L, Fiedler L, Zou M, Giannini C, Monzer A, Vladimirtsev D, Randuch M, Yu Y, Gelová Z, Verstraeten I, Hajny J, Chen M, Tan S, Hörmayer L, Li L, Marques-Bueno MM, Quddoos Z, Molnar G, Xu T, Kulich I, Jaillais Y, Friml J. ABP1/ABL3-TMK1 cell-surface auxin signaling directly targets PIN2-mediated auxin fluxes for root gravitropism. bioRxiv, 10.1101/2022.11.30.518503. mla: Rodriguez Solovey, Lesia, et al. “ABP1/ABL3-TMK1 Cell-Surface Auxin Signaling Directly Targets PIN2-Mediated Auxin Fluxes for Root Gravitropism.” BioRxiv, doi:10.1101/2022.11.30.518503. short: L. Rodriguez Solovey, L. Fiedler, M. Zou, C. Giannini, A. Monzer, D. Vladimirtsev, M. Randuch, Y. Yu, Z. Gelová, I. Verstraeten, J. Hajny, M. Chen, S. Tan, L. Hörmayer, L. Li, M.M. Marques-Bueno, Z. Quddoos, G. Molnar, T. Xu, I. Kulich, Y. Jaillais, J. Friml, BioRxiv (n.d.). corr_author: '1' das_tickbox: '1' date_created: 2025-03-13T08:36:48Z date_published: 2025-02-20T00:00:00Z date_updated: 2026-07-06T12:51:14Z day: '20' ddc: - '580' department: - _id: JiFr - _id: XiFe doi: 10.1101/2022.11.30.518503 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/2022.11.30.518503 month: '02' oa: 1 oa_version: Published Version project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 26060676-B435-11E9-9278-68D0E5697425 grant_number: ALTF 985-2016 name: Cell surface receptor complexes for auxin signaling in plants publication: bioRxiv publication_status: draft related_material: record: - id: '20656' relation: later_version status: public - id: '19395' relation: dissertation_contains status: public - id: '20364' relation: dissertation_contains status: public status: public title: ABP1/ABL3-TMK1 cell-surface auxin signaling directly targets PIN2-mediated auxin fluxes for root gravitropism type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '20364' acknowledged_ssus: - _id: LifeSc - _id: Bio acknowledgement: "Plant Facility,\r\nProtein Service Facility" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Caterina full_name: Giannini, Caterina id: e3fdddd5-f6e0-11ea-865d-ca99ee6367f4 last_name: Giannini citation: ama: Giannini C. Nuclear and cell surface auxin signaling in A. thaliana developmental transitions. 2025. doi:10.15479/AT-ISTA-20364 apa: Giannini, C. (2025). Nuclear and cell surface auxin signaling in A. thaliana developmental transitions. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20364 chicago: Giannini, Caterina. “Nuclear and Cell Surface Auxin Signaling in A. Thaliana Developmental Transitions.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20364. ieee: C. Giannini, “Nuclear and cell surface auxin signaling in A. thaliana developmental transitions,” Institute of Science and Technology Austria, 2025. ista: Giannini C. 2025. Nuclear and cell surface auxin signaling in A. thaliana developmental transitions. Institute of Science and Technology Austria. mla: Giannini, Caterina. Nuclear and Cell Surface Auxin Signaling in A. Thaliana Developmental Transitions. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20364. short: C. Giannini, Nuclear and Cell Surface Auxin Signaling in A. Thaliana Developmental Transitions, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-09-19T12:23:38Z date_published: 2025-09-19T00:00:00Z date_updated: 2026-07-06T12:51:13Z day: '19' ddc: - '580' degree_awarded: PhD department: - _id: GradSch - _id: JiFr - _id: MaLo doi: 10.15479/AT-ISTA-20364 file: - access_level: closed checksum: 536ba1701453b0b2346be14c046b2911 content_type: application/pdf creator: cgiannin date_created: 2025-09-24T14:46:34Z date_updated: 2025-09-30T14:31:29Z embargo: 2026-09-30 embargo_to: open_access file_id: '20390' file_name: 2025_Giannini_Caterina_Thesis...pdf file_size: 14278965 relation: main_file - access_level: closed checksum: 192f55262f2da2ea0a59d9c23a1b8573 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cgiannin date_created: 2025-09-24T14:46:35Z date_updated: 2025-09-24T14:46:35Z file_id: '20391' file_name: 2025_Giannini_Caterina_Thesis...docx file_size: 24499022 relation: source_file file_date_updated: 2025-09-30T14:31:29Z has_accepted_license: '1' keyword: - Auxin Signaling - Plant Development language: - iso: eng month: '09' oa_version: Published Version page: '151' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12291' relation: part_of_dissertation status: public - id: '19399' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: Nuclear and cell surface auxin signaling in A. thaliana developmental transitions type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '20441' abstract: - lang: eng text: "Epithelial spreading plays a pivotal role in the development of organisms especially those\r\nsuch as zebrafish which require the epithelial enveloping layer (EVL) to spread to cover the\r\nsubstantial yolk surface during gastrulation. Epiboly requires the transition of the epithelium\r\nwith cuboidal cells to form a thin, flat squamous epithelial sheet. During this transition, the\r\ncells show tissue-scale mechanosensation with mechanisms such as direct mechanical control\r\nover the axis of cell division.\r\nCytoskeletal intermediate filaments play a crucial role in vertebrate cells, not only facilitating\r\nmechanical stability but also helping facilitate the mechanosensitive response of the cell.\r\nMechanosenstivity displayed by intermediate filaments is due not just to their interesting\r\nphysical properties but also to their interactions with other cytoskeletal elements such as actin\r\nand microtubules. Keratin is the predominant intermediate filament expressed in the EVL.\r\nIt expresses concomitantly with the gastrulation movements of the developing embryo. Our\r\nwork focuses on understanding the role and dynamics of the keratin cytoskeletal network in\r\nmodulating the physical aspects of EVL spreading. We demonstrated with the combination of\r\nphysical characterisation and manipulations of the EVL, utilising a variety of biophysical tools\r\nand microscopy, the mechanistic role of keratin in tissue spreading.\r\nGenerating novel genetic morphants and mutants, we probe the effect that the loss of the\r\nkeratin network has on the physiology of the epithelium and the developing embryo. We\r\nshow that the changing organisation of the keratin network is important for changing EVL\r\nphysical properties as the stress imposed on the EVL increases during epiboly. By modelling\r\nthe epithelium, we study how the mechanical heterogeneity in an epithelium can feed back into\r\na mechanical loop to the maturation of the keratin network and hence affect the mechanics\r\nof the epithelium. However, unlike what would be predicted by the effect of intermediate\r\nfilaments in acting as a security belt and increasing the resistance of the epithelium, we observe\r\nthat loss of keratin leads to a delay in the EVL movement. Using both local aspirations of the\r\nYSL and EVL ablations, we demonstrate the mechanistic facilitation of actin mechanosensation\r\nin a keratin-dependent manner.\r\nFurthermore, using chemical inhibitors of microtubule polymerisation, we provide insight into\r\nthe mechanisms underlying the organisation and distribution of keratin. Interestingly, the\r\nphenotype observed upon this loss of microtubules shows that keratins interact with the nucleus\r\nthrough microtubular interactions. Together with these diverse observations, we describe\r\nthe mechanosensory feedback between resilience and that is critical for uniform and robust\r\nspreading of the epithelium." acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: "I would also like to thank the LSF and Cryo facility at ISTA, which have been helpful in my\r\nexperiments. I would also like to acknowledge FWF, grant DOI 10.55776/PAT5044023 and JKU Nanocell grant DOI \r\n10.55776/W1250 for providing funding for my PhD research. EMBO and FWF for providing funding for travel grants to attend conferences." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Suyash full_name: Naik, Suyash id: 2C0B105C-F248-11E8-B48F-1D18A9856A87 last_name: Naik orcid: 0000-0001-8421-5508 citation: ama: Naik S. Keratins act as global coordinators of tissue spreading through mechanosensitive feedback. 2025. doi:10.15479/AT-ISTA-20441 apa: Naik, S. (2025). Keratins act as global coordinators of tissue spreading through mechanosensitive feedback. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20441 chicago: Naik, Suyash. “Keratins Act as Global Coordinators of Tissue Spreading through Mechanosensitive Feedback.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20441. ieee: S. Naik, “Keratins act as global coordinators of tissue spreading through mechanosensitive feedback,” Institute of Science and Technology Austria, 2025. ista: Naik S. 2025. Keratins act as global coordinators of tissue spreading through mechanosensitive feedback. Institute of Science and Technology Austria. mla: Naik, Suyash. Keratins Act as Global Coordinators of Tissue Spreading through Mechanosensitive Feedback. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20441. short: S. Naik, Keratins Act as Global Coordinators of Tissue Spreading through Mechanosensitive Feedback, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-10-10T14:58:30Z date_published: 2025-10-12T00:00:00Z date_updated: 2026-07-06T12:51:41Z day: '12' ddc: - '596' - '597' - '532' degree_awarded: PhD department: - _id: GradSch - _id: CaHe - _id: EdHa doi: 10.15479/AT-ISTA-20441 file: - access_level: open_access checksum: 2892f04d4a5c18677871c3e06ac1244a content_type: application/pdf creator: snaik date_created: 2025-10-28T13:10:08Z date_updated: 2025-10-28T13:10:08Z file_id: '20567' file_name: Thesis_PDFA_.pdf file_size: 6846189 relation: main_file success: 1 - access_level: open_access checksum: 15934d4465cd0e9b7c32678da9a33a2f content_type: application/zip creator: snaik date_created: 2025-10-28T13:10:26Z date_updated: 2025-10-28T13:10:26Z file_id: '20568' file_name: Thesis.zip file_size: 8839300 relation: source_file file_date_updated: 2025-10-28T13:10:26Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-sa/4.0/ month: '10' oa: 1 oa_version: Published Version page: '105' project: - _id: 8f060199-16d5-11f0-9cad-f3253b266c46 grant_number: PAT 5044023 name: Keratins in epithelial tissue spreading - _id: 25AA5F24-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W 1250-B20 name: Nano-Analytics of Cellular Systems publication_identifier: isbn: - 978-3-99078-069-5 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20465' relation: part_of_dissertation status: public status: public supervisor: - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 title: Keratins act as global coordinators of tissue spreading through mechanosensitive feedback tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '19395' abstract: - lang: eng text: "Plant growth and development rely significantly on phytohormones, with auxin serving as a master regulator, orchestrating processes from embryogenesis to organogenesis, vascular patterning, and environmental adaptation. Since its conceptual proposition by Charles Darwin in 1880 as an endogenous chemical signal influencing phototropism in grass, auxin has captivated scientists seeking to understand how such a small molecule exerts a profound influence on plant development.\r\nOne particularly fascinating aspect of auxin function is its ability to self-organize its transport. Through a feedback mechanism between auxin perception and directional transport—primarily mediated by PIN auxin transporters—auxin establishes narrow transport channels. This phenomenon, known as auxin canalization, is fundamental to vascular formation, regeneration, and other key developmental processes. Despite advances in our understanding, driven by experimental studies and computational models, auxin canalization remains an enigma, with many unanswered questions.\r\nLike other hormones, auxin functions through intricate signaling pathways. It operates through at least two distinct signaling mechanisms: the well-characterized canonical pathway and the less understood non-canonical pathway. While significant progress has been made in elucidating the canonical pathway, the non-canonical mechanisms remain less defined and require further investigation.\r\nIn this study, we revisit the non-canonical auxin signaling pathway mediated by the cell-surface complex Auxin Binding Protein 1-Transmembrane Kinase 1 (ABP1-TMK1), with a particular focus on its downstream phosphorylation events. We reveal that this auxin-mediated phosphorylation is conserved across the green lineage, underscoring its fundamental role in plant development. We explore key phosphorylation targets, particularly PIN2, which is essential for root gravitropism. To further understand TMK1’s role in diverse developmental processes, we identified and investigated its interactors as potential co-receptors or regulatory components within its signaling network.\r\nGiven the previously established role of ABP1-TMK1 in auxin canalization, we sought to further investigate this process and identified several TMK1 interactors also involved in this intricate mechanism.\r\nThese findings provide new insights into the complex regulation of auxin canalization, highlighting a broader and more interconnected signaling framework than previously understood." acknowledged_ssus: - _id: LifeSc - _id: Bio acknowledgement: I would like to acknowledge the facilities at ISTA, particularly LSF, IOF, and, of course, the plant facility, for providing the necessary resources for my research. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Aline full_name: Monzer, Aline id: 2DB5D88C-D7B3-11E9-B8FD-7907E6697425 last_name: Monzer citation: ama: 'Monzer A. Cell-Surface Auxin Signaling: Linking molecular pathways to plant development. 2025. doi:10.15479/AT-ISTA-19395' apa: 'Monzer, A. (2025). Cell-Surface Auxin Signaling: Linking molecular pathways to plant development. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19395' chicago: 'Monzer, Aline. “Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19395.' ieee: 'A. Monzer, “Cell-Surface Auxin Signaling: Linking molecular pathways to plant development,” Institute of Science and Technology Austria, 2025.' ista: 'Monzer A. 2025. Cell-Surface Auxin Signaling: Linking molecular pathways to plant development. Institute of Science and Technology Austria.' mla: 'Monzer, Aline. Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19395.' short: 'A. Monzer, Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-03-12T14:25:42Z date_published: 2025-03-13T00:00:00Z date_updated: 2026-07-06T12:52:09Z day: '13' ddc: - '580' degree_awarded: PhD department: - _id: GradSch - _id: JiFr doi: 10.15479/AT-ISTA-19395 file: - access_level: open_access checksum: 9a3dd03bb4ec6b9907a325c3c4e8a1d7 content_type: application/pdf creator: amonzer date_created: 2025-03-12T14:14:49Z date_updated: 2025-03-12T14:14:49Z file_id: '19396' file_name: Final Thesis Aline Monzer.pdf file_size: 13119670 relation: main_file success: 1 - access_level: closed checksum: a353ce1ee2eabce37bca35499e76dbf1 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: amonzer date_created: 2025-03-12T14:15:19Z date_updated: 2025-04-01T07:55:27Z file_id: '19397' file_name: Thesis Aline.docx file_size: 13774837 relation: source_file file_date_updated: 2025-04-01T07:55:27Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '160' publication_identifier: eisbn: - 978-3-99078-054-1 eissn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12291' relation: part_of_dissertation status: public - id: '14826' relation: part_of_dissertation status: public - id: '19399' relation: part_of_dissertation status: public - id: '19398' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: 'Cell-Surface Auxin Signaling: Linking molecular pathways to plant development' type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: repository OA_type: green _id: '19398' abstract: - lang: eng text: Receptor-like kinases (RLKs), particularly the Transmembrane Kinase (TMK) family, play essential roles in signaling and development, with TMKs being key components of auxin perception and downstream phosphorylation events. While TMKs’ involvement in auxin canalization, a process essential for vasculature formation and regeneration, has been established, nonetheless, the additional signaling and regulatory partners remain poorly understood. In this study, we identify and characterize seven leucine-rich repeat RLKs (TINT1–TINT7) as novel interactors of TMK1, revealing their diverse evolutionary, structural, and functional characteristics. Our results show that TINTs interact with TMK1 and highlight their roles in regulating various developmental processes. Majority of TINTs contributes, together with TMK1, to auxin canalization, with TINT5 linking TMK1 to other canalization component CAMEL. Beyond canalization, we also establish the role of TINT-TMK1 interactions in processes such as stomatal movement and the hypocotyl’s gravitropic response. These findings suggest that TINTs, through their interaction with TMK1, are integral components of various signaling networks, contributing to both auxin canalization and broader plant development. acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: We deeply appreciate M. Wrzaczek’s constructive input and insightful discussions, which significantly enriched this work. We thank L. Fiedler for helping with the heat map and for the discussions. We also thank the facilities at ISTA, the imaging and optics (IOF) and Lab Support (LSF) facilities for their service and assistance. article_processing_charge: No author: - first_name: Aline full_name: Monzer, Aline id: 2DB5D88C-D7B3-11E9-B8FD-7907E6697425 last_name: Monzer - first_name: Ewa full_name: Mazur, Ewa last_name: Mazur - first_name: Lesia full_name: Rodriguez Solovey, Lesia id: 3922B506-F248-11E8-B48F-1D18A9856A87 last_name: Rodriguez Solovey orcid: 0000-0002-7244-7237 - first_name: Michelle C full_name: Gallei, Michelle C id: 35A03822-F248-11E8-B48F-1D18A9856A87 last_name: Gallei orcid: 0000-0003-1286-7368 - first_name: Minxia full_name: Zou, Minxia id: 5c243f41-03f3-11ec-841c-96faf48a7ef9 last_name: Zou - first_name: Michael full_name: Smejkal, Michael id: 79a5a1be-04a3-11f0-ba18-a1730e0b58e9 last_name: Smejkal - first_name: Ema full_name: Cervenova, Ema id: 9f185b95-04a3-11f0-8245-f5e32eeb470f last_name: Cervenova - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Monzer A, Mazur E, Rodriguez Solovey L, et al. TMK interacting network of receptor like kinases for auxin canalization and beyond. bioRxiv. doi:10.1101/2025.02.28.640727 apa: Monzer, A., Mazur, E., Rodriguez Solovey, L., Gallei, M. C., Zou, M., Smejkal, M., … Friml, J. (n.d.). TMK interacting network of receptor like kinases for auxin canalization and beyond. bioRxiv. https://doi.org/10.1101/2025.02.28.640727 chicago: Monzer, Aline, Ewa Mazur, Lesia Rodriguez Solovey, Michelle C Gallei, Minxia Zou, Michael Smejkal, Ema Cervenova, and Jiří Friml. “TMK Interacting Network of Receptor like Kinases for Auxin Canalization and Beyond.” BioRxiv, n.d. https://doi.org/10.1101/2025.02.28.640727. ieee: A. Monzer et al., “TMK interacting network of receptor like kinases for auxin canalization and beyond,” bioRxiv. . ista: Monzer A, Mazur E, Rodriguez Solovey L, Gallei MC, Zou M, Smejkal M, Cervenova E, Friml J. TMK interacting network of receptor like kinases for auxin canalization and beyond. bioRxiv, 10.1101/2025.02.28.640727. mla: Monzer, Aline, et al. “TMK Interacting Network of Receptor like Kinases for Auxin Canalization and Beyond.” BioRxiv, doi:10.1101/2025.02.28.640727. short: A. Monzer, E. Mazur, L. Rodriguez Solovey, M.C. Gallei, M. Zou, M. Smejkal, E. Cervenova, J. Friml, BioRxiv (n.d.). corr_author: '1' das_tickbox: '1' date_created: 2025-03-12T14:28:53Z date_published: 2025-03-02T00:00:00Z date_updated: 2026-07-06T12:52:09Z day: '02' ddc: - '580' department: - _id: GradSch - _id: JiFr - _id: EvBe doi: 10.1101/2025.02.28.640727 has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ main_file_link: - open_access: '1' url: https://doi.org/10.1101/2025.02.28.640727 month: '03' oa: 1 oa_version: Published Version publication: bioRxiv publication_status: draft related_material: record: - id: '19395' relation: dissertation_contains status: public status: public title: TMK interacting network of receptor like kinases for auxin canalization and beyond tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '19478' acknowledged_ssus: - _id: Bio - _id: LifeSc acknowledgement: "This project was funded by the European Research Council Advanced Grant (ETAP-742985),\r\nEuropean Research Council (ERC; 101142681 CYNIPS), Austrian Science Fund (FWF; P\r\n37051-B)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Huihuang full_name: Chen, Huihuang id: 83c96512-15b2-11ec-abd3-b7eede36184f last_name: Chen citation: ama: Chen H. The cAMP second messenger in auxin signalling. 2025. doi:10.15479/AT-ISTA-19478 apa: Chen, H. (2025). The cAMP second messenger in auxin signalling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19478 chicago: Chen, Huihuang. “The CAMP Second Messenger in Auxin Signalling.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19478. ieee: H. Chen, “The cAMP second messenger in auxin signalling,” Institute of Science and Technology Austria, 2025. ista: Chen H. 2025. The cAMP second messenger in auxin signalling. Institute of Science and Technology Austria. mla: Chen, Huihuang. The CAMP Second Messenger in Auxin Signalling. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19478. short: H. Chen, The CAMP Second Messenger in Auxin Signalling, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-04-04T07:48:24Z date_published: 2025-04-04T00:00:00Z date_updated: 2026-07-06T12:58:58Z day: '04' ddc: - '580' degree_awarded: PhD department: - _id: GradSch - _id: JiFr doi: 10.15479/AT-ISTA-19478 ec_funded: 1 file: - access_level: closed checksum: b154973663a1bba505683faab7ae5ead content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: hchen date_created: 2025-04-08T08:00:07Z date_updated: 2025-04-08T08:22:37Z file_id: '19526' file_name: Thesis_0403_Huihuang.docx file_size: 16344814 relation: source_file - access_level: closed checksum: 0099565f024388830c125ec17375c1a0 content_type: application/pdf creator: hchen date_created: 2025-04-08T08:00:06Z date_updated: 2025-04-09T13:53:38Z embargo: 2026-10-08 embargo_to: local file_id: '19527' file_name: Thesis_0406_PDFA_Huihuang_1.pdf file_size: 8482147 relation: main_file file_date_updated: 2025-04-09T13:53:38Z has_accepted_license: '1' language: - iso: eng month: '04' oa_version: Published Version page: '118' project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 7bcece63-9f16-11ee-852c-ae94e099eeb6 grant_number: P37051 name: Guanylate cyclase activity of TIR1/AFBs auxin receptors - _id: 8f347782-16d5-11f0-9cad-8c19706ee739 grant_number: '101142681' name: Cyclic nucleotides as second messengers in plants publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '19421' relation: part_of_dissertation status: public - id: '13212' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: The cAMP second messenger in auxin signalling type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '20920' abstract: - lang: eng 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Charlotte full_name: Hoffmann, Charlotte id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7 last_name: Hoffmann orcid: 0000-0003-2027-5549 citation: ama: Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi:10.15479/AT-ISTA-20920 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. ieee: C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute of Science and Technology Austria, 2025. ista: Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute of Science and Technology Austria. mla: Hoffmann, Charlotte. Theory and Applications of Verifiable Delay Functions. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20920. short: C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2026-01-02T10:46:47Z date_published: 2025-12-31T00:00:00Z date_updated: 2026-07-06T13:15:27Z day: '31' ddc: - '004' degree_awarded: PhD department: - _id: GradSch - _id: KrPi doi: 10.15479/AT-ISTA-20920 file: - access_level: closed checksum: 8a099fbf54963bd0be38f7ce73658682 content_type: application/x-zip-compressed creator: choffman date_created: 2026-01-02T10:39:16Z date_updated: 2026-01-02T10:39:16Z file_id: '20921' file_name: 2025_Hoffmann_Charlotte_Source.zip file_size: 8355494 relation: source_file - access_level: open_access checksum: 9521c07bfb2bb5b14a49c09fcfc96474 content_type: application/pdf creator: choffman date_created: 2026-01-02T10:39:26Z date_updated: 2026-01-02T10:39:26Z file_id: '20922' file_name: 2025_Hoffmann_Charlotte_Thesis.pdf file_size: 2258804 relation: main_file success: 1 file_date_updated: 2026-01-02T10:39:26Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '12' oa: 1 oa_version: Published Version page: '116' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13143' relation: part_of_dissertation status: public - id: '12176' relation: part_of_dissertation status: public - id: '20556' relation: earlier_version status: public - id: '19778' relation: part_of_dissertation status: public - id: '20701' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: Theory and applications of verifiable delay functions tmp: image: /images/cc_by_nc_sa.png 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) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '20556' abstract: - lang: eng 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Charlotte full_name: Hoffmann, Charlotte id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7 last_name: Hoffmann orcid: 0000-0003-2027-5549 citation: ama: Hoffmann C. Theory and applications of verifiable delay functions. 2025. doi: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 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. ieee: C. Hoffmann, “Theory and applications of verifiable delay functions,” Institute of Science and Technology Austria, 2025. ista: Hoffmann C. 2025. Theory and applications of verifiable delay functions. Institute of Science and Technology Austria. mla: Hoffmann, Charlotte. Theory and Applications of Verifiable Delay Functions. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20556. short: C. Hoffmann, Theory and Applications of Verifiable Delay Functions, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-10-27T14:16:56Z date_published: 2025-10-31T00:00:00Z date_updated: 2026-07-06T13:15:27Z day: '31' ddc: - '004' degree_awarded: PhD department: - _id: GradSch - _id: KrPi doi: 10.15479/AT-ISTA-20556 file: - access_level: closed checksum: 1fffa4e2c33dd0b9f883d615504a2858 content_type: application/pdf creator: choffman date_created: 2025-10-28T14:33:03Z date_updated: 2026-01-08T14:11:39Z file_id: '20573' file_name: 2025_Hoffmann_Charlotte_Thesis.pdf file_size: 2259304 relation: main_file - access_level: closed checksum: 076ea98a1f0a86c3bbc990b6b9460dc2 content_type: application/x-zip-compressed creator: choffman date_created: 2025-10-28T14:35:06Z date_updated: 2025-11-11T09:34:54Z file_id: '20574' file_name: 2025_Hoffmann_Charlotte_Source.zip file_size: 9987633 relation: source_file file_date_updated: 2026-01-08T14:11:39Z has_accepted_license: '1' language: - iso: eng month: '10' oa_version: Published Version page: '116' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13143' relation: part_of_dissertation status: public - id: '12176' relation: part_of_dissertation status: public - id: '20920' relation: later_version status: public - id: '19778' relation: part_of_dissertation status: public - id: '20701' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: Theory and applications of verifiable delay functions tmp: image: /images/cc_by_nc_sa.png 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) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: repository OA_type: green _id: '10011' 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. 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_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tim full_name: Laux, Tim last_name: Laux citation: 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' 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.' 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.' short: S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 209–268. corr_author: '1' das_tickbox: '1' date_created: 2021-09-13T12:17:10Z date_published: 2025-05-01T00:00:00Z date_updated: 2026-07-06T13:37:21Z day: '01' department: - _id: JuFi doi: 10.4310/jdg/1747065796 ec_funded: 1 external_id: arxiv: - '2109.04233' intvolume: ' 130' keyword: - Mean curvature flow - gradient flows - varifolds - weak solutions - weak-strong uniqueness - calibrated geometry - gradient-flow calibrations language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2109.04233 month: '05' oa: 1 oa_version: Preprint page: 209-268 project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication: Journal of Differential Geometry publication_identifier: eissn: - 1945-743X issn: - 0022-040X publication_status: published publisher: International Press of Boston quality_controlled: '1' scopus_import: '1' status: public title: 'A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 130 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20668' abstract: - lang: eng 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." 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. article_processing_charge: No author: - first_name: Keitaro full_name: Hashimoto, Keitaro last_name: Hashimoto - first_name: Shuichi full_name: Katsumata, Shuichi last_name: Katsumata - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X citation: 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.' 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.' 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.' 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.' 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.' short: K. Hashimoto, S. Katsumata, G. Pascual Perez, in:, 34th Usenix Security Symposium, Usenix Association, 2025, pp. 6699–6716. conference: end_date: 2025-08-15 location: Seattle, WA, USA name: 'USENIX: Security Symposium' start_date: 2025-08-13 corr_author: '1' cryptoeprintid: 1 das_tickbox: '1' date_created: 2025-11-23T23:01:40Z date_published: 2025-01-01T00:00:00Z date_updated: 2026-07-07T06:02:03Z day: '01' ddc: - '000' ec_funded: 1 external_id: cryptoeprintid: - 2025/426 file: - access_level: open_access checksum: fcfe8851aeb751af98c0b1335a0ef149 content_type: application/pdf creator: dernst date_created: 2025-11-24T07:44:08Z date_updated: 2025-11-24T07:44:08Z file_id: '20671' file_name: 2025_Usenix_Hashimoto.pdf file_size: 710733 relation: main_file success: 1 file_date_updated: 2025-11-24T07:44:08Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2025/426 month: '01' oa: 1 oa_version: Published Version page: 6699-6716 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: 34th Usenix Security Symposium publication_identifier: isbn: - '9781939133526' publication_status: published publisher: Usenix Association quality_controlled: '1' scopus_import: '1' status: public title: 'Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: gold _id: '20004' abstract: - lang: eng 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." alternative_title: - LIPIcs article_number: '75' article_processing_charge: Yes arxiv: 1 author: - first_name: Elizaveta full_name: Streltsova, Elizaveta id: 57a170da-dc96-11ea-b7c8-ab3565071bf7 last_name: Streltsova - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: 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' 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.' 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.' 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.' short: E. Streltsova, U. Wagner, in:, 41st International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. conference: end_date: 2025-06-27 location: Kanazawa, Japan name: 'SoCG: Symposium on Computational Geometry' start_date: 2025-06-23 corr_author: '1' das_tickbox: '1' date_created: 2025-07-13T22:01:22Z date_published: 2025-06-20T00:00:00Z date_updated: 2026-07-07T13:03:16Z day: '20' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2025.75 external_id: arxiv: - '2504.07752' - '2504.07770' file: - access_level: open_access checksum: a8f7feb1aa3b896e31195841a989d622 content_type: application/pdf creator: dernst date_created: 2025-07-14T07:11:04Z date_updated: 2025-07-14T07:11:04Z file_id: '20015' file_name: 2025_LIPIcs.SoCG_Streltsova.pdf file_size: 952807 relation: main_file success: 1 file_date_updated: 2025-07-14T07:11:04Z has_accepted_license: '1' intvolume: ' 332' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 41st International Symposium on Computational Geometry publication_identifier: eissn: - 1868-8969 isbn: - '9783959773706' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 332 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19733' abstract: - lang: eng 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. 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). article_number: L050402 article_processing_charge: No article_type: letter_note arxiv: 1 author: - first_name: Daniel full_name: Kun, Daniel last_name: Kun - first_name: Karl T full_name: Strömberg, Karl T id: 68011cd2-da32-11ee-a930-b2774c7aba5f last_name: Strömberg - first_name: Michele full_name: Spagnolo, Michele last_name: Spagnolo - first_name: Borivoje full_name: Dakić, Borivoje last_name: Dakić - first_name: Lee A. full_name: Rozema, Lee A. last_name: Rozema - first_name: Philip full_name: Walther, Philip last_name: Walther citation: 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 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. 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. 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). das_tickbox: '1' dataavailabilitystatement: Data that support the findings of this study are openly available at Zenodo. date_created: 2025-05-25T22:16:54Z date_published: 2025-05-16T00:00:00Z date_updated: 2026-07-07T14:05:51Z day: '16' ddc: - '530' department: - _id: OnHo doi: 10.1103/PhysRevA.111.L050402 external_id: arxiv: - '2405.08065' isi: - '001501941500006' file: - access_level: open_access checksum: b83295a8f597b7781d8e7bfa3b393b42 content_type: application/pdf creator: dernst date_created: 2025-05-28T09:16:03Z date_updated: 2025-05-28T09:16:03Z file_id: '19755' file_name: 2025_PhysReviewA_Kun.pdf file_size: 571784 relation: main_file success: 1 file_date_updated: 2025-05-28T09:16:03Z has_accepted_license: '1' intvolume: ' 111' isi: 1 issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version publication: Physical Review A publication_identifier: eissn: - 2469-9934 issn: - 2469-9926 publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: record: - id: '22142' relation: research_data status: public researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Direct and efficient detection of quantum superposition tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d volume: 111 year: '2025' ... --- OA_place: repository OA_type: green _id: '22142' abstract: - lang: eng 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." article_processing_charge: No author: - first_name: Daniel full_name: Kun, Daniel last_name: Kun 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. ista: Kun D. 2025. Direct And Efficient Detection of Quantum Superposition - Data and Figures, Zenodo, 10.5281/zenodo.13375452. mla: Kun, Daniel. Direct And Efficient Detection of Quantum Superposition - Data and Figures. Zenodo, 2025, doi:10.5281/zenodo.13375452. short: D. Kun, (2025). contributor: - contributor_type: researcher first_name: Lee last_name: Rozema - contributor_type: researcher first_name: Teodor last_name: Stroemberg - contributor_type: supervisor first_name: Philip last_name: Walther - contributor_type: supervisor first_name: Borivoje last_name: Dakic date_created: 2026-06-25T11:08:53Z date_published: 2025-04-24T00:00:00Z date_updated: 2026-07-07T14:05:51Z day: '24' ddc: - '530' department: - _id: OnHo doi: 10.5281/zenodo.13375452 main_file_link: - open_access: '1' url: https://doi.org/10.5281/zenodo.13375452 month: '4' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '19733' relation: used_in_publication status: public status: public title: Direct And Efficient Detection of Quantum Superposition - Data and Figures type: research_data_reference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 year: '2025' ... --- OA_place: repository OA_type: green _id: '22155' abstract: - lang: eng text: "The canonical Ramsey theorem of Erdős and Rado implies that for any graph \U0001D43B, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph \U0001D43E\U0001D441 contains a monochromatic, lexicographic, or rainbow copy of \U0001D43B. The least such \U0001D441 is called the Erdős–Rado number of \U0001D43B, denoted by \U0001D438⁢\U0001D445⁡(\U0001D43B). 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 \U0001D43B has bounded degree, then \U0001D438⁢\U0001D445⁡(\U0001D43B) is polynomial in |\U0001D449⁡(\U0001D43B)| if \U0001D43B 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 \U0001D443\U0001D461, we study the minimum \U0001D441 such that every edge-coloring of \U0001D43E\U0001D441 contains a monochromatic copy of S or a rainbow copy of \U0001D443\U0001D461. 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." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Lior full_name: Gishboliner, Lior last_name: Gishboliner - first_name: Aleksa full_name: Milojević, Aleksa last_name: Milojević - first_name: Benny full_name: Sudakov, Benny last_name: Sudakov - first_name: Yuval full_name: Wigderson, Yuval id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5 last_name: Wigderson citation: 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 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 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. 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. 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. date_created: 2026-06-29T10:49:48Z date_published: 2025-09-01T00:00:00Z date_updated: 2026-07-08T07:38:44Z day: '01' doi: 10.1137/24m1714964 extern: '1' external_id: arxiv: - '2410.08644' intvolume: ' 39' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2410.08644 mathsc: - 05D10 month: '09' oa: 1 oa_version: Preprint page: 1491-1519 publication: SIAM Journal on Discrete Mathematics publication_identifier: eissn: - 1095-7146 issn: - 0895-4801 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Canonical Ramsey numbers of sparse graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 39 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '19636' 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_number: '42' article_processing_charge: Yes article_type: review arxiv: 1 author: - first_name: Adam full_name: Abdalla, Adam last_name: Abdalla - first_name: Mahiro full_name: Abe, Mahiro last_name: Abe - first_name: Sven full_name: Abend, Sven last_name: Abend - first_name: Mouine full_name: Abidi, Mouine last_name: Abidi - first_name: Monika full_name: Aidelsburger, Monika last_name: Aidelsburger - first_name: Ashkan full_name: Alibabaei, Ashkan last_name: Alibabaei - first_name: Baptiste full_name: Allard, Baptiste last_name: Allard - first_name: John full_name: Antoniadis, John last_name: Antoniadis - first_name: Gianluigi full_name: Arduini, Gianluigi last_name: Arduini - first_name: Nadja full_name: Augst, Nadja last_name: Augst - first_name: Philippos full_name: Balamatsias, Philippos last_name: Balamatsias - first_name: Antun full_name: Balaž, Antun last_name: Balaž - first_name: Hannah full_name: Banks, Hannah last_name: Banks - first_name: Rachel L. full_name: Barcklay, Rachel L. last_name: Barcklay - first_name: Michele full_name: Barone, Michele last_name: Barone - first_name: Michele full_name: Barsanti, Michele last_name: Barsanti - first_name: Mark G. full_name: Bason, Mark G. last_name: Bason - first_name: Angelo full_name: Bassi, Angelo last_name: Bassi - first_name: Jean Baptiste full_name: Bayle, Jean Baptiste last_name: Bayle - first_name: Charles F.A. full_name: Baynham, Charles F.A. last_name: Baynham - first_name: Quentin full_name: Beaufils, Quentin last_name: Beaufils - first_name: Sélyan full_name: Beldjoudi, Sélyan last_name: Beldjoudi - first_name: Aleksandar full_name: Belić, Aleksandar last_name: Belić - first_name: Shayne full_name: Bennetts, Shayne last_name: Bennetts - first_name: Jose full_name: Bernabeu, Jose last_name: Bernabeu - first_name: Andrea full_name: Bertoldi, Andrea last_name: Bertoldi - first_name: Clara full_name: Bigard, Clara last_name: Bigard - first_name: N. P. full_name: Bigelow, N. P. last_name: Bigelow - first_name: Robert full_name: Bingham, Robert last_name: Bingham - first_name: Diego full_name: Blas, Diego last_name: Blas - first_name: Alexey full_name: Bobrick, Alexey last_name: Bobrick - first_name: Samuel full_name: Boehringer, Samuel last_name: Boehringer - first_name: Aleksandar full_name: Bogojević, Aleksandar last_name: Bogojević - first_name: Kai full_name: Bongs, Kai last_name: Bongs - first_name: Daniela full_name: Bortoletto, Daniela last_name: Bortoletto - first_name: Philippe full_name: Bouyer, Philippe last_name: Bouyer - first_name: Christian full_name: Brand, Christian last_name: Brand - first_name: Oliver full_name: Buchmueller, Oliver last_name: Buchmueller - 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 - first_name: Priscilla full_name: Canizares, Priscilla last_name: Canizares - first_name: Benjamin full_name: Canuel, Benjamin last_name: Canuel - first_name: Ana full_name: Caramete, Ana last_name: Caramete - first_name: Laurentiu Ioan full_name: Caramete, Laurentiu Ioan last_name: Caramete - first_name: Matteo full_name: Carlesso, Matteo last_name: Carlesso - first_name: John full_name: Carlton, John last_name: Carlton - first_name: Samuel P. full_name: Carman, Samuel P. last_name: Carman - first_name: Andrew full_name: Carroll, Andrew last_name: Carroll - first_name: Mateo full_name: Casariego, Mateo last_name: Casariego - first_name: Minoas full_name: Chairetis, Minoas last_name: Chairetis - first_name: Vassilis full_name: Charmandaris, Vassilis last_name: Charmandaris - first_name: Upasna full_name: Chauhan, Upasna last_name: Chauhan - first_name: Jiajun full_name: Chen, Jiajun last_name: Chen - first_name: Maria Luisa Maria Luisa Marilù full_name: Chiofalo, Maria Luisa Maria Luisa Marilù last_name: Chiofalo - first_name: Donatella full_name: Ciampini, Donatella last_name: Ciampini - first_name: Alessia full_name: Cimbri, Alessia last_name: Cimbri - first_name: Pierre full_name: Cladé, Pierre last_name: Cladé - first_name: Jonathon full_name: Coleman, Jonathon last_name: Coleman - first_name: Florin Lucian full_name: Constantin, Florin Lucian last_name: Constantin - first_name: Carlo R. full_name: Contaldi, Carlo R. last_name: Contaldi - first_name: Robin full_name: Corgier, Robin last_name: Corgier - first_name: Bineet full_name: Dash, Bineet last_name: Dash - first_name: G. J. full_name: Davies, G. J. last_name: Davies - first_name: Claudia full_name: De Rham, Claudia last_name: De Rham - first_name: Albert full_name: De Roeck, Albert last_name: De Roeck - first_name: Daniel full_name: Derr, Daniel last_name: Derr - first_name: Soumyodeep full_name: Dey, Soumyodeep last_name: Dey - first_name: Fabio full_name: Di Pumpo, Fabio last_name: Di Pumpo - first_name: Goran S. full_name: Djordjevic, Goran S. last_name: Djordjevic - first_name: Babette full_name: Döbrich, Babette last_name: Döbrich - first_name: Peter full_name: Dornan, Peter last_name: Dornan - first_name: Michael full_name: Doser, Michael last_name: Doser - first_name: Giannis full_name: Drougakis, Giannis last_name: Drougakis - first_name: Jacob full_name: Dunningham, Jacob last_name: Dunningham - first_name: Alisher full_name: Duspayev, Alisher last_name: Duspayev - first_name: Sajan full_name: Easo, Sajan last_name: Easo - first_name: Joshua full_name: Eby, Joshua last_name: Eby - first_name: Maxim full_name: Efremov, Maxim last_name: Efremov - first_name: Gedminas full_name: Elertas, Gedminas last_name: Elertas - first_name: John full_name: Ellis, John last_name: Ellis - first_name: Nicholas full_name: Entin, Nicholas last_name: Entin - first_name: Stephen full_name: Fairhurst, Stephen last_name: Fairhurst - first_name: Mattia full_name: Fanì, Mattia last_name: Fanì - first_name: Farida full_name: Fassi, Farida last_name: Fassi - first_name: Pierre full_name: Fayet, Pierre last_name: Fayet - first_name: Daniel full_name: Felea, Daniel last_name: Felea - first_name: Jie full_name: Feng, Jie last_name: Feng - first_name: Robert full_name: Flack, Robert last_name: Flack - first_name: Chris full_name: Foot, Chris last_name: Foot - first_name: Tim full_name: Freegarde, Tim last_name: Freegarde - first_name: Elina full_name: Fuchs, Elina last_name: Fuchs - first_name: Naceur full_name: Gaaloul, Naceur last_name: Gaaloul - first_name: Dongfeng full_name: Gao, Dongfeng last_name: Gao - first_name: Susan full_name: Gardner, Susan last_name: Gardner - first_name: Barry M. full_name: Garraway, Barry M. last_name: Garraway - first_name: Carlos L. full_name: Garrido Alzar, Carlos L. last_name: Garrido Alzar - first_name: Alexandre full_name: Gauguet, Alexandre last_name: Gauguet - first_name: Enno full_name: Giese, Enno last_name: Giese - first_name: Patrick full_name: Gill, Patrick last_name: Gill - first_name: Gian F. full_name: Giudice, Gian F. last_name: Giudice - first_name: Eric P. full_name: Glasbrenner, Eric P. last_name: Glasbrenner - first_name: Jonah full_name: Glick, Jonah last_name: Glick - first_name: Peter W. full_name: Graham, Peter W. last_name: Graham - first_name: Eduardo full_name: Granados, Eduardo last_name: Granados - first_name: Paul F. full_name: Griffin, Paul F. last_name: Griffin - first_name: Jordan full_name: Gué, Jordan last_name: Gué - first_name: Saïda full_name: Guellati-Khelifa, Saïda last_name: Guellati-Khelifa - first_name: Subhadeep full_name: Gupta, Subhadeep last_name: Gupta - first_name: Vishu full_name: Gupta, Vishu last_name: Gupta - first_name: Lucia full_name: Hackermueller, Lucia last_name: Hackermueller - first_name: Martin full_name: Haehnelt, Martin last_name: Haehnelt - first_name: Timo full_name: Hakulinen, Timo last_name: Hakulinen - first_name: Klemens full_name: Hammerer, Klemens last_name: Hammerer - first_name: Ekim T. full_name: Hanımeli, Ekim T. last_name: Hanımeli - first_name: Tiffany full_name: Harte, Tiffany last_name: Harte - first_name: Sabrina full_name: Hartmann, Sabrina last_name: Hartmann - first_name: Leonie full_name: Hawkins, Leonie last_name: Hawkins - first_name: Aurelien full_name: Hees, Aurelien last_name: Hees - first_name: Alexander full_name: Herbst, Alexander last_name: Herbst - first_name: Thomas M. full_name: Hird, Thomas M. last_name: Hird - first_name: Richard full_name: Hobson, Richard last_name: Hobson - first_name: Jason full_name: Hogan, Jason last_name: Hogan - first_name: Bodil full_name: Holst, Bodil last_name: Holst - first_name: Michael full_name: Holynski, Michael last_name: Holynski - first_name: Onur full_name: Hosten, Onur id: 4C02D85E-F248-11E8-B48F-1D18A9856A87 last_name: Hosten orcid: 0000-0002-2031-204X - first_name: Chung Chuan full_name: Hsu, Chung Chuan last_name: Hsu - first_name: Wayne Cheng Wei full_name: Huang, Wayne Cheng Wei last_name: Huang - first_name: Kenneth M. full_name: Hughes, Kenneth M. last_name: Hughes - first_name: Kamran full_name: Hussain, Kamran last_name: Hussain - first_name: Gert full_name: Hütsi, Gert last_name: Hütsi - first_name: Antonio full_name: Iovino, Antonio last_name: Iovino - first_name: Maria Catalina full_name: Isfan, Maria Catalina last_name: Isfan - first_name: Gregor full_name: Janson, Gregor last_name: Janson - first_name: Peter full_name: Jeglič, Peter last_name: Jeglič - first_name: Philippe full_name: Jetzer, Philippe last_name: Jetzer - first_name: Yijun full_name: Jiang, Yijun last_name: Jiang - first_name: Gediminas full_name: Juzeliūnas, Gediminas last_name: Juzeliūnas - first_name: Wilhelm full_name: Kaenders, Wilhelm last_name: Kaenders - first_name: Matti full_name: Kalliokoski, Matti last_name: Kalliokoski - first_name: Alex full_name: Kehagias, Alex last_name: Kehagias - first_name: Eva full_name: Kilian, Eva last_name: Kilian - first_name: Carsten full_name: Klempt, Carsten last_name: Klempt - first_name: Peter full_name: Knight, Peter last_name: Knight - first_name: Soumen full_name: Koley, Soumen last_name: Koley - first_name: Bernd full_name: Konrad, Bernd last_name: Konrad - first_name: Tim full_name: Kovachy, Tim last_name: Kovachy - 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 - first_name: Shau Yu full_name: Lan, Shau Yu last_name: Lan - first_name: Arnaud full_name: Landragin, Arnaud last_name: Landragin - first_name: Greg full_name: Landsberg, Greg last_name: Landsberg - first_name: Mehdi full_name: Langlois, Mehdi last_name: Langlois - first_name: Bryony full_name: Lanigan, Bryony last_name: Lanigan - first_name: Bruno full_name: Leone, Bruno last_name: Leone - first_name: Christophe full_name: Le Poncin-Lafitte, Christophe last_name: Le Poncin-Lafitte - first_name: Samuel full_name: Lellouch, Samuel last_name: Lellouch - first_name: Marek full_name: Lewicki, Marek last_name: Lewicki - first_name: Yu Hung full_name: Lien, Yu Hung last_name: Lien - first_name: Lucas full_name: Lombriser, Lucas last_name: Lombriser - first_name: Elias Lopez full_name: Asamar, Elias Lopez last_name: Asamar - first_name: J. Luis full_name: Lopez-Gonzalez, J. Luis last_name: Lopez-Gonzalez - first_name: Chen full_name: Lu, Chen last_name: Lu - first_name: Giuseppe Gaetano full_name: Luciano, Giuseppe Gaetano last_name: Luciano - first_name: Nathan full_name: Lundblad, Nathan last_name: Lundblad - first_name: Cristian full_name: De J. López Monjaraz, Cristian last_name: De J. López Monjaraz - first_name: Adam full_name: Lowe, Adam last_name: Lowe - first_name: Mažena full_name: Mackoit-Sinkevičienė, Mažena last_name: Mackoit-Sinkevičienė - first_name: Michele full_name: Maggiore, Michele last_name: Maggiore - first_name: Anirban full_name: Majumdar, Anirban last_name: Majumdar - first_name: Konstantinos full_name: Makris, Konstantinos last_name: Makris - first_name: Azadeh full_name: Maleknejad, Azadeh last_name: Maleknejad - first_name: Anna L. full_name: Marchant, Anna L. last_name: Marchant - first_name: Agnese full_name: Mariotti, Agnese last_name: Mariotti - first_name: Christos full_name: Markou, Christos last_name: Markou - first_name: Barnaby full_name: Matthews, Barnaby last_name: Matthews - first_name: Anupam full_name: Mazumdar, Anupam last_name: Mazumdar - first_name: Christopher full_name: Mccabe, Christopher last_name: Mccabe - first_name: Matthias full_name: Meister, Matthias last_name: Meister - first_name: Giorgio full_name: Mentasti, Giorgio last_name: Mentasti - first_name: Jonathan full_name: Menu, Jonathan last_name: Menu - first_name: Giuseppe full_name: Messineo, Giuseppe last_name: Messineo - first_name: Bernd full_name: Meyer-Hoppe, Bernd last_name: Meyer-Hoppe - first_name: Salvatore full_name: Micalizio, Salvatore last_name: Micalizio - first_name: Federica full_name: Migliaccio, Federica last_name: Migliaccio - first_name: Peter full_name: Millington, Peter last_name: Millington - first_name: Milan full_name: Milosevic, Milan last_name: Milosevic - first_name: Abhay full_name: Mishra, Abhay last_name: Mishra - first_name: Jeremiah full_name: Mitchell, Jeremiah last_name: Mitchell - first_name: Gavin W. full_name: Morley, Gavin W. last_name: Morley - first_name: Noam full_name: Mouelle, Noam last_name: Mouelle - first_name: Jürgen full_name: Müller, Jürgen last_name: Müller - first_name: David full_name: Newbold, David last_name: Newbold - first_name: Wei Tou full_name: Ni, Wei Tou last_name: Ni - first_name: Christian full_name: Niehof, Christian last_name: Niehof - first_name: Johannes full_name: Noller, Johannes last_name: Noller - first_name: Senad full_name: Odžak, Senad last_name: Odžak - first_name: Daniel K.L. full_name: Oi, Daniel K.L. last_name: Oi - first_name: Andreas full_name: Oikonomou, Andreas last_name: Oikonomou - first_name: Yasser full_name: Omar, Yasser last_name: Omar - first_name: Chris full_name: Overstreet, Chris last_name: Overstreet - first_name: Vishnupriya full_name: Puthiya Veettil, Vishnupriya last_name: Puthiya Veettil - first_name: Julia full_name: Pahl, Julia last_name: Pahl - first_name: Sean full_name: Paling, Sean last_name: Paling - first_name: Zhongyin full_name: Pan, Zhongyin last_name: Pan - first_name: George full_name: Pappas, George last_name: Pappas - first_name: Vinay full_name: Pareek, Vinay last_name: Pareek - first_name: Elizabeth full_name: Pasatembou, Elizabeth last_name: Pasatembou - first_name: Mauro full_name: Paternostro, Mauro last_name: Paternostro - first_name: Vishal K. full_name: Pathak, Vishal K. last_name: Pathak - first_name: Emanuele full_name: Pelucchi, Emanuele last_name: Pelucchi - first_name: Franck full_name: Pereira Dos Santos, Franck last_name: Pereira Dos Santos - first_name: Achim full_name: Peters, Achim last_name: Peters - first_name: Annie full_name: Pichery, Annie last_name: Pichery - first_name: Igor full_name: Pikovski, Igor last_name: Pikovski - first_name: Apostolos full_name: Pilaftsis, Apostolos last_name: Pilaftsis - first_name: Florentina Crenguta full_name: Pislan, Florentina Crenguta last_name: Pislan - first_name: Robert full_name: Plunkett, Robert last_name: Plunkett - first_name: Rosa full_name: Poggiani, Rosa last_name: Poggiani - first_name: Marco full_name: Prevedelli, Marco last_name: Prevedelli - first_name: Johann full_name: Rafelski, Johann last_name: Rafelski - first_name: Juhan full_name: Raidal, Juhan last_name: Raidal - first_name: Martti full_name: Raidal, Martti last_name: Raidal - first_name: Ernst Maria full_name: Rasel, Ernst Maria last_name: Rasel - first_name: Sébastien full_name: Renaux-Petel, Sébastien last_name: Renaux-Petel - first_name: Andrea full_name: Richaud, Andrea last_name: Richaud - first_name: Pedro full_name: Rivero-Antunez, Pedro last_name: Rivero-Antunez - first_name: Tangui full_name: Rodzinka, Tangui last_name: Rodzinka - first_name: Albert full_name: Roura, Albert last_name: Roura - first_name: Jan full_name: Rudolph, Jan last_name: Rudolph - first_name: Dylan full_name: Sabulsky, Dylan last_name: Sabulsky - first_name: Marianna S. full_name: Safronova, Marianna S. last_name: Safronova - first_name: Mairi full_name: Sakellariadou, Mairi last_name: Sakellariadou - first_name: Leonardo full_name: Salvi, Leonardo last_name: Salvi - first_name: Muhammed full_name: Sameed, Muhammed last_name: Sameed - first_name: Sumit full_name: Sarkar, Sumit last_name: Sarkar - first_name: Patrik full_name: Schach, Patrik last_name: Schach - first_name: Stefan Alaric full_name: Schäffer, Stefan Alaric last_name: Schäffer - 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 - first_name: Wolfgang P. full_name: Schleich, Wolfgang P. last_name: Schleich - first_name: Dennis full_name: Schlippert, Dennis last_name: Schlippert - first_name: Ulrich full_name: Schneider, Ulrich last_name: Schneider - first_name: Florian full_name: Schreck, Florian last_name: Schreck - first_name: Ariel full_name: Schwartzman, Ariel last_name: Schwartzman - first_name: Nico full_name: Schwersenz, Nico last_name: Schwersenz - first_name: Olga full_name: Sergijenko, Olga last_name: Sergijenko - first_name: Haifa Rejeb full_name: Sfar, Haifa Rejeb last_name: Sfar - first_name: Lijing full_name: Shao, Lijing last_name: Shao - first_name: Ian full_name: Shipsey, Ian last_name: Shipsey - first_name: Jing full_name: Shu, Jing last_name: Shu - first_name: Yeshpal full_name: Singh, Yeshpal last_name: Singh - first_name: Carlos F. full_name: Sopuerta, Carlos F. last_name: Sopuerta - first_name: Marianna full_name: Sorba, Marianna last_name: Sorba - first_name: Fiodor full_name: Sorrentino, Fiodor last_name: Sorrentino - first_name: Alessandro D.A.M. full_name: Spallicci, Alessandro D.A.M. last_name: Spallicci - first_name: Petruta full_name: Stefanescu, Petruta last_name: Stefanescu - first_name: Nikolaos full_name: Stergioulas, Nikolaos last_name: Stergioulas - first_name: Daniel full_name: Stoerk, Daniel last_name: Stoerk - first_name: Hrudya full_name: Thaivalappil Sunilkumar, Hrudya last_name: Thaivalappil Sunilkumar - first_name: Jannik full_name: Ströhle, Jannik last_name: Ströhle - first_name: Zoie full_name: Tam, Zoie last_name: Tam - first_name: Dhruv full_name: Tandon, Dhruv last_name: Tandon - first_name: Yijun full_name: Tang, Yijun last_name: Tang - first_name: Dorothee full_name: Tell, Dorothee last_name: Tell - first_name: Jacques full_name: Tempere, Jacques last_name: Tempere - first_name: Dylan J. full_name: Temples, Dylan J. last_name: Temples - first_name: Rohit P. full_name: Thampy, Rohit P. last_name: Thampy - first_name: Ingmari C. full_name: Tietje, Ingmari C. last_name: Tietje - first_name: Guglielmo M. full_name: Tino, Guglielmo M. last_name: Tino - first_name: Jonathan N. full_name: Tinsley, Jonathan N. last_name: Tinsley - first_name: Ovidiu full_name: Tintareanu Mircea, Ovidiu last_name: Tintareanu Mircea - first_name: Kimberly full_name: Tkalčec, Kimberly last_name: Tkalčec - first_name: Andrew J. full_name: Tolley, Andrew J. last_name: Tolley - first_name: Vincenza full_name: Tornatore, Vincenza last_name: Tornatore - first_name: Alejandro full_name: Torres-Orjuela, Alejandro last_name: Torres-Orjuela - first_name: Philipp full_name: Treutlein, Philipp last_name: Treutlein - first_name: Andrea full_name: Trombettoni, Andrea last_name: Trombettoni - first_name: Christian full_name: Ufrecht, Christian last_name: Ufrecht - first_name: Juan full_name: Urrutia, Juan last_name: Urrutia - first_name: Tristan full_name: Valenzuela, Tristan last_name: Valenzuela - first_name: Linda R. full_name: Valerio, Linda R. last_name: Valerio - first_name: Maurits full_name: Van Der Grinten, Maurits last_name: Van Der Grinten - first_name: Ville full_name: Vaskonen, Ville last_name: Vaskonen - first_name: Verónica full_name: Vázquez-Aceves, Verónica last_name: Vázquez-Aceves - first_name: Hardi full_name: Veermäe, Hardi last_name: Veermäe - first_name: Flavio full_name: Vetrano, Flavio last_name: Vetrano - first_name: Nikolay V. full_name: Vitanov, Nikolay V. last_name: Vitanov - first_name: Wolf full_name: Von Klitzing, Wolf last_name: Von Klitzing - first_name: Sebastian full_name: Wald, Sebastian id: 133F200A-B015-11E9-AD41-0EDAE5697425 last_name: Wald orcid: 0000-0002-5869-1604 - first_name: Thomas full_name: Walker, Thomas last_name: Walker - first_name: Reinhold full_name: Walser, Reinhold last_name: Walser - first_name: Jin full_name: Wang, Jin last_name: Wang - first_name: Yan full_name: Wang, Yan last_name: Wang - first_name: C. A. full_name: Weidner, C. A. last_name: Weidner - first_name: André full_name: Wenzlawski, André last_name: Wenzlawski - first_name: Michael full_name: Werner, Michael last_name: Werner - first_name: Lisa full_name: Wörner, Lisa last_name: Wörner - first_name: Mohamed E. full_name: Yahia, Mohamed E. last_name: Yahia - first_name: Efe full_name: Yazgan, Efe last_name: Yazgan - first_name: Emmanuel full_name: Zambrini Cruzeiro, Emmanuel last_name: Zambrini Cruzeiro - first_name: M. full_name: Zarei, M. last_name: Zarei - first_name: Mingsheng full_name: Zhan, Mingsheng last_name: Zhan - first_name: Shengnan full_name: Zhang, Shengnan last_name: Zhang - first_name: Lin full_name: Zhou, Lin last_name: Zhou - first_name: Erik full_name: Zupanič, Erik last_name: Zupanič citation: 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' 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.' ieee: 'A. Abdalla et al., “Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop,” EPJ Quantum Technology, vol. 12. Springer Nature, 2025.' 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). das_tickbox: '1' dataavailabilitystatement: No datasets were generated or analysed during the current study. date_created: 2025-05-04T22:02:30Z date_published: 2025-04-03T00:00:00Z date_updated: 2026-07-08T09:29:52Z day: '03' ddc: - '530' department: - _id: OnHo doi: 10.1140/epjqt/s40507-025-00344-3 external_id: arxiv: - '2412.14960' isi: - '001489653300001' file: - access_level: open_access checksum: 00c7a97d87f7a6314df5b0c2213fbb02 content_type: application/pdf creator: dernst date_created: 2025-05-05T10:52:52Z date_updated: 2025-05-05T10:52:52Z file_id: '19653' file_name: 2025_EPJQuantumTech_Abdalla.pdf file_size: 14352192 relation: main_file success: 1 file_date_updated: 2025-05-05T10:52:52Z has_accepted_license: '1' intvolume: ' 12' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version publication: EPJ Quantum Technology publication_identifier: eissn: - 2196-0763 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: 'Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d volume: 12 year: '2025' ... --- OA_place: repository OA_type: green _id: '22157' abstract: - lang: eng text: "A graph \U0001D43A is said to be Ramsey for a tuple of graphs(\U0001D43B 1 , … , \U0001D43B\U0001D45F ) if every \U0001D45F-coloring of the edges of \U0001D43A con-tains a monochromatic copy of \U0001D43B\U0001D456 in color \U0001D456, for some \U0001D456.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 \U0001D43A\U0001D45B,\U0001D45D becomes asymptotically almost surely Ram-sey for a fixed tuple (\U0001D43B 1 , … , \U0001D43B\U0001D45F ), 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_number: e70013 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Micha full_name: Christoph, Micha last_name: Christoph - first_name: Anders full_name: Martinsson, Anders last_name: Martinsson - first_name: Raphael full_name: Steiner, Raphael last_name: Steiner - first_name: Yuval full_name: Wigderson, Yuval id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5 last_name: Wigderson 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). date_created: 2026-06-29T10:50:35Z date_published: 2025-01-01T00:00:00Z date_updated: 2026-07-08T10:24:21Z day: '01' ddc: - '500' doi: 10.1112/plms.70013 extern: '1' external_id: arxiv: - '2402.03045' intvolume: ' 130' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2402.03045 mathsc: - 05C70 - 05D10 - 05C80 month: '01' oa: 1 oa_version: Preprint publication: Proceedings of the London Mathematical Society publication_identifier: eissn: - 1460-244X issn: - 0024-6115 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Resolution of the Kohayakawa–Kreuter conjecture tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 130 year: '2025' ... --- OA_place: repository OA_type: green _id: '22158' abstract: - lang: eng 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." article_number: e38 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Lior full_name: Gishboliner, Lior last_name: Gishboliner - first_name: Asaf full_name: Shapira, Asaf last_name: Shapira - first_name: Yuval full_name: Wigderson, Yuval id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5 last_name: Wigderson citation: 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 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. 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. ista: Gishboliner L, Shapira A, Wigderson Y. 2025. An efficient asymmetric removal lemma and its limitations. Forum of Mathematics, Sigma. 13, e38. 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. short: L. Gishboliner, A. Shapira, Y. Wigderson, Forum of Mathematics, Sigma 13 (2025). date_created: 2026-06-29T10:51:07Z date_published: 2025-02-10T00:00:00Z date_updated: 2026-07-08T10:31:22Z day: '10' doi: 10.1017/fms.2024.68 extern: '1' external_id: arxiv: - '2301.07693' intvolume: ' 13' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2301.07693 mathsc: - 05C35 - 11B75 month: '02' oa: 1 oa_version: Preprint publication: Forum of Mathematics, Sigma publication_identifier: issn: - 2050-5094 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: An efficient asymmetric removal lemma and its limitations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2025' ... --- OA_place: repository OA_type: green _id: '22163' 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" article_number: '114373' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Ishay full_name: Haviv, Ishay last_name: Haviv - first_name: Sam full_name: Mattheus, Sam last_name: Mattheus - first_name: Aleksa full_name: Milojević, Aleksa last_name: Milojević - first_name: Yuval full_name: Wigderson, Yuval id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5 last_name: Wigderson citation: 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 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 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. ista: Haviv I, Mattheus S, Milojević A, Wigderson Y. 2025. Larger nearly orthogonal sets over finite fields. Discrete Mathematics. 348(4), 114373. 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. short: I. Haviv, S. Mattheus, A. Milojević, Y. Wigderson, Discrete Mathematics 348 (2025). das_tickbox: '1' date_created: 2026-06-29T10:53:05Z date_published: 2025-04-01T00:00:00Z date_updated: 2026-07-14T08:17:17Z day: '01' doi: 10.1016/j.disc.2024.114373 extern: '1' external_id: arxiv: - '2404.01057' intvolume: ' 348' issue: '4' keyword: - Nearly orthogonal sets - Ramsey theory - Finite fields language: - iso: eng main_file_link: - open_access: '1' url: 'https://doi.org/10.48550/arXiv.2404.01057 ' month: '04' oa: 1 oa_version: Preprint publication: Discrete Mathematics publication_identifier: issn: - 0012-365X publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Larger nearly orthogonal sets over finite fields type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 348 year: '2025' ... --- OA_place: repository OA_type: green _id: '22168' abstract: - lang: eng 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." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: EDEN full_name: KUPERWASSER, EDEN last_name: KUPERWASSER - first_name: WOJCIECH full_name: SAMOTIJ, WOJCIECH last_name: SAMOTIJ - first_name: Yuval full_name: Wigderson, Yuval id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5 last_name: Wigderson citation: 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 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. 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. 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. short: E. KUPERWASSER, W. SAMOTIJ, Y. Wigderson, Mathematical Proceedings of the Cambridge Philosophical Society 178 (2025) 293–320. date_created: 2026-06-29T10:55:00Z date_published: 2025-04-28T00:00:00Z date_updated: 2026-07-14T08:38:08Z day: '28' doi: 10.1017/s0305004125000143 extern: '1' external_id: arxiv: - '2307.16611' intvolume: ' 178' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2307.16611 mathsc: - 05C80 - 05C55 - 05D10 month: '04' oa: 1 oa_version: Preprint page: 293-320 publication: Mathematical Proceedings of the Cambridge Philosophical Society publication_identifier: eissn: - 1469-8064 issn: - 0305-0041 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: On the Kohayakawa–Kreuter conjecture type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 178 year: '2025' ... --- OA_place: repository OA_type: green _id: '22172' 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." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: António full_name: Girão, António last_name: Girão - first_name: Zach full_name: Hunter, Zach last_name: Hunter - first_name: Yuval full_name: Wigderson, Yuval id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5 last_name: Wigderson citation: ama: Girão A, Hunter Z, Wigderson Y. Blowups of triangle-free graphs. Advances in Combinatorics. 2025;10. doi:10.19086/aic.2025.10 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. ista: Girão A, Hunter Z, Wigderson Y. 2025. Blowups of triangle-free graphs. Advances in Combinatorics. 10. 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. short: A. Girão, Z. Hunter, Y. Wigderson, Advances in Combinatorics 10 (2025). date_created: 2026-06-29T10:56:44Z date_published: 2025-12-19T00:00:00Z date_updated: 2026-07-14T08:50:55Z day: '19' doi: 10.19086/aic.2025.10 extern: '1' external_id: arxiv: - '2408.12913' intvolume: ' 10' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2408.12913 month: '12' oa: 1 oa_version: Preprint publication: Advances in Combinatorics publication_status: published publisher: Alliance of Diamond Open Access Journals quality_controlled: '1' scopus_import: '1' status: public title: Blowups of triangle-free graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2025' ...