@unpublished{19399, abstract = {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.}, author = {Rodriguez Solovey, Lesia and Fiedler, Lukas and Zou, Minxia and Giannini, Caterina and Monzer, Aline and Vladimirtsev, Dmitrii and Randuch, Marek and Yu, Yongfan and Gelová, Zuzana and Verstraeten, Inge and Hajny, Jakub and Chen, Meng and Tan, Shutang and Hörmayer, Lukas and Li, Lanxin and Marques-Bueno, Maria Mar and Quddoos, Zainab and Molnar, Gergely and Xu, Tongda and Kulich, Ivan and Jaillais, Yvon and Friml, Jiří}, booktitle = {bioRxiv}, title = {{ABP1/ABL3-TMK1 cell-surface auxin signaling directly targets PIN2-mediated auxin fluxes for root gravitropism}}, doi = {10.1101/2022.11.30.518503}, year = {2025}, } @phdthesis{20364, author = {Giannini, Caterina}, issn = {2663-337X}, keywords = {Auxin Signaling, Plant Development}, pages = {151}, publisher = {Institute of Science and Technology Austria}, title = {{Nuclear and cell surface auxin signaling in A. thaliana developmental transitions}}, doi = {10.15479/AT-ISTA-20364}, year = {2025}, } @phdthesis{20441, abstract = {Epithelial spreading plays a pivotal role in the development of organisms especially those such as zebrafish which require the epithelial enveloping layer (EVL) to spread to cover the substantial yolk surface during gastrulation. Epiboly requires the transition of the epithelium with cuboidal cells to form a thin, flat squamous epithelial sheet. During this transition, the cells show tissue-scale mechanosensation with mechanisms such as direct mechanical control over the axis of cell division. Cytoskeletal intermediate filaments play a crucial role in vertebrate cells, not only facilitating mechanical stability but also helping facilitate the mechanosensitive response of the cell. Mechanosenstivity displayed by intermediate filaments is due not just to their interesting physical properties but also to their interactions with other cytoskeletal elements such as actin and microtubules. Keratin is the predominant intermediate filament expressed in the EVL. It expresses concomitantly with the gastrulation movements of the developing embryo. Our work focuses on understanding the role and dynamics of the keratin cytoskeletal network in modulating the physical aspects of EVL spreading. We demonstrated with the combination of physical characterisation and manipulations of the EVL, utilising a variety of biophysical tools and microscopy, the mechanistic role of keratin in tissue spreading. Generating novel genetic morphants and mutants, we probe the effect that the loss of the keratin network has on the physiology of the epithelium and the developing embryo. We show that the changing organisation of the keratin network is important for changing EVL physical properties as the stress imposed on the EVL increases during epiboly. By modelling the epithelium, we study how the mechanical heterogeneity in an epithelium can feed back into a mechanical loop to the maturation of the keratin network and hence affect the mechanics of the epithelium. However, unlike what would be predicted by the effect of intermediate filaments in acting as a security belt and increasing the resistance of the epithelium, we observe that loss of keratin leads to a delay in the EVL movement. Using both local aspirations of the YSL and EVL ablations, we demonstrate the mechanistic facilitation of actin mechanosensation in a keratin-dependent manner. Furthermore, using chemical inhibitors of microtubule polymerisation, we provide insight into the mechanisms underlying the organisation and distribution of keratin. Interestingly, the phenotype observed upon this loss of microtubules shows that keratins interact with the nucleus through microtubular interactions. Together with these diverse observations, we describe the mechanosensory feedback between resilience and that is critical for uniform and robust spreading of the epithelium.}, author = {Naik, Suyash}, isbn = {978-3-99078-069-5}, issn = {2663-337X}, pages = {105}, publisher = {Institute of Science and Technology Austria}, title = {{Keratins act as global coordinators of tissue spreading through mechanosensitive feedback}}, doi = {10.15479/AT-ISTA-20441}, year = {2025}, } @phdthesis{19395, abstract = {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. One 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. Like 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. In 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. Given 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. These findings provide new insights into the complex regulation of auxin canalization, highlighting a broader and more interconnected signaling framework than previously understood.}, author = {Monzer, Aline}, issn = {2663-337X}, pages = {160}, publisher = {Institute of Science and Technology Austria}, title = {{Cell-Surface Auxin Signaling: Linking molecular pathways to plant development}}, doi = {10.15479/AT-ISTA-19395}, year = {2025}, } @unpublished{19398, abstract = {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.}, author = {Monzer, Aline and Mazur, Ewa and Rodriguez Solovey, Lesia and Gallei, Michelle C and Zou, Minxia and Smejkal, Michael and Cervenova, Ema and Friml, Jiří}, booktitle = {bioRxiv}, title = {{TMK interacting network of receptor like kinases for auxin canalization and beyond}}, doi = {10.1101/2025.02.28.640727}, year = {2025}, } @phdthesis{19478, author = {Chen, Huihuang}, issn = {2663-337X}, pages = {118}, publisher = {Institute of Science and Technology Austria}, title = {{The cAMP second messenger in auxin signalling}}, doi = {10.15479/AT-ISTA-19478}, year = {2025}, } @phdthesis{20920, abstract = {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. The only practical VDFs known to date are based on repeated squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T). The 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. We 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. Secondly, 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. We 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). Finally, 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. Together, 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.}, author = {Hoffmann, Charlotte}, issn = {2663-337X}, pages = {116}, publisher = {Institute of Science and Technology Austria}, title = {{Theory and applications of verifiable delay functions}}, doi = {10.15479/AT-ISTA-20920}, year = {2025}, } @phdthesis{20556, abstract = {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. The only practical VDFs known to date are based on repeated squaring in hidden order groups. Consider the function VDF(x,T)=x^(2^T). The 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. We 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. Secondly, 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. We 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). Finally, 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. Together, 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.}, author = {Hoffmann, Charlotte}, issn = {2663-337X}, pages = {116}, publisher = {Institute of Science and Technology Austria}, title = {{Theory and applications of verifiable delay functions}}, doi = {10.15479/AT-ISTA-20556}, year = {2025}, } @article{10011, abstract = {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.}, author = {Hensel, Sebastian and Laux, Tim}, issn = {1945-743X}, journal = {Journal of Differential Geometry}, keywords = {Mean curvature flow, gradient flows, varifolds, weak solutions, weak-strong uniqueness, calibrated geometry, gradient-flow calibrations}, pages = {209--268}, publisher = {International Press of Boston}, title = {{A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness}}, doi = {10.4310/jdg/1747065796}, volume = {130}, year = {2025}, } @inproceedings{20668, abstract = {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. In 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.}, author = {Hashimoto, Keitaro and Katsumata, Shuichi and Pascual Perez, Guillermo}, booktitle = {34th Usenix Security Symposium}, isbn = {9781939133526}, location = {Seattle, WA, USA}, pages = {6699--6716}, publisher = {Usenix Association}, title = {{Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable}}, year = {2025}, } @inproceedings{20004, abstract = {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. Moreover, 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). To 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.}, author = {Streltsova, Elizaveta and Wagner, Uli}, booktitle = {41st International Symposium on Computational Geometry}, isbn = {9783959773706}, issn = {1868-8969}, location = {Kanazawa, Japan}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers}}, doi = {10.4230/LIPIcs.SoCG.2025.75}, volume = {332}, year = {2025}, } @article{19733, abstract = {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.}, author = {Kun, Daniel and Strömberg, Karl T and Spagnolo, Michele and Dakić, Borivoje and Rozema, Lee A. and Walther, Philip}, issn = {2469-9934}, journal = {Physical Review A}, number = {5}, publisher = {American Physical Society}, title = {{Direct and efficient detection of quantum superposition}}, doi = {10.1103/PhysRevA.111.L050402}, volume = {111}, year = {2025}, } @misc{22142, abstract = {Data to generate Figures from the Letter "Direct and Efficient Detection of Quantum Superposition" published in APS Physical Review A. The code can be found on the provided GitLab repository.}, author = {Kun, Daniel}, publisher = {Zenodo}, title = {{Direct And Efficient Detection of Quantum Superposition - Data and Figures}}, doi = {10.5281/zenodo.13375452}, year = {2025}, } @article{22155, abstract = {The canonical Ramsey theorem of Erdős and Rado implies that for any graph 𝐻, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph 𝐾𝑁 contains a monochromatic, lexicographic, or rainbow copy of 𝐻. The least such 𝑁 is called the Erdős–Rado number of 𝐻, denoted by 𝐸⁢𝑅⁡(𝐻). Erdős–Rado numbers of cliques have received considerable attention, and in this paper we extend this line of research by studying Erdős–Rado numbers of sparse graphs. For example, we prove that if 𝐻 has bounded degree, then 𝐸⁢𝑅⁡(𝐻) is polynomial in |𝑉⁡(𝐻)| if 𝐻 is bipartite but exponential in general. We also study the closely related problem of constrained Ramsey numbers. For a given tree S and given path 𝑃𝑡, we study the minimum 𝑁 such that every edge-coloring of 𝐾𝑁 contains a monochromatic copy of S or a rainbow copy of 𝑃𝑡. We prove a nearly optimal upper bound for this problem, which differs from the best known lower bound by a function of inverse Ackermann type.}, author = {Gishboliner, Lior and Milojević, Aleksa and Sudakov, Benny and Wigderson, Yuval}, issn = {1095-7146}, journal = {SIAM Journal on Discrete Mathematics}, number = {3}, pages = {1491--1519}, publisher = {Society for Industrial & Applied Mathematics}, title = {{Canonical Ramsey numbers of sparse graphs}}, doi = {10.1137/24m1714964}, volume = {39}, year = {2025}, } @article{19636, abstract = {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).}, author = {Abdalla, Adam and Abe, Mahiro and Abend, Sven and Abidi, Mouine and Aidelsburger, Monika and Alibabaei, Ashkan and Allard, Baptiste and Antoniadis, John and Arduini, Gianluigi and Augst, Nadja and Balamatsias, Philippos and Balaž, Antun and Banks, Hannah and Barcklay, Rachel L. and Barone, Michele and Barsanti, Michele and Bason, Mark G. and Bassi, Angelo and Bayle, Jean Baptiste and Baynham, Charles F.A. and Beaufils, Quentin and Beldjoudi, Sélyan and Belić, Aleksandar and Bennetts, Shayne and Bernabeu, Jose and Bertoldi, Andrea and Bigard, Clara and Bigelow, N. P. and Bingham, Robert and Blas, Diego and Bobrick, Alexey and Boehringer, Samuel and Bogojević, Aleksandar and Bongs, Kai and Bortoletto, Daniela and Bouyer, Philippe and Brand, Christian and Buchmueller, Oliver and Buica, Gabriela and Calatroni, Sergio and Calmels, Léo and Canizares, Priscilla and Canuel, Benjamin and Caramete, Ana and Caramete, Laurentiu Ioan and Carlesso, Matteo and Carlton, John and Carman, Samuel P. and Carroll, Andrew and Casariego, Mateo and Chairetis, Minoas and Charmandaris, Vassilis and Chauhan, Upasna and Chen, Jiajun and Chiofalo, Maria Luisa Maria Luisa Marilù and Ciampini, Donatella and Cimbri, Alessia and Cladé, Pierre and Coleman, Jonathon and Constantin, Florin Lucian and Contaldi, Carlo R. and Corgier, Robin and Dash, Bineet and Davies, G. J. and De Rham, Claudia and De Roeck, Albert and Derr, Daniel and Dey, Soumyodeep and Di Pumpo, Fabio and Djordjevic, Goran S. and Döbrich, Babette and Dornan, Peter and Doser, Michael and Drougakis, Giannis and Dunningham, Jacob and Duspayev, Alisher and Easo, Sajan and Eby, Joshua and Efremov, Maxim and Elertas, Gedminas and Ellis, John and Entin, Nicholas and Fairhurst, Stephen and Fanì, Mattia and Fassi, Farida and Fayet, Pierre and Felea, Daniel and Feng, Jie and Flack, Robert and Foot, Chris and Freegarde, Tim and Fuchs, Elina and Gaaloul, Naceur and Gao, Dongfeng and Gardner, Susan and Garraway, Barry M. and Garrido Alzar, Carlos L. and Gauguet, Alexandre and Giese, Enno and Gill, Patrick and Giudice, Gian F. and Glasbrenner, Eric P. and Glick, Jonah and Graham, Peter W. and Granados, Eduardo and Griffin, Paul F. and Gué, Jordan and Guellati-Khelifa, Saïda and Gupta, Subhadeep and Gupta, Vishu and Hackermueller, Lucia and Haehnelt, Martin and Hakulinen, Timo and Hammerer, Klemens and Hanımeli, Ekim T. and Harte, Tiffany and Hartmann, Sabrina and Hawkins, Leonie and Hees, Aurelien and Herbst, Alexander and Hird, Thomas M. and Hobson, Richard and Hogan, Jason and Holst, Bodil and Holynski, Michael and Hosten, Onur and Hsu, Chung Chuan and Huang, Wayne Cheng Wei and Hughes, Kenneth M. and Hussain, Kamran and Hütsi, Gert and Iovino, Antonio and Isfan, Maria Catalina and Janson, Gregor and Jeglič, Peter and Jetzer, Philippe and Jiang, Yijun and Juzeliūnas, Gediminas and Kaenders, Wilhelm and Kalliokoski, Matti and Kehagias, Alex and Kilian, Eva and Klempt, Carsten and Knight, Peter and Koley, Soumen and Konrad, Bernd and Kovachy, Tim and Krutzik, Markus and Kumar, Mukesh and Kumar, Pradeep and Labiad, Hamza and Lan, Shau Yu and Landragin, Arnaud and Landsberg, Greg and Langlois, Mehdi and Lanigan, Bryony and Leone, Bruno and Le Poncin-Lafitte, Christophe and Lellouch, Samuel and Lewicki, Marek and Lien, Yu Hung and Lombriser, Lucas and Asamar, Elias Lopez and Lopez-Gonzalez, J. Luis and Lu, Chen and Luciano, Giuseppe Gaetano and Lundblad, Nathan and De J. López Monjaraz, Cristian and Lowe, Adam and Mackoit-Sinkevičienė, Mažena and Maggiore, Michele and Majumdar, Anirban and Makris, Konstantinos and Maleknejad, Azadeh and Marchant, Anna L. and Mariotti, Agnese and Markou, Christos and Matthews, Barnaby and Mazumdar, Anupam and Mccabe, Christopher and Meister, Matthias and Mentasti, Giorgio and Menu, Jonathan and Messineo, Giuseppe and Meyer-Hoppe, Bernd and Micalizio, Salvatore and Migliaccio, Federica and Millington, Peter and Milosevic, Milan and Mishra, Abhay and Mitchell, Jeremiah and Morley, Gavin W. and Mouelle, Noam and Müller, Jürgen and Newbold, David and Ni, Wei Tou and Niehof, Christian and Noller, Johannes and Odžak, Senad and Oi, Daniel K.L. and Oikonomou, Andreas and Omar, Yasser and Overstreet, Chris and Puthiya Veettil, Vishnupriya and Pahl, Julia and Paling, Sean and Pan, Zhongyin and Pappas, George and Pareek, Vinay and Pasatembou, Elizabeth and Paternostro, Mauro and Pathak, Vishal K. and Pelucchi, Emanuele and Pereira Dos Santos, Franck and Peters, Achim and Pichery, Annie and Pikovski, Igor and Pilaftsis, Apostolos and Pislan, Florentina Crenguta and Plunkett, Robert and Poggiani, Rosa and Prevedelli, Marco and Rafelski, Johann and Raidal, Juhan and Raidal, Martti and Rasel, Ernst Maria and Renaux-Petel, Sébastien and Richaud, Andrea and Rivero-Antunez, Pedro and Rodzinka, Tangui and Roura, Albert and Rudolph, Jan and Sabulsky, Dylan and Safronova, Marianna S. and Sakellariadou, Mairi and Salvi, Leonardo and Sameed, Muhammed and Sarkar, Sumit and Schach, Patrik and Schäffer, Stefan Alaric and Schelfhout, Jesse and Schilling, Manuel and Schkolnik, Vladimir and Schleich, Wolfgang P. and Schlippert, Dennis and Schneider, Ulrich and Schreck, Florian and Schwartzman, Ariel and Schwersenz, Nico and Sergijenko, Olga and Sfar, Haifa Rejeb and Shao, Lijing and Shipsey, Ian and Shu, Jing and Singh, Yeshpal and Sopuerta, Carlos F. and Sorba, Marianna and Sorrentino, Fiodor and Spallicci, Alessandro D.A.M. and Stefanescu, Petruta and Stergioulas, Nikolaos and Stoerk, Daniel and Thaivalappil Sunilkumar, Hrudya and Ströhle, Jannik and Tam, Zoie and Tandon, Dhruv and Tang, Yijun and Tell, Dorothee and Tempere, Jacques and Temples, Dylan J. and Thampy, Rohit P. and Tietje, Ingmari C. and Tino, Guglielmo M. and Tinsley, Jonathan N. and Tintareanu Mircea, Ovidiu and Tkalčec, Kimberly and Tolley, Andrew J. and Tornatore, Vincenza and Torres-Orjuela, Alejandro and Treutlein, Philipp and Trombettoni, Andrea and Ufrecht, Christian and Urrutia, Juan and Valenzuela, Tristan and Valerio, Linda R. and Van Der Grinten, Maurits and Vaskonen, Ville and Vázquez-Aceves, Verónica and Veermäe, Hardi and Vetrano, Flavio and Vitanov, Nikolay V. and Von Klitzing, Wolf and Wald, Sebastian and Walker, Thomas and Walser, Reinhold and Wang, Jin and Wang, Yan and Weidner, C. A. and Wenzlawski, André and Werner, Michael and Wörner, Lisa and Yahia, Mohamed E. and Yazgan, Efe and Zambrini Cruzeiro, Emmanuel and Zarei, M. and Zhan, Mingsheng and Zhang, Shengnan and Zhou, Lin and Zupanič, Erik}, issn = {2196-0763}, journal = {EPJ Quantum Technology}, publisher = {Springer Nature}, title = {{Terrestrial Very-Long-Baseline Atom Interferometry: Summary of the second workshop}}, doi = {10.1140/epjqt/s40507-025-00344-3}, volume = {12}, year = {2025}, } @article{22157, abstract = {A graph 𝐺 is said to be Ramsey for a tuple of graphs(𝐻 1 , … , 𝐻𝑟 ) if every 𝑟-coloring of the edges of 𝐺 con-tains a monochromatic copy of 𝐻𝑖 in color 𝑖, for some 𝑖.A fundamental question at the intersection of Ramseytheory and the theory of random graphs is to deter-mine the threshold at which the binomial randomgraph 𝐺𝑛,𝑝 becomes asymptotically almost surely Ram-sey for a fixed tuple (𝐻 1 , … , 𝐻𝑟 ), and a famous conjectureof Kohayakawa and Kreuter predicts this threshold.Earlier work of Mousset–Nenadov–Samotij, Bowtell–Hancock–Hyde, and Kuperwasser–Samotij–Wigdersonhas reduced this probabilistic problem to a determinis-tic graph decomposition conjecture. In this paper, weresolve this deterministic problem, thus proving theKohayakawa–Kreuter conjecture. Along the way, weprove a number of novel graph decomposition resultsthat may be of independent interest.}, author = {Christoph, Micha and Martinsson, Anders and Steiner, Raphael and Wigderson, Yuval}, issn = {1460-244X}, journal = {Proceedings of the London Mathematical Society}, number = {1}, publisher = {Wiley}, title = {{Resolution of the Kohayakawa–Kreuter conjecture}}, doi = {10.1112/plms.70013}, volume = {130}, year = {2025}, } @article{22158, abstract = {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: • We first give a regularity-free proof of Csaba’s theorem, which improves the number of copies of to the optimal number . • 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. Our proofs use a mix of combinatorial, number-theoretic, probabilistic and Ramsey-type arguments.}, author = {Gishboliner, Lior and Shapira, Asaf and Wigderson, Yuval}, issn = {2050-5094}, journal = {Forum of Mathematics, Sigma}, publisher = {Cambridge University Press}, title = {{An efficient asymmetric removal lemma and its limitations}}, doi = {10.1017/fms.2024.68}, volume = {13}, year = {2025}, } @article{22163, abstract = {For a field F and integers d and k, a set A ⊆ Fd is called k-nearly orthogonal if its members are non-self-orthogonal and every k + 1 vectors of A include an orthogonal pair. We prove that for every prime p there exists some δ = δ(p)> 0, such that for every field F of characteristic p and for all integers k ≥ 2 and d ≥ k, there exists a k-nearly orthogonal set of at least dδ·k/ logk vectors of Fd. The size of the set is optimal up to the logk term in the exponent. We further prove two extensions of this result. In the first, we provide a large set A of non-self-orthogonal vectors of Fd such that for every two subsets of A of size k+1 each, some vector of one of the subsets is orthogonal to some vector of the other. In the second extension, every k + 1 vectors of the produced set A include ℓ + 1 pairwise orthogonal vectors for an arbitrary fixed integer 1 ≤ ℓ ≤ k. The proofs involve probabilistic and spectral arguments and the hypergraph container method}, author = {Haviv, Ishay and Mattheus, Sam and Milojević, Aleksa and Wigderson, Yuval}, issn = {0012-365X}, journal = {Discrete Mathematics}, keywords = {Nearly orthogonal sets, Ramsey theory, Finite fields}, number = {4}, publisher = {Elsevier}, title = {{Larger nearly orthogonal sets over finite fields}}, doi = {10.1016/j.disc.2024.114373}, volume = {348}, year = {2025}, } @article{22168, abstract = {Let us say that a graph G is Ramsey for a tuple (H1, ... , Hr) of graphs if every r-colouring of the edges of G contains a monochromatic copy of Hi in colour i, for some i ∈ [[r]]. A famous conjecture of Kohayakawa and Kreuter, extending seminal work of Rödl and Rucinski, predicts the threshold at which the binomial random graph ´ Gn,p becomes Ramsey for (H1, ... , Hr) asymptotically almost surely. In this paper, we resolve the Kohayakawa–Kreuter conjecture for almost all tuples of graphs. Moreover, we reduce its validity to the truth of a certain deterministic statement, which 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 H1, ... , Hr. Additionally, we pose a natural (deterministic) graph-partitioning conjecture, which we believe to be of independent interest, and whose resolution would imply the Kohayakawa–Kreuter conjecture.}, author = {KUPERWASSER, EDEN and SAMOTIJ, WOJCIECH and Wigderson, Yuval}, issn = {1469-8064}, journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, number = {3}, pages = {293--320}, publisher = {Cambridge University Press}, title = {{On the Kohayakawa–Kreuter conjecture}}, doi = {10.1017/s0305004125000143}, volume = {178}, year = {2025}, } @article{22172, abstract = {A highly influential result of Nikiforov states that if an n-vertex graph G contains at least γnh copies of a fixed h-vertex graph H, then G contains a blowup of H of order Ωγ,H(logn). While the dependence on n is optimal, the correct dependence on γ is unknown; all known proofs yield bounds that are polynomial in γ, but the best known upper bound, coming from random graphs, is only logarithmic in γ. It is a major open problem to narrow this gap. We prove that if H is triangle-free, then the logarithmic behavior of the upper bound is the truth. That is, under the assumptions above, G contains a blowup of H of order ΩH(logn/log(1/γ)). This is the first non-trivial instance where the optimal dependence in Nikiforov’s theorem is known. As a consequence, we also prove an upper bound on multicolor Ramsey numbers of blowups of triangle-free graphs, proving that the dependence on the number of colors is polynomial once the blowup is sufficiently large. This shows that, from the perspective of multicolor Ramsey numbers, blowups of fixed triangle-free graphs behave like bipartite graphs.}, author = {Girão, António and Hunter, Zach and Wigderson, Yuval}, journal = {Advances in Combinatorics}, publisher = {Alliance of Diamond Open Access Journals}, title = {{Blowups of triangle-free graphs}}, doi = {10.19086/aic.2025.10}, volume = {10}, year = {2025}, }