--- _id: '17126' abstract: - lang: eng text: "Functional encryption (FE) is a primitive where the holder of a master secret key can control which functions a user can evaluate on encrypted data. It is a powerful primitive that even implies indistinguishability obfuscation (iO), given sufficiently compact ciphertexts (Ananth-Jain, CRYPTO’15 and Bitansky-Vaikuntanathan, FOCS’15). However, despite being extensively studied, there are FE schemes, such as function-hiding inner-product FE (Bishop-Jain-Kowalczyk, AC’15, Abdalla-Catalano-Fiore-Gay-Ursu, CRYPTO’18) and compact quadratic FE (Baltico-Catalano-Fiore-Gay, Lin, CRYPTO’17), that can be only realized using pairings. This raises the question if there are some mathematical barriers that hinder us from realizing these FE schemes from other assumptions.\r\n\r\nIn this paper, we study the difficulty of constructing lattice-based compact FE. We generalize the impossibility results of Ünal (EC’20) for lattice-based function-hiding FE, and extend it to the case of compact FE. Concretely, we prove lower bounds for lattice-based compact FE schemes which meet some (natural) algebraic restrictions at encryption and decryption, and have ciphertexts of linear size and secret keys of minimal degree. We see our results as important indications of why it is hard to construct lattice-based FE schemes for new functionalities, and which mathematical barriers have to be overcome." acknowledgement: We want to thank the anonymous reviewers of TCC and Eurocrypt for their very helpful comments and suggestions. This work has received funding from the Austrian Science Fund (FWF) and netidee SCIENCE via grant P31621-N38 (PROFET). alternative_title: - LNCS article_processing_charge: No author: - first_name: Erkan full_name: Tairi, Erkan last_name: Tairi - first_name: Akin full_name: Ünal, Akin id: f6b56fb6-dc63-11ee-9dbf-f6780863a85a last_name: Ünal orcid: 0000-0002-8929-0221 citation: ama: 'Tairi E, Ünal A. Lower bounds for lattice-based compact functional encryption. In: Advances in Cryptology – EUROCRYPT 2024. Vol 14652. Springer Nature; 2024:249-279. doi:10.1007/978-3-031-58723-8_9' apa: 'Tairi, E., & Ünal, A. (2024). Lower bounds for lattice-based compact functional encryption. In Advances in Cryptology – EUROCRYPT 2024 (Vol. 14652, pp. 249–279). Zurich, Switzerland: Springer Nature. https://doi.org/10.1007/978-3-031-58723-8_9' chicago: Tairi, Erkan, and Akin Ünal. “Lower Bounds for Lattice-Based Compact Functional Encryption.” In Advances in Cryptology – EUROCRYPT 2024, 14652:249–79. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-58723-8_9. ieee: E. Tairi and A. Ünal, “Lower bounds for lattice-based compact functional encryption,” in Advances in Cryptology – EUROCRYPT 2024, Zurich, Switzerland, 2024, vol. 14652, pp. 249–279. ista: 'Tairi E, Ünal A. 2024. Lower bounds for lattice-based compact functional encryption. Advances in Cryptology – EUROCRYPT 2024. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 14652, 249–279.' mla: Tairi, Erkan, and Akin Ünal. “Lower Bounds for Lattice-Based Compact Functional Encryption.” Advances in Cryptology – EUROCRYPT 2024, vol. 14652, Springer Nature, 2024, pp. 249–79, doi:10.1007/978-3-031-58723-8_9. short: E. Tairi, A. Ünal, in:, Advances in Cryptology – EUROCRYPT 2024, Springer Nature, 2024, pp. 249–279. conference: end_date: 2024-05-30 location: Zurich, Switzerland name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques' start_date: 2024-05-26 date_created: 2024-06-09T22:01:03Z date_published: 2024-05-08T00:00:00Z date_updated: 2025-09-08T07:48:18Z day: '08' department: - _id: KrPi doi: 10.1007/978-3-031-58723-8_9 external_id: isi: - '001278247600009' intvolume: ' 14652' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2023/719.pdf month: '05' oa: 1 oa_version: Submitted Version page: 249-279 publication: Advances in Cryptology – EUROCRYPT 2024 publication_identifier: eissn: - 1611-3349 isbn: - '9783031587221' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Lower bounds for lattice-based compact functional encryption type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 14652 year: '2024' ... --- _id: '17128' abstract: - lang: eng text: The onset of turbulence in pipe flow has defied detailed understanding ever since the first observations of the spatially heterogeneous nature of the transition. Recent theoretical studies and experiments in simpler, shear-driven flows suggest that the onset of turbulence is a directed-percolation non-equilibrium phase transition, but whether these findings are generic and also apply to open or pressure-driven flows is unknown. In pipe flow, the extremely long time scales near the transition make direct observations of critical behaviour virtually impossible. Here we find a technical solution to that limitation and show that the universality class of the transition is directed percolation, from which a jammed phase of puffs emerges above the critical point. Our method is to experimentally characterize all pairwise interactions between localized patches of turbulence puffs and use these interactions as input for renormalization group and computer simulations of minimal models that extrapolate to long length and time scales. The strong interactions in the jamming regime enable us to explicitly measure the turbulent fraction and confirm model predictions. Our work shows that directed-percolation scaling applies beyond simple closed shear flows and underscores how statistical mechanics can lead to profound, quantitative and predictive insights on turbulent flows and their phases. acknowledgement: We gratefully acknowledge the assistance of J. M. Lopez with DNSs at an early stage of this work. This work was partially supported by two grants from the Simons Foundation (grant nos. 662985 (N.G.) and 662960 (B.H.)) and by Ministry of Science and Technology, Taiwan (grant nos. MOST 109-2112-M-001-017-MY3 and MOST 111-2112-M-001-027-MY3 (H.-Y.S.)). Part of this work was performed using computing resources of CRIANN (Normandy, France). article_processing_charge: No article_type: original author: - first_name: Grégoire M full_name: Lemoult, Grégoire M id: 4787FE80-F248-11E8-B48F-1D18A9856A87 last_name: Lemoult - first_name: Mukund full_name: Vasudevan, Mukund id: 3C5A959A-F248-11E8-B48F-1D18A9856A87 last_name: Vasudevan - first_name: Hong Yan full_name: Shih, Hong Yan last_name: Shih - first_name: Gaute full_name: Linga, Gaute last_name: Linga - first_name: Joachim full_name: Mathiesen, Joachim last_name: Mathiesen - first_name: Nigel full_name: Goldenfeld, Nigel last_name: Goldenfeld - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Lemoult GM, Vasudevan M, Shih HY, et al. Directed percolation and puff jamming near the transition to pipe turbulence. Nature Physics. 2024;20:1339-1345. doi:10.1038/s41567-024-02513-0 apa: Lemoult, G. M., Vasudevan, M., Shih, H. Y., Linga, G., Mathiesen, J., Goldenfeld, N., & Hof, B. (2024). Directed percolation and puff jamming near the transition to pipe turbulence. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-024-02513-0 chicago: Lemoult, Grégoire M, Mukund Vasudevan, Hong Yan Shih, Gaute Linga, Joachim Mathiesen, Nigel Goldenfeld, and Björn Hof. “Directed Percolation and Puff Jamming near the Transition to Pipe Turbulence.” Nature Physics. Springer Nature, 2024. https://doi.org/10.1038/s41567-024-02513-0. ieee: G. M. Lemoult et al., “Directed percolation and puff jamming near the transition to pipe turbulence,” Nature Physics, vol. 20. Springer Nature, pp. 1339–1345, 2024. ista: Lemoult GM, Vasudevan M, Shih HY, Linga G, Mathiesen J, Goldenfeld N, Hof B. 2024. Directed percolation and puff jamming near the transition to pipe turbulence. Nature Physics. 20, 1339–1345. mla: Lemoult, Grégoire M., et al. “Directed Percolation and Puff Jamming near the Transition to Pipe Turbulence.” Nature Physics, vol. 20, Springer Nature, 2024, pp. 1339–45, doi:10.1038/s41567-024-02513-0. short: G.M. Lemoult, M. Vasudevan, H.Y. Shih, G. Linga, J. Mathiesen, N. Goldenfeld, B. Hof, Nature Physics 20 (2024) 1339–1345. corr_author: '1' date_created: 2024-06-09T22:01:03Z date_published: 2024-08-01T00:00:00Z date_updated: 2025-09-08T07:50:20Z day: '01' department: - _id: BjHo doi: 10.1038/s41567-024-02513-0 external_id: isi: - '001232300600001' intvolume: ' 20' isi: 1 language: - iso: eng month: '08' oa_version: None page: 1339-1345 project: - _id: 238598C6-32DE-11EA-91FC-C7463DDC885E grant_number: '662960' name: Revisiting the Turbulence Problem Using Statistical Mechanics publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Directed percolation and puff jamming near the transition to pipe turbulence type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 20 year: '2024' ... --- OA_place: publisher _id: '17133' abstract: - lang: eng text: "An ideal quantum computer relies on qubits capable of performing fast gate operations and\r\nmaintaining strong interconnections while preserving their quantum coherence. Since the\r\ninception of experimental eforts toward building a quantum computer, the community has\r\nfaced challenges in engineering such a system. Among the various methods of implementing a\r\nquantum computer, superconducting qubits have shown fast gates close to tens of nanoseconds,\r\nwith the state-of-the-art reaching a coherence of a few milliseconds. However, achieving\r\nsimultaneously long lifetimes with fast qubit operations poses an inherent paradox. Qubits\r\nwith high coherence require isolation from the environment, while fast operation necessitates\r\nstrong coupling of the qubit. This thesis approaches this issue by proposing the idea of\r\nengineering superconducting qubits capable of transitioning between operating in a protected\r\nregime, where the qubit is completely isolated from the environment, and coupling to the\r\ncommunication channels as needed. In this direction, we use the geometric superinductor to\r\nscan the parameter space of rf-SQUID devices, searching for a regime where we can take the\r\nqubit protection to its extreme.\r\n\r\nThis leads us to the inductively shunted transmon (IST) regime, characterized by EJ /EC ≫ 1\r\nand EJ /EL ≫ 1, where the circuit potential exhibits a double well with a large barrier\r\nseparating the local ground states of each quantum well. In this regime, although it is\r\nanticipated that the two quantum wells would be isolated from each other, we observe single\r\nfuxon tunneling between them. The interplay of the cavity photons and the fuxon transition\r\nforms a rich physical system, containing resonance conditions that allow the preparation of the\r\nfuxon ground or excited states. This enables us to study the relaxation rate of such transition\r\nand show that it can be as large as 3.6 hours. Dynamically controlling the barrier height\r\nbetween the two quantum wells allows for controllable coupling, which scales exponentially,\r\nfor a qubit encoded in two fuxon states.\r\nThe 0-π qubit is one of the very few known superconducting circuit types that ofers exponential\r\nprotection from both relaxation and dephasing simultaneously. However, this qubit is not\r\nexempt from the fact that such protection comes at the expense of complex readout and\r\ncontrol. In this thesis, we propose a way to controllably break the circuit symmetry, the\r\nkey reason for the protection, to momentarily restore the ability to control and manipulate\r\nthe qubit. An asymmetry in capacitances and inductances in the 0-π circuit is detrimental\r\nsince they lead to coupling of the protected state to the thermally occupied parasitic mode\r\nof the circuit. However, here we try to exploit a controlled asymmetry in Josephson energies\r\nand show that this can be used as a tunable coupler between the protected states. In the\r\nfuture, this should allow to perform gate operations by dynamically controlling the asymmetry\r\ninstead of driving the protected transition with microwave pulses. Therefore, we believe that\r\nthe proposed method can make the use of protected qubits more practical in experimental\r\nrealizations of quantum computing." acknowledged_ssus: - _id: NanoFab - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Farid full_name: Hassani, Farid id: 2AED110C-F248-11E8-B48F-1D18A9856A87 last_name: Hassani orcid: 0000-0001-6937-5773 citation: ama: Hassani F. Superconducting qubits capable of dynamic switching between protected and high-speed control regimes. 2024. doi:10.15479/at:ista:17133 apa: Hassani, F. (2024). Superconducting qubits capable of dynamic switching between protected and high-speed control regimes. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17133 chicago: Hassani, Farid. “Superconducting Qubits Capable of Dynamic Switching between Protected and High-Speed Control Regimes.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17133. ieee: F. Hassani, “Superconducting qubits capable of dynamic switching between protected and high-speed control regimes,” Institute of Science and Technology Austria, 2024. ista: Hassani F. 2024. Superconducting qubits capable of dynamic switching between protected and high-speed control regimes. Institute of Science and Technology Austria. mla: Hassani, Farid. Superconducting Qubits Capable of Dynamic Switching between Protected and High-Speed Control Regimes. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17133. short: F. Hassani, Superconducting Qubits Capable of Dynamic Switching between Protected and High-Speed Control Regimes, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-06-11T18:20:05Z date_published: 2024-06-11T00:00:00Z date_updated: 2026-04-15T06:43:02Z day: '11' ddc: - '530' degree_awarded: PhD department: - _id: GradSch - _id: JoFi doi: 10.15479/at:ista:17133 file: - access_level: open_access checksum: 258c353d47fa37ea63ea43b1e10a34a0 content_type: application/pdf creator: fhassani date_created: 2024-06-12T07:53:19Z date_updated: 2024-06-20T11:52:22Z file_id: '17137' file_name: Thesis_main_final.pdf file_size: 28370759 relation: main_file - access_level: closed checksum: deffa5d0db88093f74812fa71520d5e1 content_type: text/x-tex creator: fhassani date_created: 2024-06-12T07:54:27Z date_updated: 2024-06-12T07:54:27Z file_id: '17138' file_name: Thesis_main.tex file_size: 445735 relation: source_file file_date_updated: 2024-06-20T11:52:22Z has_accepted_license: '1' keyword: - Quantum information - Qubits - Superconducting devices language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '161' project: - _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A name: NOMIS Fellowship Program - _id: bdb108fd-d553-11ed-ba76-83dc74a9864f grant_number: F07105 name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits publication_identifier: isbn: - 978-3-99078-040-4 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13227' relation: part_of_dissertation status: public - id: '9928' relation: part_of_dissertation status: public - id: '8755' relation: part_of_dissertation status: public status: public supervisor: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X title: Superconducting qubits capable of dynamic switching between protected and high-speed control regimes 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: '2024' ... --- _id: '17136' abstract: - lang: eng text: "This paper focuses on Majority Dynamics in sparse graphs, in particular, as a\r\ntool to study internal cuts. It is known that, in Majority Dynamics on a finite\r\ngraph, each vertex eventually either comes to a fixed state, or oscillates with\r\nperiod two. The empirical evidence acquired by simulations suggests that for\r\nrandom odd-regular graphs, approximately half of the vertices end up\r\noscillating with high probability. We notice a local symmetry between\r\noscillating and non-oscillating vertices, that potentially can explain why the\r\nfraction of the oscillating vertices is concentrated around $\\frac{1}{2}$. In\r\nour simulations, we observe that the parts of random odd-regular graph under\r\nMajority Dynamics with high probability do not contain $\\lceil \\frac{d}{2}\r\n\\rceil$-cores at any timestep, and thus, one cannot use Majority Dynamics to\r\nprove that internal cuts exist in odd-regular graphs almost surely. However, we\r\nsuggest a modification of Majority Dynamics, that yields parts with desired\r\ncores with high probability." acknowledgement: "I am grateful to Matthew Kwan for setting the problem, providing useful literature,\r\nfruitful discussions, text review, mentorship, general encouragement and support." article_number: '2406.07026' article_processing_charge: No arxiv: 1 author: - first_name: Pavel full_name: Arkhipov, Pavel id: b25f2ab2-1fed-11ee-8599-fe02d211784f last_name: Arkhipov citation: ama: 'Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv. doi:10.48550/arXiv.2406.07026' apa: 'Arkhipov, P. (n.d.). Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv. https://doi.org/10.48550/arXiv.2406.07026' chicago: 'Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2406.07026.' ieee: 'P. Arkhipov, “Majority dynamics and internal partitions of random regular graphs: Experimental results,” arXiv. .' ista: 'Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv, 2406.07026.' mla: 'Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” ArXiv, 2406.07026, doi:10.48550/arXiv.2406.07026.' short: P. Arkhipov, ArXiv (n.d.). date_created: 2024-06-12T07:01:52Z date_published: 2024-06-11T00:00:00Z date_updated: 2024-06-17T10:45:32Z day: '11' department: - _id: GradSch doi: 10.48550/arXiv.2406.07026 external_id: arxiv: - '2406.07026' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2406.07026 month: '06' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: 'Majority dynamics and internal partitions of random regular graphs: Experimental results' type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- _id: '17139' article_processing_charge: No author: - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Waleed full_name: Khalid, Waleed id: 097c0562-3cf0-11ee-8fd3-e7a79c1e2fd1 last_name: Khalid - first_name: Stefano full_name: Elefante, Stefano id: 490F40CE-F248-11E8-B48F-1D18A9856A87 last_name: Elefante - first_name: Stephan full_name: Stadlbauer, Stephan id: 4D0BC184-F248-11E8-B48F-1D18A9856A87 last_name: Stadlbauer citation: ama: 'Schlögl A, Khalid W, Elefante S, Stadlbauer S. How much memory per CPU core is requested? In: ASHPC24 - Austrian-Slovenian HPC Meeting 2024. EuroCC Austria; 2024:46. doi:10.25365/phaidra.463' apa: 'Schlögl, A., Khalid, W., Elefante, S., & Stadlbauer, S. (2024). How much memory per CPU core is requested? In ASHPC24 - Austrian-Slovenian HPC Meeting 2024 (p. 46). Grundlsee, Austria: EuroCC Austria. https://doi.org/10.25365/phaidra.463' chicago: Schlögl, Alois, Waleed Khalid, Stefano Elefante, and Stephan Stadlbauer. “How Much Memory per CPU Core Is Requested?” In ASHPC24 - Austrian-Slovenian HPC Meeting 2024, 46. EuroCC Austria, 2024. https://doi.org/10.25365/phaidra.463. ieee: A. Schlögl, W. Khalid, S. Elefante, and S. Stadlbauer, “How much memory per CPU core is requested?,” in ASHPC24 - Austrian-Slovenian HPC Meeting 2024, Grundlsee, Austria, 2024, p. 46. ista: 'Schlögl A, Khalid W, Elefante S, Stadlbauer S. 2024. How much memory per CPU core is requested? ASHPC24 - Austrian-Slovenian HPC Meeting 2024. ASHPC: Austrian-Slovenian HPC Meeting, 46.' mla: Schlögl, Alois, et al. “How Much Memory per CPU Core Is Requested?” ASHPC24 - Austrian-Slovenian HPC Meeting 2024, EuroCC Austria, 2024, p. 46, doi:10.25365/phaidra.463. short: A. Schlögl, W. Khalid, S. Elefante, S. Stadlbauer, in:, ASHPC24 - Austrian-Slovenian HPC Meeting 2024, EuroCC Austria, 2024, p. 46. conference: end_date: 2024-06-13 location: Grundlsee, Austria name: 'ASHPC: Austrian-Slovenian HPC Meeting' start_date: 2024-06-10 date_created: 2024-06-14T09:06:36Z date_published: 2024-06-13T00:00:00Z date_updated: 2024-06-17T09:40:37Z day: '13' ddc: - '000' department: - _id: ScienComp doi: 10.25365/phaidra.463 file: - access_level: open_access checksum: f7d3dded6df2dcdb4818904cf2e1c183 content_type: application/pdf creator: dernst date_created: 2024-06-17T09:36:51Z date_updated: 2024-06-17T09:36:51Z file_id: '17153' file_name: 2024_ASHPC_Schloegl.pdf file_size: 206746 relation: main_file success: 1 file_date_updated: 2024-06-17T09:36:51Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '46' publication: ASHPC24 - Austrian-Slovenian HPC Meeting 2024 publication_identifier: isbn: - '9783200096455' publication_status: published publisher: EuroCC Austria quality_controlled: '1' status: public title: How much memory per CPU core is requested? 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_abstract user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '17141' abstract: - lang: eng text: The TIR1/AFB–Aux/IAA–ARF canonical auxin signaling pathway is widely accepted to (de)active transcriptional regulation, thus controlling auxin-associated developmental processes. However, the theme of a rapid auxin response has emerged since the 2018 Auxins and Cytokinin in Plant Development conference. To date, a few signaling components have been identified to mediate both slow and rapid auxin responses, which unveils the complexity of auxin signaling. acknowledgement: "We thank other lab members for their critical comments on this manuscript. We also thank the editor and reviewers for their constructive comments to improve our manuscript. We apologize to authors whose important work we could not include due to space limitations.\r\nThis work is supported by funding from Jiangxi Agricultural University (9232308314) and the Science and Technology Department of Jiangxi Province (20223BCJ25037) to HBH, and the Science and Technology Department of Jiangxi Province (20202ACB215002) to SYP." article_number: erae246 article_processing_charge: No article_type: original author: - first_name: Zilin full_name: Zhang, Zilin last_name: Zhang - first_name: Huihuang full_name: Chen, Huihuang id: 83c96512-15b2-11ec-abd3-b7eede36184f last_name: Chen - first_name: Shuaiying full_name: Peng, Shuaiying last_name: Peng - first_name: Huibin full_name: Han, Huibin last_name: Han citation: ama: Zhang Z, Chen H, Peng S, Han H. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 2024;75(18). doi:10.1093/jxb/erae246 apa: Zhang, Z., Chen, H., Peng, S., & Han, H. (2024). Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/erae246 chicago: Zhang, Zilin, Huihuang Chen, Shuaiying Peng, and Huibin Han. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany. Oxford University Press, 2024. https://doi.org/10.1093/jxb/erae246. ieee: Z. Zhang, H. Chen, S. Peng, and H. Han, “Slow and rapid auxin responses in Arabidopsis,” Journal of Experimental Botany, vol. 75, no. 18. Oxford University Press, 2024. ista: Zhang Z, Chen H, Peng S, Han H. 2024. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 75(18), erae246. mla: Zhang, Zilin, et al. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany, vol. 75, no. 18, erae246, Oxford University Press, 2024, doi:10.1093/jxb/erae246. short: Z. Zhang, H. Chen, S. Peng, H. Han, Journal of Experimental Botany 75 (2024). date_created: 2024-06-15T19:50:15Z date_published: 2024-09-27T00:00:00Z date_updated: 2025-09-08T07:57:50Z day: '27' ddc: - '580' department: - _id: GradSch - _id: JiFr doi: 10.1093/jxb/erae246 external_id: isi: - '001270051200001' pmid: - '38794966' file: - access_level: open_access checksum: 91b9435ed0f6640809c7588df19abf2f content_type: application/pdf creator: dernst date_created: 2025-01-02T10:26:22Z date_updated: 2025-01-02T10:26:22Z file_id: '18720' file_name: 2024_JourExperimentalBotany_Zhang.pdf file_size: 763097 relation: main_file success: 1 file_date_updated: 2025-01-02T10:26:22Z has_accepted_license: '1' intvolume: ' 75' isi: 1 issue: '18' language: - iso: eng month: '09' oa: 1 oa_version: Published Version pmid: 1 publication: Journal of Experimental Botany publication_identifier: issn: - 0022-0957 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Slow and rapid auxin responses in Arabidopsis 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 75 year: '2024' ... --- APC_amount: 6081,83 EUR DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '17142' abstract: - lang: eng text: Despite the diverse genetic origins of autism spectrum disorders (ASDs), affected individuals share strikingly similar and correlated behavioural traits that include perceptual and sensory processing challenges. Notably, the severity of these sensory symptoms is often predictive of the expression of other autistic traits. However, the origin of these perceptual deficits remains largely elusive. Here, we show a recurrent impairment in visual threat perception that is similarly impaired in 3 independent mouse models of ASD with different molecular aetiologies. Interestingly, this deficit is associated with reduced avoidance of threatening environments—a nonperceptual trait. Focusing on a common cause of ASDs, the Setd5 gene mutation, we define the molecular mechanism. We show that the perceptual impairment is caused by a potassium channel (Kv1)-mediated hypoexcitability in a subcortical node essential for the initiation of escape responses, the dorsal periaqueductal grey (dPAG). Targeted pharmacological Kv1 blockade rescued both perceptual and place avoidance deficits, causally linking seemingly unrelated trait deficits to the dPAG. Furthermore, we show that different molecular mechanisms converge on similar behavioural phenotypes by demonstrating that the autism models Cul3 and Ptchd1, despite having similar behavioural phenotypes, differ in their functional and molecular alteration. Our findings reveal a link between rapid perception controlled by subcortical pathways and appropriate learned interactions with the environment and define a nondevelopmental source of such deficits in ASD. acknowledgement: 'This work was supported by a European Research Council Starting Grant 756502 (MJ). ' article_number: e3002668 article_processing_charge: Yes article_type: original author: - first_name: Laura full_name: Burnett, Laura id: 3B717F68-F248-11E8-B48F-1D18A9856A87 last_name: Burnett orcid: 0000-0002-8937-410X - first_name: Peter full_name: Koppensteiner, Peter id: 3B8B25A8-F248-11E8-B48F-1D18A9856A87 last_name: Koppensteiner orcid: 0000-0002-3509-1948 - first_name: Olga full_name: Symonova, Olga id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87 last_name: Symonova orcid: 0000-0003-2012-9947 - first_name: Tomas full_name: Masson, Tomas id: 93ac43e8-8599-11eb-9b86-f6efb0a4c207 last_name: Masson orcid: 0000-0002-2634-6283 - first_name: Tomas A full_name: Vega Zuniga, Tomas A id: 2E7C4E78-F248-11E8-B48F-1D18A9856A87 last_name: Vega Zuniga - first_name: Ximena full_name: Contreras, Ximena id: 475990FE-F248-11E8-B48F-1D18A9856A87 last_name: Contreras - first_name: Thomas full_name: Rülicke, Thomas last_name: Rülicke - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 citation: ama: Burnett L, Koppensteiner P, Symonova O, et al. Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice. PLoS Biology. 2024;22. doi:10.1371/journal.pbio.3002668 apa: Burnett, L., Koppensteiner, P., Symonova, O., Masson, T., Vega Zuniga, T. A., Contreras, X., … Jösch, M. A. (2024). Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3002668 chicago: Burnett, Laura, Peter Koppensteiner, Olga Symonova, Tomas Masson, Tomas A Vega Zuniga, Ximena Contreras, Thomas Rülicke, Ryuichi Shigemoto, Gaia Novarino, and Maximilian A Jösch. “Shared Behavioural Impairments in Visual Perception and Place Avoidance across Different Autism Models Are Driven by Periaqueductal Grey Hypoexcitability in Setd5 Haploinsufficient Mice.” PLoS Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pbio.3002668. ieee: L. Burnett et al., “Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice,” PLoS Biology, vol. 22. Public Library of Science, 2024. ista: Burnett L, Koppensteiner P, Symonova O, Masson T, Vega Zuniga TA, Contreras X, Rülicke T, Shigemoto R, Novarino G, Jösch MA. 2024. Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice. PLoS Biology. 22, e3002668. mla: Burnett, Laura, et al. “Shared Behavioural Impairments in Visual Perception and Place Avoidance across Different Autism Models Are Driven by Periaqueductal Grey Hypoexcitability in Setd5 Haploinsufficient Mice.” PLoS Biology, vol. 22, e3002668, Public Library of Science, 2024, doi:10.1371/journal.pbio.3002668. short: L. Burnett, P. Koppensteiner, O. Symonova, T. Masson, T.A. Vega Zuniga, X. Contreras, T. Rülicke, R. Shigemoto, G. Novarino, M.A. Jösch, PLoS Biology 22 (2024). corr_author: '1' date_created: 2024-06-16T22:01:05Z date_published: 2024-06-10T00:00:00Z date_updated: 2025-09-08T07:57:11Z day: '10' ddc: - '570' department: - _id: RySh - _id: GaNo - _id: MaJö doi: 10.1371/journal.pbio.3002668 ec_funded: 1 external_id: isi: - '001246176800003' pmid: - '38857283' file: - access_level: open_access checksum: 496e1aa4fd5b92b7e4087ecc2c964133 content_type: application/pdf creator: dernst date_created: 2025-01-09T10:39:41Z date_updated: 2025-01-09T10:39:41Z file_id: '18805' file_name: 2024_PloS_Burnett.pdf file_size: 4016568 relation: main_file success: 1 file_date_updated: 2025-01-09T10:39:41Z has_accepted_license: '1' intvolume: ' 22' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2634E9D2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '756502' name: Circuits of Visual Attention publication: PLoS Biology publication_identifier: eissn: - 1545-7885 issn: - 1544-9173 publication_status: published publisher: Public Library of Science quality_controlled: '1' related_material: link: - relation: software url: https://doi.org/10.5281/zenodo.11130587 record: - id: '15385' relation: research_data status: public scopus_import: '1' status: public title: Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 22 year: '2024' ... --- _id: '17143' abstract: - lang: eng text: "This paper deals with local criteria for the convergence to a global minimiser for gradient flow trajectories and their discretisations. To obtain quantitative estimates on the speed of convergence, we consider variations on the classical Kurdyka–Łojasiewicz inequality for a large class of parameter functions. Our assumptions are given in terms of the initial data, without any reference to an equilibrium point. The main results are convergence statements for gradient flow curves and proximal point sequences to a global minimiser, together with sharp quantitative estimates on the speed of convergence. These convergence results apply in the general setting of lower semicontinuous functionals on complete metric spaces, generalising recent results for smooth functionals on Rn. While the non-smooth setting covers very general spaces, it is also useful for (non)-smooth functionals on Rn.\r\n." acknowledgement: The authors gratefully acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 716117). This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/ESP208. This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Lorenzo full_name: Dello Schiavo, Lorenzo id: ECEBF480-9E4F-11EA-B557-B0823DDC885E last_name: Dello Schiavo orcid: 0000-0002-9881-6870 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti citation: ama: Dello Schiavo L, Maas J, Pedrotti F. Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. 2024;377(6):3779-3804. doi:10.1090/tran/9156 apa: Dello Schiavo, L., Maas, J., & Pedrotti, F. (2024). Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/9156 chicago: Dello Schiavo, Lorenzo, Jan Maas, and Francesco Pedrotti. “Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces.” Transactions of the American Mathematical Society. American Mathematical Society, 2024. https://doi.org/10.1090/tran/9156. ieee: L. Dello Schiavo, J. Maas, and F. Pedrotti, “Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces,” Transactions of the American Mathematical Society, vol. 377, no. 6. American Mathematical Society, pp. 3779–3804, 2024. ista: Dello Schiavo L, Maas J, Pedrotti F. 2024. Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces. Transactions of the American Mathematical Society. 377(6), 3779–3804. mla: Dello Schiavo, Lorenzo, et al. “Local Conditions for Global Convergence of Gradient Flows and Proximal Point Sequences in Metric Spaces.” Transactions of the American Mathematical Society, vol. 377, no. 6, American Mathematical Society, 2024, pp. 3779–804, doi:10.1090/tran/9156. short: L. Dello Schiavo, J. Maas, F. Pedrotti, Transactions of the American Mathematical Society 377 (2024) 3779–3804. date_created: 2024-06-16T22:01:06Z date_published: 2024-06-01T00:00:00Z date_updated: 2026-04-07T13:00:02Z day: '01' department: - _id: JaMa doi: 10.1090/tran/9156 ec_funded: 1 external_id: arxiv: - '2304.05239' isi: - '001203273300001' intvolume: ' 377' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2304.05239 month: '06' oa: 1 oa_version: Preprint page: 3779-3804 project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 34dbf174-11ca-11ed-8bc3-afe9d43d4b9c grant_number: E208 name: Configuration Spaces over Non-Smooth Spaces publication: Transactions of the American Mathematical Society publication_identifier: eissn: - 1088-6850 issn: - 0002-9947 publication_status: published publisher: American Mathematical Society quality_controlled: '1' related_material: record: - id: '17336' relation: dissertation_contains status: public scopus_import: '1' status: public title: Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 377 year: '2024' ... --- _id: '17144' abstract: - lang: eng text: "We prove that the medial axis of closed sets is Hausdorff stable in the following sense: Let \U0001D4AE ⊆ ℝ^d be a fixed closed set that contains a bounding sphere. That is, the bounding sphere is part of the set \U0001D4AE. Consider the space of C^{1,1} diffeomorphisms of ℝ^d to itself, which keep the bounding sphere invariant. The map from this space of diffeomorphisms (endowed with a Banach norm) to the space of closed subsets of ℝ^d (endowed with the Hausdorff distance), mapping a diffeomorphism F to the closure of the medial axis of F(\U0001D4AE), is Lipschitz. This extends a previous stability result of Chazal and Soufflet on the stability of the medial axis of C² manifolds under C² ambient diffeomorphisms." acknowledgement: "This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nSupported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Cô d'Azur.\r\nWe are greatly indebted to Fred Chazal for sharing his insights. We further thank Erin Chambers, Christopher Fillmore, and Elizabeth Stephenson for early discussions and all members of the Edelsbrunner group (Institute of Science and Technology Austria) and the Datashape team (Inria) for the atmosphere in which this research was conducted." alternative_title: - LIPIcs article_number: '69' article_processing_charge: No arxiv: 1 author: - first_name: Hana full_name: Kourimska, Hana id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E last_name: Kourimska orcid: 0000-0001-7841-0091 - first_name: André full_name: Lieutier, André last_name: Lieutier - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Kourimska H, Lieutier A, Wintraecken M. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.69' apa: 'Kourimska, H., Lieutier, A., & Wintraecken, M. (2024). The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.69' chicago: Kourimska, Hana, André Lieutier, and Mathijs Wintraecken. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.69. ieee: H. Kourimska, A. Lieutier, and M. Wintraecken, “The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293. ista: 'Kourimska H, Lieutier A, Wintraecken M. 2024. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 69.' mla: Kourimska, Hana, et al. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” 40th International Symposium on Computational Geometry, vol. 293, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.69. short: H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. conference: end_date: 2024-06-14 location: Athens, Greece name: 'SoCG: Symposium on Computational Geometry' date_created: 2024-06-16T22:01:06Z date_published: 2024-06-01T00:00:00Z date_updated: 2025-04-15T07:16:58Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2024.69 ec_funded: 1 external_id: arxiv: - '2212.01118' file: - access_level: open_access checksum: b40ff456c19294adb5d9613fcfd751c6 content_type: application/pdf creator: dernst date_created: 2024-06-17T08:33:40Z date_updated: 2024-06-17T08:33:40Z file_id: '17150' file_name: 2024_LIPICS_Kourimska.pdf file_size: 1612558 relation: main_file success: 1 file_date_updated: 2024-06-17T08:33:40Z has_accepted_license: '1' intvolume: ' 293' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: 40th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959773164' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms 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: 293 year: '2024' ... --- _id: '17145' abstract: - lang: eng text: Grid peeling is the process of repeatedly removing the convex hull vertices of the grid points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous process, the affine curve-shortening flow, which deforms the curve based on the curvature. We prove this conjecture for one class of curves, parabolas with a vertical axis, and we determine the value of the constant factor in the formula that relates the two processes. acknowledgement: Part of this work was done while G.R. enjoyed the hospitality of the Institute of Science and Technology Austria (ISTA) as a visiting professor during his sabbatical in the winter semester 2022/23. alternative_title: - LIPIcs article_number: '76' article_processing_charge: No arxiv: 1 author: - first_name: Günter full_name: Rote, Günter last_name: Rote - first_name: Moritz full_name: Rüber, Moritz last_name: Rüber - first_name: Morteza full_name: Saghafian, Morteza id: f86f7148-b140-11ec-9577-95435b8df824 last_name: Saghafian citation: ama: 'Rote G, Rüber M, Saghafian M. Grid peeling of parabolas. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.76' apa: 'Rote, G., Rüber, M., & Saghafian, M. (2024). Grid peeling of parabolas. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.76' chicago: Rote, Günter, Moritz Rüber, and Morteza Saghafian. “Grid Peeling of Parabolas.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.76. ieee: G. Rote, M. Rüber, and M. Saghafian, “Grid peeling of parabolas,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293. ista: 'Rote G, Rüber M, Saghafian M. 2024. Grid peeling of parabolas. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 76.' mla: Rote, Günter, et al. “Grid Peeling of Parabolas.” 40th International Symposium on Computational Geometry, vol. 293, 76, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.76. short: G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. conference: end_date: 2024-06-14 location: Athens, Greece name: 'SoCG: Symposium on Computational Geometry' start_date: 2024-06-11 date_created: 2024-06-16T22:01:06Z date_published: 2024-06-01T00:00:00Z date_updated: 2024-06-17T08:41:56Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2024.76 external_id: arxiv: - '2402.15787' file: - access_level: open_access checksum: fbad1de06383a6b7e8a1cb3e8c7205ce content_type: application/pdf creator: dernst date_created: 2024-06-17T08:40:04Z date_updated: 2024-06-17T08:40:04Z file_id: '17151' file_name: 2024_LIPICS_Rote.pdf file_size: 1430896 relation: main_file success: 1 file_date_updated: 2024-06-17T08:40:04Z has_accepted_license: '1' intvolume: ' 293' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 40th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959773164' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Grid peeling of parabolas 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: 293 year: '2024' ... --- _id: '17154' abstract: - lang: eng text: We compute the deterministic approximation for mixed fluctuation moments of products of deterministic matrices and general Sobolev functions of Wigner matrices. Restricting to polynomials, our formulas reproduce recent results of Male et al. (Random Matrices Theory Appl. 11(2):2250015, 2022), showing that the underlying combinatorics of non-crossing partitions and annular non-crossing permutations continue to stay valid beyond the setting of second-order free probability theory. The formulas obtained further characterize the variance in the functional central limit theorem given in the recent companion paper (Reker in Preprint, arXiv:2204.03419, 2023). and thus allow identifying the fluctuation around the thermal value in certain thermalization problems. article_number: '10' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Jana full_name: Reker, Jana id: e796e4f9-dc8d-11ea-abe3-97e26a0323e9 last_name: Reker citation: ama: Reker J. Fluctuation moments for regular functions of Wigner Matrices. Mathematical Physics, Analysis and Geometry. 2024;27(3). doi:10.1007/s11040-024-09483-y apa: Reker, J. (2024). Fluctuation moments for regular functions of Wigner Matrices. Mathematical Physics, Analysis and Geometry. Springer Nature. https://doi.org/10.1007/s11040-024-09483-y chicago: Reker, Jana. “Fluctuation Moments for Regular Functions of Wigner Matrices.” Mathematical Physics, Analysis and Geometry. Springer Nature, 2024. https://doi.org/10.1007/s11040-024-09483-y. ieee: J. Reker, “Fluctuation moments for regular functions of Wigner Matrices,” Mathematical Physics, Analysis and Geometry, vol. 27, no. 3. Springer Nature, 2024. ista: Reker J. 2024. Fluctuation moments for regular functions of Wigner Matrices. Mathematical Physics, Analysis and Geometry. 27(3), 10. mla: Reker, Jana. “Fluctuation Moments for Regular Functions of Wigner Matrices.” Mathematical Physics, Analysis and Geometry, vol. 27, no. 3, 10, Springer Nature, 2024, doi:10.1007/s11040-024-09483-y. short: J. Reker, Mathematical Physics, Analysis and Geometry 27 (2024). date_created: 2024-06-21T09:31:17Z date_published: 2024-06-20T00:00:00Z date_updated: 2026-04-07T13:02:12Z day: '20' ddc: - '519' department: - _id: LaEr doi: 10.1007/s11040-024-09483-y ec_funded: 1 external_id: arxiv: - '2307.11029' isi: - '001251464300001' file: - access_level: open_access checksum: 7d04318d66f765621bdcb648378d458e content_type: application/pdf creator: cchlebak date_created: 2024-06-26T11:26:42Z date_updated: 2024-06-26T11:26:42Z file_id: '17175' file_name: 2024_MathPhysAnaGeo_Reker.pdf file_size: 1327596 relation: main_file success: 1 file_date_updated: 2024-06-26T11:26:42Z has_accepted_license: '1' intvolume: ' 27' isi: 1 issue: '3' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Mathematical Physics, Analysis and Geometry publication_identifier: eissn: - 1572-9656 issn: - 1385-0172 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '17164' relation: dissertation_contains status: public scopus_import: '1' status: public title: Fluctuation moments for regular functions of Wigner Matrices 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 27 year: '2024' ... --- OA_place: publisher _id: '17156' abstract: - lang: eng text: "This dissertation is the summary of the author’s work, concerning the relations between\r\ncohomology rings of algebraic varieties and rings of functions on zero schemes and fixed\r\npoint schemes. For most of the thesis, the focus is on smooth complex varieties with\r\nan action of a principally paired group, e.g. a parabolic subgroup of a reductive group.\r\nThe fundamental theorem 5.2.11 from co-authored article [66] says that if the principal\r\nnilpotent has a unique zero, then the zero scheme over the Kostant section is isomorphic\r\nto the spectrum of the equivariant cohomology ring, remembering the grading in terms of\r\na C^* action. A similar statement is proved also for the G-invariant functions on the total\r\nzero scheme over the whole Lie algebra. Additionally, we are able to prove an analogous\r\nresult for the GKM spaces, which poses the question on a joint generalisation.\r\nWe also tackle the situation of a singular variety. As long as it is embedded in a smooth\r\nvariety with regular action, we are able to study its cohomology as well by means of\r\nthe zero scheme. In case of e.g. Schubert varieties this determines the cohomology ring\r\ncompletely. In largest generality, this allows us to see a significant part of the cohomology\r\nring.\r\nWe also show (Theorem 6.2.1) that the cohomology ring of spherical varieties appears as\r\nthe ring of functions on the zero scheme. The computational aspect is not easy, but one\r\ncan hope that this can bring some concrete information about such cohomology rings.\r\nLastly, the K-theory conjecture 6.3.1 is studied, with some results attained for GKM\r\nspaces.\r\nThe thesis includes also an introduction to group actions on algebraic varieties. In\r\nparticular, the vector fields associated to the actions are extensively studied. We also\r\nprovide a version of the Kostant section for arbitrary principally paired group, which\r\nparametrises the regular orbits in the Lie algebra of an algebraic group. Before proving\r\nthe main theorem, we also include a historical overview of the field. In particular we bring\r\ntogether the results of Akyildiz, Carrell and Lieberman on non-equivariant cohomology\r\nrings." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Kamil P full_name: Rychlewicz, Kamil P id: 85A07246-A8BF-11E9-B4FA-D9E3E5697425 last_name: Rychlewicz citation: ama: Rychlewicz KP. Equivariant cohomology and rings of functions. 2024. doi:10.15479/at:ista:17156 apa: Rychlewicz, K. P. (2024). Equivariant cohomology and rings of functions. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17156 chicago: Rychlewicz, Kamil P. “Equivariant Cohomology and Rings of Functions.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17156. ieee: K. P. Rychlewicz, “Equivariant cohomology and rings of functions,” Institute of Science and Technology Austria, 2024. ista: Rychlewicz KP. 2024. Equivariant cohomology and rings of functions. Institute of Science and Technology Austria. mla: Rychlewicz, Kamil P. Equivariant Cohomology and Rings of Functions. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17156. short: K.P. Rychlewicz, Equivariant Cohomology and Rings of Functions, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-06-23T15:07:06Z date_published: 2024-06-25T00:00:00Z date_updated: 2026-04-07T12:55:46Z day: '25' ddc: - '516' degree_awarded: PhD department: - _id: TaHa - _id: GradSch doi: 10.15479/at:ista:17156 file: - access_level: closed checksum: 1610063569f5452f8a5acef728c2fc26 content_type: application/zip creator: krychlew date_created: 2024-06-26T20:56:27Z date_updated: 2024-06-26T21:00:14Z file_id: '17179' file_name: thesis.zip file_size: 2761814 relation: source_file - access_level: open_access checksum: 7bbadb1fbc9ed2a1ecf54597f88af99c content_type: application/pdf creator: krychlew date_created: 2024-06-26T20:58:24Z date_updated: 2024-06-26T20:58:24Z file_id: '17180' file_name: thesis.pdf file_size: 3695952 relation: main_file file_date_updated: 2024-06-26T21:00:14Z has_accepted_license: '1' keyword: - equivariant cohomology - zero schemes - algebraic groups - Lie algebras language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '117' project: - _id: 34cd0f74-11ca-11ed-8bc3-bf0492a14a24 grant_number: '26525' name: Topology of open smooth varieties with a torus action publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '17157' relation: part_of_dissertation status: public status: public supervisor: - first_name: Tamás full_name: Hausel, Tamás id: 4A0666D8-F248-11E8-B48F-1D18A9856A87 last_name: Hausel orcid: 0000-0002-9582-2634 title: Equivariant cohomology and rings of 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: '2024' ... --- _id: '17161' abstract: - lang: eng text: Dynamic processes in molecules can occur on a wide range of timescales, and it is important to understand which timescales of motion contribute to different parameters used in dynamics measurements. For spin relaxation, this can easily be understood from the sampling frequencies of the spectral-density function by different relaxation-rate constants. In addition to data from relaxation measurements, determining dynamically averaged anisotropic interactions in magic-angle spinning (MAS) solid-state NMR allows for better quantification of the amplitude of molecular motion. For partially averaged anisotropic interactions, the relevant timescales of motion are not so clearly defined. Whether the averaging depends on the experimental methods (e.g., pulse sequences) or conditions (e.g., MAS frequency, magnitude of anisotropic interaction, radio-frequency field amplitudes) is not fully understood. To investigate these questions, we performed numerical simulations of dynamic systems based on the stochastic Liouville equation using several experiments for recoupling the dipolar coupling, chemical-shift anisotropy or quadrupolar coupling. As described in the literature, the transition between slow motion, where parameters characterizing the anisotropic interaction are not averaged, and fast motion, where the tensors are averaged leading to a scaled anisotropic quantity, occurs over a window of motional rate constants that depends mainly on the strength of the interaction. This transition region can span 2 orders of magnitude in exchange-rate constants (typically in the microsecond range) but depends only marginally on the employed recoupling scheme or sample spinning frequency. The transition region often coincides with a fast relaxation of coherences, making precise quantitative measurements difficult. Residual couplings in off-magic-angle experiments, however, average over longer timescales of motion. While in principle one may gain information on the timescales of motion from the transition area, extracting such information is hampered by low signal-to-noise ratio in experimental spectra due to fast relaxation that occurs in the same region. acknowledgement: "We would like to thank Kay Saalwächter for pointing out important aspects of the intermediate regime during the open review process. Lea Marie Becker is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria.\r\nThis research has been supported by the Österreichischen Akademie der Wissenschaften (grant no. PR10660EAW01) and the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (grant nos. 200020_188988 and 200020_219375)." article_processing_charge: Yes article_type: original author: - first_name: Kathrin full_name: Aebischer, Kathrin last_name: Aebischer - first_name: Lea Marie full_name: Becker, Lea Marie id: 36336939-eb97-11eb-a6c2-c83f1214ca79 last_name: Becker orcid: 0000-0002-6401-5151 - first_name: Paul full_name: Schanda, Paul id: 7B541462-FAF6-11E9-A490-E8DFE5697425 last_name: Schanda orcid: 0000-0002-9350-7606 - first_name: Matthias full_name: Ernst, Matthias last_name: Ernst citation: ama: Aebischer K, Becker LM, Schanda P, Ernst M. Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR. Magnetic Resonance. 2024;5(1):69-86. doi:10.5194/mr-5-69-2024 apa: Aebischer, K., Becker, L. M., Schanda, P., & Ernst, M. (2024). Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR. Magnetic Resonance. Copernicus Publications. https://doi.org/10.5194/mr-5-69-2024 chicago: Aebischer, Kathrin, Lea Marie Becker, Paul Schanda, and Matthias Ernst. “Evaluating the Motional Timescales Contributing to Averaged Anisotropic Interactions in MAS Solid-State NMR.” Magnetic Resonance. Copernicus Publications, 2024. https://doi.org/10.5194/mr-5-69-2024. ieee: K. Aebischer, L. M. Becker, P. Schanda, and M. Ernst, “Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR,” Magnetic Resonance, vol. 5, no. 1. Copernicus Publications, pp. 69–86, 2024. ista: Aebischer K, Becker LM, Schanda P, Ernst M. 2024. Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR. Magnetic Resonance. 5(1), 69–86. mla: Aebischer, Kathrin, et al. “Evaluating the Motional Timescales Contributing to Averaged Anisotropic Interactions in MAS Solid-State NMR.” Magnetic Resonance, vol. 5, no. 1, Copernicus Publications, 2024, pp. 69–86, doi:10.5194/mr-5-69-2024. short: K. Aebischer, L.M. Becker, P. Schanda, M. Ernst, Magnetic Resonance 5 (2024) 69–86. date_created: 2024-06-23T22:01:02Z date_published: 2024-06-11T00:00:00Z date_updated: 2025-06-11T13:26:12Z day: '11' ddc: - '530' department: - _id: PaSc doi: 10.5194/mr-5-69-2024 external_id: pmid: - '40384772' file: - access_level: open_access checksum: d01074f6919387fcaf8c9ebed320ccae content_type: application/pdf creator: dernst date_created: 2024-06-27T06:42:55Z date_updated: 2024-06-27T06:42:55Z file_id: '17181' file_name: 2024_MagneticResonance_Aebischer.pdf file_size: 6736194 relation: main_file success: 1 file_date_updated: 2024-06-27T06:42:55Z has_accepted_license: '1' intvolume: ' 5' issue: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 69-86 pmid: 1 project: - _id: 7be609c4-9f16-11ee-852c-85015ce2b9b0 grant_number: '26777' name: Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches publication: Magnetic Resonance publication_identifier: eissn: - 2699-0016 publication_status: published publisher: Copernicus Publications quality_controlled: '1' scopus_import: '1' status: public title: Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR 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: 5 year: '2024' ... --- _id: '17162' abstract: - lang: eng text: "Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. ‍given a threshold t the goal is to find a probability bound p such that ℙ[total cost ≥ t] ≤ p. Intuitively, given a threshold t on the resource, the problem is to find the likelihood that the total cost exceeds this threshold.\r\nFirst, for expectation bounds, a major obstacle in previous works on cost analysis is that they can handle only non-negative costs or bounded variable updates. In contrast, we provide a new variant of the standard notion of cost martingales, that allows us to find expectation bounds for a class of programs with general positive or negative costs and no restriction on the variable updates. More specifically, our approach is applicable as long as there is a lower bound on the total cost incurred along every path.\r\nSecond, for tail bounds, all previous methods are limited to programs in which the expected total cost is finite. In contrast, we present a novel approach, based on a combination of our martingale-based method for expectation bounds with a quantitative safety analysis, to obtain a solution to the tail bound problem that is applicable even to programs with infinite expected cost. Specifically, this allows us to obtain runtime tail bounds for programs that do not terminate almost-surely.\r\nIn summary, we provide a novel combination of martingale-based cost analysis and quantitative safety analysis that is able to find expectation and tail cost bounds for probabilistic programs, without the restrictions of non-negative costs, bounded updates, or finiteness of the expected total cost. Finally, we provide experimental results showcasing that our approach can solve instances that were beyond the reach of previous methods." acknowledgement: "This work was supported in part by the European Research Council (ERC) under Grant No. 863818\r\n(ForM-SMArt) and the Hong Kong Research Grants Council under ECS Project No. 26208122." article_number: '107' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic orcid: 0000-0002-4681-1699 citation: ama: Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8(OOPSLA1). doi:10.1145/3649824 apa: Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824 chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2024. https://doi.org/10.1145/3649824. ieee: K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024. ista: Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2024. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 8(OOPSLA1), 107. mla: Chatterjee, Krishnendu, et al. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1, 107, Association for Computing Machinery, 2024, doi:10.1145/3649824. short: K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024). date_created: 2024-06-23T22:01:02Z date_published: 2024-04-29T00:00:00Z date_updated: 2025-04-14T07:52:47Z day: '29' ddc: - '000' department: - _id: KrCh doi: 10.1145/3649824 ec_funded: 1 file: - access_level: open_access checksum: 9243ded966f71df1572be5466019be5c content_type: application/pdf creator: dernst date_created: 2024-06-27T07:48:16Z date_updated: 2024-06-27T07:48:16Z file_id: '17182' file_name: 2024_ProcACMProgLanguage_Chatterjee.pdf file_size: 413096 relation: main_file success: 1 file_date_updated: 2024-06-27T07:48:16Z has_accepted_license: '1' intvolume: ' 8' issue: OOPSLA1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Quantitative bounds on resource usage of probabilistic programs 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: 8 year: '2024' ... --- OA_place: publisher _id: '17164' abstract: - lang: eng text: "This thesis is structured into two parts. In the first part, we consider the random\r\nvariable X := Tr(f1(W)A1 . . . fk(W)Ak) where W is an N × N Hermitian Wigner matrix, k ∈ N, and we choose (possibly N-dependent) regular functions f1, . . . , fk as well as\r\nbounded deterministic matrices A1, . . . , Ak. In this context, we prove a functional central\r\nlimit theorem on macroscopic and mesoscopic scales, showing that the fluctuations of X\r\naround its expectation are Gaussian and that the limiting covariance structure is given\r\nby a deterministic recursion. We further give explicit error bounds in terms of the scaling\r\nof f1, . . . , fk and the number of traceless matrices among A1, . . . , Ak, thus extending\r\nthe results of Cipolloni, Erdős and Schröder [40] to products of arbitrary length k ≥ 2.\r\nAnalyzing the underlying combinatorics leads to a non-recursive formula for the variance\r\nof X as well as the covariance of X and Y := Tr(fk+1(W)Ak+1 . . . fk+ℓ(W)Ak+ℓ) of similar\r\nbuild. When restricted to polynomials, these formulas reproduce recent results of Male,\r\nMingo, Peché, and Speicher [107], showing that the underlying combinatorics of noncrossing partitions and annular non-crossing permutations continue to stay valid beyond\r\nthe setting of second-order free probability theory. As an application, we consider the\r\nfluctuation of Tr(eitW A1e\r\n−itW A2)/N around its thermal value Tr(A1) Tr(A2)/N2 when t\r\nis large and give an explicit formula for the variance.\r\nThe second part of the thesis collects three smaller projects focusing on different random\r\nmatrix models. In the first project, we show that a class of weakly perturbed Hamiltonians\r\nof the form Hλ = H0 + λW, where W is a Wigner matrix, exhibits prethermalization.\r\nThat is, the time evolution generated by Hλ relaxes to its ultimate thermal state via an\r\nintermediate prethermal state with a lifetime of order λ\r\n−2\r\n. As the main result, we obtain\r\na general relaxation formula, expressing the perturbed dynamics via the unperturbed\r\ndynamics and the ultimate thermal state. The proof relies on a two-resolvent global law\r\nfor the deformed Wigner matrix Hλ.\r\nThe second project focuses on correlated random matrices, more precisely on a correlated N × N Hermitian random matrix with a polynomially decaying metric correlation\r\nstructure. A trivial a priori bound shows that the operator norm of this model is stochastically dominated by √\r\nN. However, by calculating the trace of the moments of the matrix\r\nand using the summable decay of the cumulants, the norm estimate can be improved to a\r\nbound of order one.\r\nIn the third project, we consider a multiplicative perturbation of the form UA(t) where U\r\nis a unitary random matrix and A = diag(t, 1, ..., 1). This so-called UA model was\r\nfirst introduced by Fyodorov [73] for its applications in scattering theory. We give a\r\ngeneral description of the eigenvalue trajectories obtained by varying the parameter t and\r\nintroduce a flow of deterministic domains that separates the outlier resulting from the\r\nrank-one perturbation from the typical eigenvalues for all sub-critical timescales. The\r\nresults are obtained under generic assumptions on U that hold for various unitary random\r\nmatrices, including the circular unitary ensemble (CUE) in the original formulation of\r\nthe model." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jana full_name: Reker, Jana id: e796e4f9-dc8d-11ea-abe3-97e26a0323e9 last_name: Reker citation: ama: 'Reker J. Central limit theorems for random matrices: From resolvents to free probability. 2024. doi:10.15479/at:ista:17164' apa: 'Reker, J. (2024). Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17164' chicago: 'Reker, Jana. “Central Limit Theorems for Random Matrices: From Resolvents to Free Probability.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17164.' ieee: 'J. Reker, “Central limit theorems for random matrices: From resolvents to free probability,” Institute of Science and Technology Austria, 2024.' ista: 'Reker J. 2024. Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria.' mla: 'Reker, Jana. Central Limit Theorems for Random Matrices: From Resolvents to Free Probability. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17164.' short: 'J. Reker, Central Limit Theorems for Random Matrices: From Resolvents to Free Probability, Institute of Science and Technology Austria, 2024.' corr_author: '1' date_created: 2024-06-24T11:23:29Z date_published: 2024-06-26T00:00:00Z date_updated: 2026-04-07T13:02:13Z day: '26' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/at:ista:17164 ec_funded: 1 file: - access_level: open_access checksum: fb16d86e1f2753dc3a9e14d2bdfd84cd content_type: application/pdf creator: jreker date_created: 2024-06-26T12:39:36Z date_updated: 2024-06-26T12:44:53Z file_id: '17176' file_name: ISTA_Thesis_JReker.pdf file_size: 2783027 relation: main_file - access_level: closed checksum: cb1e54009d47c1dcf5b866c4566fa27f content_type: application/zip creator: jreker date_created: 2024-06-26T12:39:42Z date_updated: 2024-06-26T12:44:53Z file_id: '17177' file_name: ISTA_Thesis_JReker_SourceFiles.zip file_size: 3054878 relation: source_file file_date_updated: 2024-06-26T12:44:53Z has_accepted_license: '1' keyword: - Random Matrices - Spectrum - Central Limit Theorem - Resolvent - Free Probability language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '206' project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '17173' relation: part_of_dissertation status: public - id: '11135' relation: part_of_dissertation status: public - id: '17047' relation: part_of_dissertation status: public - id: '17154' relation: part_of_dissertation status: public - id: '17174' relation: part_of_dissertation status: public status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: 'Central limit theorems for random matrices: From resolvents to free probability' 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: '2024' ... --- _id: '17170' abstract: - lang: eng text: "In this article we extend and strengthen the seminal work by Niyogi, Smale, and Weinberger on the learning of the homotopy type from a sample of an underlying space. In their work, Niyogi, Smale, and Weinberger studied samples of C² manifolds with positive reach embedded in ℝ^d. We extend their results in the following ways: - As the ambient space we consider both ℝ^d and Riemannian manifolds with lower bounded sectional curvature. - In both types of ambient spaces, we study sets of positive reach - a significantly more general setting than C² manifolds - as well as general manifolds of positive reach. - The sample P of a set (or a manifold) \U0001D4AE of positive reach may be noisy. We work with two one-sided Hausdorff distances - ε and δ - between P and \U0001D4AE. We provide tight bounds in terms of ε and δ, that guarantee that there exists a parameter r such that the union of balls of radius r centred at the sample P deformation-retracts to \U0001D4AE. We exhibit their tightness by an explicit construction. We carefully distinguish the roles of δ and ε. This is not only essential to achieve tight bounds, but also sensible in practical situations, since it allows one to adapt the bound according to sample density and the amount of noise present in the sample separately." acknowledgement: "This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nWintraecken, Mathijs: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d'Azur." alternative_title: - LIPIcs article_processing_charge: No arxiv: 1 author: - first_name: Dominique full_name: Attali, Dominique last_name: Attali - first_name: Hana full_name: Kourimska, Hana id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E last_name: Kourimska orcid: 0000-0001-7841-0091 - first_name: Christopher D full_name: Fillmore, Christopher D id: 35638A5C-AAC7-11E9-B0BF-5503E6697425 last_name: Fillmore - first_name: Ishika full_name: Ghosh, Ishika id: ee449b28-344d-11ef-a6d5-9ca430e9e9ff last_name: Ghosh - first_name: André full_name: Lieutier, André last_name: Lieutier - first_name: Elizabeth R full_name: Stephenson, Elizabeth R id: 2D04F932-F248-11E8-B48F-1D18A9856A87 last_name: Stephenson orcid: 0000-0002-6862-208X - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Attali D, Kourimska H, Fillmore CD, et al. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19. doi:10.4230/LIPIcs.SoCG.2024.11' apa: 'Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., & Wintraecken, M. (2024). Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In 40th International Symposium on Computational Geometry (Vol. 293, p. 11:1-11:19). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.11' chicago: Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” In 40th International Symposium on Computational Geometry, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.11. ieee: D. Attali et al., “Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 11:1-11:19. ista: 'Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 11:1-11:19.' mla: Attali, Dominique, et al. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19, doi:10.4230/LIPIcs.SoCG.2024.11. short: D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19. conference: end_date: 2024-06-14 location: Athens, Greece name: 'SoCG: Symposium on Computational Geometry' start_date: 2024-06-11 date_created: 2024-06-25T11:45:58Z date_published: 2024-06-06T00:00:00Z date_updated: 2025-04-15T07:16:57Z day: '06' ddc: - '516' department: - _id: GradSch - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2024.11 ec_funded: 1 external_id: arxiv: - '2206.10485' file: - access_level: open_access checksum: 6a2ddc8b51aa58f197a8b294750f1f8d content_type: application/pdf creator: cfillmor date_created: 2024-06-25T11:47:26Z date_updated: 2024-06-25T11:47:26Z file_id: '17171' file_name: LIPIcs.SoCG.2024.11.pdf file_size: 20886142 relation: main_file success: 1 file_date_updated: 2024-06-25T11:47:26Z has_accepted_license: '1' intvolume: ' 293' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 11:1-11:19 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: 40th International Symposium on Computational Geometry publication_identifier: eissn: - 1868-8969 isbn: - '9783959773164' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds 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: 293 year: '2024' ... --- APC_amount: 804 EUR OA_place: publisher OA_type: gold _id: '17187' abstract: - lang: eng text: "The generation of diverse cell types during development is fundamental to brain\r\nfunctions. We outline a protocol to quantitatively assess the clonal output of individual neural progenitors using mosaic analysis with double markers (MADM) in\r\nmice. We first describe steps to acquire and reconstruct adult MADM clones in\r\nthe superior colliculus. Then we detail analysis pipelines to determine clonal\r\ncomposition and architecture. This protocol enables the buildup of quantitative\r\nframeworks of lineage progression with precise spatial resolution in the brain.\r\nFor complete details on the use and execution of this protocol, please refer to\r\nCheung et al.1" acknowledged_ssus: - _id: Bio - _id: PreCl acknowledgement: We thank A. Heger for mouse breeding support. This work was supported by the Scientific Service Units of IST Austria through resources provided by the Imaging & Optics and Preclinical facilities. G.C. received funding from the European Commission (IST plus postdoctoral fellowship); S.H. was funded by ISTA institutional funds and the Austrian Science Fund Special Research Programmes (FWF SFB-F78 Neuro Stem Modulation). article_number: '103157' article_processing_charge: Yes article_type: original author: - first_name: Giselle T full_name: Cheung, Giselle T id: 471195F6-F248-11E8-B48F-1D18A9856A87 last_name: Cheung orcid: 0000-0001-8457-2572 - first_name: Carmen full_name: Streicher, Carmen id: 36BCB99C-F248-11E8-B48F-1D18A9856A87 last_name: Streicher - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Cheung GT, Streicher C, Hippenmeyer S. Protocol for quantitative reconstruction of cell lineage using mosaic analysis with double markers in mice. STAR Protocols. 2024;5(3). doi:10.1016/j.xpro.2024.103157 apa: Cheung, G. T., Streicher, C., & Hippenmeyer, S. (2024). Protocol for quantitative reconstruction of cell lineage using mosaic analysis with double markers in mice. STAR Protocols. Elsevier. https://doi.org/10.1016/j.xpro.2024.103157 chicago: Cheung, Giselle T, Carmen Streicher, and Simon Hippenmeyer. “Protocol for Quantitative Reconstruction of Cell Lineage Using Mosaic Analysis with Double Markers in Mice.” STAR Protocols. Elsevier, 2024. https://doi.org/10.1016/j.xpro.2024.103157. ieee: G. T. Cheung, C. Streicher, and S. Hippenmeyer, “Protocol for quantitative reconstruction of cell lineage using mosaic analysis with double markers in mice,” STAR Protocols, vol. 5, no. 3. Elsevier, 2024. ista: Cheung GT, Streicher C, Hippenmeyer S. 2024. Protocol for quantitative reconstruction of cell lineage using mosaic analysis with double markers in mice. STAR Protocols. 5(3), 103157. mla: Cheung, Giselle T., et al. “Protocol for Quantitative Reconstruction of Cell Lineage Using Mosaic Analysis with Double Markers in Mice.” STAR Protocols, vol. 5, no. 3, 103157, Elsevier, 2024, doi:10.1016/j.xpro.2024.103157. short: G.T. Cheung, C. Streicher, S. Hippenmeyer, STAR Protocols 5 (2024). corr_author: '1' date_created: 2024-06-30T22:01:04Z date_published: 2024-09-20T00:00:00Z date_updated: 2025-12-30T10:54:11Z day: '20' ddc: - '570' department: - _id: SiHi doi: 10.1016/j.xpro.2024.103157 ec_funded: 1 external_id: pmid: - '38935508' file: - access_level: open_access checksum: d8a8cdba82a394e731aa699ace1ae433 content_type: application/pdf creator: dernst date_created: 2025-01-09T12:12:40Z date_updated: 2025-01-09T12:12:40Z file_id: '18809' file_name: 2024_STARProtoc_Cheung.pdf file_size: 5186071 relation: main_file success: 1 file_date_updated: 2025-01-09T12:12:40Z has_accepted_license: '1' intvolume: ' 5' issue: '3' language: - iso: eng month: '09' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E grant_number: F7805 name: Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression publication: STAR Protocols publication_identifier: eissn: - 2666-1667 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Protocol for quantitative reconstruction of cell lineage using mosaic analysis with double markers in mice 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '17188' abstract: - lang: eng text: "In a delegation problem, a principal P with commitment power tries to pick one out of \U0001D45B options.\r\nEach option is drawn independently from a known distribution. Instead of inspecting the options\r\nherself, P delegates the information acquisition to a rational and self-interested agent A. After\r\ninspection, A proposes one of the options, and P can accept or reject.\r\nDelegation is a classic setting in economic information design with many prominent applications,\r\nbut the computational problems are only poorly understood. In this paper, we study a natural\r\nonline variant of delegation, in which the agent searches through the options in an online fashion.\r\nFor each option, he has to irrevocably decide if he wants to propose the current option or discard\r\nit, before seeing information on the next option(s). How can we design algorithms for P that\r\napproximate the utility of her best option in hindsight?\r\nWe show that in general P can obtain a Θ(1∕\U0001D45B)-approximation and extend this result to ratios\r\nof Θ(\U0001D458∕\U0001D45B) in case (1) A has a lookahead of \U0001D458 rounds, or (2) A can propose up to \U0001D458 different\r\noptions. We provide fine-grained bounds independent of \U0001D45B based on three parameters. If the ratio\r\nof maximum and minimum utility for A is bounded by a factor \U0001D6FC, we obtain an Ω(loglog \U0001D6FC∕ log \U0001D6FC)-\r\napproximation algorithm, and we show that this is best possible. Additionally, if P cannot\r\ndistinguish options with the same value for herself, we show that ratios polynomial in 1∕\U0001D6FC cannot\r\nbe avoided. If there are at most \U0001D6FD different utility values for A, we show a Θ(1∕\U0001D6FD)-approximation.\r\nIf the utilities of P and A for each option are related by a factor \U0001D6FE, we obtain an Ω(1∕ log \U0001D6FE)-\r\napproximation, where \U0001D442(log log \U0001D6FE∕ log \U0001D6FE) is best possible." acknowledgement: Hahn gratefully acknowledges the support of GIF grant I-1419-118.4/2017. Hoefer gratefully acknowledges the support of GIF grant I-1419-118.4/2017, DFG Research Unit ADYN (project number 411362735), and DFG grant Ho 3831/9-1 (project number 514505843). article_number: '104171' article_processing_charge: Yes (in subscription journal) article_type: original arxiv: 1 author: - first_name: Pirmin full_name: Braun, Pirmin last_name: Braun - first_name: Niklas full_name: Hahn, Niklas id: 0a01c7b2-b823-11ed-9928-cc3f874f9ffd last_name: Hahn - first_name: Martin full_name: Hoefer, Martin last_name: Hoefer - first_name: Conrad full_name: Schecker, Conrad last_name: Schecker citation: ama: Braun P, Hahn N, Hoefer M, Schecker C. Delegated online search. Artificial Intelligence. 2024;334. doi:10.1016/j.artint.2024.104171 apa: Braun, P., Hahn, N., Hoefer, M., & Schecker, C. (2024). Delegated online search. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2024.104171 chicago: Braun, Pirmin, Niklas Hahn, Martin Hoefer, and Conrad Schecker. “Delegated Online Search.” Artificial Intelligence. Elsevier, 2024. https://doi.org/10.1016/j.artint.2024.104171. ieee: P. Braun, N. Hahn, M. Hoefer, and C. Schecker, “Delegated online search,” Artificial Intelligence, vol. 334. Elsevier, 2024. ista: Braun P, Hahn N, Hoefer M, Schecker C. 2024. Delegated online search. Artificial Intelligence. 334, 104171. mla: Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence, vol. 334, 104171, Elsevier, 2024, doi:10.1016/j.artint.2024.104171. short: P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024). corr_author: '1' date_created: 2024-06-30T22:01:05Z date_published: 2024-09-01T00:00:00Z date_updated: 2025-09-08T08:00:42Z day: '01' ddc: - '000' department: - _id: MoHe doi: 10.1016/j.artint.2024.104171 external_id: arxiv: - '2203.01084' isi: - '001260448100001' file: - access_level: open_access checksum: f02a56bc7ea88f41fcc68968e4ceddf3 content_type: application/pdf creator: dernst date_created: 2025-01-09T10:45:24Z date_updated: 2025-01-09T10:45:24Z file_id: '18806' file_name: 2024_ArtificialIntelligence_Braun.pdf file_size: 772226 relation: main_file success: 1 file_date_updated: 2025-01-09T10:45:24Z has_accepted_license: '1' intvolume: ' 334' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version publication: Artificial Intelligence publication_identifier: issn: - 0004-3702 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Delegated online search 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 334 year: '2024' ... --- OA_type: closed access _id: '17189' abstract: - lang: eng text: Supergranules, which are solar flow features with a lateral scale of 30,000–40,000 km and a lifetime of ~24 h, form a prominent component of the Sun’s convective spectrum. However, their internal flows, which can be probed only by helioseismology, are not well understood. We analyse dopplergrams recorded by the Solar Dynamics Observatory satellite to identify and characterize ~23,000 supergranules. We find that the vertical flows peak at a depth of ~10,000 km, and remain invariant over the full range of lateral supergranular scales, contrary to numerical predictions. We also infer that, within the local seismic resolution (≳5,000 km), downflows are ~40% weaker than upflows, indicating an apparent mass-flux imbalance. This may imply that the descending flows also comprise plumes, which maintain the mass balance but are simply too small to be detected by seismic waves. These results challenge the widely used mixing-length description of solar convection. acknowledgement: "We thank F. J. Simons for the codes for computing Slepian functions,\r\nM. Rempel and R. Cameron for their insights into solar convection, J.\r\nW. Lord for the numerical simulations and J. Naranjo for his help with\r\nthe NYUAD NetDRMS system. This research was carried out with the\r\nHigh Performance Computing resources at NYUAD. The datasets were\r\nprepared in the data centre at the Center for Space Science of NYUAD.\r\nThis research is based upon work supported by Tamkeen under the\r\nNYUAD Research Institute (Grant Nos G1502 and CASS to C.S.H,\r\nS.H. and K.R.S.). S.H. acknowledges funding from the Department\r\nof Atomic Energy, India. K.R.S. and S.H. acknowledge support from\r\nthe Ofice of Sponsored Research of King Abdullah University of\r\nScience and Technology (Award No. OSR-CRG2020-4342). S.B.D.\r\nacknowledges funding from the Elisabeth H. and F. A. Dahlen Award\r\n2022 by the Department of Geosciences, Princeton University. S.B.D.\r\nalso acknowledges funding from the European Union’s Horizon 2020\r\nresearch and innovation programme under a Marie Skłodowska-Curie\r\ngrant (Grant Agreement No. 101034413). Some data products were\r\nprocessed and downloaded from the German Data Center for SDO,\r\nwhich is funded by the German Aerospace Center (DLR Grant No.\r\n500L1701)." article_processing_charge: No article_type: original author: - first_name: Chris S. full_name: Hanson, Chris S. last_name: Hanson - first_name: Srijan B full_name: Das, Srijan B id: 9ce7c423-dacf-11ed-8942-e09c6cb27149 last_name: Das orcid: 0000-0003-0896-7972 - first_name: Prasad full_name: Mani, Prasad last_name: Mani - first_name: Shravan full_name: Hanasoge, Shravan last_name: Hanasoge - first_name: Katepalli R. full_name: Sreenivasan, Katepalli R. last_name: Sreenivasan citation: ama: Hanson CS, Das SB, Mani P, Hanasoge S, Sreenivasan KR. Supergranular-scale solar convection not explained by mixing-length theory. Nature Astronomy. 2024;8:1088-1101. doi:10.1038/s41550-024-02304-w apa: Hanson, C. S., Das, S. B., Mani, P., Hanasoge, S., & Sreenivasan, K. R. (2024). Supergranular-scale solar convection not explained by mixing-length theory. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-024-02304-w chicago: Hanson, Chris S., Srijan B Das, Prasad Mani, Shravan Hanasoge, and Katepalli R. Sreenivasan. “Supergranular-Scale Solar Convection Not Explained by Mixing-Length Theory.” Nature Astronomy. Springer Nature, 2024. https://doi.org/10.1038/s41550-024-02304-w. ieee: C. S. Hanson, S. B. Das, P. Mani, S. Hanasoge, and K. R. Sreenivasan, “Supergranular-scale solar convection not explained by mixing-length theory,” Nature Astronomy, vol. 8. Springer Nature, pp. 1088–1101, 2024. ista: Hanson CS, Das SB, Mani P, Hanasoge S, Sreenivasan KR. 2024. Supergranular-scale solar convection not explained by mixing-length theory. Nature Astronomy. 8, 1088–1101. mla: Hanson, Chris S., et al. “Supergranular-Scale Solar Convection Not Explained by Mixing-Length Theory.” Nature Astronomy, vol. 8, Springer Nature, 2024, pp. 1088–101, doi:10.1038/s41550-024-02304-w. short: C.S. Hanson, S.B. Das, P. Mani, S. Hanasoge, K.R. Sreenivasan, Nature Astronomy 8 (2024) 1088–1101. date_created: 2024-06-30T22:01:05Z date_published: 2024-09-01T00:00:00Z date_updated: 2025-09-08T08:04:56Z day: '01' department: - _id: LiBu doi: 10.1038/s41550-024-02304-w ec_funded: 1 external_id: isi: - '001254181700001' intvolume: ' 8' isi: 1 language: - iso: eng month: '09' oa_version: None page: 1088-1101 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Nature Astronomy publication_identifier: eissn: - 2397-3366 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Supergranular-scale solar convection not explained by mixing-length theory type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 8 year: '2024' ... --- _id: '17190' abstract: - lang: eng text: "For a locally finite set, \U0001D434⊆ℝ\U0001D451\r\n, the \U0001D458\r\nth Brillouin zone of \U0001D44E∈\U0001D434\r\n is the region of points \U0001D465∈ℝ\U0001D451\r\n for which ‖\U0001D465−\U0001D44E‖\r\n is the \U0001D458\r\nth smallest among the Euclidean distances between \U0001D465\r\n and the points in \U0001D434\r\n. If \U0001D434\r\n is a lattice, the \U0001D458\r\nth Brillouin zones of the points in \U0001D434\r\n are translates of each other, and together they tile space. Depending on the value of \U0001D458\r\n, they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in ℝ2\r\n, and the convergence of the maximum volume of a chamber to zero for the integer lattice." acknowledgement: The second author is partially supported by the Alexander von Humboldt Foundation. The sixth author is supported by the European Union's Horizon 2020 research and innovation programme under Marie Sklodowska-Curie grant agreement 754411, and by Austrian Science Fund(FWF) grant M-3073. All other authors are supported by European Research Council (ERC) grant 788183, by the Wittgenstein Prize, by Austrian Science Fund (FWF) grant Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF) grant I 02979-N35. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Alexey full_name: Garber, Alexey last_name: Garber - first_name: Mohadese full_name: Ghafaris, Mohadese last_name: Ghafaris - first_name: Teresa full_name: Heiss, Teresa id: 4879BB4E-F248-11E8-B48F-1D18A9856A87 last_name: Heiss orcid: 0000-0002-1780-2689 - first_name: Morteza full_name: Saghafiant, Morteza last_name: Saghafiant - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Edelsbrunner H, Garber A, Ghafaris M, Heiss T, Saghafiant M, Wintraecken M. Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. 2024;38(2):1784-1807. doi:10.1137/22M1489071 apa: Edelsbrunner, H., Garber, A., Ghafaris, M., Heiss, T., Saghafiant, M., & Wintraecken, M. (2024). Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/22M1489071 chicago: Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafaris, Teresa Heiss, Morteza Saghafiant, and Mathijs Wintraecken. “Brillouin Zones of Integer Lattices and Their Perturbations.” SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/22M1489071. ieee: H. Edelsbrunner, A. Garber, M. Ghafaris, T. Heiss, M. Saghafiant, and M. Wintraecken, “Brillouin zones of integer lattices and their perturbations,” SIAM Journal on Discrete Mathematics, vol. 38, no. 2. Society for Industrial and Applied Mathematics, pp. 1784–1807, 2024. ista: Edelsbrunner H, Garber A, Ghafaris M, Heiss T, Saghafiant M, Wintraecken M. 2024. Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. 38(2), 1784–1807. mla: Edelsbrunner, Herbert, et al. “Brillouin Zones of Integer Lattices and Their Perturbations.” SIAM Journal on Discrete Mathematics, vol. 38, no. 2, Society for Industrial and Applied Mathematics, 2024, pp. 1784–807, doi:10.1137/22M1489071. short: H. Edelsbrunner, A. Garber, M. Ghafaris, T. Heiss, M. Saghafiant, M. Wintraecken, SIAM Journal on Discrete Mathematics 38 (2024) 1784–1807. corr_author: '1' date_created: 2024-06-30T22:01:05Z date_published: 2024-06-07T00:00:00Z date_updated: 2025-09-08T08:06:04Z day: '07' department: - _id: HeEd doi: 10.1137/22M1489071 ec_funded: 1 external_id: arxiv: - '2204.01077' isi: - '001292728600001' intvolume: ' 38' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2204.01077 month: '06' oa: 1 oa_version: Preprint page: 1784-1807 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science publication: SIAM Journal on Discrete Mathematics publication_identifier: issn: - 0895-4801 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Brillouin zones of integer lattices and their perturbations type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 38 year: '2024' ...