[{"date_updated":"2025-09-08T07:48:18Z","day":"08","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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","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.","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.","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.","short":"E. Tairi, A. Ünal, in:, Advances in Cryptology – EUROCRYPT 2024, Springer Nature, 2024, pp. 249–279.","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","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."},"year":"2024","_id":"17126","intvolume":" 14652","month":"05","volume":14652,"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).","doi":"10.1007/978-3-031-58723-8_9","quality_controlled":"1","oa_version":"Submitted Version","author":[{"first_name":"Erkan","full_name":"Tairi, Erkan","last_name":"Tairi"},{"first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221","last_name":"Ünal","full_name":"Ünal, Akin"}],"oa":1,"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031587221"],"eissn":["1611-3349"]},"department":[{"_id":"KrPi"}],"scopus_import":"1","publisher":"Springer Nature","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."}],"type":"conference","date_published":"2024-05-08T00:00:00Z","external_id":{"isi":["001278247600009"]},"main_file_link":[{"url":"https://eprint.iacr.org/2023/719.pdf","open_access":"1"}],"conference":{"end_date":"2024-05-30","start_date":"2024-05-26","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Zurich, Switzerland"},"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"title":"Lower bounds for lattice-based compact functional encryption","publication":"Advances in Cryptology – EUROCRYPT 2024","status":"public","article_processing_charge":"No","date_created":"2024-06-09T22:01:03Z","page":"249-279"},{"day":"01","date_updated":"2025-09-08T08:57:32Z","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Wang, Victor, and Max Wenqiang Xu. “Paucity Phenomena for Polynomial Products.” Bulletin of the London Mathematical Society, vol. 56, no. 8, London Mathematical Society, 2024, pp. 2718–26, doi:10.1112/blms.13095.","apa":"Wang, V., & Xu, M. W. (2024). Paucity phenomena for polynomial products. Bulletin of the London Mathematical Society. London Mathematical Society. https://doi.org/10.1112/blms.13095","short":"V. Wang, M.W. Xu, Bulletin of the London Mathematical Society 56 (2024) 2718–2726.","ama":"Wang V, Xu MW. Paucity phenomena for polynomial products. Bulletin of the London Mathematical Society. 2024;56(8):2718-2726. doi:10.1112/blms.13095","ieee":"V. Wang and M. W. Xu, “Paucity phenomena for polynomial products,” Bulletin of the London Mathematical Society, vol. 56, no. 8. London Mathematical Society, pp. 2718–2726, 2024.","chicago":"Wang, Victor, and Max Wenqiang Xu. “Paucity Phenomena for Polynomial Products.” Bulletin of the London Mathematical Society. London Mathematical Society, 2024. https://doi.org/10.1112/blms.13095.","ista":"Wang V, Xu MW. 2024. Paucity phenomena for polynomial products. Bulletin of the London Mathematical Society. 56(8), 2718–2726."},"year":"2024","article_type":"original","ec_funded":1,"_id":"17127","intvolume":" 56","month":"08","volume":56,"acknowledgement":"We thank Oleksiy Klurman, Ilya Shkredov, and Igor Shparlinski for helpful comments on earlier versions of the paper, and thank Yotam Hendel for providing a reference for Lemma 2.1. We also thank the anonymous referee for their generous corrections and comments. The first author has received funding from the European Union's Horizon 2020 Research and Innovation Program under the Marie Skłodowska-Curie Grant Agreement Number: 101034413. The second author is partially supported by the Cuthbert C. Hurd Graduate Fellowship in the Mathematical Sciences, Stanford.","doi":"10.1112/blms.13095","quality_controlled":"1","oa_version":"Submitted Version","has_accepted_license":"1","issue":"8","author":[{"orcid":"0000-0002-0704-7026","last_name":"Wang","full_name":"Wang, Victor","id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9","first_name":"Victor"},{"first_name":"Max Wenqiang","last_name":"Xu","full_name":"Xu, Max Wenqiang"}],"oa":1,"file_date_updated":"2024-08-20T08:36:32Z","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"publication_status":"published","department":[{"_id":"TiBr"}],"ddc":["512"],"publisher":"London Mathematical Society","scopus_import":"1","date_published":"2024-08-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Let P(x)∈Z[x] be a polynomial with at least two distinct complex roots. We prove that the number of solutions (x1,…,xk,y1,…,yk)∈[N]2k to the equation\r\n∏1≤i≤kP(xi)=∏1≤j≤kP(yj)≠0\r\n(for any k≥1 ) is asymptotically k!Nk as N→+∞. This solves a question first proposed and studied by Najnudel. The result can also be interpreted as saying that all even moments of random partial sums 1N√∑n≤Nf(P(n)) match standard complex Gaussian moments as N→+∞\r\n , where f is the Steinhaus random multiplicative function."}],"external_id":{"isi":["001235729900001"],"arxiv":["2211.02908"]},"file":[{"date_created":"2024-08-20T08:36:32Z","relation":"main_file","file_size":331775,"access_level":"open_access","file_name":"Paucity_phenomena_for_polynomial_products__Wang_Xu_ (7).pdf","file_id":"17446","content_type":"application/pdf","checksum":"ae386a4031856efac23c7cdcb53b559b","success":1,"date_updated":"2024-08-20T08:36:32Z","creator":"vwang"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.02908"}],"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"arxiv":1,"language":[{"iso":"eng"}],"title":"Paucity phenomena for polynomial products","publication":"Bulletin of the London Mathematical Society","status":"public","article_processing_charge":"No","date_created":"2024-06-09T22:01:03Z","page":"2718-2726"},{"corr_author":"1","language":[{"iso":"eng"}],"page":"1339-1345","status":"public","date_created":"2024-06-09T22:01:03Z","article_processing_charge":"No","publication":"Nature Physics","title":"Directed percolation and puff jamming near the transition to pipe turbulence","publisher":"Springer Nature","scopus_import":"1","date_published":"2024-08-01T00:00:00Z","type":"journal_article","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."}],"department":[{"_id":"BjHo"}],"publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"publication_status":"published","author":[{"last_name":"Lemoult","full_name":"Lemoult, Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","first_name":"Grégoire M"},{"id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","first_name":"Mukund","full_name":"Vasudevan, Mukund","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","last_name":"Goldenfeld","full_name":"Goldenfeld, Nigel"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754","last_name":"Hof","full_name":"Hof, Björn"}],"project":[{"_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","name":"Revisiting the Turbulence Problem Using Statistical Mechanics","grant_number":"662960"}],"external_id":{"isi":["001232300600001"]},"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).","volume":20,"month":"08","quality_controlled":"1","oa_version":"None","doi":"10.1038/s41567-024-02513-0","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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","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.","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.","short":"G.M. Lemoult, M. Vasudevan, H.Y. Shih, G. Linga, J. Mathiesen, N. Goldenfeld, B. Hof, Nature Physics 20 (2024) 1339–1345.","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","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."},"date_updated":"2025-09-08T07:50:20Z","day":"01","isi":1,"intvolume":" 20","_id":"17128","article_type":"original","year":"2024"},{"month":"06","acknowledgement":"I am grateful to Matthew Kwan for setting the problem, providing useful literature,\r\nfruitful discussions, text review, mentorship, general encouragement and support.","arxiv":1,"language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2406.07026","title":"Majority dynamics and internal partitions of random regular graphs: Experimental results","oa_version":"Preprint","publication":"arXiv","date_created":"2024-06-12T07:01:52Z","article_processing_charge":"No","status":"public","author":[{"id":"b25f2ab2-1fed-11ee-8599-fe02d211784f","first_name":"Pavel","last_name":"Arkhipov","full_name":"Arkhipov, Pavel"}],"day":"11","date_updated":"2024-06-17T10:45:32Z","department":[{"_id":"GradSch"}],"publication_status":"submitted","oa":1,"type":"preprint","date_published":"2024-06-11T00:00:00Z","abstract":[{"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.","lang":"eng"}],"citation":{"ista":"Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv, 2406.07026.","ama":"Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv. doi: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. .","short":"P. Arkhipov, ArXiv (n.d.).","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","mla":"Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” ArXiv, 2406.07026, doi:10.48550/arXiv.2406.07026."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2406.07026","external_id":{"arxiv":["2406.07026"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.07026"}],"year":"2024","_id":"17136"},{"conference":{"location":"Grundlsee, Austria","start_date":"2024-06-10","end_date":"2024-06-13","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"language":[{"iso":"eng"}],"title":"How much memory per CPU core is requested?","publication":"ASHPC24 - Austrian-Slovenian HPC Meeting 2024","status":"public","date_created":"2024-06-14T09:06:36Z","article_processing_charge":"No","page":"46","author":[{"orcid":"0000-0002-5621-8100","last_name":"Schlögl","full_name":"Schlögl, Alois","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Khalid, Waleed","last_name":"Khalid","first_name":"Waleed","id":"097c0562-3cf0-11ee-8fd3-e7a79c1e2fd1"},{"last_name":"Elefante","full_name":"Elefante, Stefano","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Stadlbauer, Stephan","last_name":"Stadlbauer","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan"}],"file_date_updated":"2024-06-17T09:36:51Z","oa":1,"publication_status":"published","publication_identifier":{"isbn":["9783200096455"]},"department":[{"_id":"ScienComp"}],"ddc":["000"],"publisher":"EuroCC Austria","date_published":"2024-06-13T00:00:00Z","type":"conference_abstract","file":[{"date_updated":"2024-06-17T09:36:51Z","creator":"dernst","content_type":"application/pdf","success":1,"checksum":"f7d3dded6df2dcdb4818904cf2e1c183","access_level":"open_access","file_size":206746,"file_name":"2024_ASHPC_Schloegl.pdf","file_id":"17153","date_created":"2024-06-17T09:36:51Z","relation":"main_file"}],"month":"06","doi":"10.25365/phaidra.463","quality_controlled":"1","oa_version":"Published Version","has_accepted_license":"1","day":"13","date_updated":"2024-06-17T09:40:37Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"short":"A. Schlögl, W. Khalid, S. Elefante, S. Stadlbauer, in:, ASHPC24 - Austrian-Slovenian HPC Meeting 2024, EuroCC Austria, 2024, p. 46.","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.","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","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.","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2024","_id":"17139","license":"https://creativecommons.org/licenses/by/4.0/"},{"article_type":"original","year":"2024","intvolume":" 75","_id":"17141","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"isi":1,"day":"27","date_updated":"2025-09-08T07:57:50Z","citation":{"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","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.","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.","ista":"Zhang Z, Chen H, Peng S, Han H. 2024. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 75(18), erae246.","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","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.","short":"Z. Zhang, H. Chen, S. Peng, H. Han, Journal of Experimental Botany 75 (2024)."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","quality_controlled":"1","doi":"10.1093/jxb/erae246","issue":"18","has_accepted_license":"1","volume":75,"month":"09","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.","file":[{"date_created":"2025-01-02T10:26:22Z","relation":"main_file","file_id":"18720","file_name":"2024_JourExperimentalBotany_Zhang.pdf","file_size":763097,"access_level":"open_access","content_type":"application/pdf","checksum":"91b9435ed0f6640809c7588df19abf2f","success":1,"date_updated":"2025-01-02T10:26:22Z","creator":"dernst"}],"external_id":{"isi":["001270051200001"],"pmid":["38794966"]},"article_number":"erae246","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"publication_status":"published","publication_identifier":{"issn":["0022-0957"]},"oa":1,"file_date_updated":"2025-01-02T10:26:22Z","author":[{"full_name":"Zhang, Zilin","last_name":"Zhang","first_name":"Zilin"},{"full_name":"Chen, Huihuang","last_name":"Chen","id":"83c96512-15b2-11ec-abd3-b7eede36184f","first_name":"Huihuang"},{"first_name":"Shuaiying","last_name":"Peng","full_name":"Peng, Shuaiying"},{"full_name":"Han, Huibin","last_name":"Han","first_name":"Huibin"}],"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."}],"date_published":"2024-09-27T00:00:00Z","type":"journal_article","publisher":"Oxford University Press","scopus_import":"1","OA_type":"hybrid","ddc":["580"],"publication":"Journal of Experimental Botany","title":"Slow and rapid auxin responses in Arabidopsis","date_created":"2024-06-15T19:50:15Z","article_processing_charge":"No","pmid":1,"status":"public","OA_place":"publisher","language":[{"iso":"eng"}]},{"OA_place":"publisher","language":[{"iso":"eng"}],"corr_author":"1","APC_amount":"6081,83 EUR","title":"Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice","publication":"PLoS Biology","date_created":"2024-06-16T22:01:05Z","article_processing_charge":"Yes","status":"public","DOAJ_listed":"1","pmid":1,"author":[{"first_name":"Laura","id":"3B717F68-F248-11E8-B48F-1D18A9856A87","full_name":"Burnett, Laura","last_name":"Burnett","orcid":"0000-0002-8937-410X"},{"first_name":"Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","last_name":"Koppensteiner","orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter"},{"full_name":"Symonova, Olga","last_name":"Symonova","orcid":"0000-0003-2012-9947","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga"},{"first_name":"Tomas","id":"93ac43e8-8599-11eb-9b86-f6efb0a4c207","full_name":"Masson, Tomas","orcid":"0000-0002-2634-6283","last_name":"Masson"},{"last_name":"Vega Zuniga","full_name":"Vega Zuniga, Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas A"},{"id":"475990FE-F248-11E8-B48F-1D18A9856A87","first_name":"Ximena","last_name":"Contreras","full_name":"Contreras, Ximena"},{"first_name":"Thomas","last_name":"Rülicke","full_name":"Rülicke, Thomas"},{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"},{"first_name":"Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","last_name":"Jösch","full_name":"Jösch, Maximilian A"}],"publication_identifier":{"issn":["1544-9173"],"eissn":["1545-7885"]},"publication_status":"published","department":[{"_id":"RySh"},{"_id":"GaNo"},{"_id":"MaJö"}],"file_date_updated":"2025-01-09T10:39:41Z","related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.11130587"}],"record":[{"id":"15385","relation":"research_data","status":"public"}]},"oa":1,"OA_type":"gold","ddc":["570"],"date_published":"2024-06-10T00:00:00Z","type":"journal_article","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."}],"publisher":"Public Library of Science","scopus_import":"1","article_number":"e3002668","external_id":{"pmid":["38857283"],"isi":["001246176800003"]},"file":[{"file_name":"2024_PloS_Burnett.pdf","file_id":"18805","access_level":"open_access","file_size":4016568,"date_created":"2025-01-09T10:39:41Z","relation":"main_file","date_updated":"2025-01-09T10:39:41Z","creator":"dernst","content_type":"application/pdf","success":1,"checksum":"496e1aa4fd5b92b7e4087ecc2c964133"}],"project":[{"call_identifier":"H2020","grant_number":"756502","name":"Circuits of Visual Attention","_id":"2634E9D2-B435-11E9-9278-68D0E5697425"}],"month":"06","volume":22,"acknowledgement":"This work was supported by a European Research Council Starting Grant 756502 (MJ). ","doi":"10.1371/journal.pbio.3002668","oa_version":"Published Version","quality_controlled":"1","has_accepted_license":"1","isi":1,"day":"10","date_updated":"2025-09-08T07:57:11Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"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.","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","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).","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.","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","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."},"ec_funded":1,"year":"2024","article_type":"original","_id":"17142","intvolume":" 22"},{"arxiv":1,"language":[{"iso":"eng"}],"title":"Local conditions for global convergence of gradient flows and proximal point sequences in metric spaces","publication":"Transactions of the American Mathematical Society","status":"public","article_processing_charge":"No","date_created":"2024-06-16T22:01:06Z","page":"3779-3804","author":[{"full_name":"Dello Schiavo, Lorenzo","last_name":"Dello Schiavo","orcid":"0000-0002-9881-6870","first_name":"Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E"},{"full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","last_name":"Pedrotti","full_name":"Pedrotti, Francesco"}],"oa":1,"related_material":{"record":[{"id":"17336","status":"public","relation":"dissertation_contains"}]},"department":[{"_id":"JaMa"}],"publication_status":"published","publication_identifier":{"issn":["0002-9947"],"eissn":["1088-6850"]},"publisher":"American Mathematical Society","scopus_import":"1","type":"journal_article","date_published":"2024-06-01T00:00:00Z","abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["2304.05239"],"isi":["001203273300001"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2304.05239","open_access":"1"}],"project":[{"call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","name":"Configuration Spaces over Non-Smooth Spaces","grant_number":"E208"}],"month":"06","volume":377,"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","doi":"10.1090/tran/9156","quality_controlled":"1","oa_version":"Preprint","issue":"6","date_updated":"2025-09-08T07:55:03Z","day":"01","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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","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.","short":"L. Dello Schiavo, J. Maas, F. Pedrotti, Transactions of the American Mathematical Society 377 (2024) 3779–3804.","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","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."},"year":"2024","article_type":"original","ec_funded":1,"_id":"17143","intvolume":" 377"},{"oa":1,"file_date_updated":"2024-06-17T08:33:40Z","department":[{"_id":"HeEd"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"publication_status":"published","author":[{"orcid":"0000-0001-7841-0091","last_name":"Kourimska","full_name":"Kourimska, Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}],"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"We prove that the medial axis of closed sets is Hausdorff stable in the following sense: Let 𝒮 ⊆ ℝ^d be a fixed closed set that contains a bounding sphere. That is, the bounding sphere is part of the set 𝒮. 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(𝒮), 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.","lang":"eng"}],"date_published":"2024-06-01T00:00:00Z","type":"conference","ddc":["510"],"file":[{"content_type":"application/pdf","checksum":"b40ff456c19294adb5d9613fcfd751c6","success":1,"date_updated":"2024-06-17T08:33:40Z","creator":"dernst","date_created":"2024-06-17T08:33:40Z","relation":"main_file","file_name":"2024_LIPICS_Kourimska.pdf","file_id":"17150","file_size":1612558,"access_level":"open_access"}],"article_number":"69","external_id":{"arxiv":["2212.01118"]},"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry","location":"Athens, Greece"},"arxiv":1,"publication":"40th International Symposium on Computational Geometry","alternative_title":["LIPIcs"],"title":"The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms","status":"public","article_processing_charge":"No","date_created":"2024-06-16T22:01:06Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-04-15T07:16:58Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","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.","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","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.","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"},"year":"2024","ec_funded":1,"intvolume":" 293","_id":"17144","volume":293,"month":"06","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.","quality_controlled":"1","oa_version":"Published Version","doi":"10.4230/LIPIcs.SoCG.2024.69","has_accepted_license":"1"},{"citation":{"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.","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","short":"G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","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","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2024-06-17T08:41:56Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"17145","intvolume":" 293","year":"2024","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.","month":"06","volume":293,"has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2024.76","oa_version":"Published Version","quality_controlled":"1","ddc":["510"],"type":"conference","date_published":"2024-06-01T00:00:00Z","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."}],"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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","id":"f86f7148-b140-11ec-9577-95435b8df824","last_name":"Saghafian","full_name":"Saghafian, Morteza"}],"publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"publication_status":"published","department":[{"_id":"HeEd"}],"oa":1,"file_date_updated":"2024-06-17T08:40:04Z","article_number":"76","external_id":{"arxiv":["2402.15787"]},"file":[{"creator":"dernst","date_updated":"2024-06-17T08:40:04Z","success":1,"checksum":"fbad1de06383a6b7e8a1cb3e8c7205ce","content_type":"application/pdf","file_size":1430896,"access_level":"open_access","file_id":"17151","file_name":"2024_LIPICS_Rote.pdf","relation":"main_file","date_created":"2024-06-17T08:40:04Z"}],"arxiv":1,"conference":{"location":"Athens, Greece","end_date":"2024-06-14","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"date_created":"2024-06-16T22:01:06Z","article_processing_charge":"No","status":"public","title":"Grid peeling of parabolas","alternative_title":["LIPIcs"],"publication":"40th International Symposium on Computational Geometry"},{"article_processing_charge":"No","date_created":"2024-06-16T22:01:06Z","status":"public","publication":"40th International Symposium on Computational Geometry","title":"Maximum Betti numbers of Čech complexes","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"arxiv":1,"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2024-06-11","end_date":"2024-06-14","location":"Athens, Greece"},"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"file":[{"relation":"main_file","date_created":"2024-06-17T08:46:33Z","file_id":"17152","file_name":"2024_LIPICS_Edelsbrunner.pdf","file_size":766562,"access_level":"open_access","checksum":"5442d44fb89d77477a87668d6e61aac9","success":1,"content_type":"application/pdf","creator":"dernst","date_updated":"2024-06-17T08:46:33Z"}],"external_id":{"arxiv":["2310.14801"]},"article_number":"53","abstract":[{"lang":"eng","text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². In particular, there is an arrangement of n contruent balls in ℝ³ that enclose a quadratic number of voids, which answers a long-standing open question in computational geometry."}],"date_published":"2024-06-01T00:00:00Z","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","ddc":["510"],"publication_status":"published","department":[{"_id":"HeEd"}],"publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"related_material":{"record":[{"id":"20657","relation":"later_version","status":"public"}]},"oa":1,"file_date_updated":"2024-06-17T08:46:33Z","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Pach","full_name":"Pach, János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János"}],"has_accepted_license":"1","oa_version":"Published Version","quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2024.53","acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. {I 02979-N35.} The second author is supported by the European Research Council (ERC), grant \"GeoScape\" and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.\r\nThe authors thank Matt Kahle for communicating the question about extremal Čech complexes, Ben Schweinhart for early discussions on the linked circles construction in three dimensions, and Gábor Tardos for helpful remarks and suggestions.","volume":293,"month":"06","intvolume":" 293","_id":"17146","ec_funded":1,"year":"2024","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Edelsbrunner, H., & Pach, J. (2024). Maximum Betti numbers of Čech complexes. 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.53","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” 40th International Symposium on Computational Geometry, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.53.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293.","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” 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.53.","ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.53","ista":"Edelsbrunner H, Pach J. 2024. Maximum Betti numbers of Čech complexes. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 53.","short":"H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-12-01T15:19:20Z","day":"01"},{"doi":"10.1109/ICASSP48485.2024.10447198","oa_version":"Submitted Version","quality_controlled":"1","acknowledgement":"This work was supported by a Lopez-Loreta Prize to MM, an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and core funding from ISTA. The authors thank Philip Schniter, Matthew Stephens and Pragya Sur for valuable suggestions on an early version of the work. The authors acknowledge the participants and investigators of the UK Biobank study. High-performance\r\ncomputing was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","month":"04","_id":"17147","year":"2024","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Depope, Al, et al. “Inference of Genetic Effects via Approximate Message Passing.” 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2024, pp. 13151–55, doi:10.1109/ICASSP48485.2024.10447198.","apa":"Depope, A., Mondelli, M., & Robinson, M. R. (2024). Inference of genetic effects via approximate message passing. In 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing (pp. 13151–13155). Seoul, Korea: IEEE. https://doi.org/10.1109/ICASSP48485.2024.10447198","short":"A. Depope, M. Mondelli, M.R. Robinson, in:, 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2024, pp. 13151–13155.","ieee":"A. Depope, M. Mondelli, and M. R. Robinson, “Inference of genetic effects via approximate message passing,” in 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, Seoul, Korea, 2024, pp. 13151–13155.","ista":"Depope A, Mondelli M, Robinson MR. 2024. Inference of genetic effects via approximate message passing. 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing. ICASSP: International Conference on Acoustics, Speech and Signal Processing, 13151–13155.","chicago":"Depope, Al, Marco Mondelli, and Matthew Richard Robinson. “Inference of Genetic Effects via Approximate Message Passing.” In 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, 13151–55. IEEE, 2024. https://doi.org/10.1109/ICASSP48485.2024.10447198.","ama":"Depope A, Mondelli M, Robinson MR. Inference of genetic effects via approximate message passing. In: 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE; 2024:13151-13155. doi:10.1109/ICASSP48485.2024.10447198"},"isi":1,"date_updated":"2025-11-05T07:21:31Z","day":"19","article_processing_charge":"No","date_created":"2024-06-16T22:01:07Z","status":"public","page":"13151-13155","title":"Inference of genetic effects via approximate message passing","publication":"2024 IEEE International Conference on Acoustics, Speech, and Signal Processing","conference":{"location":"Seoul, Korea","name":"ICASSP: International Conference on Acoustics, Speech and Signal Processing","start_date":"2024-04-14","end_date":"2024-04-19"},"corr_author":"1","language":[{"iso":"eng"}],"OA_place":"repository","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"},{"name":"Improving estimation and prediction of common complex disease risk","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","grant_number":"PCEGP3_181181"}],"external_id":{"isi":["001396233806078"]},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=aQYCDxfZV0"}],"OA_type":"green","type":"conference","date_published":"2024-04-19T00:00:00Z","abstract":[{"text":"Efficient utilization of large-scale biobank data is crucial for inferring the genetic basis of disease and predicting health outcomes from the DNA. Yet we lack efficient, accurate methods that scale to data where electronic health records are linked to whole genome sequence information. To address this issue, our paper develops a new algorithmic paradigm based on Approximate Message Passing (AMP), which is specifically tailored for genomic prediction and association testing. Our method yields comparable out-of-sample prediction accuracy to the state of the art on UK Biobank traits, whilst dramatically improving computational complexity, with a 8x-speed up in the run time. In addition, AMP theory provides a joint association testing framework, which outperforms the currently used REGENIE method, in roughly a third of the compute time. This first, truly large-scale application of the AMP framework lays the foundations for a far wider range of statistical analyses for hundreds of millions of variables measured on millions of people.","lang":"eng"}],"publisher":"IEEE","scopus_import":"1","author":[{"id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","first_name":"Al","full_name":"Depope, Al","last_name":"Depope"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","last_name":"Robinson","full_name":"Robinson, Matthew Richard"}],"publication_identifier":{"issn":["1520-6149"],"isbn":["9798350344851"]},"publication_status":"published","department":[{"_id":"MaMo"},{"_id":"MaRo"}],"oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}]},{"date_updated":"2025-09-08T07:58:43Z","day":"20","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"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.","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","short":"J. Reker, Mathematical Physics, Analysis and Geometry 27 (2024).","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","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."},"article_type":"original","year":"2024","ec_funded":1,"_id":"17154","intvolume":" 27","month":"06","volume":27,"doi":"10.1007/s11040-024-09483-y","quality_controlled":"1","oa_version":"Published Version","has_accepted_license":"1","issue":"3","author":[{"first_name":"Jana","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","full_name":"Reker, Jana","last_name":"Reker"}],"file_date_updated":"2024-06-26T11:26:42Z","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"17164"}]},"publication_status":"published","publication_identifier":{"issn":["1385-0172"],"eissn":["1572-9656"]},"department":[{"_id":"LaEr"}],"ddc":["519"],"publisher":"Springer Nature","scopus_import":"1","type":"journal_article","date_published":"2024-06-20T00:00:00Z","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","external_id":{"isi":["001251464300001"],"arxiv":["2307.11029"]},"file":[{"date_updated":"2024-06-26T11:26:42Z","creator":"cchlebak","content_type":"application/pdf","checksum":"7d04318d66f765621bdcb648378d458e","success":1,"file_name":"2024_MathPhysAnaGeo_Reker.pdf","file_id":"17175","file_size":1327596,"access_level":"open_access","date_created":"2024-06-26T11:26:42Z","relation":"main_file"}],"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"arxiv":1,"language":[{"iso":"eng"}],"title":"Fluctuation moments for regular functions of Wigner Matrices","publication":"Mathematical Physics, Analysis and Geometry","status":"public","article_processing_charge":"Yes (via OA deal)","date_created":"2024-06-21T09:31:17Z"},{"file":[{"relation":"source_file","date_created":"2024-06-26T20:56:27Z","file_id":"17179","file_name":"thesis.zip","access_level":"closed","file_size":2761814,"checksum":"1610063569f5452f8a5acef728c2fc26","content_type":"application/zip","creator":"krychlew","date_updated":"2024-06-26T21:00:14Z"},{"file_id":"17180","file_name":"thesis.pdf","file_size":3695952,"access_level":"open_access","date_created":"2024-06-26T20:58:24Z","relation":"main_file","date_updated":"2024-06-26T20:58:24Z","creator":"krychlew","content_type":"application/pdf","checksum":"7bbadb1fbc9ed2a1ecf54597f88af99c"}],"project":[{"grant_number":"26525","_id":"34cd0f74-11ca-11ed-8bc3-bf0492a14a24","name":"Topology of open smooth varieties with a torus action"}],"author":[{"first_name":"Kamil P","id":"85A07246-A8BF-11E9-B4FA-D9E3E5697425","last_name":"Rychlewicz","full_name":"Rychlewicz, Kamil P"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"17157"}]},"file_date_updated":"2024-06-26T21:00:14Z","oa":1,"department":[{"_id":"TaHa"},{"_id":"GradSch"}],"publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"ddc":["516"],"publisher":"Institute of Science and Technology Austria","abstract":[{"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.","lang":"eng"}],"date_published":"2024-06-25T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"title":"Equivariant cohomology and rings of functions","status":"public","article_processing_charge":"No","date_created":"2024-06-23T15:07:06Z","page":"117","degree_awarded":"PhD","language":[{"iso":"eng"}],"corr_author":"1","year":"2024","_id":"17156","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","date_updated":"2025-04-15T08:38:28Z","day":"25","keyword":["equivariant cohomology","zero schemes","algebraic groups","Lie algebras"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Rychlewicz, Kamil P. Equivariant Cohomology and Rings of Functions. Institute of Science and Technology Austria, 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","short":"K.P. Rychlewicz, Equivariant Cohomology and Rings of Functions, Institute of Science and Technology Austria, 2024.","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.","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.","ama":"Rychlewicz KP. Equivariant cohomology and rings of functions. 2024. doi:10.15479/at:ista:17156"},"doi":"10.15479/at:ista:17156","oa_version":"Published Version","has_accepted_license":"1","supervisor":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","full_name":"Hausel, Tamás","last_name":"Hausel","orcid":"0000-0002-9582-2634"}],"month":"06"},{"month":"06","volume":5,"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).","doi":"10.5194/mr-5-69-2024","oa_version":"Published Version","quality_controlled":"1","has_accepted_license":"1","issue":"1","date_updated":"2025-06-11T13:26:12Z","day":"11","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"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","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.","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.","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.","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","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.","short":"K. Aebischer, L.M. Becker, P. Schanda, M. Ernst, Magnetic Resonance 5 (2024) 69–86."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2024","article_type":"original","_id":"17161","intvolume":" 5","language":[{"iso":"eng"}],"title":"Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR","publication":"Magnetic Resonance","date_created":"2024-06-23T22:01:02Z","article_processing_charge":"Yes","status":"public","pmid":1,"page":"69-86","author":[{"first_name":"Kathrin","full_name":"Aebischer, Kathrin","last_name":"Aebischer"},{"full_name":"Becker, Lea Marie","orcid":"0000-0002-6401-5151","last_name":"Becker","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul"},{"full_name":"Ernst, Matthias","last_name":"Ernst","first_name":"Matthias"}],"publication_status":"published","publication_identifier":{"eissn":["2699-0016"]},"department":[{"_id":"PaSc"}],"oa":1,"file_date_updated":"2024-06-27T06:42:55Z","ddc":["530"],"abstract":[{"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.","lang":"eng"}],"date_published":"2024-06-11T00:00:00Z","type":"journal_article","publisher":"Copernicus Publications","scopus_import":"1","external_id":{"pmid":["40384772"]},"file":[{"content_type":"application/pdf","success":1,"checksum":"d01074f6919387fcaf8c9ebed320ccae","date_updated":"2024-06-27T06:42:55Z","creator":"dernst","date_created":"2024-06-27T06:42:55Z","relation":"main_file","file_id":"17181","file_name":"2024_MagneticResonance_Aebischer.pdf","file_size":6736194,"access_level":"open_access"}],"project":[{"_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","grant_number":"26777"}]},{"language":[{"iso":"eng"}],"title":"Quantitative bounds on resource usage of probabilistic programs","publication":"Proceedings of the ACM on Programming Languages","status":"public","article_processing_charge":"Yes (in subscription journal)","date_created":"2024-06-23T22:01:02Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"}],"file_date_updated":"2024-06-27T07:48:16Z","oa":1,"department":[{"_id":"KrCh"}],"publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"ddc":["000"],"publisher":"Association for Computing Machinery","scopus_import":"1","abstract":[{"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.","lang":"eng"}],"date_published":"2024-04-29T00:00:00Z","type":"journal_article","article_number":"107","file":[{"content_type":"application/pdf","checksum":"9243ded966f71df1572be5466019be5c","success":1,"date_updated":"2024-06-27T07:48:16Z","creator":"dernst","date_created":"2024-06-27T07:48:16Z","relation":"main_file","file_id":"17182","file_name":"2024_ProcACMProgLanguage_Chatterjee.pdf","file_size":413096,"access_level":"open_access"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"month":"04","volume":8,"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.","doi":"10.1145/3649824","quality_controlled":"1","oa_version":"Published Version","has_accepted_license":"1","issue":"OOPSLA1","date_updated":"2025-04-14T07:52:47Z","day":"29","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).","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","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.","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.","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.","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","year":"2024","ec_funded":1,"_id":"17162","intvolume":" 8"},{"_id":"17164","year":"2024","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Reker J. 2024. Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria.","ieee":"J. Reker, “Central limit theorems for random matrices: From resolvents to free probability,” Institute of Science and Technology Austria, 2024.","ama":"Reker J. Central limit theorems for random matrices: From resolvents to free probability. 2024. doi: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.","short":"J. Reker, Central Limit Theorems for Random Matrices: From Resolvents to Free Probability, Institute of Science and Technology Austria, 2024.","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","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."},"day":"26","date_updated":"2025-11-07T13:04:17Z","keyword":["Random Matrices","Spectrum","Central Limit Theorem","Resolvent","Free Probability"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"has_accepted_license":"1","supervisor":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.15479/at:ista:17164","oa_version":"Published Version","month":"06","project":[{"call_identifier":"H2020","grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"file":[{"content_type":"application/pdf","checksum":"fb16d86e1f2753dc3a9e14d2bdfd84cd","date_updated":"2024-06-26T12:44:53Z","creator":"jreker","date_created":"2024-06-26T12:39:36Z","relation":"main_file","file_size":2783027,"access_level":"open_access","file_id":"17176","file_name":"ISTA_Thesis_JReker.pdf"},{"content_type":"application/zip","checksum":"cb1e54009d47c1dcf5b866c4566fa27f","date_updated":"2024-06-26T12:44:53Z","creator":"jreker","date_created":"2024-06-26T12:39:42Z","relation":"source_file","file_name":"ISTA_Thesis_JReker_SourceFiles.zip","file_id":"17177","file_size":3054878,"access_level":"closed"}],"ddc":["519"],"publisher":"Institute of Science and Technology Austria","date_published":"2024-06-26T00:00:00Z","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."}],"type":"dissertation","author":[{"last_name":"Reker","full_name":"Reker, Jana","first_name":"Jana","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"17173"},{"id":"11135","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"17047"},{"id":"17154","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"17174"}]},"file_date_updated":"2024-06-26T12:44:53Z","oa":1,"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"status":"public","date_created":"2024-06-24T11:23:29Z","article_processing_charge":"No","page":"206","alternative_title":["ISTA Thesis"],"title":"Central limit theorems for random matrices: From resolvents to free probability","degree_awarded":"PhD","language":[{"iso":"eng"}],"corr_author":"1"},{"publication":"40th International Symposium on Computational Geometry","title":"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds","alternative_title":["LIPIcs"],"page":"11:1-11:19","date_created":"2024-06-25T11:45:58Z","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"conference":{"start_date":"2024-06-11","end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry","location":"Athens, Greece"},"arxiv":1,"file":[{"date_created":"2024-06-25T11:47:26Z","relation":"main_file","file_id":"17171","file_name":"LIPIcs.SoCG.2024.11.pdf","file_size":20886142,"access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"6a2ddc8b51aa58f197a8b294750f1f8d","date_updated":"2024-06-25T11:47:26Z","creator":"cfillmor"}],"external_id":{"arxiv":["2206.10485"]},"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"},{"name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773164"]},"oa":1,"file_date_updated":"2024-06-25T11:47:26Z","author":[{"last_name":"Attali","full_name":"Attali, Dominique","first_name":"Dominique"},{"first_name":"Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","last_name":"Kourimska","orcid":"0000-0001-7841-0091","full_name":"Kourimska, Hana"},{"full_name":"Fillmore, Christopher D","last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D"},{"id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","first_name":"Ishika","last_name":"Ghosh","full_name":"Ghosh, Ishika"},{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"},{"id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","orcid":"0000-0002-6862-208X","last_name":"Stephenson"},{"last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"abstract":[{"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) 𝒮 of positive reach may be noisy. We work with two one-sided Hausdorff distances - ε and δ - between P and 𝒮. 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 𝒮. 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.","lang":"eng"}],"type":"conference","date_published":"2024-06-06T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","ddc":["516"],"oa_version":"Published Version","quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2024.11","has_accepted_license":"1","volume":293,"month":"06","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.","ec_funded":1,"year":"2024","intvolume":" 293","_id":"17170","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-04-15T07:16:57Z","day":"06","citation":{"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.","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.","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","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.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1016/j.xpro.2024.103157","quality_controlled":"1","oa_version":"Published Version","has_accepted_license":"1","issue":"3","month":"09","volume":5,"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).","year":"2024","article_type":"original","ec_funded":1,"_id":"17187","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","intvolume":" 5","date_updated":"2025-12-30T10:54:11Z","day":"20","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"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","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.","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.","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.","short":"G.T. Cheung, C. Streicher, S. Hippenmeyer, STAR Protocols 5 (2024).","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Protocol for quantitative reconstruction of cell lineage using mosaic analysis with double markers in mice","publication":"STAR Protocols","pmid":1,"status":"public","article_processing_charge":"Yes","date_created":"2024-06-30T22:01:04Z","OA_place":"publisher","APC_amount":"804 EUR","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"pmid":["38935508"]},"article_number":"103157","file":[{"creator":"dernst","date_updated":"2025-01-09T12:12:40Z","checksum":"d8a8cdba82a394e731aa699ace1ae433","success":1,"content_type":"application/pdf","file_name":"2024_STARProtoc_Cheung.pdf","file_id":"18809","access_level":"open_access","file_size":5186071,"relation":"main_file","date_created":"2025-01-09T12:12:40Z"}],"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"F7805","name":"Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"}],"author":[{"first_name":"Giselle T","id":"471195F6-F248-11E8-B48F-1D18A9856A87","full_name":"Cheung, Giselle T","orcid":"0000-0001-8457-2572","last_name":"Cheung"},{"id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen","last_name":"Streicher","full_name":"Streicher, Carmen"},{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"oa":1,"file_date_updated":"2025-01-09T12:12:40Z","publication_status":"published","publication_identifier":{"eissn":["2666-1667"]},"department":[{"_id":"SiHi"}],"ddc":["570"],"OA_type":"gold","publisher":"Elsevier","scopus_import":"1","abstract":[{"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","lang":"eng"}],"date_published":"2024-09-20T00:00:00Z","type":"journal_article"},{"has_accepted_license":"1","doi":"10.1016/j.artint.2024.104171","oa_version":"Published Version","quality_controlled":"1","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).","month":"09","volume":334,"_id":"17188","intvolume":" 334","article_type":"original","year":"2024","citation":{"short":"P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).","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.","ista":"Braun P, Hahn N, Hoefer M, Schecker C. 2024. Delegated online search. Artificial Intelligence. 334, 104171.","ieee":"P. Braun, N. Hahn, M. Hoefer, and C. Schecker, “Delegated online search,” Artificial Intelligence, vol. 334. Elsevier, 2024.","ama":"Braun P, Hahn N, Hoefer M, Schecker C. Delegated online search. Artificial Intelligence. 2024;334. doi:10.1016/j.artint.2024.104171","mla":"Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence, vol. 334, 104171, Elsevier, 2024, 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"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_updated":"2025-09-08T08:00:42Z","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_created":"2024-06-30T22:01:05Z","article_processing_charge":"Yes (in subscription journal)","status":"public","title":"Delegated online search","publication":"Artificial Intelligence","arxiv":1,"corr_author":"1","language":[{"iso":"eng"}],"OA_place":"publisher","article_number":"104171","external_id":{"isi":["001260448100001"],"arxiv":["2203.01084"]},"file":[{"creator":"dernst","date_updated":"2025-01-09T10:45:24Z","success":1,"checksum":"f02a56bc7ea88f41fcc68968e4ceddf3","content_type":"application/pdf","file_id":"18806","file_name":"2024_ArtificialIntelligence_Braun.pdf","file_size":772226,"access_level":"open_access","relation":"main_file","date_created":"2025-01-09T10:45:24Z"}],"OA_type":"hybrid","ddc":["000"],"abstract":[{"lang":"eng","text":"In a delegation problem, a principal P with commitment power tries to pick one out of 𝑛 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∕𝑛)-approximation and extend this result to ratios\r\nof Θ(𝑘∕𝑛) in case (1) A has a lookahead of 𝑘 rounds, or (2) A can propose up to 𝑘 different\r\noptions. We provide fine-grained bounds independent of 𝑛 based on three parameters. If the ratio\r\nof maximum and minimum utility for A is bounded by a factor 𝛼, we obtain an Ω(loglog 𝛼∕ log 𝛼)-\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∕𝛼 cannot\r\nbe avoided. If there are at most 𝛽 different utility values for A, we show a Θ(1∕𝛽)-approximation.\r\nIf the utilities of P and A for each option are related by a factor 𝛾, we obtain an Ω(1∕ log 𝛾)-\r\napproximation, where 𝑂(log log 𝛾∕ log 𝛾) is best possible."}],"date_published":"2024-09-01T00:00:00Z","type":"journal_article","publisher":"Elsevier","scopus_import":"1","author":[{"last_name":"Braun","full_name":"Braun, Pirmin","first_name":"Pirmin"},{"first_name":"Niklas","id":"0a01c7b2-b823-11ed-9928-cc3f874f9ffd","last_name":"Hahn","full_name":"Hahn, Niklas"},{"last_name":"Hoefer","full_name":"Hoefer, Martin","first_name":"Martin"},{"first_name":"Conrad","full_name":"Schecker, Conrad","last_name":"Schecker"}],"department":[{"_id":"MoHe"}],"publication_status":"published","publication_identifier":{"issn":["0004-3702"]},"file_date_updated":"2025-01-09T10:45:24Z","oa":1}]