[{"_id":"18527","acknowledgement":"The authors would like to thank the anonymous referee for the useful suggestions which improved this article. This paper is based on data obtained with the ALMA Observatory, under Large Program 2017.1.00428.L. ALMA is a partnership of ESO (representing its member states), NSF (USA), and NINS (Japan), together with NRC (Canada), MOST and ASIAA (Taiwan), and KASI (Republic of Korea), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO and NAOJ. CDC would like to thank the GESO group at the European Southern Observatory (ESO) for the useful discussions while preparing this manuscript. The simulated data underlying this article will be shared on reasonable request to the corresponding author. CDC acknowledged support from Sapienza University of Rome program “Bando per la mobilità individuale all’estero” (DR n.1607 del 14 June 2021) during the visiting period (June-November 2022) at ESO Garching, Germany. LG and RS acknowledge support from the PRIN 2022 MUR project 2022CB3PJ3 – First Light And Galaxy aSsembly (FLAGS) funded by the European Union – Next Generation EU, and from the Amaldi Research Center funded by the MIUR program “Dipartimento di Eccellenza” (CUP:B81I18001170001). MR acknowledges support from the Narodowe Centrum Nauki (UMO-2020/38/E/ST9/00077) and support from the Foundation for Polish Science (FNP) under the program START 063.2023. We have benefited from the publicly available software CASA and CARTA and programming language Python, including the numpy (https://numpy.org), matplotlib (https://matplotlib.org), scipy (https://scipy.org) and astropy (http://www.astropy.org) packages. ","article_processing_charge":"No","corr_author":"1","date_created":"2024-11-10T23:02:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"isi":["001332213700013"],"arxiv":["2401.03020"]},"date_published":"2024-10-01T00:00:00Z","quality_controlled":"1","OA_type":"hybrid","author":[{"full_name":"Di Cesare, Claudia","last_name":"Di Cesare","first_name":"Claudia","id":"2d002343-372f-11ef-98ec-a164d20427cb"},{"full_name":"Ginolfi, M.","last_name":"Ginolfi","first_name":"M."},{"last_name":"Graziani","first_name":"L.","full_name":"Graziani, L."},{"full_name":"Schneider, R.","first_name":"R.","last_name":"Schneider"},{"full_name":"Romano, M.","first_name":"M.","last_name":"Romano"},{"full_name":"Popping, G.","last_name":"Popping","first_name":"G."}],"intvolume":"       690","title":"Carbon envelopes around merging galaxies at z ~ 4.5","file":[{"date_updated":"2024-11-11T08:54:11Z","checksum":"24c65a64047aba156f39b01425269bdb","relation":"main_file","success":1,"file_id":"18533","access_level":"open_access","file_size":8033864,"creator":"dernst","date_created":"2024-11-11T08:54:11Z","content_type":"application/pdf","file_name":"2024_AstronomyAstrophysics_diCesare.pdf"}],"department":[{"_id":"JoMa"}],"publication_status":"published","publisher":"EDP Sciences","doi":"10.1051/0004-6361/202449164","type":"journal_article","license":"https://creativecommons.org/licenses/by/4.0/","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","file_date_updated":"2024-11-11T08:54:11Z","language":[{"iso":"eng"}],"article_type":"original","publication":"Astronomy & Astrophysics","das_tickbox":"1","date_updated":"2026-07-08T06:44:39Z","isi":1,"year":"2024","abstract":[{"lang":"eng","text":"Context. Galaxies evolve through a dynamic exchange of material with their immediate surrounding environment, the so-called circumgalactic medium (CGM). Understanding the physics of gas flows and the nature of the CGM is fundamental to studying galaxy evolution, especially at 4 ≤ z ≤ 6 (i.e., after the Epoch of Reionization) when galaxies rapidly assembled their masses and reached their chemical maturity. Galactic outflows are predicted to enrich the CGM with metals, although it has also been suggested that gas stripping in systems undergoing a major merger may play a role.\r\n\r\nAims. In this work, we explore the metal enrichment of the medium around merging galaxies at z ∼ 4.5, observed by the ALMA Large Program to INvestigate [CII] at Early times (ALPINE). To do so, we study the nature of the [CII] 158 μm emission in the CGM around these systems, using simulations to help disentangle the mechanisms contributing to the CGM metal pollution.\r\n\r\nMethods. By adopting an updated classification of major merger systems in the ALPINE survey, we selected and analyzed merging galaxies whose components can be spatially and/or spectrally resolved in a robust way. This makes it possible to distinguish between the [CII] emission coming from the single components of the system and that coming from the system as a whole. We also made use of the dustyGadget cosmological simulation to select synthetic analogs of observed galaxies and guide the interpretation of the observational results.\r\n\r\nResults. We find a large diffuse [CII] envelope (≳20 kpc) embedding all the merging systems, with at least 25% of the total [CII] emission coming from the medium between the galaxies. Using predictions from dustyGadget, we suggest that this emission has a multi-fold nature, with dynamical interactions between galaxies playing a major role in stripping the gas and enriching the medium with heavy elements."}],"citation":{"ista":"Di Cesare C, Ginolfi M, Graziani L, Schneider R, Romano M, Popping G. 2024. Carbon envelopes around merging galaxies at z ~ 4.5. Astronomy &#38; Astrophysics. 690, A255.","ieee":"C. Di Cesare, M. Ginolfi, L. Graziani, R. Schneider, M. Romano, and G. Popping, “Carbon envelopes around merging galaxies at z ~ 4.5,” <i>Astronomy &#38; Astrophysics</i>, vol. 690. EDP Sciences, 2024.","apa":"Di Cesare, C., Ginolfi, M., Graziani, L., Schneider, R., Romano, M., &#38; Popping, G. (2024). Carbon envelopes around merging galaxies at z ~ 4.5. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202449164\">https://doi.org/10.1051/0004-6361/202449164</a>","short":"C. Di Cesare, M. Ginolfi, L. Graziani, R. Schneider, M. Romano, G. Popping, Astronomy &#38; Astrophysics 690 (2024).","mla":"Di Cesare, Claudia, et al. “Carbon Envelopes around Merging Galaxies at z ~ 4.5.” <i>Astronomy &#38; Astrophysics</i>, vol. 690, A255, EDP Sciences, 2024, doi:<a href=\"https://doi.org/10.1051/0004-6361/202449164\">10.1051/0004-6361/202449164</a>.","ama":"Di Cesare C, Ginolfi M, Graziani L, Schneider R, Romano M, Popping G. Carbon envelopes around merging galaxies at z ~ 4.5. <i>Astronomy &#38; Astrophysics</i>. 2024;690. doi:<a href=\"https://doi.org/10.1051/0004-6361/202449164\">10.1051/0004-6361/202449164</a>","chicago":"Di Cesare, Claudia, M. Ginolfi, L. Graziani, R. Schneider, M. Romano, and G. Popping. “Carbon Envelopes around Merging Galaxies at z ~ 4.5.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2024. <a href=\"https://doi.org/10.1051/0004-6361/202449164\">https://doi.org/10.1051/0004-6361/202449164</a>."},"volume":690,"ddc":["520"],"publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"scopus_import":"1","article_number":"A255","status":"public","oa":1,"oa_version":"Published Version","has_accepted_license":"1","arxiv":1,"OA_place":"publisher"},{"language":[{"iso":"eng"}],"extern":"1","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","month":"10","abstract":[{"text":"The inertia bound and ratio bound (also known as the Cvetković bound and Hoffman bound) are two fundamental inequalities in spectral graph theory, giving upper bounds on the independence number a(G) of a graph G in terms of spectral information about a weighted adjacency matrix of G. For both inequalities, given a graph G, one needs to make a judicious choice of weighted adjacency matrix to obtain as strong a bound as possible. While there is a well‐established theory surrounding the ratio bound, the inertia bound is much more mysterious, and its limits are rather unclear. In fact, only recently did Sinkovic find the first example of a graph for which the inertia bound is not tight (for any weighted adjacency matrix), answering a longstanding question of Godsil. We show that the inertia bound can be extremely far from tight, and in fact can significantly underperform the ratio bound: for example, one of our results is that for infinitely many n, there is an n‐vertex graph for which even the unweighted ratio bound can prove a(G)<4n^3/4, but the inertia bound is always at least n/4. In particular, these results address questions of Rooney, Sinkovic, and Wocjan–Elphick–Abiad.","lang":"eng"}],"year":"2024","date_updated":"2026-07-08T07:34:36Z","publication":"Bulletin of the London Mathematical Society","ddc":["500"],"volume":56,"citation":{"chicago":"Kwan, Matthew, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” <i>Bulletin of the London Mathematical Society</i>. Wiley, 2024. <a href=\"https://doi.org/10.1112/blms.13127\">https://doi.org/10.1112/blms.13127</a>.","mla":"Kwan, Matthew, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 10, Wiley, 2024, pp. 3196–208, doi:<a href=\"https://doi.org/10.1112/blms.13127\">10.1112/blms.13127</a>.","ama":"Kwan M, Wigderson Y. The inertia bound is far from tight. <i>Bulletin of the London Mathematical Society</i>. 2024;56(10):3196-3208. doi:<a href=\"https://doi.org/10.1112/blms.13127\">10.1112/blms.13127</a>","ieee":"M. Kwan and Y. Wigderson, “The inertia bound is far from tight,” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 10. Wiley, pp. 3196–3208, 2024.","apa":"Kwan, M., &#38; Wigderson, Y. (2024). The inertia bound is far from tight. <i>Bulletin of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/blms.13127\">https://doi.org/10.1112/blms.13127</a>","short":"M. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024) 3196–3208.","ista":"Kwan M, Wigderson Y. 2024. The inertia bound is far from tight. Bulletin of the London Mathematical Society. 56(10), 3196–3208."},"arxiv":1,"OA_place":"publisher","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1112/blms.13127"}],"oa":1,"oa_version":"Published Version","status":"public","scopus_import":"1","publication_identifier":{"eissn":["1469-2120"],"issn":["0024-6093"]},"article_processing_charge":"Yes (via OA deal)","date_created":"2026-06-29T10:49:18Z","page":"3196-3208","acknowledgement":"Open access funding provided by Eidgenossische Technische Hochschule Zurich.","_id":"22154","author":[{"full_name":"Kwan, Matthew","first_name":"Matthew","last_name":"Kwan"},{"first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson","full_name":"Wigderson, Yuval"}],"intvolume":"        56","quality_controlled":"1","OA_type":"hybrid","external_id":{"arxiv":["2312.04925"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"date_published":"2024-10-01T00:00:00Z","issue":"10","title":"The inertia bound is far from tight","publisher":"Wiley","type":"journal_article","doi":"10.1112/blms.13127","publication_status":"published"},{"author":[{"id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","orcid":"0000-0003-0582-2946","first_name":"Sofya","last_name":"Agafonova","full_name":"Agafonova, Sofya"},{"last_name":"Mishra","first_name":"Umang","id":"4328fa4c-f128-11eb-9611-c107b0fe4d51","full_name":"Mishra, Umang"},{"full_name":"Diorico, Fritz R","first_name":"Fritz R","id":"2E054C4C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4947-8924","last_name":"Diorico"},{"first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","last_name":"Hosten","full_name":"Hosten, Onur"}],"intvolume":"         6","external_id":{"arxiv":["2306.12804"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"date_published":"2024-02-05T00:00:00Z","quality_controlled":"1","OA_type":"gold","article_processing_charge":"Yes","corr_author":"1","date_created":"2024-02-12T11:42:18Z","_id":"14980","acknowledgement":"We thank Pere Rosselló for his contributions to the initial modeling of the presented sensing technique. This work was supported by Institute of Science and Technology Austria, and\r\nthe European Research Council under Grant No. 101087907 (ERC CoG QuHAMP).","publisher":"American Physical Society","type":"journal_article","doi":"10.1103/physrevresearch.6.013141","department":[{"_id":"OnHo"}],"publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","file_size":1437167,"file_id":"14981","content_type":"application/pdf","file_name":"2024_PhysicalRevResearch_Agafonova.pdf","date_created":"2024-02-12T11:46:50Z","checksum":"3a39ebffb24c1cc1dd0b547a726dc52d","relation":"main_file","date_updated":"2024-02-12T11:46:50Z","success":1}],"issue":"1","researchdata_availability":"no","title":"Zigzag optical cavity for sensing and controlling torsional motion","project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907"}],"year":"2024","APC_amount":"2933,65 EUR","abstract":[{"lang":"eng","text":"Precision sensing and manipulation of milligram-scale mechanical oscillators has attracted growing interest in the fields of table-top explorations of gravity and tests of quantum mechanics at macroscopic scales. Torsional oscillators present an opportunity in this regard due to their remarked isolation from environmental noise. For torsional motion, an effective employment of optical cavities to enhance optomechanical interactions—as already established for linear oscillators—so far faced certain challenges. Here, we propose a concept for sensing and manipulating torsional motion, where exclusively the torsional rotations of a pendulum are mapped onto the path length of a single two-mirror optical cavity. The concept inherently alleviates many limitations of previous approaches. A proof-of-principle experiment is conducted with a rigidly controlled pendulum to explore the sensing aspects of the concept and to identify practical limitations in a potential state-of-the art setup. Based on this study, we anticipate development of precision torque sensors utilizing torsional pendulums that can support sensitivities below 10−19Nm/√Hz, while the motion of the pendulums are dominated by quantum radiation pressure noise at sub-microwatts of incoming laser power. These developments will provide horizons for experiments at the interface of quantum mechanics and gravity."}],"publication":"Physical Review Research","das_tickbox":"0","date_updated":"2026-07-08T07:52:51Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","day":"05","file_date_updated":"2024-02-12T11:46:50Z","language":[{"iso":"eng"}],"article_type":"original","supplementarymaterial":"no","month":"02","has_accepted_license":"1","oa_version":"Published Version","oa":1,"arxiv":1,"OA_place":"publisher","publication_identifier":{"eissn":["2643-1564"]},"scopus_import":"1","article_number":"013141","status":"public","ddc":["530"],"DOAJ_listed":"1","citation":{"chicago":"Agafonova, Sofia, Umang Mishra, Fritz R Diorico, and Onur Hosten. “Zigzag Optical Cavity for Sensing and Controlling Torsional Motion.” <i>Physical Review Research</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/physrevresearch.6.013141\">https://doi.org/10.1103/physrevresearch.6.013141</a>.","mla":"Agafonova, Sofia, et al. “Zigzag Optical Cavity for Sensing and Controlling Torsional Motion.” <i>Physical Review Research</i>, vol. 6, no. 1, 013141, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.013141\">10.1103/physrevresearch.6.013141</a>.","ama":"Agafonova S, Mishra U, Diorico FR, Hosten O. Zigzag optical cavity for sensing and controlling torsional motion. <i>Physical Review Research</i>. 2024;6(1). doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.013141\">10.1103/physrevresearch.6.013141</a>","ieee":"S. Agafonova, U. Mishra, F. R. Diorico, and O. Hosten, “Zigzag optical cavity for sensing and controlling torsional motion,” <i>Physical Review Research</i>, vol. 6, no. 1. American Physical Society, 2024.","apa":"Agafonova, S., Mishra, U., Diorico, F. R., &#38; Hosten, O. (2024). Zigzag optical cavity for sensing and controlling torsional motion. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.6.013141\">https://doi.org/10.1103/physrevresearch.6.013141</a>","short":"S. Agafonova, U. Mishra, F.R. Diorico, O. Hosten, Physical Review Research 6 (2024).","ista":"Agafonova S, Mishra U, Diorico FR, Hosten O. 2024. Zigzag optical cavity for sensing and controlling torsional motion. Physical Review Research. 6(1), 013141."},"volume":6},{"_id":"14802","acknowledgement":"We thank Rishabh Sahu and Sebastian Wald for technical contributions to the experiment. Funding by Institute of Science and Technology Austria.","page":"26-31","keyword":["Atomic and Molecular Physics","and Optics","Electronic","Optical and Magnetic Materials"],"date_created":"2024-01-15T10:25:38Z","article_processing_charge":"Yes","corr_author":"1","date_published":"2024-01-20T00:00:00Z","external_id":{"isi":["001202817000004"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"OA_type":"gold","quality_controlled":"1","intvolume":"        11","author":[{"full_name":"Diorico, Fritz R","last_name":"Diorico","first_name":"Fritz R","orcid":"0000-0002-4947-8924","id":"2E054C4C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zhutov","first_name":"Artem","id":"0f02ed6a-b514-11ee-b891-8379c5f19cb7","full_name":"Zhutov, Artem"},{"full_name":"Hosten, Onur","last_name":"Hosten","first_name":"Onur","orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"}],"title":"Laser-cavity locking utilizing beam ellipticity: accessing the 10<sup>−7</sup> instability scale relative to cavity linewidth","file":[{"date_updated":"2024-01-17T08:53:16Z","checksum":"eb99ca7d0fe73e22f121875175546ed7","relation":"main_file","success":1,"file_id":"14824","access_level":"open_access","creator":"dernst","file_size":4558986,"date_created":"2024-01-17T08:53:16Z","content_type":"application/pdf","file_name":"2023_Optica_Diorico.pdf"}],"researchdata_availability":"upon request","issue":"1","department":[{"_id":"OnHo"}],"publication_status":"published","doi":"10.1364/optica.507451","type":"journal_article","publisher":"Optica Publishing Group","month":"01","supplementarymaterial":"no","day":"20","file_date_updated":"2024-01-17T08:53:16Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","article_type":"original","language":[{"iso":"eng"}],"publication":"Optica","date_updated":"2026-07-08T08:25:12Z","dataavailabilitystatement":"Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.","das_tickbox":"1","APC_amount":"3393,38 EUR","year":"2024","isi":1,"abstract":[{"lang":"eng","text":"Frequency-stable lasers form the back bone of precision measurements in science and technology. Such lasers typically attain their stability through frequency locking to reference cavities. State-of-the-art locking performances to date had been achieved using frequency modulation based methods, complemented with active drift cancellation systems. We demonstrate an all passive, modulation-free laser-cavity locking technique (squash locking) that utilizes changes in spatial beam ellipticity for error signal generation, and a coherent polarization post-selection for noise resilience. By comparing two identically built proof-of-principle systems, we show a frequency locking instability of 5×10<jats:sup>−7</jats:sup> relative to the cavity linewidth at 10 s averaging. The results surpass the demonstrated performances of methods engineered over the last five decades, potentially enabling an advancement in the precision control of lasers, while creating avenues for bridging the performance gaps between industrial grade lasers with scientific ones due to the afforded simplicity and scalability."}],"citation":{"ama":"Diorico FR, Zhutov A, Hosten O. Laser-cavity locking utilizing beam ellipticity: accessing the 10<sup>−7</sup> instability scale relative to cavity linewidth. <i>Optica</i>. 2024;11(1):26-31. doi:<a href=\"https://doi.org/10.1364/optica.507451\">10.1364/optica.507451</a>","mla":"Diorico, Fritz R., et al. “Laser-Cavity Locking Utilizing Beam Ellipticity: Accessing the 10<sup>−7</sup> Instability Scale Relative to Cavity Linewidth.” <i>Optica</i>, vol. 11, no. 1, Optica Publishing Group, 2024, pp. 26–31, doi:<a href=\"https://doi.org/10.1364/optica.507451\">10.1364/optica.507451</a>.","chicago":"Diorico, Fritz R, Artem Zhutov, and Onur Hosten. “Laser-Cavity Locking Utilizing Beam Ellipticity: Accessing the 10<sup>−7</sup> Instability Scale Relative to Cavity Linewidth.” <i>Optica</i>. Optica Publishing Group, 2024. <a href=\"https://doi.org/10.1364/optica.507451\">https://doi.org/10.1364/optica.507451</a>.","ista":"Diorico FR, Zhutov A, Hosten O. 2024. Laser-cavity locking utilizing beam ellipticity: accessing the 10<sup>−7</sup> instability scale relative to cavity linewidth. Optica. 11(1), 26–31.","short":"F.R. Diorico, A. Zhutov, O. Hosten, Optica 11 (2024) 26–31.","ieee":"F. R. Diorico, A. Zhutov, and O. Hosten, “Laser-cavity locking utilizing beam ellipticity: accessing the 10<sup>−7</sup> instability scale relative to cavity linewidth,” <i>Optica</i>, vol. 11, no. 1. Optica Publishing Group, pp. 26–31, 2024.","apa":"Diorico, F. R., Zhutov, A., &#38; Hosten, O. (2024). Laser-cavity locking utilizing beam ellipticity: accessing the 10<sup>−7</sup> instability scale relative to cavity linewidth. <i>Optica</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/optica.507451\">https://doi.org/10.1364/optica.507451</a>"},"volume":11,"DOAJ_listed":"1","ddc":["530"],"publication_identifier":{"issn":["2334-2536"]},"scopus_import":"1","status":"public","oa_version":"Published Version","oa":1,"has_accepted_license":"1","OA_place":"publisher"},{"status":"public","publication_identifier":{"issn":["2663-337X"]},"OA_place":"publisher","degree_awarded":"PhD","oa_version":"Published Version","has_accepted_license":"1","oa":1,"citation":{"chicago":"Li, Vyacheslav. “Towards a Quantum Entanglement Enhanced Atom Interferomter.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17225\">https://doi.org/10.15479/at:ista:17225</a>.","ama":"Li V. Towards a quantum entanglement enhanced atom interferomter. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17225\">10.15479/at:ista:17225</a>","mla":"Li, Vyacheslav. <i>Towards a Quantum Entanglement Enhanced Atom Interferomter</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17225\">10.15479/at:ista:17225</a>.","short":"V. Li, Towards a Quantum Entanglement Enhanced Atom Interferomter, Institute of Science and Technology Austria, 2024.","ieee":"V. Li, “Towards a quantum entanglement enhanced atom interferomter,” Institute of Science and Technology Austria, 2024.","apa":"Li, V. (2024). <i>Towards a quantum entanglement enhanced atom interferomter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17225\">https://doi.org/10.15479/at:ista:17225</a>","ista":"Li V. 2024. Towards a quantum entanglement enhanced atom interferomter. Institute of Science and Technology Austria."},"ddc":["530"],"date_updated":"2026-07-08T08:50:57Z","supervisor":[{"full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","first_name":"Onur","last_name":"Hosten"}],"abstract":[{"lang":"eng","text":"This thesis describes the development of an atom interferometer designed to exploit the\r\nadvantages of utilizing quantum entanglement for enhanced precision measurements beyond\r\nthe standard quantum limit. While the project remains ongoing, significant progress has been\r\nmade.\r\nA key contribution of this work is the development of Quantrol, an experimental control\r\nsystem leveraging the ARTIQ framework. This software enables precise timing and control\r\nwithout requiring prior knowledge of ARTIQ’s implementation details or coding experience.\r\nThe interface offers user friendly visual comprehension of the experimental sequence and\r\nextended capabilities, allowing researchers to scan variables with a simple click of a mouse.\r\nThe main proposed project is to implement atom interferometric sequence with squeezed input\r\nstates inside of a dipole trap generated by a high finesse cavity. The presence of the dipole\r\ntrap allows one dimensional atomic cloud split while maintaining relatively strong confinement\r\nin other directions.\r\nWe are currently able to trap and cool 87Rb atoms to few micro kelvin temperatures, load\r\nthem into the dipole trap and state prepare them to be used for squeezing and interferometric\r\nsequence."}],"year":"2024","month":"07","language":[{"iso":"eng"}],"day":"11","file_date_updated":"2024-07-11T10:26:22Z","alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","doi":"10.15479/at:ista:17225","type":"dissertation","publisher":"Institute of Science and Technology Austria","title":"Towards a quantum entanglement enhanced atom interferomter","project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","grant_number":"101087907","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6"}],"file":[{"checksum":"15b2dbe8d2c9ed7ca5dd413827928077","relation":"main_file","date_updated":"2024-07-11T10:26:22Z","success":1,"access_level":"open_access","file_size":6729761,"creator":"vli","file_id":"17228","content_type":"application/pdf","file_name":"PhD_Thesis_Vyacheslav_Li_no_signatures_PDFA.pdf","date_created":"2024-07-11T10:26:22Z"},{"content_type":"application/x-zip-compressed","file_name":"PhD Thesis Vyacheslav Li.zip","date_created":"2024-07-11T10:26:22Z","access_level":"closed","creator":"vli","file_size":9542859,"file_id":"17229","checksum":"16e904a11d8d0ebb167cb654ddfc7fe5","relation":"source_file","date_updated":"2024-07-11T10:26:22Z"}],"date_published":"2024-07-11T00:00:00Z","tmp":{"short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png"},"author":[{"first_name":"Vyacheslav","id":"3A4FAA92-F248-11E8-B48F-1D18A9856A87","last_name":"Li","full_name":"Li, Vyacheslav"}],"_id":"17225","date_created":"2024-07-11T09:46:48Z","related_material":{"record":[{"id":"11438","status":"public","relation":"part_of_dissertation"}]},"corr_author":"1","article_processing_charge":"No","page":"79"},{"OA_place":"publisher","oa":1,"oa_version":"Published Version","has_accepted_license":"1","article_number":"e1011941","status":"public","scopus_import":"1","publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]},"pmid":1,"ddc":["000","570"],"DOAJ_listed":"1","volume":20,"citation":{"ama":"Chintaluri C, Bejtka M, Sredniawa W, et al. kCSD-python, reliable current source density estimation with quality control. <i>PLoS Computational Biology</i>. 2024;20(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">10.1371/journal.pcbi.1011941</a>","mla":"Chintaluri, Chaitanya, et al. “KCSD-Python, Reliable Current Source Density Estimation with Quality Control.” <i>PLoS Computational Biology</i>, vol. 20, no. 3, e1011941, Public Library of Science, 2024, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">10.1371/journal.pcbi.1011941</a>.","chicago":"Chintaluri, Chaitanya, Marta Bejtka, Wladyslaw Sredniawa, Michal Czerwinski, Jakub M. Dzik, Joanna Jedrzejewska-Szmek, and Daniel K. Wojciki. “KCSD-Python, Reliable Current Source Density Estimation with Quality Control.” <i>PLoS Computational Biology</i>. Public Library of Science, 2024. <a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">https://doi.org/10.1371/journal.pcbi.1011941</a>.","ista":"Chintaluri C, Bejtka M, Sredniawa W, Czerwinski M, Dzik JM, Jedrzejewska-Szmek J, Wojciki DK. 2024. kCSD-python, reliable current source density estimation with quality control. PLoS Computational Biology. 20(3), e1011941.","apa":"Chintaluri, C., Bejtka, M., Sredniawa, W., Czerwinski, M., Dzik, J. M., Jedrzejewska-Szmek, J., &#38; Wojciki, D. K. (2024). kCSD-python, reliable current source density estimation with quality control. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">https://doi.org/10.1371/journal.pcbi.1011941</a>","ieee":"C. Chintaluri <i>et al.</i>, “kCSD-python, reliable current source density estimation with quality control,” <i>PLoS Computational Biology</i>, vol. 20, no. 3. Public Library of Science, 2024.","short":"C. Chintaluri, M. Bejtka, W. Sredniawa, M. Czerwinski, J.M. Dzik, J. Jedrzejewska-Szmek, D.K. Wojciki, PLoS Computational Biology 20 (2024)."},"abstract":[{"text":"Interpretation of extracellular recordings can be challenging due to the long range of electric field. This challenge can be mitigated by estimating the current source density (CSD). Here we introduce kCSD-python, an open Python package implementing Kernel Current Source Density (kCSD) method and related tools to facilitate CSD analysis of experimental data and the interpretation of results. We show how to counter the limitations imposed by noise and assumptions in the method itself. kCSD-python allows CSD estimation for an arbitrary distribution of electrodes in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in a single cell, and includes a range of diagnostic aids. We demonstrate its features in a Jupyter Notebook tutorial which illustrates a typical analytical workflow and main functionalities useful in validating analysis results.","lang":"eng"}],"isi":1,"year":"2024","das_tickbox":"1","date_updated":"2026-07-13T12:30:33Z","publication":"PLoS Computational Biology","language":[{"iso":"eng"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"14","file_date_updated":"2025-06-25T05:47:36Z","month":"03","publisher":"Public Library of Science","type":"journal_article","doi":"10.1371/journal.pcbi.1011941","publication_status":"published","department":[{"_id":"TiVo"}],"issue":"3","file":[{"checksum":"c09718d0d09614642d877d0716ce32e8","relation":"main_file","date_updated":"2025-06-25T05:47:36Z","success":1,"access_level":"open_access","file_size":2540277,"creator":"dernst","file_id":"19897","content_type":"application/pdf","file_name":"2024_PLoSCompBio_Chintaluri.pdf","date_created":"2025-06-25T05:47:36Z"}],"title":"kCSD-python, reliable current source density estimation with quality control","author":[{"full_name":"Chintaluri, Chaitanya","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","orcid":"0000-0003-4252-1608","first_name":"Chaitanya","last_name":"Chintaluri"},{"first_name":"Marta","last_name":"Bejtka","full_name":"Bejtka, Marta"},{"full_name":"Sredniawa, Wladyslaw","first_name":"Wladyslaw","last_name":"Sredniawa"},{"last_name":"Czerwinski","first_name":"Michal","full_name":"Czerwinski, Michal"},{"full_name":"Dzik, Jakub M.","first_name":"Jakub M.","last_name":"Dzik"},{"last_name":"Jedrzejewska-Szmek","first_name":"Joanna","full_name":"Jedrzejewska-Szmek, Joanna"},{"full_name":"Wojciki, Daniel K.","last_name":"Wojciki","first_name":"Daniel K."}],"intvolume":"        20","quality_controlled":"1","OA_type":"gold","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"pmid":["38484020"],"isi":["001190689800001"]},"date_published":"2024-03-14T00:00:00Z","article_processing_charge":"Yes","corr_author":"1","date_created":"2024-03-24T23:00:59Z","related_material":{"link":[{"url":"https://github.com/Neuroinflab/kCSD-python","relation":"software"}]},"acknowledgement":"The Python implementation of kCSD was started by Grzegorz Parka during Google Summer of Code project through the International Neuroinformatics Coordinating Facility. Jan Mąka implemented the first Python version of skCSD class. This work was supported by the Polish National Science Centre (2013/08/W/NZ4/00691 to DKW; 2015/17/B/ST7/04123 to DKW). ","_id":"15169"},{"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"},{"name":"Improving estimation and prediction of common complex disease risk","grant_number":"PCEGP3_181181","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A"}],"title":"Inference of genetic effects via approximate message passing","publisher":"IEEE","type":"conference","acknowledged_ssus":[{"_id":"ScienComp"}],"doi":"10.1109/ICASSP48485.2024.10447198","publication_status":"published","department":[{"_id":"MaMo"},{"_id":"MaRo"}],"corr_author":"1","article_processing_charge":"No","date_created":"2024-06-16T22:01:07Z","page":"13151-13155","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).","_id":"17147","author":[{"id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","first_name":"Al","last_name":"Depope","full_name":"Depope, Al"},{"full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","last_name":"Robinson"}],"quality_controlled":"1","OA_type":"green","external_id":{"isi":["001396233806078"]},"conference":{"location":"Seoul, Korea","start_date":"2024-04-14","end_date":"2024-04-19","name":"ICASSP: International Conference on Acoustics, Speech and Signal Processing"},"date_published":"2024-04-19T00:00:00Z","citation":{"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.","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 <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>, Seoul, Korea, 2024, pp. 13151–13155.","apa":"Depope, A., Mondelli, M., &#38; Robinson, M. R. (2024). Inference of genetic effects via approximate message passing. In <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i> (pp. 13151–13155). Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">https://doi.org/10.1109/ICASSP48485.2024.10447198</a>","mla":"Depope, Al, et al. “Inference of Genetic Effects via Approximate Message Passing.” <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>, IEEE, 2024, pp. 13151–55, doi:<a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">10.1109/ICASSP48485.2024.10447198</a>.","ama":"Depope A, Mondelli M, Robinson MR. Inference of genetic effects via approximate message passing. In: <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>. IEEE; 2024:13151-13155. doi:<a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">10.1109/ICASSP48485.2024.10447198</a>","chicago":"Depope, Al, Marco Mondelli, and Matthew Richard Robinson. “Inference of Genetic Effects via Approximate Message Passing.” In <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>, 13151–55. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">https://doi.org/10.1109/ICASSP48485.2024.10447198</a>."},"OA_place":"repository","main_file_link":[{"url":"https://openreview.net/forum?id=aQYCDxfZV0","open_access":"1"}],"oa":1,"oa_version":"Submitted Version","status":"public","scopus_import":"1","publication_identifier":{"isbn":["9798350344851"],"issn":["1520-6149"]},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","month":"04","abstract":[{"lang":"eng","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."}],"isi":1,"year":"2024","date_updated":"2026-07-13T14:57:55Z","publication":"2024 IEEE International Conference on Acoustics, Speech, and Signal Processing"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","extern":"1","language":[{"iso":"eng"}],"article_type":"original","month":"10","year":"2024","abstract":[{"text":"Burr and Erd˝os in 1975 conjectured, and Chv´atal, R¨odl, Szemer´edi and\r\nTrotter later proved, that the Ramsey number of any bounded degree\r\ngraph is linear in the number of vertices. In this paper, we disprove\r\nthe natural directed analogue of the Burr–Erd˝os conjecture, answering a\r\nquestion of Buci´c, Letzter, and Sudakov. If H is an acyclic digraph, the\r\noriented Ramsey number of H, denoted −→r1(H), is the least N such that\r\nevery tournament on N vertices contains a copy of H. We show that for\r\nany Δ ≥ 2 and any sufficiently large n, there exists an acyclic digraph H\r\nwith n vertices and maximum degree Δ such that\r\n−→r1(H) ≥ nΩ(Δ2/3/ log5/3 Δ).\r\nThis proves that −→r1(H) is not always linear in the number of vertices for\r\nbounded-degree H. On the other hand, we show that −→r1(H) is nearly linear\r\nin the number of vertices for typical bounded-degree acyclic digraphs H,\r\nand obtain linear or nearly linear bounds for several natural families of\r\nbounded-degree acyclic digraphs.\r\nFor multiple colors, we prove a quasi-polynomial upper bound −→rk(H)=\r\n2(log n)Ok(1) for all bounded-degree acyclic digraphs H on n vertices, where −→rk(H) is the least N such that every k-edge-colored tournament on N\r\nvertices contains a monochromatic copy of H. For k ≥ 2 and n ≥ 4, we\r\nexhibit an acyclic digraph H with n vertices and maximum degree 3 such\r\nthat −→rk(H) ≥ nΩ(log n/ log log n), showing that these Ramsey numbers can\r\ngrow faster than any polynomial in the number of vertices.","lang":"eng"}],"publication":"Israel Journal of Mathematics","date_updated":"2026-07-14T09:08:32Z","citation":{"ista":"Fox J, He X, Wigderson Y. 2024. Ramsey numbers of sparse digraphs. Israel Journal of Mathematics. 263(1), 1–48.","ieee":"J. Fox, X. He, and Y. Wigderson, “Ramsey numbers of sparse digraphs,” <i>Israel Journal of Mathematics</i>, vol. 263, no. 1. Springer Nature, pp. 1–48, 2024.","apa":"Fox, J., He, X., &#38; Wigderson, Y. (2024). Ramsey numbers of sparse digraphs. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-024-2624-y\">https://doi.org/10.1007/s11856-024-2624-y</a>","short":"J. Fox, X. He, Y. Wigderson, Israel Journal of Mathematics 263 (2024) 1–48.","ama":"Fox J, He X, Wigderson Y. Ramsey numbers of sparse digraphs. <i>Israel Journal of Mathematics</i>. 2024;263(1):1-48. doi:<a href=\"https://doi.org/10.1007/s11856-024-2624-y\">10.1007/s11856-024-2624-y</a>","mla":"Fox, Jacob, et al. “Ramsey Numbers of Sparse Digraphs.” <i>Israel Journal of Mathematics</i>, vol. 263, no. 1, Springer Nature, 2024, pp. 1–48, doi:<a href=\"https://doi.org/10.1007/s11856-024-2624-y\">10.1007/s11856-024-2624-y</a>.","chicago":"Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey Numbers of Sparse Digraphs.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s11856-024-2624-y\">https://doi.org/10.1007/s11856-024-2624-y</a>."},"volume":263,"oa_version":"Preprint","oa":1,"arxiv":1,"OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2105.02383"}],"scopus_import":"1","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"status":"public","page":"1-48","article_processing_charge":"No","date_created":"2026-06-29T10:59:02Z","_id":"22179","author":[{"full_name":"Fox, Jacob","first_name":"Jacob","last_name":"Fox"},{"full_name":"He, Xiaoyu","first_name":"Xiaoyu","last_name":"He"},{"first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson","full_name":"Wigderson, Yuval"}],"intvolume":"       263","external_id":{"arxiv":["2105.02383"]},"date_published":"2024-10-01T00:00:00Z","quality_controlled":"1","OA_type":"green","issue":"1","title":"Ramsey numbers of sparse digraphs","publisher":"Springer Nature","doi":"10.1007/s11856-024-2624-y","type":"journal_article","publication_status":"published"},{"_id":"22180","article_processing_charge":"No","date_created":"2026-06-29T10:59:24Z","page":"663-675","quality_controlled":"1","OA_type":"green","external_id":{"unknown":["2208.11181"]},"date_published":"2024-07-01T00:00:00Z","author":[{"full_name":"Wigderson, Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval"}],"intvolume":"       106","title":"Ramsey numbers upon vertex deletion","issue":"3","publication_status":"published","publisher":"Wiley","type":"journal_article","doi":"10.1002/jgt.23093","month":"07","language":[{"iso":"eng"}],"extern":"1","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2026-07-14T09:10:28Z","publication":"Journal of Graph Theory","abstract":[{"lang":"eng","text":"Given a graph , its Ramsey number  is the minimum  so that every two‐coloring of  contains a monochromatic copy of . It was conjectured by Conlon, Fox, and Sudakov that if one deletes a single vertex from , the Ramsey number can change by at most a constant factor. We disprove this conjecture, exhibiting an infinite family of graphs such that deleting a single vertex from each decreases the Ramsey number by a super‐constant factor. One consequence of this result is the following. There exists a family of graphs  so that in any Ramsey coloring for  (i.e., a coloring of a clique on  vertices with no monochromatic copy of ), one of the color classes has density ."}],"year":"2024","volume":106,"citation":{"ama":"Wigderson Y. Ramsey numbers upon vertex deletion. <i>Journal of Graph Theory</i>. 2024;106(3):663-675. doi:<a href=\"https://doi.org/10.1002/jgt.23093\">10.1002/jgt.23093</a>","mla":"Wigderson, Yuval. “Ramsey Numbers upon Vertex Deletion.” <i>Journal of Graph Theory</i>, vol. 106, no. 3, Wiley, 2024, pp. 663–75, doi:<a href=\"https://doi.org/10.1002/jgt.23093\">10.1002/jgt.23093</a>.","chicago":"Wigderson, Yuval. “Ramsey Numbers upon Vertex Deletion.” <i>Journal of Graph Theory</i>. Wiley, 2024. <a href=\"https://doi.org/10.1002/jgt.23093\">https://doi.org/10.1002/jgt.23093</a>.","ista":"Wigderson Y. 2024. Ramsey numbers upon vertex deletion. Journal of Graph Theory. 106(3), 663–675.","short":"Y. Wigderson, Journal of Graph Theory 106 (2024) 663–675.","apa":"Wigderson, Y. (2024). Ramsey numbers upon vertex deletion. <i>Journal of Graph Theory</i>. Wiley. <a href=\"https://doi.org/10.1002/jgt.23093\">https://doi.org/10.1002/jgt.23093</a>","ieee":"Y. Wigderson, “Ramsey numbers upon vertex deletion,” <i>Journal of Graph Theory</i>, vol. 106, no. 3. Wiley, pp. 663–675, 2024."},"status":"public","scopus_import":"1","publication_identifier":{"eissn":["1097-0118"],"issn":["0364-9024"]},"OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2208.11181"}],"oa_version":"Preprint","oa":1},{"author":[{"first_name":"Muhammad","last_name":"Afifurrahman","full_name":"Afifurrahman, Muhammad"},{"last_name":"Kuperberg","id":"c3bac823-112d-11f0-a3f5-c264f852e697","first_name":"Vivian Zieve","full_name":"Kuperberg, Vivian Zieve"},{"full_name":"Ostafe, Alina","first_name":"Alina","last_name":"Ostafe"},{"full_name":"Shparlinski, Igor E.","last_name":"Shparlinski","first_name":"Igor E."}],"intvolume":"        37","external_id":{"arxiv":["2401.10086"]},"date_published":"2024-01-01T00:00:00Z","quality_controlled":"1","OA_type":"green","article_processing_charge":"No","date_created":"2026-06-29T12:55:47Z","_id":"22190","publisher":"De Gruyter","type":"journal_article","doi":"10.1515/forum-2024-0114","publication_status":"published","issue":"4","title":"Statistics of ranks, determinants and characteristic polynomials of rational matrices","year":"2024","abstract":[{"text":"We consider the set of 𝑚×𝑛 matrices with rational entries having numerator and denominator of size at most H and obtain various upper bounds on the number of such matrices of a given rank, or with a given determinant, or a given characteristic polynomial. We also consider similar questions for matrices whose entries are Egyptian fractions.","lang":"eng"}],"publication":"Forum Mathematicum","date_updated":"2026-07-14T10:48:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","language":[{"iso":"eng"}],"article_type":"original","month":"01","oa":1,"oa_version":"Preprint","arxiv":1,"OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2401.10086"}],"publication_identifier":{"issn":["0933-7741"],"eissn":["1435-5337"]},"scopus_import":"1","status":"public","citation":{"ista":"Afifurrahman M, Kuperberg VZ, Ostafe A, Shparlinski IE. 2024. Statistics of ranks, determinants and characteristic polynomials of rational matrices. Forum Mathematicum. 37(4).","ieee":"M. Afifurrahman, V. Z. Kuperberg, A. Ostafe, and I. E. Shparlinski, “Statistics of ranks, determinants and characteristic polynomials of rational matrices,” <i>Forum Mathematicum</i>, vol. 37, no. 4. De Gruyter, 2024.","apa":"Afifurrahman, M., Kuperberg, V. Z., Ostafe, A., &#38; Shparlinski, I. E. (2024). Statistics of ranks, determinants and characteristic polynomials of rational matrices. <i>Forum Mathematicum</i>. De Gruyter. <a href=\"https://doi.org/10.1515/forum-2024-0114\">https://doi.org/10.1515/forum-2024-0114</a>","short":"M. Afifurrahman, V.Z. Kuperberg, A. Ostafe, I.E. Shparlinski, Forum Mathematicum 37 (2024).","mla":"Afifurrahman, Muhammad, et al. “Statistics of Ranks, Determinants and Characteristic Polynomials of Rational Matrices.” <i>Forum Mathematicum</i>, vol. 37, no. 4, De Gruyter, 2024, doi:<a href=\"https://doi.org/10.1515/forum-2024-0114\">10.1515/forum-2024-0114</a>.","ama":"Afifurrahman M, Kuperberg VZ, Ostafe A, Shparlinski IE. Statistics of ranks, determinants and characteristic polynomials of rational matrices. <i>Forum Mathematicum</i>. 2024;37(4). doi:<a href=\"https://doi.org/10.1515/forum-2024-0114\">10.1515/forum-2024-0114</a>","chicago":"Afifurrahman, Muhammad, Vivian Zieve Kuperberg, Alina Ostafe, and Igor E. Shparlinski. “Statistics of Ranks, Determinants and Characteristic Polynomials of Rational Matrices.” <i>Forum Mathematicum</i>. De Gruyter, 2024. <a href=\"https://doi.org/10.1515/forum-2024-0114\">https://doi.org/10.1515/forum-2024-0114</a>."},"mathsc":["11C20","15B36","15B52"],"volume":37},{"abstract":[{"text":"We study the distribution of consecutive sums of two squares\r\nin arithmetic progressions. If {En}n∈N is the sequence of\r\nsums of two squares in increasing order, we show that for\r\nany modulus q and any congruence classes a1, a2, a3 mod q\r\nwhich are admissible in the sense that there are solutions\r\nto x2 + y2 ≡ ai mod q, there exist infinitely many n with\r\nEn+i−1 ≡ ai mod q, for i =1, 2, 3. We also show that for\r\nany r1, r2 ≥ 1, there exist infinitely many n with En+i−1 ≡\r\na1 mod q for 1 ≤ i ≤ r1 and En+i−1 ≡ a2 mod q for\r\nr1 +1 ≤ i ≤ r1 + r2","lang":"eng"}],"year":"2024","date_updated":"2026-07-14T11:10:45Z","publication":"Journal of Number Theory","article_type":"original","language":[{"iso":"eng"}],"extern":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.12855"}],"arxiv":1,"oa_version":"Preprint","status":"public","publication_identifier":{"issn":["0022-314X"]},"scopus_import":"1","volume":264,"citation":{"ieee":"N. Kimmel and V. Z. Kuperberg, “Consecutive runs of sums of two squares,” <i>Journal of Number Theory</i>, vol. 264. Elsevier, pp. 135–147, 2024.","apa":"Kimmel, N., &#38; Kuperberg, V. Z. (2024). Consecutive runs of sums of two squares. <i>Journal of Number Theory</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">https://doi.org/10.1016/j.jnt.2024.05.003</a>","short":"N. Kimmel, V.Z. Kuperberg, Journal of Number Theory 264 (2024) 135–147.","ista":"Kimmel N, Kuperberg VZ. 2024. Consecutive runs of sums of two squares. Journal of Number Theory. 264, 135–147.","chicago":"Kimmel, Noam, and Vivian Zieve Kuperberg. “Consecutive Runs of Sums of Two Squares.” <i>Journal of Number Theory</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">https://doi.org/10.1016/j.jnt.2024.05.003</a>.","ama":"Kimmel N, Kuperberg VZ. Consecutive runs of sums of two squares. <i>Journal of Number Theory</i>. 2024;264:135-147. doi:<a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">10.1016/j.jnt.2024.05.003</a>","mla":"Kimmel, Noam, and Vivian Zieve Kuperberg. “Consecutive Runs of Sums of Two Squares.” <i>Journal of Number Theory</i>, vol. 264, Elsevier, 2024, pp. 135–47, doi:<a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">10.1016/j.jnt.2024.05.003</a>."},"intvolume":"       264","author":[{"full_name":"Kimmel, Noam","first_name":"Noam","last_name":"Kimmel"},{"first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697","last_name":"Kuperberg","full_name":"Kuperberg, Vivian Zieve"}],"OA_type":"green","quality_controlled":"1","date_published":"2024-11-01T00:00:00Z","external_id":{"arxiv":["2306.12855"]},"date_created":"2026-06-29T12:58:28Z","article_processing_charge":"No","page":"135-147","_id":"22197","type":"journal_article","doi":"10.1016/j.jnt.2024.05.003","publisher":"Elsevier","publication_status":"published","title":"Consecutive runs of sums of two squares"},{"publisher":"IOP Publishing","doi":"10.1088/1361-6633/ad627b","type":"journal_article","publication_status":"published","issue":"9","title":"Liquid crystals from curved colloidal rods: Waves, twists and more","author":[{"last_name":"Fernández-Rico","first_name":"Carla","id":"492def71-6250-11f0-b278-d41dbd241b62","full_name":"Fernández-Rico, Carla"},{"full_name":"Dullens, Roel P A","last_name":"Dullens","first_name":"Roel P A"}],"intvolume":"        87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"pmid":["38996410"]},"date_published":"2024-08-12T00:00:00Z","quality_controlled":"1","OA_type":"hybrid","article_processing_charge":"No","date_created":"2026-06-30T06:31:09Z","_id":"22209","has_accepted_license":"1","oa":1,"oa_version":"Published Version","OA_place":"publisher","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1361-6633/ad627b"}],"publication_identifier":{"issn":["0034-4885"],"eissn":["1361-6633"]},"scopus_import":"1","article_number":"094601","status":"public","ddc":["540"],"pmid":1,"citation":{"chicago":"Fernández-Rico, Carla, and Roel P A Dullens. “Liquid Crystals from Curved Colloidal Rods: Waves, Twists and More.” <i>Reports on Progress in Physics</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.1088/1361-6633/ad627b\">https://doi.org/10.1088/1361-6633/ad627b</a>.","ama":"Fernández-Rico C, Dullens RPA. Liquid crystals from curved colloidal rods: Waves, twists and more. <i>Reports on Progress in Physics</i>. 2024;87(9). doi:<a href=\"https://doi.org/10.1088/1361-6633/ad627b\">10.1088/1361-6633/ad627b</a>","mla":"Fernández-Rico, Carla, and Roel P. A. Dullens. “Liquid Crystals from Curved Colloidal Rods: Waves, Twists and More.” <i>Reports on Progress in Physics</i>, vol. 87, no. 9, 094601, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.1088/1361-6633/ad627b\">10.1088/1361-6633/ad627b</a>.","short":"C. Fernández-Rico, R.P.A. Dullens, Reports on Progress in Physics 87 (2024).","ieee":"C. Fernández-Rico and R. P. A. Dullens, “Liquid crystals from curved colloidal rods: Waves, twists and more,” <i>Reports on Progress in Physics</i>, vol. 87, no. 9. IOP Publishing, 2024.","apa":"Fernández-Rico, C., &#38; Dullens, R. P. A. (2024). Liquid crystals from curved colloidal rods: Waves, twists and more. <i>Reports on Progress in Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1361-6633/ad627b\">https://doi.org/10.1088/1361-6633/ad627b</a>","ista":"Fernández-Rico C, Dullens RPA. 2024. Liquid crystals from curved colloidal rods: Waves, twists and more. Reports on Progress in Physics. 87(9), 094601."},"volume":87,"year":"2024","abstract":[{"lang":"eng","text":"The curvature of elongated microscopic building blocks plays a crucial role on their self-assembly into orientationally ordered phases. While rod-like molecules form a handful of liquid crystal (LC) phases, curved or banana-shaped molecules show more than fifty phases, with fascinating physical properties, such as chirality or polarity. Despite the fundamental and technological importance of these so-called ‘banana-shaped liquid crystals’, little is known about their microscopic details at the single-molecule level. Curved colloidal liquid crystals—liquid crystals formed by curved colloidal rods—are excellent model systems to optically resolve the structure and dynamics of curved building blocks within these condensed phases. Recent advances in the synthesis of curved rod-like particles have unlocked the potential for studying—at the single-particle level—the intimate relationship between shape and phase symmetry, and even confirmed the stability of elusive LC phases. Further developments in this nascent field promise exciting findings, such as the first observation of the colloidal twist-bend nematic phase or the fabrication of functional materials with curvature-dependent properties. In this Report on Progress, we will highlight recent advances in the synthesis and assembly of curved colloidal liquid crystals and discuss the upcoming challenges and opportunities of this field."}],"publication":"Reports on Progress in Physics","date_updated":"2026-07-15T06:27:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"12","language":[{"iso":"eng"}],"extern":"1","article_type":"review","PlanS_conform":"1","month":"08"},{"publisher":"Springer Nature","doi":"10.1038/s41563-023-01703-0","type":"journal_article","publication_status":"published","title":"Elastic microphase separation produces robust bicontinuous materials","author":[{"full_name":"Fernández-Rico, Carla","first_name":"Carla","id":"492def71-6250-11f0-b278-d41dbd241b62","last_name":"Fernández-Rico"},{"full_name":"Schreiber, Sanjay","last_name":"Schreiber","first_name":"Sanjay"},{"full_name":"Oudich, Hamza","last_name":"Oudich","first_name":"Hamza"},{"full_name":"Lorenz, Charlotta","first_name":"Charlotta","last_name":"Lorenz"},{"full_name":"Sicher, Alba","last_name":"Sicher","first_name":"Alba"},{"full_name":"Sai, Tianqi","first_name":"Tianqi","last_name":"Sai"},{"first_name":"Viola","last_name":"Bauernfeind","full_name":"Bauernfeind, Viola"},{"first_name":"Stefanie","last_name":"Heyden","full_name":"Heyden, Stefanie"},{"last_name":"Carrara","first_name":"Pietro","full_name":"Carrara, Pietro"},{"first_name":"Laura De","last_name":"Lorenzis","full_name":"Lorenzis, Laura De"},{"last_name":"Style","first_name":"Robert W.","full_name":"Style, Robert W."},{"full_name":"Dufresne, Eric R.","first_name":"Eric R.","last_name":"Dufresne"}],"intvolume":"        23","external_id":{"arxiv":["2304.11419"]},"date_published":"2024-01-01T00:00:00Z","quality_controlled":"1","OA_type":"green","page":"124-130","article_processing_charge":"No","date_created":"2026-06-30T06:36:39Z","_id":"22219","oa":1,"oa_version":"Preprint","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.11419"}],"OA_place":"repository","scopus_import":"1","publication_identifier":{"issn":["1476-1122"],"eissn":["1476-4660"]},"status":"public","citation":{"ista":"Fernández-Rico C, Schreiber S, Oudich H, Lorenz C, Sicher A, Sai T, Bauernfeind V, Heyden S, Carrara P, Lorenzis LD, Style RW, Dufresne ER. 2024. Elastic microphase separation produces robust bicontinuous materials. Nature Materials. 23, 124–130.","short":"C. Fernández-Rico, S. Schreiber, H. Oudich, C. Lorenz, A. Sicher, T. Sai, V. Bauernfeind, S. Heyden, P. Carrara, L.D. Lorenzis, R.W. Style, E.R. Dufresne, Nature Materials 23 (2024) 124–130.","apa":"Fernández-Rico, C., Schreiber, S., Oudich, H., Lorenz, C., Sicher, A., Sai, T., … Dufresne, E. R. (2024). Elastic microphase separation produces robust bicontinuous materials. <i>Nature Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41563-023-01703-0\">https://doi.org/10.1038/s41563-023-01703-0</a>","ieee":"C. Fernández-Rico <i>et al.</i>, “Elastic microphase separation produces robust bicontinuous materials,” <i>Nature Materials</i>, vol. 23. Springer Nature, pp. 124–130, 2024.","mla":"Fernández-Rico, Carla, et al. “Elastic Microphase Separation Produces Robust Bicontinuous Materials.” <i>Nature Materials</i>, vol. 23, Springer Nature, 2024, pp. 124–30, doi:<a href=\"https://doi.org/10.1038/s41563-023-01703-0\">10.1038/s41563-023-01703-0</a>.","ama":"Fernández-Rico C, Schreiber S, Oudich H, et al. Elastic microphase separation produces robust bicontinuous materials. <i>Nature Materials</i>. 2024;23:124-130. doi:<a href=\"https://doi.org/10.1038/s41563-023-01703-0\">10.1038/s41563-023-01703-0</a>","chicago":"Fernández-Rico, Carla, Sanjay Schreiber, Hamza Oudich, Charlotta Lorenz, Alba Sicher, Tianqi Sai, Viola Bauernfeind, et al. “Elastic Microphase Separation Produces Robust Bicontinuous Materials.” <i>Nature Materials</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41563-023-01703-0\">https://doi.org/10.1038/s41563-023-01703-0</a>."},"volume":23,"year":"2024","abstract":[{"text":"Bicontinuous microstructures are essential to the function of diverse natural and synthetic systems. Their synthesis has been based on two approaches: arrested phase separation or self-assembly of block copolymers. The former is attractive for its chemical simplicity and the latter, for its thermodynamic robustness. Here we introduce elastic microphase separation (EMPS) as an alternative approach to make bicontinuous microstructures. Conceptually, EMPS balances the molecular-scale forces that drive demixing with large-scale elasticity to encode a thermodynamic length scale. This process features a continuous phase transition, reversible without hysteresis. Practically, EMPS is triggered by simply supersaturating an elastomeric matrix with a liquid, resulting in uniform bicontinuous materials with a well-defined microscopic length scale tuned by the matrix stiffness. The versatility of EMPS is further demonstrated by fabricating bicontinuous materials with superior mechanical properties and controlled anisotropy and microstructural gradients. Overall, EMPS presents a robust alternative for the bulk fabrication of homogeneous bicontinuous materials.","lang":"eng"}],"publication":"Nature Materials","date_updated":"2026-07-15T08:23:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","language":[{"iso":"eng"}],"extern":"1","article_type":"original","month":"01"},{"month":"06","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2024-07-22T12:07:56Z","day":"12","language":[{"iso":"eng"}],"article_type":"original","publication":"Advanced Energy Materials","date_updated":"2026-07-17T07:09:41Z","isi":1,"year":"2024","abstract":[{"text":"Thermoelectric materials convert heat into electricity, with a broad range of applications near room temperature (RT). However, the library of RT high-performance materials is limited. Traditional high-temperature synthetic methods constrain the range of materials achievable, hindering the ability to surpass crystal structure limitations and engineer defects. Here, a solution-based synthetic approach is introduced, enabling RT synthesis of powders and exploration of densification at lower temperatures to influence the material's microstructure. The approach is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated that the concentration of Ag interstitials, grain boundaries, and dislocations are directly correlated to the sintering temperature, and achieve a figure of merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and resolve Ag2Se's challenges are provided, including stoichiometry issues leading to irreproducible performances. This work highlights the potential of RT solution synthesis in expanding the repertoire of high-performance thermoelectric materials for practical applications.","lang":"eng"}],"citation":{"ista":"Kleinhanns T, Milillo F, Calcabrini M, Fiedler C, Horta S, Balazs D, Strumolo MJ, Hasler R, Llorca J, Tkadletz M, Brutchey RL, Ibáñez M. 2024. A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. Advanced Energy Materials. 14(22), 2400408.","short":"T. Kleinhanns, F. Milillo, M. Calcabrini, C. Fiedler, S. Horta, D. Balazs, M.J. Strumolo, R. Hasler, J. Llorca, M. Tkadletz, R.L. Brutchey, M. Ibáñez, Advanced Energy Materials 14 (2024).","ieee":"T. Kleinhanns <i>et al.</i>, “A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se,” <i>Advanced Energy Materials</i>, vol. 14, no. 22. Wiley, 2024.","apa":"Kleinhanns, T., Milillo, F., Calcabrini, M., Fiedler, C., Horta, S., Balazs, D., … Ibáñez, M. (2024). A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. <i>Advanced Energy Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/aenm.202400408\">https://doi.org/10.1002/aenm.202400408</a>","ama":"Kleinhanns T, Milillo F, Calcabrini M, et al. A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. <i>Advanced Energy Materials</i>. 2024;14(22). doi:<a href=\"https://doi.org/10.1002/aenm.202400408\">10.1002/aenm.202400408</a>","mla":"Kleinhanns, Tobias, et al. “A Route to High Thermoelectric Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.” <i>Advanced Energy Materials</i>, vol. 14, no. 22, 2400408, Wiley, 2024, doi:<a href=\"https://doi.org/10.1002/aenm.202400408\">10.1002/aenm.202400408</a>.","chicago":"Kleinhanns, Tobias, Francesco Milillo, Mariano Calcabrini, Christine Fiedler, Sharona Horta, Daniel Balazs, Marissa J. Strumolo, et al. “A Route to High Thermoelectric Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.” <i>Advanced Energy Materials</i>. Wiley, 2024. <a href=\"https://doi.org/10.1002/aenm.202400408\">https://doi.org/10.1002/aenm.202400408</a>."},"volume":14,"ddc":["530"],"publication_identifier":{"issn":["1614-6832"],"eissn":["1614-6840"]},"scopus_import":"1","article_number":"2400408","status":"public","oa":1,"has_accepted_license":"1","oa_version":"Published Version","_id":"15182","acknowledgement":"This work was supported by the Scientific Service Units (SSU) of ISTA through resources provided by the Electron Microscopy Facility (EMF), the Lab Support Facility (LSF), and the Nanofabrication Facility (NNF). This work was financially supported by ISTA and the Werner Siemens Foundation. The USTEM Service Unit of the Technical University of Vienna is acknowledged for EBSD sample preparation and analysis. R.L.B. acknowledges the National Science Foundation for funding the mass spectrometry analysis under award DMR 1904719. J.L. is a Serra Húnter Fellow and is grateful to the ICREA Academia program and projects MICINN/FEDER PID2021-124572OB-C31 and GC 2021 SGR 01061.","article_processing_charge":"Yes (via OA deal)","corr_author":"1","related_material":{"record":[{"id":"22017","status":"public","relation":"dissertation_contains"}]},"date_created":"2024-03-25T08:57:40Z","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"external_id":{"isi":["001184300200001"]},"date_published":"2024-06-12T00:00:00Z","quality_controlled":"1","author":[{"last_name":"Kleinhanns","orcid":"0000-0003-1537-7436","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","first_name":"Tobias","full_name":"Kleinhanns, Tobias"},{"full_name":"Milillo, Francesco","first_name":"Francesco","id":"38b830db-ea88-11ee-bf9b-929beaf79054","last_name":"Milillo"},{"full_name":"Calcabrini, Mariano","first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4566-5877","last_name":"Calcabrini"},{"full_name":"Fiedler, Christine","first_name":"Christine","id":"bd3fceba-dc74-11ea-a0a7-c17f71817366","last_name":"Fiedler"},{"full_name":"Horta, Sharona","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","last_name":"Horta"},{"full_name":"Balazs, Daniel","first_name":"Daniel","orcid":"0000-0001-7597-043X","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","last_name":"Balazs"},{"full_name":"Strumolo, Marissa J.","last_name":"Strumolo","first_name":"Marissa J."},{"full_name":"Hasler, Roger","last_name":"Hasler","first_name":"Roger"},{"full_name":"Llorca, Jordi","first_name":"Jordi","last_name":"Llorca"},{"last_name":"Tkadletz","first_name":"Michael","full_name":"Tkadletz, Michael"},{"full_name":"Brutchey, Richard L.","first_name":"Richard L.","last_name":"Brutchey"},{"last_name":"Ibáñez","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"}],"intvolume":"        14","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"title":"A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se","file":[{"file_id":"17314","file_size":8824301,"creator":"dernst","access_level":"open_access","date_created":"2024-07-22T12:07:56Z","file_name":"2024_AdvancedEnergyMaterials_Kleinhanns.pdf","content_type":"application/pdf","date_updated":"2024-07-22T12:07:56Z","relation":"main_file","checksum":"86b26430e00d5f43ea19e9b610692ab7","success":1}],"issue":"22","department":[{"_id":"MaIb"},{"_id":"LifeSc"}],"publication_status":"published","publisher":"Wiley","type":"journal_article","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"doi":"10.1002/aenm.202400408","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"},{"quality_controlled":"1","OA_type":"gold","external_id":{"arxiv":["2304.10930"]},"date_published":"2024-08-26T00:00:00Z","author":[{"first_name":"Ivailo","last_name":"Hartarsky","full_name":"Hartarsky, Ivailo"},{"id":"9aa8388e-d003-11ee-8458-c4c1d7447977","first_name":"Lyuben","last_name":"Lichev","full_name":"Lichev, Lyuben"},{"first_name":"Fabio Lucio","last_name":"Toninelli","full_name":"Toninelli, Fabio Lucio"}],"_id":"18951","article_processing_charge":"Yes","date_created":"2025-01-29T10:57:09Z","publication_status":"epub_ahead","department":[{"_id":"MaKw"}],"publisher":"EMS Press","type":"journal_article","doi":"10.4171/aihpd/200","title":"Local dimer dynamics in higher dimensions","das_tickbox":"1","date_updated":"2026-07-23T05:41:50Z","publication":"Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions","abstract":[{"text":"We consider local dynamics of the dimer model (perfect matchings) on hypercubic boxes [n] \r\nd . These consist of successively switching the dimers along alternating cycles of prescribed (small) lengths. We study the connectivity properties of the dimer configuration space equipped with these transitions. Answering a question of Freire, Klivans, Milet, and Saldanha, we show that in three dimensions any configuration admits an alternating cycle of length at most 6. We further establish that any configuration on [n] d  features order n d−2  alternating cycles of length at most 4d−2. We also prove that the dynamics of dimer configurations on the unit hypercube of dimension d is ergodic when switching alternating cycles of length at most 4d−4. Finally, in the planar but non-bipartite case, we show that parallelogram-shaped boxes in the triangular lattice are ergodic for switching alternating cycles of lengths 4 and 6 only, thus improving a result of Kenyon and Rémila, which also uses 8-cycles. None of our proofs make reference to height functions.","lang":"eng"}],"year":"2024","month":"08","language":[{"iso":"eng"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"26","status":"public","scopus_import":"1","publication_identifier":{"eissn":["2308-5835"],"issn":["2308-5827"]},"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.10930"}],"OA_place":"repository","oa_version":"Preprint","oa":1,"mathsc":["05B50","05C70","82C20"],"citation":{"chicago":"Hartarsky, Ivailo, Lyuben Lichev, and Fabio Lucio Toninelli. “Local Dimer Dynamics in Higher Dimensions.” <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions</i>. EMS Press, 2024. <a href=\"https://doi.org/10.4171/aihpd/200\">https://doi.org/10.4171/aihpd/200</a>.","ama":"Hartarsky I, Lichev L, Toninelli FL. Local dimer dynamics in higher dimensions. <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions</i>. 2024. doi:<a href=\"https://doi.org/10.4171/aihpd/200\">10.4171/aihpd/200</a>","mla":"Hartarsky, Ivailo, et al. “Local Dimer Dynamics in Higher Dimensions.” <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions</i>, EMS Press, 2024, doi:<a href=\"https://doi.org/10.4171/aihpd/200\">10.4171/aihpd/200</a>.","short":"I. Hartarsky, L. Lichev, F.L. Toninelli, Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions (2024).","ieee":"I. Hartarsky, L. Lichev, and F. L. Toninelli, “Local dimer dynamics in higher dimensions,” <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions</i>. EMS Press, 2024.","apa":"Hartarsky, I., Lichev, L., &#38; Toninelli, F. L. (2024). Local dimer dynamics in higher dimensions. <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions</i>. EMS Press. <a href=\"https://doi.org/10.4171/aihpd/200\">https://doi.org/10.4171/aihpd/200</a>","ista":"Hartarsky I, Lichev L, Toninelli FL. 2024. Local dimer dynamics in higher dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions."},"DOAJ_listed":"1"},{"acknowledgement":"Aronov, Boris: Work has been supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work.","_id":"18917","article_processing_charge":"Yes","corr_author":"1","date_created":"2025-01-27T14:19:17Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"19860"}]},"page":"8:1-8:15","quality_controlled":"1","OA_type":"gold","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"arxiv":["2403.02627"]},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2024-06-11","location":"Athens, Greece","end_date":"2024-06-14"},"date_published":"2024-06-06T00:00:00Z","author":[{"full_name":"Aronov, Boris","last_name":"Aronov","first_name":"Boris"},{"full_name":"Basit, Abdul","first_name":"Abdul","last_name":"Basit"},{"last_name":"Ramesh","first_name":"Indu","full_name":"Ramesh, Indu"},{"full_name":"Tasinato, Gianluca","last_name":"Tasinato","id":"0433290C-AF8F-11E9-A4C7-F729E6697425","first_name":"Gianluca"},{"full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       293","title":"Eight-partitioning points in 3D, and efficiently too","file":[{"success":1,"checksum":"443aa29ea5d948e917cfccd681dcf176","relation":"main_file","date_updated":"2025-01-27T14:17:37Z","content_type":"application/pdf","file_name":"2024_LIPICs_Aronov.pdf","date_created":"2025-01-27T14:17:37Z","access_level":"open_access","file_size":880725,"creator":"dernst","file_id":"18918"}],"publication_status":"published","department":[{"_id":"UlWa"},{"_id":"GradSch"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","doi":"10.4230/LIPIcs.SoCG.2024.8","month":"06","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"06","file_date_updated":"2025-01-27T14:17:37Z","date_updated":"2026-07-23T11:14:45Z","publication":"40th International Symposium on Computational Geometry","abstract":[{"lang":"eng","text":"An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.\r\nWe prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.\r\nMoreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2})."}],"year":"2024","volume":293,"citation":{"ieee":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.","apa":"Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15.","ista":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.","chicago":"Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In <i>40th International Symposium on Computational Geometry</i>, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>.","mla":"Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>.","ama":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>"},"ddc":["510"],"status":"public","scopus_import":"1","publication_identifier":{"isbn":["9783959773164"]},"arxiv":1,"OA_place":"publisher","has_accepted_license":"1","oa":1,"oa_version":"Published Version"},{"corr_author":"1","article_processing_charge":"Yes","related_material":{"record":[{"id":"22281","status":"public","relation":"dissertation_contains"}]},"date_created":"2024-11-17T23:01:47Z","acknowledgement":"Antoine El-Hayek: This project has received funding from the Austrian Science Fund\r\n(FWF) grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung,\r\n2020–2024.\r\nMonika Henzinger: This project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI\r\n10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE\r\nStiftung, 2020–2024.\r\nStefan Schmid: This project has received funding from the German Research Foundation (DFG),\r\nSPP 2378 (project ReNO), 2023-2027.","_id":"18557","author":[{"full_name":"El-Hayek, Antoine","last_name":"El-Hayek","orcid":"0000-0003-4268-7368","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"intvolume":"       319","quality_controlled":"1","OA_type":"gold","external_id":{"arxiv":["2302.11988"],"isi":["001542467600021"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"conference":{"end_date":"2024-11-01","start_date":"2024-10-28","location":"Madrid, Spain","name":"DISC: Symposium on Distributed Computing"},"date_published":"2024-10-24T00:00:00Z","file":[{"date_updated":"2024-11-18T08:02:45Z","checksum":"d6c8277331cafa188c33ba1717206cf4","relation":"main_file","success":1,"file_id":"18561","access_level":"open_access","creator":"dernst","file_size":809666,"date_created":"2024-11-18T08:02:45Z","content_type":"application/pdf","file_name":"2024_LIPIcs_ElHayek.pdf"}],"title":"Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges","project":[{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"},{"name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.DISC.2024.21","type":"conference","publication_status":"published","department":[{"_id":"MoHe"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"file_date_updated":"2024-11-18T08:02:45Z","day":"24","month":"10","abstract":[{"lang":"eng","text":"Broadcast and Consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures. Over the last years, researchers have derived several impossibility results and high time complexity lower bounds for these tasks. Specifically for the setting where in each round of communication the adversary is allowed to choose one rooted tree along which the information is disseminated, there is a lower as well as an upper bound that is linear in the number n of nodes for Broadcast and for n ≥ 3 the adversary can guarantee that Consensus never happens. This setting is called the oblivious message adversary for rooted trees. Also note that if the adversary is allowed to choose a graph that does not contain a rooted tree, then it can guarantee that Broadcast and Consensus will never happen. However, such deterministic adversarial models may be overly pessimistic, as many processes in real-world settings are stochastic in nature rather than worst-case. This paper studies Broadcast on stochastic dynamic networks and shows that the situation is very different to the deterministic case. In particular, we show that if information dissemination occurs along random rooted trees and directed Erdős–Rényi graphs, Broadcast completes in O(log n) rounds of communication with high probability. The fundamental insight in our analysis is that key variables are mutually independent. We then study two adversarial models, (a) one with Byzantine nodes and (b) one where an adversary controls the edges. (a) Our techniques without Byzantine nodes are general enough so that they can be extended to Byzantine nodes. (b) In the spirit of smoothed analysis, we introduce the notion of randomized oblivious message adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi graph) is chosen uniformly at random among the set of all such graphs that include these edges. We show that Broadcast completes in a finite number of rounds, which is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All Broadcast, and Consensus, and give lower bounds that show that most of our upper bounds are tight."}],"isi":1,"year":"2024","date_updated":"2026-07-24T12:48:28Z","publication":"38th International Symposium on Distributed Computing","ddc":["000"],"volume":319,"ec_funded":1,"citation":{"short":"A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"A. El-Hayek, M. Henzinger, and S. Schmid, “Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges,” in <i>38th International Symposium on Distributed Computing</i>, Madrid, Spain, 2024, vol. 319.","apa":"El-Hayek, A., Henzinger, M., &#38; Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In <i>38th International Symposium on Distributed Computing</i> (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>","ista":"El-Hayek A, Henzinger M, Schmid S. 2024. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. 38th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 319, 21.","chicago":"El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In <i>38th International Symposium on Distributed Computing</i>, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>.","ama":"El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In: <i>38th International Symposium on Distributed Computing</i>. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>","mla":"El-Hayek, Antoine, et al. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” <i>38th International Symposium on Distributed Computing</i>, vol. 319, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>."},"arxiv":1,"OA_place":"publisher","has_accepted_license":"1","oa":1,"oa_version":"Published Version","article_number":"21","status":"public","scopus_import":"1","publication_identifier":{"isbn":["9783959773522"],"issn":["1868-8969"]}},{"ddc":["510"],"volume":293,"ec_funded":1,"citation":{"short":"H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","apa":"Edelsbrunner, H., &#38; Pach, J. (2024). Maximum Betti numbers of Čech complexes. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>","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.","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>.","ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>."},"arxiv":1,"has_accepted_license":"1","oa":1,"oa_version":"Published Version","article_number":"53","status":"public","scopus_import":"1","publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-06-17T08:46:33Z","day":"01","month":"06","abstract":[{"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.","lang":"eng"}],"year":"2024","date_updated":"2026-07-27T08:15:58Z","publication":"40th International Symposium on Computational Geometry","file":[{"file_id":"17152","access_level":"open_access","file_size":766562,"creator":"dernst","date_created":"2024-06-17T08:46:33Z","content_type":"application/pdf","file_name":"2024_LIPICS_Edelsbrunner.pdf","date_updated":"2024-06-17T08:46:33Z","checksum":"5442d44fb89d77477a87668d6e61aac9","relation":"main_file","success":1}],"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"}],"title":"Maximum Betti numbers of Čech complexes","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","doi":"10.4230/LIPIcs.SoCG.2024.53","publication_status":"published","department":[{"_id":"HeEd"}],"article_processing_charge":"No","related_material":{"record":[{"id":"20657","status":"public","relation":"later_version"}]},"date_created":"2024-06-16T22:01:06Z","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.","_id":"17146","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach","full_name":"Pach, János"}],"intvolume":"       293","quality_controlled":"1","external_id":{"arxiv":["2310.14801"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"conference":{"location":"Athens, Greece","end_date":"2024-06-14","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"date_published":"2024-06-01T00:00:00Z"},{"_id":"17426","acknowledgement":"This work was partially supported by project SERICS (PE00000014) under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU.\r\n","page":"24574-24583","related_material":{"link":[{"relation":"software","url":"https://github.com/berndprach/1LipschitzLayersCompared"}],"record":[{"id":"19759","relation":"dissertation_contains","status":"public"}]},"date_created":"2024-08-14T08:42:32Z","article_processing_charge":"No","corr_author":"1","date_published":"2024-06-01T00:00:00Z","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","location":"Seattle, WA, United States","end_date":"2024-06-22","start_date":"2024-06-16"},"external_id":{"arxiv":["2311.16833"],"isi":["001344387500055"]},"OA_type":"green","quality_controlled":"1","author":[{"full_name":"Prach, Bernd","last_name":"Prach","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd"},{"last_name":"Brau","first_name":"Fabio","full_name":"Brau, Fabio"},{"full_name":"Buttazzo, Giorgio","last_name":"Buttazzo","first_name":"Giorgio"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"publication_status":"published","type":"conference","doi":"10.1109/CVPR52733.2024.02320","publisher":"Computer Vision Foundation","month":"06","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","date_updated":"2026-07-27T12:47:43Z","year":"2024","isi":1,"abstract":[{"lang":"eng","text":"The robustness of neural networks against input perturbations with bounded\r\nmagnitude represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical systems. Recently, the scientific community has\r\nfocused on enhancing certifiable robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods have been proposed in the literature to achieve this\r\ngoal, understanding the performance of such methods is not straightforward,\r\nsince different metrics can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness) for different applications. For this reason,\r\nthis work provides a thorough theoretical and empirical comparison between\r\nmethods by evaluating them in terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also provides some guidelines and recommendations to\r\nsupport the user in selecting the methods that work best depending on the\r\navailable resources. We provide code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared."}],"citation":{"chicago":"Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 24574–83. Computer Vision Foundation, 2024. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>.","ama":"Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In: <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. Computer Vision Foundation; 2024:24574-24583. doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>","mla":"Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Computer Vision Foundation, 2024, pp. 24574–83, doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>.","ieee":"B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared: Memory, speed, and certifiable robustness,” in <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Seattle, WA, United States, 2024, pp. 24574–24583.","apa":"Prach, B., Brau, F., Buttazzo, G., &#38; Lampert, C. (2024). 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 24574–24583). Seattle, WA, United States: Computer Vision Foundation. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>","short":"B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–24583.","ista":"Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24574–24583."},"status":"public","has_accepted_license":"1","oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.16833","open_access":"1"}],"OA_place":"repository","arxiv":1},{"publication_status":"draft","status":"public","article_number":"2412.04245","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"arxiv":1,"type":"preprint","oa":1,"doi":"10.48550/arXiv.2412.04245","oa_version":"Preprint","citation":{"ama":"Prach B, Lampert C. Intriguing properties of robust classification. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, 2412.04245, doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>.","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>.","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","short":"B. Prach, C. Lampert, ArXiv (n.d.).","apa":"Prach, B., &#38; Lampert, C. (n.d.). Intriguing properties of robust classification. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” <i>arXiv</i>. ."},"title":"Intriguing properties of robust classification","date_updated":"2026-07-27T12:47:43Z","publication":"arXiv","date_published":"2024-12-05T00:00:00Z","external_id":{"arxiv":["2412.04245"]},"author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","last_name":"Prach","full_name":"Prach, Bernd"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","full_name":"Lampert, Christoph"}],"abstract":[{"lang":"eng","text":"Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers."}],"year":"2024","month":"12","_id":"18874","related_material":{"record":[{"relation":"later_version","status":"public","id":"20455"},{"relation":"dissertation_contains","status":"public","id":"19759"}]},"date_created":"2025-01-24T16:57:29Z","article_processing_charge":"No","corr_author":"1","language":[{"iso":"eng"}],"day":"05","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"}]