[{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2504.07268"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"04","scopus_import":"1","article_number":"165145","article_processing_charge":"No","doi":"10.1103/PhysRevB.111.165145","citation":{"ista":"Tenhuisen SFR, Pan GA, Song Q, Baykusheva DR, Ferenc Segedin D, Goodge BH, Paik H, Pelliciari J, Bisogni V, Gu Y, Agrestini S, Nag A, García-Fernández M, Zhou KJ, Kourkoutis LF, Brooks CM, Mundy JA, Dean MPM, Mitrano M. 2025. Magnetic excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper nickelates observed via resonant inelastic x-ray scattering. Physical Review B. 111(16), 165145.","ieee":"S. F. R. Tenhuisen et al., “Magnetic excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper nickelates observed via resonant inelastic x-ray scattering,” Physical Review B, vol. 111, no. 16. American Physical Society, 2025.","ama":"Tenhuisen SFR, Pan GA, Song Q, et al. Magnetic excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper nickelates observed via resonant inelastic x-ray scattering. Physical Review B. 2025;111(16). doi:10.1103/PhysRevB.111.165145","short":"S.F.R. Tenhuisen, G.A. Pan, Q. Song, D.R. Baykusheva, D. Ferenc Segedin, B.H. Goodge, H. Paik, J. Pelliciari, V. Bisogni, Y. Gu, S. Agrestini, A. Nag, M. García-Fernández, K.J. Zhou, L.F. Kourkoutis, C.M. Brooks, J.A. Mundy, M.P.M. Dean, M. Mitrano, Physical Review B 111 (2025).","chicago":"Tenhuisen, Sophia F.R., Grace A. Pan, Qi Song, Denitsa Rangelova Baykusheva, Dan Ferenc Segedin, Berit H. Goodge, Hanjong Paik, et al. “Magnetic Excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper Nickelates Observed via Resonant Inelastic x-Ray Scattering.” Physical Review B. American Physical Society, 2025. https://doi.org/10.1103/PhysRevB.111.165145.","apa":"Tenhuisen, S. F. R., Pan, G. A., Song, Q., Baykusheva, D. R., Ferenc Segedin, D., Goodge, B. H., … Mitrano, M. (2025). Magnetic excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper nickelates observed via resonant inelastic x-ray scattering. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.111.165145","mla":"Tenhuisen, Sophia F. R., et al. “Magnetic Excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper Nickelates Observed via Resonant Inelastic x-Ray Scattering.” Physical Review B, vol. 111, no. 16, 165145, American Physical Society, 2025, doi:10.1103/PhysRevB.111.165145."},"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"abstract":[{"lang":"eng","text":"Magnetic interactions are thought to play a key role in the properties of many unconventional superconductors, including cuprates, iron pnictides, and square-planar nickelates. Superconductivity was also recently observed in the bilayer and trilayer Ruddlesden-Popper nickelates, the electronic structure of which is expected to differ from that of cuprates and square-planar nickelates. Here we study how electronic structure and magnetic interactions evolve with the number of layers, 𝑛, in thin film Ruddlesden-Popper nickelates Nd𝑛+1⁢Ni𝑛⁢O3⁢𝑛+1 with 𝑛=1,3, and 5 using resonant inelastic x-ray scattering (RIXS). The RIXS spectra are consistent with a high-spin |3⁢𝑑8⁢ 𝐿̲⟩ electronic configuration, resembling that of La2−𝑥⁢Sr𝑥⁢NiO4 and the parent perovskite, NdNiO3. The magnetic excitations soften to lower energy in the structurally self-doped, higher-𝑛 films. Our observations confirm that structural tuning is an effective route for altering electronic properties, such as magnetic superexchange, in this prominent family of materials."}],"department":[{"_id":"DeBa"}],"publisher":"American Physical Society","_id":"19639","date_updated":"2026-07-22T06:53:20Z","acknowledgement":"Work by S.F.R.T., D.R.B., J.P., V.B., M.P.M.D., and M.M. was supported by the U.S. Department of Energy (DOE), Division of Materials Science, under Contract No. DE-SC0012704. G.A.P. and D.F.S. are primarily supported by the DOE, Office of Basic Energy Sciences, Division of Materials Sciences and Engineering, under Grant No. DE-SC0021925, and by NSF Graduate Research Fellowship Grant No. DGE-1745303. S.F.R.T. acknowledges additional support from the DOE, Office of Science, Office of Workforce Development for Teachers and Scientists, Office of Science Graduate Student Research (SCGSR) program. The SCGSR program is administered by the Oak Ridge Institute for Science and Education for the DOE under Contract No. DE-SC0014664. G.A.P. acknowledges additional support from the Paul and Daisy Soros Fellowship for New Americans. Q.S. was supported by the Science and Technology Center for Integrated Quantum Materials, NSF Grant No. DMR-1231319. B.H.G and L.F.K. acknowledge support by PARADIM, NSF Grant No. DMR-2039380. J.A.M. acknowledges support from the DOE, Office of Basic Energy Sciences, Division of Materials Sciences and Engineering, under Grant No. DE-SC0021925. Materials growth and electron microscopy were supported by PARADIM under NSF Cooperative Agreement Grant No. DMR-2039380. Electron microscopy made use of the Cornell Center for Materials Research Shared Facilities. The Thermo Fisher Spectra 300 X-CFEG was acquired with support from PARADIM, an NSF Materials Innovation Platforms (Grant No. DMR-2039380), and Cornell University. The FEI Titan Themis 300 was acquired through Grant No. NSF-MRI-1429155, with additional support from Cornell University, the Weill Institute, and the Kavli Institute at Cornell University. The Thermo Fisher Helios G4 UX FIB was acquired with support by NSF Grant No. DMR-1539918. This research used beamline 2-ID of the National Synchrotron Light Source II, a DOE Office of Science User Facility operated for the DOE Office of Science by Brookhaven National Laboratory under Contract No. DE-SC0012704. We acknowledge Diamond Light Source for time on Beamline I21 under Proposal No. MM27484.","external_id":{"arxiv":["2504.07268"]},"title":"Magnetic excitations in Ndn+1Nin O3n+1 Ruddlesden-Popper nickelates observed via resonant inelastic x-ray scattering","OA_place":"repository","das_tickbox":"1","author":[{"last_name":"Tenhuisen","first_name":"Sophia F.R.","full_name":"Tenhuisen, Sophia F.R."},{"full_name":"Pan, Grace A.","first_name":"Grace A.","last_name":"Pan"},{"full_name":"Song, Qi","first_name":"Qi","last_name":"Song"},{"id":"71b4d059-2a03-11ee-914d-dfa3beed6530","orcid":"0000-0002-7438-1139","last_name":"Baykusheva","first_name":"Denitsa Rangelova","full_name":"Baykusheva, Denitsa Rangelova"},{"full_name":"Ferenc Segedin, Dan","first_name":"Dan","last_name":"Ferenc Segedin"},{"last_name":"Goodge","first_name":"Berit H.","full_name":"Goodge, Berit H."},{"last_name":"Paik","first_name":"Hanjong","full_name":"Paik, Hanjong"},{"last_name":"Pelliciari","full_name":"Pelliciari, Jonathan","first_name":"Jonathan"},{"first_name":"Valentina","full_name":"Bisogni, Valentina","last_name":"Bisogni"},{"first_name":"Yanhong","full_name":"Gu, Yanhong","last_name":"Gu"},{"last_name":"Agrestini","first_name":"Stefano","full_name":"Agrestini, Stefano"},{"last_name":"Nag","first_name":"Abhishek","full_name":"Nag, Abhishek"},{"full_name":"García-Fernández, Mirian","first_name":"Mirian","last_name":"García-Fernández"},{"full_name":"Zhou, Ke Jin","first_name":"Ke Jin","last_name":"Zhou"},{"last_name":"Kourkoutis","full_name":"Kourkoutis, Lena F.","first_name":"Lena F."},{"full_name":"Brooks, Charles M.","first_name":"Charles M.","last_name":"Brooks"},{"last_name":"Mundy","full_name":"Mundy, Julia A.","first_name":"Julia A."},{"full_name":"Dean, Mark P.M.","first_name":"Mark P.M.","last_name":"Dean"},{"full_name":"Mitrano, Matteo","first_name":"Matteo","last_name":"Mitrano"}],"day":"15","article_type":"original","OA_type":"green","quality_controlled":"1","volume":111,"publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1103/PhysRevB.111.165145","publication":"Physical Review B","intvolume":" 111","status":"public","year":"2025","issue":"16","type":"journal_article","date_created":"2025-05-04T22:02:31Z","oa":1,"date_published":"2025-04-15T00:00:00Z"},{"title":"Solid state diffusion in metal-semiconductors core-shell nanoparticle","date_published":"2025-03-03T00:00:00Z","date_created":"2025-07-21T08:22:29Z","type":"conference_abstract","date_updated":"2026-07-22T06:54:55Z","year":"2025","status":"public","publisher":"Fundació de la comunitat valenciana SCITO","_id":"20054","department":[{"_id":"MaIb"}],"conference":{"end_date":"2025-03-07","name":"MATSUS: Materials for Sustainable Development Conference","start_date":"2025-03-03","location":"Sevilla, Spain"},"corr_author":"1","doi":"10.29363/nanoge.matsusspring.2025.220","citation":{"mla":"Horta, Sharona. “Solid State Diffusion in Metal-Semiconductors Core-Shell Nanoparticle.” Proceedings of the MATSUS Spring 2025 Conference, 220, Fundació de la comunitat valenciana SCITO, 2025, doi:10.29363/nanoge.matsusspring.2025.220.","apa":"Horta, S. (2025). Solid state diffusion in metal-semiconductors core-shell nanoparticle. In Proceedings of the MATSUS Spring 2025 Conference. Sevilla, Spain: Fundació de la comunitat valenciana SCITO. https://doi.org/10.29363/nanoge.matsusspring.2025.220","short":"S. Horta, in:, Proceedings of the MATSUS Spring 2025 Conference, Fundació de la comunitat valenciana SCITO, 2025.","chicago":"Horta, Sharona. “Solid State Diffusion in Metal-Semiconductors Core-Shell Nanoparticle.” In Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO, 2025. https://doi.org/10.29363/nanoge.matsusspring.2025.220.","ama":"Horta S. Solid state diffusion in metal-semiconductors core-shell nanoparticle. In: Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO; 2025. doi:10.29363/nanoge.matsusspring.2025.220","ieee":"S. Horta, “Solid state diffusion in metal-semiconductors core-shell nanoparticle,” in Proceedings of the MATSUS Spring 2025 Conference, Sevilla, Spain, 2025.","ista":"Horta S. 2025. Solid state diffusion in metal-semiconductors core-shell nanoparticle. Proceedings of the MATSUS Spring 2025 Conference. MATSUS: Materials for Sustainable Development Conference, 220."},"publication":"Proceedings of the MATSUS Spring 2025 Conference","article_processing_charge":"No","fulldoi":"https://doi.org/10.29363/nanoge.matsusspring.2025.220","publication_status":"published","article_number":"220","quality_controlled":"1","OA_type":"closed access","day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"03","author":[{"first_name":"Sharona","full_name":"Horta, Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","last_name":"Horta"}],"oa_version":"None"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"03","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.4171/JEMS/1601","open_access":"1"}],"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"department":[{"_id":"TaHa"}],"corr_author":"1","abstract":[{"text":"We establish an isomorphism of complex K-theory of the moduli space M of “SL n​ ”-Higgs bundles of degree d and rank n (in the sense of Hausel–Thaddeus) and twisted complex K-theory of the orbifold M of PGL n​ -Higgs bundles of degree e, where (n,d)=(n,e)=1. Along the way, we prove the vanishing of torsion for H ∗ ( M ) and certain twisted complex K-theory groups of M . We also extend Arinkin’s autoduality of compactified Jacobian to a derived equivalence between SL n​ - and PGL n​ -Hitchin systems over the elliptic locus. In the appendix, we develop a formalism of G-sheaves of spectra, generalising equivariant homotopy theory to a relative setting.","lang":"eng"}],"publication_identifier":{"eissn":["1435-9863"],"issn":["1435-9855"]},"doi":"10.4171/jems/1601","citation":{"apa":"Groechenig, M., & Shen, S. (2025). Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. EMS Press. https://doi.org/10.4171/jems/1601","mla":"Groechenig, Michael, and Shiyu Shen. “Complex K-Theory of Moduli Spaces of Higgs Bundles.” Journal of the European Mathematical Society, EMS Press, 2025, doi:10.4171/jems/1601.","ama":"Groechenig M, Shen S. Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. 2025. doi:10.4171/jems/1601","chicago":"Groechenig, Michael, and Shiyu Shen. “Complex K-Theory of Moduli Spaces of Higgs Bundles.” Journal of the European Mathematical Society. EMS Press, 2025. https://doi.org/10.4171/jems/1601.","short":"M. Groechenig, S. Shen, Journal of the European Mathematical Society (2025).","ista":"Groechenig M, Shen S. 2025. Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society.","ieee":"M. Groechenig and S. Shen, “Complex K-theory of moduli spaces of Higgs bundles,” Journal of the European Mathematical Society. EMS Press, 2025."},"article_processing_charge":"Yes","DOAJ_listed":"1","title":"Complex K-theory of moduli spaces of Higgs bundles","external_id":{"isi":["001608254800001"],"arxiv":["2212.10695"]},"acknowledgement":"It is a pleasure to thank Tom Baird for sharing his insights about vanishing of torsion for H.M{1\r\n2/. Furthermore, we would like to thank him for bringing [25] to our attention. We also thank Alexander Kupers for enlightening conversations about the Atiyah–Hirzebruch spectral sequence and for pointing out a reference. We are grateful to Victoria Hoskins and Simon Pepin-Lehalleur for sharing a preprint of their recent paper on a motivic version of topological mirror symmetry and for useful remarks on Section 6. Anne Larsen pointed out that our previous proof Lemma 4.5 was incomplete, we thank her for bringing this to our attention. We are grateful to the anonymous referee for many valuable comments that have improved the paper tremendously. The report we received was one of the most detailed referee report either of us has ever seen. We thank them for their hard work and the resulting contribution to this paper. Michael Groechenig was supported by an NSERC discovery grant and an Alfred P. Sloan\r\nfellowship. Shiyu Shen has received funding from the European Union’s Horizon 2020 research\r\nand innovation program under the Marie Skłodowska-Curie grant agreement No. 101034413.","ddc":["510"],"date_updated":"2026-07-23T11:16:00Z","publisher":"EMS Press","_id":"20043","day":"20","isi":1,"author":[{"first_name":"Michael","full_name":"Groechenig, Michael","last_name":"Groechenig"},{"orcid":"0000-0002-4444-8718","last_name":"Shen","id":"544cccd3-9005-11ec-87bc-94aef1c5b814","full_name":"Shen, Shiyu","first_name":"Shiyu"}],"das_tickbox":"1","OA_place":"publisher","ec_funded":1,"quality_controlled":"1","OA_type":"gold","article_type":"original","publication":"Journal of the European Mathematical Society","fulldoi":"https://doi.org/10.4171/jems/1601","arxiv":1,"publication_status":"epub_ahead","date_published":"2025-03-20T00:00:00Z","oa":1,"date_created":"2025-07-21T07:54:50Z","type":"journal_article","status":"public","year":"2025","mathsc":["14H60","19L50"]},{"ec_funded":1,"OA_place":"publisher","author":[{"orcid":"0000-0003-4268-7368","id":"888a098e-fcac-11ee-aff7-d347be57b725","last_name":"El-Hayek","full_name":"El-Hayek, Antoine","first_name":"Antoine"},{"last_name":"Elsässer","full_name":"Elsässer, Robert","first_name":"Robert"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"isi":1,"day":"13","OA_type":"hybrid","quality_controlled":"1","file":[{"success":1,"content_type":"application/pdf","file_id":"20115","creator":"dernst","file_size":2200347,"file_name":"2025_PODC_ElHayek.pdf","access_level":"open_access","date_created":"2025-08-04T09:10:55Z","checksum":"52976d226f3f691aa519d71c1c718fa5","relation":"main_file","date_updated":"2025-08-04T09:10:55Z"}],"arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.1145/3732772.3733505","publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"location":"Huatulco, Mexico","name":"PODC: Symposium on Principles of Distributed Computing","end_date":"2025-06-20","start_date":"2025-06-16"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"22281"}]},"status":"public","year":"2025","type":"conference","date_created":"2025-07-21T08:16:15Z","oa":1,"date_published":"2025-06-13T00:00:00Z","oa_version":"Published Version","month":"06","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"article_processing_charge":"Yes (via OA deal)","citation":{"ama":"El-Hayek A, Elsässer R, Schmid S. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2025. doi:10.1145/3732772.3733505","short":"A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025.","chicago":"El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733505.","ista":"El-Hayek A, Elsässer R, Schmid S. 2025. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing.","ieee":"A. El-Hayek, R. Elsässer, and S. Schmid, “An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025.","apa":"El-Hayek, A., Elsässer, R., & Schmid, S. (2025). An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In Proceedings of the ACM Symposium on Principles of Distributed Computing. Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733505","mla":"El-Hayek, Antoine, et al. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, doi:10.1145/3732772.3733505."},"doi":"10.1145/3732772.3733505","file_date_updated":"2025-08-04T09:10:55Z","publication_identifier":{"isbn":[" 9798400718854"]},"abstract":[{"lang":"eng","text":"We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has already been studied intensively in the literature. In this problem, each node in a system of n nodes, has initially one of k different opinions, and they need to agree on the (relative) majority opinion. In particular, we consider the important and intensively studied model of Undecided State Dynamics.\r\nOur main contribution is an almost tight lower bound on the stabilization time: we prove that there exists an initial configuration, even with bias \\Delta = \\omega(\\sqrt{n\\log n}), where stabilization requires \\Omega(kn\\log \\frac {\\sqrt n} {k \\log n}) interactions, or equivalently, \\Omega(k\\log \\frac {\\sqrt n} {k \\log n}) parallel time for any k = o\\left(\\frac {\\sqrt n}{\\log n}\\right). This bound is tight for any k \\le n^{\\frac 1 2 - \\epsilon}, where \\epsilon >0 can be any small constant, as Amir et al.~(PODC'23) gave a O(k\\log n) parallel time upper bound for k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)."}],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"MoHe"}],"publisher":"Association for Computing Machinery","_id":"20051","ddc":["000"],"date_updated":"2026-07-24T12:48:28Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5862,grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with\r\nadditional funding from the netidee SCIENCE Stiftung, 2020–2024\r\nand the German Research Foundation (DFG), grant 470029389\r\n(FlexNets).","external_id":{"arxiv":["2505.02765"],"isi":["001525534800066"]},"title":"An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model"},{"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’sHorizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund(FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","external_id":{"arxiv":["2412.15069"]},"publisher":"Society for Industrial and Applied Mathematics","_id":"19982","date_updated":"2026-07-24T12:48:28Z","title":"Fully dynamic approximate minimum cut in subpolynomial time per operation","citation":{"apa":"El-Hayek, A., Henzinger, M., & Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978322.22","mla":"El-Hayek, Antoine, et al. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–84, doi:10.1137/1.9781611978322.22.","ista":"El-Hayek A, Henzinger M, Li J. 2025. Fully dynamic approximate minimum cut in subpolynomial time per operation. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 750–784.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Fully dynamic approximate minimum cut in subpolynomial time per operation,” in Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2025, pp. 750–784.","ama":"El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2025:750-784. doi:10.1137/1.9781611978322.22","chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 750–84. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.22.","short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784."},"doi":"10.1137/1.9781611978322.22","publication_identifier":{"eisbn":["9781611978322"]},"abstract":[{"lang":"eng","text":"Dynamically maintaining the minimum cut in a graph G under edge insertions and deletion is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an n-node graph the best known (1 + o (1))-approximate algorithm takes update time [14]. If the minimum cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n o (1) update time exists [8].\r\nWe present the first fully dynamic algorithm for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical contribution is to show that it suffices to consider small-volume cuts in suitably contracted graphs."}],"article_processing_charge":"No","department":[{"_id":"MoHe"}],"corr_author":"1","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564"},{"grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.15069","open_access":"1"}],"month":"01","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","related_material":{"record":[{"id":"22281","relation":"dissertation_contains","status":"public"}]},"year":"2025","status":"public","oa":1,"date_published":"2025-01-07T00:00:00Z","date_created":"2025-07-10T13:08:57Z","publication":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1137/1.9781611978322.22","conference":{"end_date":"2025-01-15","name":"SODA: Symposium on Discrete Algorithms","start_date":"2025-01-12","location":"New Orleans, LA, United States"},"quality_controlled":"1","OA_type":"green","page":"750-784","ec_funded":1,"OA_place":"repository","day":"07","author":[{"first_name":"Antoine","full_name":"El-Hayek, Antoine","last_name":"El-Hayek","id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Jason","full_name":"Li, Jason","last_name":"Li"}]},{"author":[{"last_name":"He","full_name":"He, Zhen","first_name":"Zhen"},{"last_name":"Westoby","full_name":"Westoby, Matthew","first_name":"Matthew"},{"id":"2066b6dd-2d54-11ef-8f8c-c94731161817","last_name":"Ren","full_name":"Ren, Shaoting","first_name":"Shaoting"},{"first_name":"Chuanxi","full_name":"Zhao, Chuanxi","last_name":"Zhao"},{"last_name":"He","full_name":"He, Yifei","first_name":"Yifei"},{"last_name":"Zhang","full_name":"Zhang, Tianzhao","first_name":"Tianzhao"},{"full_name":"Yang, Wei","first_name":"Wei","last_name":"Yang"}],"day":"10","OA_place":"publisher","das_tickbox":"1","supplementarymaterial":"no","volume":71,"OA_type":"gold","article_type":"original","file":[{"file_size":6023889,"creator":"dernst","content_type":"application/pdf","file_id":"22411","success":1,"checksum":"6b50f39880c70b2e58baaa7713848ab5","date_updated":"2026-07-27T08:19:34Z","relation":"main_file","access_level":"open_access","date_created":"2026-07-27T08:19:34Z","file_name":"2026_JournalGlaciology_He.pdf"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.1017/jog.2025.10104","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Journal of Glaciology","date_created":"2025-11-23T23:01:40Z","date_published":"2025-11-10T00:00:00Z","oa":1,"researchdata_availability":"yes","year":"2025","PlanS_conform":"1","status":"public","intvolume":" 71","type":"journal_article","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","scopus_import":"1","oa_version":"Published Version","dataavailabilitystatement":"The Python scripts to processing of the time-lapse photos to point clouds, as well as ICP registration, are available on Zenodo (https://doi.org/10.5281/zenodo.16272541).","article_number":"e129","department":[{"_id":"FrPe"}],"has_accepted_license":"1","article_processing_charge":"Yes","DOAJ_listed":"1","publication_identifier":{"issn":["0022-1430"],"eissn":["1727-5652"]},"abstract":[{"text":"Ice cliffs and supraglacial ponds are key drivers of mass loss on debris-covered glaciers. However, the relationship between melt ponds and adjacent ice cliffs has not been fully explored. We investigated the seasonal drainage patterns of a melt pond on the debris-covered Zhuxi Glacier in southeast Tibet and estimated the mass loss of its adjacent ice cliff during 2023-2024. Using hourly time-lapse photogrammetry we built a series of high-resolution point clouds to quantify the evolution of the ice cliff-pond system. Our findings indicate that subaerial melting and undercutting were the primary mechanisms of ice cliff mass loss during summer. In winter when the pond water level dropped, ice cliff calving became the dominant mode of ice loss. As the water level rose in spring, calving and subaerial melting occurred simultaneously and ice loss from calving accounted for approximately 19.5 % of total ice loss from February to July 2024. Our results reveal the transitional state of this ice cliff-pond system, exhibiting characteristics of both melt hotspots and lake-terminating calving fronts, and highlight the interplay between seasonal drainage-refill pond and differing modes of ice loss on adjacent ice cliff. Future research should focus on additional high-resolution monitoring of similar systems and incorporation of ice cliff-pond dynamics in glacier-scale numerical models. ","lang":"eng"}],"citation":{"ama":"He Z, Westoby M, REN S, et al. Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier. Journal of Glaciology. 2025;71. doi:10.1017/jog.2025.10104","chicago":"He, Zhen, Matthew Westoby, SHAOTING REN, Chuanxi Zhao, Yifei He, Tianzhao Zhang, and Wei Yang. “Quantifying the Seasonal Dynamics of a Transitional Ice Cliff-Pond System on a Debris-Covered Glacier.” Journal of Glaciology. Cambridge University Press, 2025. https://doi.org/10.1017/jog.2025.10104.","short":"Z. He, M. Westoby, S. REN, C. Zhao, Y. He, T. Zhang, W. Yang, Journal of Glaciology 71 (2025).","ista":"He Z, Westoby M, REN S, Zhao C, He Y, Zhang T, Yang W. 2025. Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier. Journal of Glaciology. 71, e129.","ieee":"Z. He et al., “Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier,” Journal of Glaciology, vol. 71. Cambridge University Press, 2025.","apa":"He, Z., Westoby, M., REN, S., Zhao, C., He, Y., Zhang, T., & Yang, W. (2025). Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier. Journal of Glaciology. Cambridge University Press. https://doi.org/10.1017/jog.2025.10104","mla":"He, Zhen, et al. “Quantifying the Seasonal Dynamics of a Transitional Ice Cliff-Pond System on a Debris-Covered Glacier.” Journal of Glaciology, vol. 71, e129, Cambridge University Press, 2025, doi:10.1017/jog.2025.10104."},"file_date_updated":"2026-07-27T08:19:34Z","doi":"10.1017/jog.2025.10104","title":"Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier","date_updated":"2026-07-27T08:21:14Z","ddc":["550"],"publisher":"Cambridge University Press","_id":"20669","acknowledgement":"This study was supported by the National Natural Science Foundation of China (grant nos. 42271138, 42201144), Lhasa Science and Technology Plan Project (LSKJ202406), the National Key R&D Program of China (grant nos. 2024YFF0808601), and the Science and Technology Plan Projects of Tibet Autonomous Region (Grants XZ202501ZY0081 and XZ202401ZY0003). ZH additionally acknowledges mobility funding provided by China Scholarship Council (CSC), supporting an extended research stay at the University of Plymouth, where much of this research was completed."},{"title":"Automating the analysis of quantitative automata with QuAK","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.","external_id":{"arxiv":["2501.16088"]},"_id":"19741","publisher":"Springer Nature","ddc":["000"],"date_updated":"2026-07-27T12:48:18Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"corr_author":"1","citation":{"ama":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. Automating the analysis of quantitative automata with QuAK. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15696. Springer Nature; 2025:303-312. doi:10.1007/978-3-031-90643-5_16","short":"M. Chalupa, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 303–312.","chicago":"Chalupa, Marek, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Automating the Analysis of Quantitative Automata with QuAK.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15696:303–12. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90643-5_16.","ista":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. 2025. Automating the analysis of quantitative automata with QuAK. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. , LNCS, vol. 15696, 303–312.","ieee":"M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Automating the analysis of quantitative automata with QuAK,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2025, vol. 15696, pp. 303–312.","apa":"Chalupa, M., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2025). Automating the analysis of quantitative automata with QuAK. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15696, pp. 303–312). Springer Nature. https://doi.org/10.1007/978-3-031-90643-5_16","mla":"Chalupa, Marek, et al. “Automating the Analysis of Quantitative Automata with QuAK.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15696, Springer Nature, 2025, pp. 303–12, doi:10.1007/978-3-031-90643-5_16."},"doi":"10.1007/978-3-031-90643-5_16","file_date_updated":"2025-06-02T08:13:11Z","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031906428"]},"abstract":[{"lang":"eng","text":"Quantitative automata model beyond-boolean aspects of systems: every execution is mapped to a real number by incorporating weighted transitions and value functions that generalize acceptance conditions of boolean w-automata. Despite the theoretical advances in systems analysis through quantitative automata, the first comprehensive software tool for quantitative automata (Quantitative Automata Kit, or QuAK) was developed only recently. QuAK implements algorithms for solving standard decision problems, e.g., emptiness and universality, as well as constructions for safety and liveness of quantitative automata. We present the architecture of QuAK, which reflects that all of these problems reduce to either checking inclusion between two quantitative automata or computing the highest value achievable by an automaton—its so-called top value. We improve QuAK by extending these two algorithms with an option to return, alongside their results, an ultimately periodic word witnessing the algorithm’s output, as well as implementing a new safety-liveness decomposition algorithm that can handle nondeterministic automata, making QuAK more informative and capable."}],"article_processing_charge":"No","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"05","oa_version":"Published Version","oa":1,"date_published":"2025-05-01T00:00:00Z","date_created":"2025-05-25T22:17:07Z","type":"conference","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20147"}]},"intvolume":" 15696","status":"public","year":"2025","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-031-90643-5_16","volume":15696,"quality_controlled":"1","file":[{"checksum":"a27fa245be8d83421e9127b48a09c8af","date_updated":"2025-06-02T08:13:11Z","relation":"main_file","file_name":"2025_TACAS_ChalupaMarek.pdf","access_level":"open_access","date_created":"2025-06-02T08:13:11Z","creator":"dernst","file_size":420669,"success":1,"file_id":"19768","content_type":"application/pdf"}],"OA_type":"hybrid","day":"01","author":[{"first_name":"Marek","full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"first_name":"Naci E","full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"page":"303-312","ec_funded":1,"OA_place":"publisher"},{"date_updated":"2026-07-27T12:50:03Z","_id":"21858","external_id":{"arxiv":["2502.06560"]},"acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST Austria through resources\r\nprovided by Scientific Computing (SciComp). EI was supported in part by the FWF DK VGSCO,\r\ngrant agreement number W1260-N35. AJ was supported in part by ERC Proof-of-Concept Grant\r\nFastML, grant agreement 101158077.","title":"Position: It's time to act on the risk of efficient personalized text generation","article_processing_charge":"No","abstract":[{"text":"The recent surge in high-quality open-source Generative AI text models (colloquially: LLMs), as well as efficient finetuning techniques, have opened the possibility of creating high-quality personalized models that generate text attuned to a specific individual’s needs and are capable of credibly imitating their writing style by refining an open-source model with that person’s own data. The technology to create such models is accessible to private individuals, and training and running such models can be done cheaply on consumer-grade hardware. While these advancements are a huge gain for usability and privacy, this position paper argues that the practical feasibility of impersonating specific individuals also introduces novel safety risks. For instance, this technology enables the creation of phishing emails\r\nor fraudulent social media accounts, based on small amounts of publicly available text, or by the individuals themselves to escape AI text detection. We further argue that these risks are complementary to—and distinct from—the much-discussed risks of other impersonation attacks such as image, voice, or video deepfakes, and are not adequately addressed by the larger research community, or the current generation of open- and closed-source models.","lang":"eng"}],"citation":{"ieee":"E. B. Iofinova, A. Jovanovic, and D.-A. Alistarh, “Position: It’s time to act on the risk of efficient personalized text generation,” arXiv. .","ista":"Iofinova EB, Jovanovic A, Alistarh D-A. Position: It’s time to act on the risk of efficient personalized text generation. arXiv, 10.48550/arXiv.2502.06560.","chicago":"Iofinova, Eugenia B, Andrej Jovanovic, and Dan-Adrian Alistarh. “Position: It’s Time to Act on the Risk of Efficient Personalized Text Generation.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2502.06560.","short":"E.B. Iofinova, A. Jovanovic, D.-A. Alistarh, ArXiv (n.d.).","ama":"Iofinova EB, Jovanovic A, Alistarh D-A. Position: It’s time to act on the risk of efficient personalized text generation. arXiv. doi:10.48550/arXiv.2502.06560","mla":"Iofinova, Eugenia B., et al. “Position: It’s Time to Act on the Risk of Efficient Personalized Text Generation.” ArXiv, doi:10.48550/arXiv.2502.06560.","apa":"Iofinova, E. B., Jovanovic, A., & Alistarh, D.-A. (n.d.). Position: It’s time to act on the risk of efficient personalized text generation. arXiv. https://doi.org/10.48550/arXiv.2502.06560"},"doi":"10.48550/arXiv.2502.06560","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"project":[{"grant_number":"101158077","_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","name":"FastML: Efficient and Cost-Effective Distributed Machine Learning"},{"grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2502.06560"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"06","status":"public","year":"2025","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21854"}]},"type":"preprint","date_created":"2026-05-11T08:55:23Z","date_published":"2025-06-02T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.48550/arXiv.2502.06560","arxiv":1,"publication_status":"draft","publication":"arXiv","OA_type":"green","OA_place":"repository","author":[{"first_name":"Eugenia B","full_name":"Iofinova, Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","last_name":"Iofinova","orcid":"0000-0002-7778-3221"},{"last_name":"Jovanovic","full_name":"Jovanovic, Andrej","first_name":"Andrej"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"day":"02"},{"publication":"SIAM Journal on Optimization","arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.1137/24m1664691","issue":"3","type":"journal_article","intvolume":" 35","related_material":{"record":[{"id":"21957","relation":"dissertation_contains","status":"public"}]},"status":"public","year":"2025","oa":1,"date_published":"2025-09-01T00:00:00Z","date_created":"2026-02-05T13:33:05Z","page":"1630-1654","OA_place":"repository","day":"01","author":[{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"first_name":"Simone","full_name":"Naldi, Simone","last_name":"Naldi"},{"first_name":"Jeferson","full_name":"Zapata, Jeferson","id":"00223538-AF8F-11E9-A4C7-F729E6697425","last_name":"Zapata"}],"quality_controlled":"1","article_type":"original","OA_type":"green","volume":35,"citation":{"ama":"Kolmogorov V, Naldi S, Zapata J. Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. 2025;35(3):1630-1654. doi:10.1137/24m1664691","chicago":"Kolmogorov, Vladimir, Simone Naldi, and Jeferson Zapata. “Certifying Solutions of Degenerate Semidefinite Programs.” SIAM Journal on Optimization. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/24m1664691.","short":"V. Kolmogorov, S. Naldi, J. Zapata, SIAM Journal on Optimization 35 (2025) 1630–1654.","ista":"Kolmogorov V, Naldi S, Zapata J. 2025. Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. 35(3), 1630–1654.","ieee":"V. Kolmogorov, S. Naldi, and J. Zapata, “Certifying solutions of degenerate semidefinite programs,” SIAM Journal on Optimization, vol. 35, no. 3. Society for Industrial and Applied Mathematics, pp. 1630–1654, 2025.","apa":"Kolmogorov, V., Naldi, S., & Zapata, J. (2025). Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/24m1664691","mla":"Kolmogorov, Vladimir, et al. “Certifying Solutions of Degenerate Semidefinite Programs.” SIAM Journal on Optimization, vol. 35, no. 3, Society for Industrial and Applied Mathematics, 2025, pp. 1630–54, doi:10.1137/24m1664691."},"doi":"10.1137/24m1664691","abstract":[{"text":"This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMIs). Since in some SDP instances all feasible solutions have irrational entries, numerical solvers that work with rational numbers can only find an approximate solution. We study the following question: Is it possible to certify feasibility of a given SDP using an approximate solution that is sufficiently close to some exact solution? Existing approaches make the assumption that there exist rational feasible solutions (and use techniques such as rounding and lattice reduction algorithms). We propose an alternative approach that does not need this assumption. More specifically, we show how to construct a system of polynomial equations whose set of real solutions is guaranteed to have an isolated correct solution (assuming that the target exact solution is maximum-rank). This allows, in particular, for us to use algorithms from real algebraic geometry for solving systems of polynomial equations, yielding a hybrid (or symbolic-numerical) method for SDPs. We experimentally compare it with a pure symbolic method in [D. Henrion, S. Naldi, and M. Safey El Din, SIAM J. Optim., 26 (2016), pp. 2512–2539]; the hybrid method was able to certify feasibility of many SDP instances on which the aforementioned paper failed. Our approach may have further applications, such as refining an approximate solution using methods of numerical algebraic geometry for systems of polynomial equations.","lang":"eng"}],"publication_identifier":{"eissn":["1095-7189"],"issn":["1052-6234"]},"article_processing_charge":"No","department":[{"_id":"VlKo"},{"_id":"GradSch"}],"external_id":{"arxiv":["2405.13625"]},"_id":"21144","publisher":"Society for Industrial and Applied Mathematics","date_updated":"2026-07-27T14:30:41Z","title":"Certifying solutions of degenerate semidefinite programs","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.13625","open_access":"1"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09"},{"department":[{"_id":"MaIb"},{"_id":"MassSpec"}],"has_accepted_license":"1","corr_author":"1","abstract":[{"text":"Ag2Se is a promising n-type thermoelectric material, but its performance is limited by excessive carrier concentration, compositional inhomogeneity, and phase instability, challenges rooted in a narrow homogeneity range and uncontrolled Ag+ diffusion in the superionic phase. Here, we address these issues by exploiting liquid–solid interface reactions using CdSe complexes that remove surface excess Ag to yield stoichiometric Ag2Se and generate CdSe nanodomains that inhibit Ag+ diffusion and constrain grain growth. The resulting Ag2Se-CdSe nanocomposites exhibit a reproducible, stable figure of merit (zT) of 1.04 between 300 and 390 K. Beyond demonstrating high performance, we elucidate the interfacial chemical reactions that give rise to the observed microstructure and transport properties, providing a foundation for rationally engineering interfacial chemistry to tailor transport properties across diverse thermoelectric material systems.","lang":"eng"}],"publication_identifier":{"eissn":["1520-5126"],"issn":["0002-7863"]},"citation":{"mla":"Liu, Yu, et al. “Liquid-Solid Interface Reactions Drive Enhanced Thermoelectric Performance in Ag2Se.” Journal of the American Chemical Society, vol. 147, no. 35, American Chemical Society, 2025, pp. 32199–208, doi:10.1021/jacs.5c11435.","apa":"Liu, Y., Kleinhanns, T., Horta, S., Dutkiewicz, E., Lu, S., Spadaro, M. C., … Ibáñez, M. (2025). Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.5c11435","ieee":"Y. Liu et al., “Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se,” Journal of the American Chemical Society, vol. 147, no. 35. American Chemical Society, pp. 32199–32208, 2025.","ista":"Liu Y, Kleinhanns T, Horta S, Dutkiewicz E, Lu S, Spadaro MC, Genç A, Chen L, Lim KH, Hong M, Arbiol J, Ibáñez M. 2025. Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se. Journal of the American Chemical Society. 147(35), 32199–32208.","chicago":"Liu, Yu, Tobias Kleinhanns, Sharona Horta, Ewelina Dutkiewicz, Shaoqing Lu, Maria Chiara Spadaro, Aziz Genç, et al. “Liquid-Solid Interface Reactions Drive Enhanced Thermoelectric Performance in Ag2Se.” Journal of the American Chemical Society. American Chemical Society, 2025. https://doi.org/10.1021/jacs.5c11435.","short":"Y. Liu, T. Kleinhanns, S. Horta, E. Dutkiewicz, S. Lu, M.C. Spadaro, A. Genç, L. Chen, K.H. Lim, M. Hong, J. Arbiol, M. Ibáñez, Journal of the American Chemical Society 147 (2025) 32199–32208.","ama":"Liu Y, Kleinhanns T, Horta S, et al. Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se. Journal of the American Chemical Society. 2025;147(35):32199-32208. doi:10.1021/jacs.5c11435"},"doi":"10.1021/jacs.5c11435","file_date_updated":"2025-09-10T06:55:17Z","article_processing_charge":"Yes (via OA deal)","title":"Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se","external_id":{"isi":["001558320100001"]},"acknowledgement":"M.I. acknowledges financial support from ISTA and the Werner Siemens Foundation. The Scientific Service Units (SSU) of ISTA supported this work through resources provided by the Electron Microscopy Facility (EMF), the Lab Support Facility (LSF) and the Nanofabrication Facility (NNF) and the LSF Mass Spectrometry Service. The members of the Ibáñez research group are acknowledged, especially Christine Fiedler for scientific illustration and Ihor Cherniukh for valuable discussions. Y.L. acknowledges funding from the National Natural Science Foundation of China (NSFC) (Grants No. 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (Grant No. 2022LCX002) and the Fundamental Research Funds for the Central Universities (JZ2024HGTB0239). K.H.L. acknowledges financial support from the National Natural Science Foundation of China (NSFC) (Grant No. 22208293). ICN2 acknowledges funding from Generalitat de Catalunya 2021SGR00457. Authors acknowledge the Advanced Materials programme by the Spanish Government with funding from European Union NextGenerationEU (PRTR-C17.I1) and by Generalitat de Catalunya (Project In-CAEM). The authors thank support from the project AMaDE (PID2023-149158OB-C43), funded by MCIN/AEI/10.13039/501100011033/and by “ERDF Away of making Europe”, by the “European Union”. ICN2 is supported by the Severo Ochoa program from Spanish MCIN/AEI (Grant No.: CEX2021-001214-S) and is funded by the CERCA Programme/Generalitat de Catalunya. ICN2 is founding member of e-DREAM. (68) M.H. acknowledges the funding from the Australian Research Council (FT230100316 and IH200100035). M.H. acknowledges the computational support from the National Computational Infrastructure (NCI) and Pawsey Supercomputing Centre, Australia.","ddc":["540"],"date_updated":"2026-07-28T09:55:14Z","publisher":"American Chemical Society","_id":"20326","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","oa_version":"Published Version","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Journal of the American Chemical Society","fulldoi":"https://doi.org/10.1021/jacs.5c11435","publication_status":"published","date_published":"2025-08-22T00:00:00Z","oa":1,"date_created":"2025-09-10T05:44:03Z","type":"journal_article","issue":"35","year":"2025","status":"public","PlanS_conform":"1","related_material":{"record":[{"id":"22017","status":"public","relation":"dissertation_contains"}]},"intvolume":" 147","day":"22","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"NanoFab"},{"_id":"MassSpec"}],"isi":1,"author":[{"orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","first_name":"Yu","full_name":"Liu, Yu"},{"full_name":"Kleinhanns, Tobias","first_name":"Tobias","orcid":"0000-0003-1537-7436","last_name":"Kleinhanns","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425"},{"last_name":"Horta","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","first_name":"Sharona","full_name":"Horta, Sharona"},{"first_name":"Ewelina","full_name":"Dutkiewicz, Ewelina","id":"0601cc46-c082-11ec-9b07-bb29641d1de9","last_name":"Dutkiewicz"},{"last_name":"Lu","first_name":"Shaoqing","full_name":"Lu, Shaoqing"},{"last_name":"Spadaro","full_name":"Spadaro, Maria Chiara","first_name":"Maria Chiara"},{"last_name":"Genç","full_name":"Genç, Aziz","first_name":"Aziz"},{"full_name":"Chen, Lei","first_name":"Lei","last_name":"Chen"},{"first_name":"Khak Ho","full_name":"Lim, Khak Ho","last_name":"Lim"},{"last_name":"Hong","full_name":"Hong, Min","first_name":"Min"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria"}],"page":"32199-32208","OA_place":"publisher","volume":147,"file":[{"checksum":"52892fa91adadd39a1c42da9e01139a5","date_updated":"2025-09-10T06:55:17Z","relation":"main_file","file_name":"2025_JACS_Liu.pdf","access_level":"open_access","date_created":"2025-09-10T06:55:17Z","creator":"dernst","file_size":9997327,"success":1,"file_id":"20334","content_type":"application/pdf"}],"quality_controlled":"1","article_type":"original","OA_type":"hybrid"},{"oa_version":"Published Version","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"abstract":[{"text":"Here, we present a foundational investigation of charge transport through three BODIPY-based molecules using the scanning tunneling microscope–break junction (STM-BJ) technique. We demonstrate that molecular conductance through the BODIPY core can be measured by introducing aurophilic linkers at the 2,6-positions. By varying these linkers, we systematically modulate the frontier molecular orbital energies and fine-tune transport behavior. Our experimental results are supported by DFT-based calculations, which feature a new computationally efficient correction to standard PBE-level transmission predictions. Together, these findings establish the viability of BODIPY-based systems for molecular junction applications and lay the groundwork for future studies of their single-molecule optoelectronic properties.","lang":"eng"}],"citation":{"mla":"York, Emma, et al. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” Nano Letters, vol. 25, no. 36, American Chemical Society, 2025, pp. 13697–702, doi:10.1021/acs.nanolett.5c03764.","apa":"York, E., Stone, I., Shi, W., Roy, X., & Venkataraman, L. (2025). Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.5c03764","ieee":"E. York, I. Stone, W. Shi, X. Roy, and L. Venkataraman, “Tuning conductance in BODIPY-based single-molecule junctions,” Nano Letters, vol. 25, no. 36. American Chemical Society, pp. 13697–13702, 2025.","ista":"York E, Stone I, Shi W, Roy X, Venkataraman L. 2025. Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. 25(36), 13697–13702.","short":"E. York, I. Stone, W. Shi, X. Roy, L. Venkataraman, Nano Letters 25 (2025) 13697–13702.","chicago":"York, Emma, Ilana Stone, Wanzhuo Shi, Xavier Roy, and Latha Venkataraman. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” Nano Letters. American Chemical Society, 2025. https://doi.org/10.1021/acs.nanolett.5c03764.","ama":"York E, Stone I, Shi W, Roy X, Venkataraman L. Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. 2025;25(36):13697-13702. doi:10.1021/acs.nanolett.5c03764"},"file_date_updated":"2025-12-30T09:39:44Z","doi":"10.1021/acs.nanolett.5c03764","corr_author":"1","department":[{"_id":"LaVe"}],"has_accepted_license":"1","date_updated":"2026-07-28T09:53:54Z","ddc":["540"],"_id":"20331","publisher":"American Chemical Society","external_id":{"pmid":["40855728"],"isi":["001557017200001"]},"acknowledgement":"We thank the National Science Foundation (No. NSF-DMR 2241180) for supporting this research. Synthetic work at Columbia was funded in part by the Air Force Office of Scientific Research (AFOSR), under Grant No. FA9550-22-1-0389. The cryoprobe on the 500 MHz NMR instrument used in this research at Columbia was purchased through the NIH Award No. S10OD026749. This work was supported in part by the Institute of Science and Technology Austria. HRMS sample preparation, analysis, and data evaluation were performed by Aikaterina Paraskevopoulou, Mass Spec Service, LSF, ISTA.","title":"Tuning conductance in BODIPY-based single-molecule junctions","OA_place":"publisher","page":"13697-13702","das_tickbox":"1","isi":1,"author":[{"last_name":"York","id":"08dde91e-8e0a-11f0-9d7d-9e8d80864f16","full_name":"York, Emma","first_name":"Emma"},{"last_name":"Stone","full_name":"Stone, Ilana","first_name":"Ilana"},{"first_name":"Wanzhuo","full_name":"Shi, Wanzhuo","last_name":"Shi","id":"a3010425-87c8-11f0-8106-bec32bea74da"},{"last_name":"Roy","first_name":"Xavier","full_name":"Roy, Xavier"},{"id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","orcid":"0000-0002-6957-6089","last_name":"Venkataraman","first_name":"Latha","full_name":"Venkataraman, Latha"}],"day":"25","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"MassSpec"}],"pmid":1,"OA_type":"hybrid","article_type":"letter_note","file":[{"file_name":"2025_NanoLetters_York.pdf","date_created":"2025-12-30T09:39:44Z","access_level":"open_access","relation":"main_file","date_updated":"2025-12-30T09:39:44Z","checksum":"bac881601e1f33c3cf8f51d50b958e68","success":1,"content_type":"application/pdf","file_id":"20910","creator":"dernst","file_size":3144989}],"quality_controlled":"1","volume":25,"fulldoi":"https://doi.org/10.1021/acs.nanolett.5c03764","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Nano Letters","PlanS_conform":"1","status":"public","year":"2025","intvolume":" 25","type":"journal_article","issue":"36","date_created":"2025-09-10T05:48:29Z","date_published":"2025-08-25T00:00:00Z","oa":1},{"corr_author":"1","department":[{"_id":"TiBr"}],"article_processing_charge":"No","publication_identifier":{"eissn":["1730-6264"],"issn":["0065-1036"]},"abstract":[{"text":"We study the growth of sumsets A+B⊂S⊂G, where S does not contain an arithmetic progression of length 2k+1, and where G is a commutative group, in which every nonzero element has an order of at least 2k+1. More specifically, we show the following: if A,B⊂G are sets such that A+B does not contain an arithmetic progression of length 2k+1, then\r\n|A+B|≥|A|2k−13k−2|B|k3k−2.\r\nAs an application we derive upper bounds on the cardinality of the summands in sumsets A+B+C contained in the set of t-th powers, where t≥2 is an integer. In particular, we show that min(|A|,|B|,|C|)≪(logN)4/5 for t=2, and min(|A|,|B|,|C|)≪t(logN)1/2 for t≥3.","lang":"eng"}],"doi":"10.4064/aa250115-14-7","citation":{"ista":"Elsholtz C, Ruzsa IZ, Wurzinger L. 2025. Sumset growth in progression-free sets. Acta Arithmetica. 220, 289–303.","ieee":"C. Elsholtz, I. Z. Ruzsa, and L. Wurzinger, “Sumset growth in progression-free sets,” Acta Arithmetica, vol. 220. Institute of Mathematics, pp. 289–303, 2025.","ama":"Elsholtz C, Ruzsa IZ, Wurzinger L. Sumset growth in progression-free sets. Acta Arithmetica. 2025;220:289-303. doi:10.4064/aa250115-14-7","short":"C. Elsholtz, I.Z. Ruzsa, L. Wurzinger, Acta Arithmetica 220 (2025) 289–303.","chicago":"Elsholtz, Christian, Imre Z. Ruzsa, and Lena Wurzinger. “Sumset Growth in Progression-Free Sets.” Acta Arithmetica. Institute of Mathematics, 2025. https://doi.org/10.4064/aa250115-14-7.","apa":"Elsholtz, C., Ruzsa, I. Z., & Wurzinger, L. (2025). Sumset growth in progression-free sets. Acta Arithmetica. Institute of Mathematics. https://doi.org/10.4064/aa250115-14-7","mla":"Elsholtz, Christian, et al. “Sumset Growth in Progression-Free Sets.” Acta Arithmetica, vol. 220, Institute of Mathematics, 2025, pp. 289–303, doi:10.4064/aa250115-14-7."},"title":"Sumset growth in progression-free sets","date_updated":"2026-07-29T09:51:25Z","publisher":"Institute of Mathematics","_id":"20603","external_id":{"isi":["001570716800001"]},"acknowledgement":"The authors would like to thank the referee and Ilya Shkredov for comments on the manuscript.\r\nC. E. is supported by a joint FWF-ANR project ArithRand, grant numbers FWF I 4945-N and ANR-20-CE91-0006.\r\n","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"09","scopus_import":"1","oa_version":"None","fulldoi":"https://doi.org/10.4064/aa250115-14-7","publication_status":"published","publication":"Acta Arithmetica","date_created":"2025-11-04T14:33:16Z","date_published":"2025-09-12T00:00:00Z","researchdata_availability":"no","status":"public","year":"2025","intvolume":" 220","type":"journal_article","isi":1,"author":[{"last_name":"Elsholtz","full_name":"Elsholtz, Christian","first_name":"Christian"},{"first_name":"Imre Z.","full_name":"Ruzsa, Imre Z.","last_name":"Ruzsa"},{"orcid":"0009-0004-5360-0074","id":"50c57d72-32a8-11ee-aeea-d652094d2ccd","last_name":"Wurzinger","first_name":"Lena","full_name":"Wurzinger, Lena"}],"day":"12","page":"289-303","das_tickbox":"0","supplementarymaterial":"no","volume":220,"article_type":"original","OA_type":"closed access","quality_controlled":"1"},{"department":[{"_id":"CaHe"},{"_id":"EdHa"}],"corr_author":"1","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"abstract":[{"text":"For tissues to spread, they must be deformable while maintaining their structural integrity. How these opposing requirements are balanced within spreading tissues is not yet well understood. Here, we show that keratin intermediate filaments function in epithelial spreading by adapting tissue mechanical resilience to the stresses arising in the tissue during the spreading process. By analysing the expansion of the enveloping cell layer (EVL) over the large yolk cell in early zebrafish embryos in vivo, we found that keratin network maturation in EVL cells is promoted by stresses building up within the spreading tissue. Through genetic interference and tissue rheology experiments, complemented by a vertex model with mechanochemical feedback, we demonstrate that stress-induced keratin network maturation in the EVL increases tissue viscosity, which is essential for preventing tissue rupture. Interestingly, keratins are also required in the yolk cell for mechanosensitive actomyosin network contraction and flow, the force-generating processes pulling the EVL. These dual mechanosensitive functions of keratins enable a balance between pulling force production in the yolk cell and the mechanical resilience of the EVL against stresses generated by these pulling forces, thereby ensuring uniform and robust tissue spreading.","lang":"eng"}],"publication":"bioRxiv","doi":"10.1101/2025.02.14.638262","citation":{"ama":"Naik S, Keta Y-E, Pranjic-Ferscha K, Hannezo EB, Henkes S, Heisenberg C-PJ. Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties. bioRxiv. doi:10.1101/2025.02.14.638262","short":"S. Naik, Y.-E. Keta, K. Pranjic-Ferscha, E.B. Hannezo, S. Henkes, C.-P.J. Heisenberg, BioRxiv (n.d.).","chicago":"Naik, Suyash, Yann-Edwin Keta, Kornelija Pranjic-Ferscha, Edouard B Hannezo, Silke Henkes, and Carl-Philipp J Heisenberg. “Keratins Coordinate Tissue Spreading by Balancing Spreading Forces with Tissue Material Properties.” BioRxiv, n.d. https://doi.org/10.1101/2025.02.14.638262.","ista":"Naik S, Keta Y-E, Pranjic-Ferscha K, Hannezo EB, Henkes S, Heisenberg C-PJ. Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties. bioRxiv, 10.1101/2025.02.14.638262.","ieee":"S. Naik, Y.-E. Keta, K. Pranjic-Ferscha, E. B. Hannezo, S. Henkes, and C.-P. J. Heisenberg, “Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties,” bioRxiv. .","apa":"Naik, S., Keta, Y.-E., Pranjic-Ferscha, K., Hannezo, E. B., Henkes, S., & Heisenberg, C.-P. J. (n.d.). Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties. bioRxiv. https://doi.org/10.1101/2025.02.14.638262","mla":"Naik, Suyash, et al. “Keratins Coordinate Tissue Spreading by Balancing Spreading Forces with Tissue Material Properties.” BioRxiv, doi:10.1101/2025.02.14.638262."},"article_processing_charge":"No","fulldoi":"https://doi.org/10.1101/2025.02.14.638262","publication_status":"draft","date_published":"2025-02-17T00:00:00Z","title":"Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties","oa":1,"date_created":"2025-10-14T07:25:27Z","type":"preprint","year":"2025","date_updated":"2026-07-29T10:33:31Z","status":"public","_id":"20465","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20441"},{"id":"22608","relation":"later_version","status":"public"}]},"day":"17","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"02","author":[{"first_name":"Suyash","full_name":"Naik, Suyash","last_name":"Naik","id":"2C0B105C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8421-5508"},{"first_name":"Yann-Edwin","full_name":"Keta, Yann-Edwin","last_name":"Keta"},{"id":"4362B3C2-F248-11E8-B48F-1D18A9856A87","last_name":"Pranjic-Ferscha","full_name":"Pranjic-Ferscha, Kornelija","first_name":"Kornelija"},{"full_name":"Hannezo, Edouard B","first_name":"Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo"},{"full_name":"Henkes, Silke","first_name":"Silke","last_name":"Henkes"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","oa_version":"Preprint","das_tickbox":"1","OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.1101/2025.02.14.638262","open_access":"1"}]},{"date_published":"2025-12-09T00:00:00Z","oa":1,"date_created":"2025-12-08T09:49:41Z","type":"dissertation","year":"2025","status":"public","related_material":{"record":[{"status":"public","id":"13097","relation":"part_of_dissertation"}]},"fulldoi":"https://doi.org/10.15479/AT-ISTA-20735","publication_status":"published","supervisor":[{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","orcid":"0000-0003-3295-6181","first_name":"Tim P","full_name":"Vogels, Tim P"},{"full_name":"Sweeney, Lora Beatrice Jaeger","first_name":"Lora Beatrice Jaeger","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","last_name":"Sweeney","orcid":"0000-0001-9242-5601"}],"file":[{"relation":"source_file","date_updated":"2026-01-02T13:05:07Z","checksum":"9e3b6b73f8cbec2c3687d17fe8e30410","date_created":"2026-01-01T17:26:30Z","access_level":"closed","file_name":"tadpoleAdEx.zip","file_size":566072368,"creator":"awilson","content_type":"application/zip","file_id":"20919"},{"content_type":"application/pdf","file_id":"20923","success":1,"file_size":7170097,"creator":"awilson","date_created":"2026-01-04T12:58:49Z","access_level":"open_access","file_name":"Masters_Thesis_Alexia_Wilson_FINAL_pdfA.pdf","date_updated":"2026-01-04T12:58:49Z","relation":"main_file","checksum":"13f4c0d33923e9d5c9d56731345cf21d"}],"day":"09","author":[{"full_name":"Wilson, Alexia C","first_name":"Alexia C","last_name":"Wilson","orcid":"0000-0001-6191-1367","id":"5230e794-15b2-11ec-abd3-e2d5335ebd1d"}],"doi_confirm":"1","page":"110","OA_place":"publisher","title":"Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog","degree_awarded":"MS","ddc":["570","596","005"],"date_updated":"2026-07-29T12:55:12Z","_id":"20735","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"TiVo"},{"_id":"LoSw"}],"has_accepted_license":"1","corr_author":"1","alternative_title":["ISTA Master's Thesis"],"publication_identifier":{"issn":["2791-4585"]},"abstract":[{"lang":"eng","text":"Left–right alternation is a defining feature of spinal locomotor circuits, yet the level of neuronal\r\ndetail required to generate and maintain this pattern remains unclear. This thesis investigates how\r\nmodels spanning multiple levels of abstraction—from biophysically detailed Hodgkin–Huxley (HH)\r\nneurons to adaptive integrate–and–fire (I&F) formulations and synfire-chain modules—can account\r\nfor the generation of fictive swimming in the spinal cord of the Xenopus laevis tadpole. The guiding\r\nhypothesis is that a small set of neuronal mechanisms is sufficient to reproduce the essential features\r\nof rhythmic alternation, and that moving between modeling scales helps distinguish core principles\r\nfrom biological detail.\r\nA minimal bilateral HH network comprising only four canonical neuron classes—excitatory\r\ndescending interneurons (dINs), inhibitory commissural interneurons (cINs), ipsilateral inhibitory\r\ninterneurons (aINs) and motoneurons—served as a biophysical proof of concept. Tuned to reproduce\r\nexperimentally observed firing modes, the model demonstrated that rebound-prone dIN excitability,\r\ncontralateral inhibition and modest electrical coupling are sufficient to generate stable alternating\r\nactivity, even in very small networks. These results motivated the transition to simpler models\r\ncapable of efficient analysis and scaling.\r\nAdaptive exponential I&F (AdEx) neurons were calibrated to physiological recordings using\r\nsimulation-based inference, yielding tonic and phasic/rebound templates that preserved the key\r\ndynamical signatures of the HH model. Phase-plane analysis clarified the mechanisms underlying\r\nsingle-spike responses and rebound firing in dINs. At network level, the I&F models robustly\r\nreproduced left–right alternation, while highlighting constraints on synaptic kinetics and adaptation\r\nneeded to avoid multi-spike responses.\r\nFinally, a synfire-chain framework provided a complementary, timing-centric perspective, demonstrating how precise spike synchrony, synaptic delays and minimal inhibitory coupling can generate\r\nalternating left–right sequences in a feedforward setting. Together, these approaches converge on a\r\ncommon conclusion: rebound-prone ipsilateral excitation combined with precisely timed contralateral inhibition constitutes a sufficient substrate for alternating spinal rhythms.\r\nBy integrating bottom-up and top-down modeling strategies, this thesis provides a unified, extensible framework for studying spinal pattern generation. The results show that essential locomotor\r\ndynamics can be captured across multiple abstraction levels, offering both mechanistic insight and\r\npractical tools for future data-driven investigations of spinal circuit development, robustness and\r\nmodulation."}],"doi":"10.15479/AT-ISTA-20735","citation":{"apa":"Wilson, A. C. (2025). Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20735","mla":"Wilson, Alexia C. Modelling the Spinal Cord of a Tadpole: Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20735.","ista":"Wilson AC. 2025. Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog. Institute of Science and Technology Austria.","ieee":"A. C. Wilson, “Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog,” Institute of Science and Technology Austria, 2025.","ama":"Wilson AC. Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog. 2025. doi:10.15479/AT-ISTA-20735","short":"A.C. Wilson, Modelling the Spinal Cord of a Tadpole: Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog, Institute of Science and Technology Austria, 2025.","chicago":"Wilson, Alexia C. “Modelling the Spinal Cord of a Tadpole: Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20735."},"file_date_updated":"2026-01-04T12:58:49Z","article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"12","oa_version":"Published Version"},{"OA_place":"repository","das_tickbox":"1","author":[{"first_name":"Martin","full_name":"Dvorak, Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","last_name":"Dvorak"},{"last_name":"Figueroa-Reid","full_name":"Figueroa-Reid, Tristan","first_name":"Tristan"},{"first_name":"Rida","full_name":"Hamadani, Rida","last_name":"Hamadani"},{"last_name":"Hwang","first_name":"Byung-Hak","full_name":"Hwang, Byung-Hak"},{"full_name":"Karunus, Evgenia","first_name":"Evgenia","last_name":"Karunus"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"last_name":"Meiburg","full_name":"Meiburg, Alexander","first_name":"Alexander"},{"first_name":"Alexander","full_name":"Nelson, Alexander","last_name":"Nelson"},{"full_name":"Nelson, Peter","first_name":"Peter","last_name":"Nelson"},{"full_name":"Sandey, Mark","first_name":"Mark","last_name":"Sandey"},{"first_name":"Ivan","full_name":"Sergeev, Ivan","orcid":"0009-0004-9145-8785","last_name":"Sergeev","id":"ca3c9187-9a72-11ee-a009-8af825d896b0"}],"day":"23","OA_type":"green","fulldoi":"https://doi.org/10.48550/arXiv.2509.20539","arxiv":1,"publication_status":"draft","publication":"arXiv","year":"2025","status":"public","related_material":{"record":[{"status":"public","id":"21393","relation":"dissertation_contains"}]},"type":"preprint","date_created":"2026-03-04T11:56:29Z","date_published":"2025-09-23T00:00:00Z","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2509.20539","open_access":"1"}],"oa_version":"Preprint","month":"09","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2509.20539","article_processing_charge":"No","abstract":[{"text":"Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited number of notions and results have been implemented so far. In this work, we formalize the proof of the forward (composition) direction of Seymour's theorem for regular matroids. To this end, we develop a library in Lean 4 that implements definitions and results about totally unimodular matrices, vector matroids, their standard representations, regular matroids, and 1-, 2-, and 3-sums of matrices and binary matroids given by their standard representations. Using this framework, we formally state Seymour's decomposition theorem and implement a formally verified proof of the composition direction in the setting where the matroids have finite rank and may have infinite ground sets.","lang":"eng"}],"citation":{"apa":"Dvorak, M., Figueroa-Reid, T., Hamadani, R., Hwang, B.-H., Karunus, E., Kolmogorov, V., … Sergeev, I. (n.d.). Composition direction of Seymour’s theorem for regular matroids — Formally verified. arXiv. https://doi.org/10.48550/arXiv.2509.20539","mla":"Dvorak, Martin, et al. “Composition Direction of Seymour’s Theorem for Regular Matroids — Formally Verified.” ArXiv, 2509.20539, doi:10.48550/arXiv.2509.20539.","ama":"Dvorak M, Figueroa-Reid T, Hamadani R, et al. Composition direction of Seymour’s theorem for regular matroids — Formally verified. arXiv. doi:10.48550/arXiv.2509.20539","chicago":"Dvorak, Martin, Tristan Figueroa-Reid, Rida Hamadani, Byung-Hak Hwang, Evgenia Karunus, Vladimir Kolmogorov, Alexander Meiburg, et al. “Composition Direction of Seymour’s Theorem for Regular Matroids — Formally Verified.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2509.20539.","short":"M. Dvorak, T. Figueroa-Reid, R. Hamadani, B.-H. Hwang, E. Karunus, V. Kolmogorov, A. Meiburg, A. Nelson, P. Nelson, M. Sandey, I. Sergeev, ArXiv (n.d.).","ista":"Dvorak M, Figueroa-Reid T, Hamadani R, Hwang B-H, Karunus E, Kolmogorov V, Meiburg A, Nelson A, Nelson P, Sandey M, Sergeev I. Composition direction of Seymour’s theorem for regular matroids — Formally verified. arXiv, 2509.20539.","ieee":"M. Dvorak et al., “Composition direction of Seymour’s theorem for regular matroids — Formally verified,” arXiv. ."},"doi":"10.48550/arXiv.2509.20539","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"date_updated":"2026-07-29T12:56:51Z","_id":"21398","external_id":{"arxiv":["2509.20539"]},"acknowledgement":"We would like to dedicate the paper to the memory of Klaus Truemper, whose monograph Matroid Decomposition [12]\r\nlaid the foundation for our entire work.","title":"Composition direction of Seymour's theorem for regular matroids — Formally verified"},{"arxiv":1,"publication_status":"draft","fulldoi":"https://doi.org/10.48550/arXiv.2508.05410","publication":"arXiv","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2025-09-04T09:14:11Z","oa":1,"date_published":"2025-08-31T00:00:00Z","related_material":{"record":[{"id":"20276","status":"public","relation":"dissertation_contains"}]},"status":"public","year":"2025","type":"preprint","author":[{"full_name":"Bhargava, Manas","first_name":"Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","orcid":"0009-0007-6138-6890","last_name":"Bhargava"},{"full_name":"Hiraki, Takefumi","first_name":"Takefumi","last_name":"Hiraki"},{"first_name":"Irina-Malina","full_name":"Strugaru, Irina-Malina","last_name":"Strugaru","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074"},{"first_name":"Yuhan","full_name":"Zhang, Yuhan","last_name":"Zhang"},{"id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","orcid":"0000-0002-5062-4474","last_name":"Piovarci","first_name":"Michael","full_name":"Piovarci, Michael"},{"first_name":"Chiara","full_name":"Daraio, Chiara","last_name":"Daraio"},{"full_name":"Iwai, Daisuke","first_name":"Daisuke","last_name":"Iwai"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd"}],"day":"31","ec_funded":1,"OA_place":"repository","corr_author":"1","department":[{"_id":"BeBi"}],"article_processing_charge":"No","citation":{"apa":"Bhargava, M., Hiraki, T., Strugaru, I.-M., Zhang, Y., Piovarci, M., Daraio, C., … Bickel, B. (n.d.). Computational design and fabrication of modular robots with untethered control. arXiv. https://doi.org/10.48550/arXiv.2508.05410","mla":"Bhargava, Manas, et al. “Computational Design and Fabrication of Modular Robots with Untethered Control.” ArXiv, doi:10.48550/arXiv.2508.05410.","ama":"Bhargava M, Hiraki T, Strugaru I-M, et al. Computational design and fabrication of modular robots with untethered control. arXiv. doi:10.48550/arXiv.2508.05410","short":"M. Bhargava, T. Hiraki, I.-M. Strugaru, Y. Zhang, M. Piovarci, C. Daraio, D. Iwai, B. Bickel, ArXiv (n.d.).","chicago":"Bhargava, Manas, Takefumi Hiraki, Irina-Malina Strugaru, Yuhan Zhang, Michael Piovarci, Chiara Daraio, Daisuke Iwai, and Bernd Bickel. “Computational Design and Fabrication of Modular Robots with Untethered Control.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2508.05410.","ista":"Bhargava M, Hiraki T, Strugaru I-M, Zhang Y, Piovarci M, Daraio C, Iwai D, Bickel B. Computational design and fabrication of modular robots with untethered control. arXiv, 10.48550/arXiv.2508.05410.","ieee":"M. Bhargava et al., “Computational design and fabrication of modular robots with untethered control,” arXiv. ."},"doi":"10.48550/arXiv.2508.05410","abstract":[{"text":"Natural organisms utilize distributed actuation through their musculoskeletal\r\nsystems to adapt their gait for traversing diverse terrains or to morph their\r\nbodies for varied tasks. A longstanding challenge in robotics is to emulate\r\nthis capability of natural organisms, which has motivated the development of\r\nnumerous soft robotic systems. However, such systems are generally optimized\r\nfor a single functionality, lack the ability to change form or function on\r\ndemand, or remain tethered to bulky control systems. To address these\r\nlimitations, we present a framework for designing and controlling robots that\r\nutilize distributed actuation. We propose a novel building block that\r\nintegrates 3D-printed bones with liquid crystal elastomer (LCE) muscles as\r\nlightweight actuators, enabling the modular assembly of musculoskeletal robots.\r\nWe developed LCE rods that contract in response to infrared radiation, thereby\r\nproviding localized, untethered control over the distributed skeletal network\r\nand producing global deformations of the robot. To fully capitalize on the\r\nextensive design space, we introduce two computational tools: one for\r\noptimizing the robot's skeletal graph to achieve multiple target deformations,\r\nand another for co-optimizing skeletal designs and control gaits to realize\r\ndesired locomotion. We validate our framework by constructing several robots\r\nthat demonstrate complex shape morphing, diverse control schemes, and\r\nenvironmental adaptability. Our system integrates advances in modular material\r\nbuilding, untethered and distributed control, and computational design to\r\nintroduce a new generation of robots that brings us closer to the capabilities\r\nof living organisms.","lang":"eng"}],"title":"Computational design and fabrication of modular robots with untethered control","_id":"20286","date_updated":"2026-07-29T13:03:30Z","acknowledgement":"The authors express gratitude to Magali Lorion for assisting in the initial fabrication of LCEs,\r\nPengbin Tang for providing the code for simulating discrete elastic rods, the Imaging and\r\nOptics Facility at ISTA for assisting with the spectrometry measurements, and the MIBA\r\nmachine shop at ISTA for their support in manufacturing various devices.\r\nFunding: This project was supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation program (Grant Agreement No.\r\n715767 -– MATERIALIZABLE).","external_id":{"arxiv":["2508.05410"]},"language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"08","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.05410"}],"oa_version":"Preprint","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"}]},{"file":[{"file_name":"2025_Trioni_Andrea_Thesis.pdf","access_level":"open_access","date_created":"2025-09-25T07:15:05Z","checksum":"6fb925648dfa5f4384814c552ee2f099","date_updated":"2025-09-25T14:25:31Z","relation":"main_file","content_type":"application/pdf","file_id":"20392","creator":"atrioni","file_size":22351676},{"date_created":"2025-09-25T14:45:43Z","access_level":"closed","file_name":"2025_Trioni_Andrea_Thesis.zip","relation":"source_file","date_updated":"2025-09-26T07:20:48Z","checksum":"619dc614bdfbf3999b76ac8890b2cebd","content_type":"application/x-zip-compressed","file_id":"20396","file_size":60079009,"creator":"atrioni"}],"supervisor":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M","full_name":"Fink, Johannes M"}],"ec_funded":1,"OA_place":"publisher","page":"202","author":[{"last_name":"Trioni","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","first_name":"Andrea"}],"doi_confirm":"1","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"day":"23","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"8755"}]},"year":"2025","status":"public","type":"dissertation","date_created":"2025-09-23T09:57:57Z","oa":1,"date_published":"2025-09-23T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT-ISTA-20371","project":[{"name":"Protected states of quantum matter","_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","grant_number":"F07105"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"month":"09","publisher":"Institute of Science and Technology Austria","_id":"20371","ddc":["539"],"date_updated":"2026-07-29T13:12:10Z","acknowledgement":"I also gratefully acknowledge the generous support of the NOMIS Foundation Project \"Protected\r\nStates of Quantum Matter\" and the grant from the Beyond-C consortium. Their funding\r\nmade this research possible and gave me the freedom to ask ambitious questions, and try to\r\nanswer them.\r\n","degree_awarded":"PhD","title":"High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains","article_processing_charge":"No","citation":{"apa":"Trioni, A. (2025). High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20371","mla":"Trioni, Andrea. High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20371.","ama":"Trioni A. High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. 2025. doi:10.15479/AT-ISTA-20371","short":"A. Trioni, High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains, Institute of Science and Technology Austria, 2025.","chicago":"Trioni, Andrea. “High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20371.","ista":"Trioni A. 2025. High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. Institute of Science and Technology Austria.","ieee":"A. Trioni, “High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains,” Institute of Science and Technology Austria, 2025."},"file_date_updated":"2025-09-26T07:20:48Z","doi":"10.15479/AT-ISTA-20371","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-067-1"]},"abstract":[{"lang":"eng","text":"Quantum mechanics reveals a world that defies classical determinism, where uncertainty, superposition, and fluctuations are fundamental aspects. Engineering devices that harness these quantum features requires not only precision, but also a deep understanding of how they interact with their surrounding environment. Superconducting circuits, which exploit\r\nmacroscopic quantum coherence in low-loss superconducting materials, provide a scalable platform for implementing such systems. Among the critical elements in these circuits, superinductors—high-impedance, dissipation-free inductive components—play a central role by suppressing charge fluctuations. They allow quantum states to be delocalized in phase space, protect qubits from environmental noise, and facilitate access to phenomena such as dual Josephson physics and ultra-strong coupling regimes. \r\nThis thesis explores two complementary implementations of high-impedance circuits: geometric superinductors, demonstrating that high impedance can be achieved beyond kinetic inductance,\r\nand Josephson junction chains, used to investigate both microwave mode properties and DC transport across the superconductor-to-insulator transition. \r\nPart I addresses geometric superinductors. Contrary to the common belief that high-impedance superconducting circuits require kinetic inductance, we demonstrate that purely geometric designs can achieve characteristic impedance exceeding the resistance quantum. By exploiting mutual coupling between adjacent turns, coil-based inductors achieve enhanced self-inductance, creating a reliable platform for qubits and resonators. Modeling, simulation, fabrication, and\r\ncharacterization confirm that these elements behave as superinductor. With low loss, high linearity, and minimal stray capacitance, these elements are reproducible, free of uncontrolled tunneling events, and capable of strong magnetic coupling. This establishes geometric superinductors as robust, single-wave-function superconducting devices suitable for hardware protected qubits and hybrid systems.\r\nPart II presents classical numerical simulations of a Quantum Phase Slip circuit to study dual Shapiro steps. The circuit consists of an ideal Quantum Phase Slip element embedded in a resistive-inductive environment with a parasitic capacitance.\r\nPart III extends the investigation of high characteristic-impedance circuit elements to one-dimensional Josephson junction chains, which act as a quantum simulator for many-body physics and the superconductor–insulator transition. Different devices are realized on both sides of the DC phase transition, showing either a supercurrent branch or Coulomb blockade at zero bias. The effect of the crossover on microwave modes, however, remains insufficiently investigated. Studying these modes provides insight into the interplay between disorder and phase-slip events. Small differences in circuit component sizes determine which side of the transition a device falls on, making these results relevant not only for fundamental understanding but also for the design of quantum devices, emphasizing the crucial role of the\r\nelectromagnetic environment in stabilizing and controlling fragile quantum states. \r\nTogether, these results illustrate how carefully engineered high characteristic-impedance elements provide a link between macroscopic circuits and the inherently uncertain quantum world, enabling experiments that probe, control, and ultimately exploit quantum fluctuations for applications in quantum information, metrology, solid state physics and beyond.\r\n\r\n"}],"alternative_title":["ISTA Thesis"],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"JoFi"}]},{"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","oa_version":"Published Version","project":[{"grant_number":"P31312","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425"},{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"department":[{"_id":"UlWa"}],"has_accepted_license":"1","corr_author":"1","publication_identifier":{"issn":["0737-8017"],"isbn":["9798400715105"]},"abstract":[{"lang":"eng","text":"We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Nešetřil, this problem is NP-hard for any non-bipartite loop-less graph H. Brakensiek and Guruswami [SODA 2018] conjectured the hardness extends to promise graph homomorphism problems as follows: fix a pair of non-bipartite loop-less graphs G, H such that there is a homomorphism from G to H, it is NP-hard to distinguish between graphs that are G-colourable and those that are not H-colourable. We confirm this conjecture in the cases when both G and H are 4-colourable. This is a common generalisation of previous results of Khanna, Linial, and Safra [Comb. 20(3): 393-415 (2000)] and of Krokhin and Opršal [FOCS 2019]. The result is obtained by combining the algebraic approach to promise constraint satisfaction with methods of topological combinatorics and equivariant obstruction theory."}],"doi":"10.1145/3717823.3718154","file_date_updated":"2025-07-14T06:42:58Z","citation":{"mla":"Avvakumov, Sergey, et al. “Hardness of 4-Colouring G-Colourable Graphs.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83, doi:10.1145/3717823.3718154.","apa":"Avvakumov, S., Filakovský, M., Opršal, J., Tasinato, G., & Wagner, U. (2025). Hardness of 4-colouring G-colourable graphs. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 72–83). Prague, Czechia: Association for Computing Machinery. https://doi.org/10.1145/3717823.3718154","short":"S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.","chicago":"Avvakumov, Sergey, Marek Filakovský, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of 4-Colouring G-Colourable Graphs.” In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 72–83. Association for Computing Machinery, 2025. https://doi.org/10.1145/3717823.3718154.","ama":"Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:72-83. doi:10.1145/3717823.3718154","ieee":"S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of 4-colouring G-colourable graphs,” in Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Prague, Czechia, 2025, pp. 72–83.","ista":"Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83."},"article_processing_charge":"Yes (in subscription journal)","title":"Hardness of 4-colouring G-colourable graphs","acknowledgement":"This research was supported by the Austrian Science Fund (FWF project P31312-N35) and by project MSCAfellow5_MUNI (CZ.02.01.01/00/22_010/0003229) financed by the Ministry of Education, Youth and Sports of the Czech Republic. This project has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No 101034413.","ddc":["000"],"date_updated":"2026-07-29T13:13:17Z","publisher":"Association for Computing Machinery","_id":"20008","day":"15","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7840-5062","last_name":"Avvakumov","full_name":"Avvakumov, Sergey","first_name":"Sergey"},{"first_name":"Marek","full_name":"Filakovský, Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský"},{"full_name":"Opršal, Jakub","first_name":"Jakub","last_name":"Opršal","orcid":"0000-0003-1245-3456","id":"ec596741-c539-11ec-b829-c79322a91242"},{"first_name":"Gianluca","full_name":"Tasinato, Gianluca","last_name":"Tasinato","id":"0433290C-AF8F-11E9-A4C7-F729E6697425"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli"}],"page":"72-83","OA_place":"publisher","ec_funded":1,"file":[{"file_name":"2025_STOC_Avvakumov.pdf","access_level":"open_access","date_created":"2025-07-14T06:42:58Z","checksum":"2c9ae7ad0102c41124976f4cb5182760","date_updated":"2025-07-14T06:42:58Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"20013","creator":"dernst","file_size":940827}],"quality_controlled":"1","OA_type":"hybrid","conference":{"end_date":"2025-06-27","name":"STOC: Symposium on Theory of Computing","start_date":"2025-06-23","location":"Prague, Czechia"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","fulldoi":"https://doi.org/10.1145/3717823.3718154","publication_status":"published","date_published":"2025-06-15T00:00:00Z","oa":1,"date_created":"2025-07-13T22:01:23Z","type":"conference","year":"2025","status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"20339","status":"public"}]}},{"project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","grant_number":"101020331"},{"_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","name":"Spectral rigidity and integrability for billiards and geodesic flows","call_identifier":"H2020","grant_number":"885707"}],"oa_version":"Published Version","month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","ddc":["510"],"date_updated":"2026-07-29T13:18:16Z","_id":"18112","publisher":"Cambridge University Press","external_id":{"isi":["001308182000001"]},"acknowledgement":"I am very grateful to Vadim Kaloshin for suggesting the topic, his guidance during this project, and many helpful comments on an earlier version of the manuscript. Moreover, I would like to thank Comlan Edmond Koudjinan and Volodymyr Riabov for interesting discussions. Partial financial support by the ERC Advanced Grant ‘RMTBeyond’ No. 101020331 is gratefully acknowledged. This project received funding from the European Research Council (ERC) ERC Grant No. 885707.","title":"Deformational rigidity of integrable metrics on the torus","article_processing_charge":"Yes (via OA deal)","abstract":[{"lang":"eng","text":"It is conjectured that the only integrable metrics on the two-dimensional torus are Liouville metrics. In this paper, we study a deformative version of this conjecture: we consider integrable deformations of a non-flat Liouville metric in a conformal class and show that for a fairly large class of such deformations, the deformed metric is again Liouville. The principal idea of the argument is that the preservation of rational invariant tori in the foliation of the phase space forces a linear combination on the Fourier coefficients of the deformation to vanish. Showing that the resulting linear system is non-degenerate will then yield the claim. Since our method of proof immediately carries over to higher dimensional tori, we obtain analogous statements in this more general case. To put our results in perspective, we review existing results about integrable metrics on the torus."}],"publication_identifier":{"issn":["0143-3857"],"eissn":["1469-4417"]},"file_date_updated":"2025-01-13T08:51:40Z","doi":"10.1017/etds.2024.48","citation":{"ista":"Henheik SJ. 2025. Deformational rigidity of integrable metrics on the torus. Ergodic Theory and Dynamical Systems. 45(2), 467–503.","ieee":"S. J. Henheik, “Deformational rigidity of integrable metrics on the torus,” Ergodic Theory and Dynamical Systems, vol. 45, no. 2. Cambridge University Press, pp. 467–503, 2025.","ama":"Henheik SJ. Deformational rigidity of integrable metrics on the torus. Ergodic Theory and Dynamical Systems. 2025;45(2):467-503. doi:10.1017/etds.2024.48","short":"S.J. Henheik, Ergodic Theory and Dynamical Systems 45 (2025) 467–503.","chicago":"Henheik, Sven Joscha. “Deformational Rigidity of Integrable Metrics on the Torus.” Ergodic Theory and Dynamical Systems. Cambridge University Press, 2025. https://doi.org/10.1017/etds.2024.48.","apa":"Henheik, S. J. (2025). Deformational rigidity of integrable metrics on the torus. Ergodic Theory and Dynamical Systems. Cambridge University Press. https://doi.org/10.1017/etds.2024.48","mla":"Henheik, Sven Joscha. “Deformational Rigidity of Integrable Metrics on the Torus.” Ergodic Theory and Dynamical Systems, vol. 45, no. 2, Cambridge University Press, 2025, pp. 467–503, doi:10.1017/etds.2024.48."},"corr_author":"1","department":[{"_id":"LaEr"}],"has_accepted_license":"1","OA_type":"hybrid","article_type":"original","file":[{"file_size":659100,"creator":"dernst","file_id":"18828","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2025-01-13T08:51:40Z","checksum":"650fe115d998fe0ac3a8d0c7519447c8","date_created":"2025-01-13T08:51:40Z","access_level":"open_access","file_name":"2025_ErgodicTheory_Henheik.pdf"}],"quality_controlled":"1","volume":45,"OA_place":"publisher","ec_funded":1,"page":"467-503","isi":1,"author":[{"first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha","last_name":"Henheik","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","orcid":"0000-0003-1106-327X"}],"day":"01","status":"public","year":"2025","related_material":{"record":[{"id":"19540","status":"public","relation":"dissertation_contains"}]},"intvolume":" 45","type":"journal_article","issue":"2","date_created":"2024-09-22T22:01:43Z","date_published":"2025-02-01T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1017/etds.2024.48","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Ergodic Theory and Dynamical Systems"},{"article_processing_charge":"Yes (via OA deal)","citation":{"ista":"Erdös L, Henheik SJ, Kolupaiev O. 2025. Loschmidt echo for deformed Wigner matrices. Letters in Mathematical Physics. 115, 14.","ieee":"L. Erdös, S. J. Henheik, and O. Kolupaiev, “Loschmidt echo for deformed Wigner matrices,” Letters in Mathematical Physics, vol. 115. Springer Nature, 2025.","ama":"Erdös L, Henheik SJ, Kolupaiev O. Loschmidt echo for deformed Wigner matrices. Letters in Mathematical Physics. 2025;115. doi:10.1007/s11005-025-01904-5","short":"L. Erdös, S.J. Henheik, O. Kolupaiev, Letters in Mathematical Physics 115 (2025).","chicago":"Erdös, László, Sven Joscha Henheik, and Oleksii Kolupaiev. “Loschmidt Echo for Deformed Wigner Matrices.” Letters in Mathematical Physics. Springer Nature, 2025. https://doi.org/10.1007/s11005-025-01904-5.","apa":"Erdös, L., Henheik, S. J., & Kolupaiev, O. (2025). Loschmidt echo for deformed Wigner matrices. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-025-01904-5","mla":"Erdös, László, et al. “Loschmidt Echo for Deformed Wigner Matrices.” Letters in Mathematical Physics, vol. 115, 14, Springer Nature, 2025, doi:10.1007/s11005-025-01904-5."},"doi":"10.1007/s11005-025-01904-5","file_date_updated":"2025-02-05T07:01:40Z","abstract":[{"lang":"eng","text":"We consider two Hamiltonians that are close to each other, H1≈H2, and analyze the time-decay of the corresponding Loschmidt echo M(t):=|⟨ψ0,eitH2e−itH1ψ0⟩|2 that expresses the effect of an imperfect time reversal on the initial state ψ0. Our model Hamiltonians are deformed Wigner matrices that do not share a common eigenbasis. The main tools for our results are two-resolvent laws for such H1 and H2."}],"publication_identifier":{"issn":["1573-0530"]},"corr_author":"1","has_accepted_license":"1","department":[{"_id":"LaEr"}],"_id":"19001","publisher":"Springer Nature","ddc":["510"],"date_updated":"2026-07-29T13:18:16Z","acknowledgement":"We thank Giorgio Cipolloni for helpful discussions in a closely related joint project. Open access funding provided by Institute of Science and Technology (IST Austria). All authors were supported by the ERC Advanced Grant “RMTBeyond” No. 101020331.","external_id":{"pmid":["39896265"],"arxiv":["2410.08108"],"isi":["001409618800002"]},"title":"Loschmidt echo for deformed Wigner matrices","oa_version":"Published Version","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"article_number":"14","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1007/s11005-025-01904-5","publication":"Letters in Mathematical Physics","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19540"}]},"intvolume":" 115","status":"public","year":"2025","type":"journal_article","date_created":"2025-02-05T06:48:29Z","oa":1,"date_published":"2025-01-30T00:00:00Z","ec_funded":1,"OA_place":"publisher","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha"},{"first_name":"Oleksii","full_name":"Kolupaiev, Oleksii","last_name":"Kolupaiev","orcid":"0000-0003-1491-4623","id":"149b70d4-896a-11ed-bdf8-8c63fd44ca61"}],"isi":1,"day":"30","OA_type":"hybrid","article_type":"original","pmid":1,"quality_controlled":"1","file":[{"relation":"main_file","date_updated":"2025-02-05T07:01:40Z","checksum":"ee07edf5f85a6f2651926b2f8760af74","date_created":"2025-02-05T07:01:40Z","access_level":"open_access","file_name":"2025_LettersMathPhysics_Erdoes.pdf","file_size":828335,"creator":"dernst","file_id":"19004","content_type":"application/pdf","success":1}],"volume":115}]