--- DOAJ_listed: '1' OA_place: publisher OA_type: gold PlanS_conform: '1' _id: '20662' abstract: - lang: eng text: Task-based functional magnetic resonance imaging (fMRI) reveals individual differences in neural correlates of cognition but faces scalability challenges due to cognitive demands, protocol variability, and limited task coverage in large datasets. Here, we propose DeepTaskGen, a deep-learning approach that synthesizes non-acquired task-based contrast maps from resting-state (rs-) fMRI. We validate this approach using the Human Connectome Project lifespan data, then generate 47 contrast maps from 7 different cognitive tasks for over 20,000 individuals from UK Biobank. DeepTaskGen outperforms several benchmarks in generating synthetic task-contrast maps, achieving superior reconstruction performance while retaining inter-individual variation essential for biomarker development. We further show comparable or superior predictive performance of synthetic maps relative to actual maps and rs-connectomes across diverse demographic, cognitive, and clinical variables. This approach facilitates the study of individual differences and the generation of task-related biomarkers by enabling the generation of arbitrary functional cognitive tasks from readily available rs-fMRI data. acknowledgement: 'Funded by the European Union (Grant agreement No 101057429). Complementary funding was received by UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding guarantee (10131373 and 10038599) and the National Key R&D Program of Ministry of Science and Technology of China (MOST 2023YFE0199700). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union, the European Health and Digital Executive Agency (HADEA), UKRI or MOST. Neither the European Union nor HADEA nor UKRI nor MOST can be held responsible for them. This work has also been supported by a Grant from the German Research Foundation to the ENIGMA task-based fMRI Working Group (DFG ER 724/4–1, WA 1539/11–1). Data used in this study were provided in part by the Human Connectome Project, WU-Minn Consortium (principal investigators: D. Van Essen and K. Ugurbil; grant number 1U54MH091657), funded by the 16 National Institutes of Health (NIH) institutes and centers supporting the NIH Blueprint for Neuroscience Research, and by the McDonnell Center for Systems Neuroscience at Washington University. Additionally, this research utilized data obtained from UK Biobank, a large-scale biomedical database. Open Access funding enabled and organized by Projekt DEAL.' article_number: '1572' article_processing_charge: Yes article_type: original author: - first_name: Emin full_name: Serin, Emin last_name: Serin - first_name: Kerstin full_name: Ritter, Kerstin last_name: Ritter - first_name: Gunter full_name: Schumann, Gunter last_name: Schumann - first_name: Tobias full_name: Banaschewski, Tobias last_name: Banaschewski - first_name: Andre full_name: Marquand, Andre last_name: Marquand - first_name: Henrik full_name: Walter, Henrik last_name: Walter - first_name: George full_name: Ogoh, George last_name: Ogoh - first_name: Bernd Carsten full_name: Stahl, Bernd Carsten last_name: Stahl - first_name: Ragnhild full_name: Brandlistuen, Ragnhild last_name: Brandlistuen - first_name: Tamara full_name: Schikowski, Tamara last_name: Schikowski - first_name: Allan H. full_name: Young, Allan H. last_name: Young - first_name: Yu full_name: Xinyang, Yu last_name: Xinyang - first_name: Zuo full_name: Zhang, Zuo last_name: Zhang - first_name: Kofoworola full_name: Agunbiade, Kofoworola last_name: Agunbiade - first_name: Di full_name: Chen, Di last_name: Chen - first_name: Sylvane full_name: Desrivières, Sylvane last_name: Desrivières - first_name: Nicholas full_name: Clinton, Nicholas last_name: Clinton - first_name: Paul full_name: Thompson, Paul last_name: Thompson - first_name: Venessa full_name: Köhler, Venessa last_name: Köhler - first_name: Ameli full_name: Schwalber, Ameli last_name: Schwalber - first_name: Vince D. full_name: Calhoun, Vince D. last_name: Calhoun - first_name: Xiao full_name: Chang, Xiao last_name: Chang - first_name: Yanqing full_name: Zhang, Yanqing last_name: Zhang - first_name: Yuzhu full_name: Li, Yuzhu last_name: Li - first_name: Yuxiang full_name: Dai, Yuxiang last_name: Dai - first_name: Jiacan full_name: Yuan, Jiacan last_name: Yuan - first_name: Yunman full_name: Xia, Yunman last_name: Xia - first_name: Tianye full_name: Jia, Tianye last_name: Jia - first_name: Paul full_name: Renner, Paul last_name: Renner - first_name: Sören full_name: Hese, Sören last_name: Hese - first_name: Bernhard full_name: Spanlang, Bernhard last_name: Spanlang - first_name: Charlie full_name: Pearmund, Charlie last_name: Pearmund - first_name: Anastasios Polykarpos full_name: Athanasiadis, Anastasios Polykarpos last_name: Athanasiadis - first_name: Spase full_name: Petkoski, Spase last_name: Petkoski - first_name: Viktor full_name: Jirsa, Viktor last_name: Jirsa - first_name: Karen full_name: Schmitt, Karen last_name: Schmitt - first_name: Johannes H. full_name: Wilbertz, Johannes H. last_name: Wilbertz - first_name: Myrto full_name: Patraskaki, Myrto last_name: Patraskaki - first_name: Peter full_name: Sommer, Peter last_name: Sommer - first_name: Stefanie full_name: Heilmann-Heimbach, Stefanie last_name: Heilmann-Heimbach - first_name: Carina M. full_name: Mathey, Carina M. last_name: Mathey - first_name: Abigail J. full_name: Miller, Abigail J. last_name: Miller - first_name: Isabelle full_name: Claus, Isabelle last_name: Claus - first_name: Markus M. full_name: Nöthen, Markus M. last_name: Nöthen - first_name: Per full_name: Hoffmann, Per last_name: Hoffmann - first_name: Andreas J. full_name: Forstner, Andreas J. last_name: Forstner - first_name: Alvaro full_name: Pastor, Alvaro last_name: Pastor - first_name: Jaime full_name: Gallego, Jaime last_name: Gallego - first_name: Reiya full_name: Itatani, Reiya last_name: Itatani - first_name: Francisco full_name: Eiroa-Orosa, Francisco last_name: Eiroa-Orosa - first_name: Guillem full_name: Feixas, Guillem last_name: Feixas - first_name: Mel full_name: Slater, Mel last_name: Slater - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 - first_name: Sarah Jane full_name: Böttger, Sarah Jane last_name: Böttger - first_name: Mira full_name: Tschorn, Mira last_name: Tschorn - first_name: Michael full_name: Rapp, Michael last_name: Rapp - first_name: Helga full_name: Ask, Helga last_name: Ask - first_name: Rikka full_name: Kjelkenes, Rikka last_name: Kjelkenes - first_name: Sara full_name: Fernandez, Sara last_name: Fernandez - first_name: Dennis full_name: Van Der Meer, Dennis last_name: Van Der Meer - first_name: Lars T. full_name: Westlye, Lars T. last_name: Westlye - first_name: Ole A. full_name: Andreassen, Ole A. last_name: Andreassen - first_name: Rieke full_name: Aden, Rieke last_name: Aden - first_name: Beke full_name: Seefried, Beke last_name: Seefried - first_name: Frauke full_name: Nees, Frauke last_name: Nees - first_name: Maja full_name: Neidhart, Maja last_name: Neidhart - first_name: Argyris full_name: Stringaris, Argyris last_name: Stringaris - first_name: Emanuel full_name: Schwarz, Emanuel last_name: Schwarz - first_name: Nathalie full_name: Holz, Nathalie last_name: Holz - first_name: Heike full_name: Tost, Heike last_name: Tost - first_name: Andreas full_name: Meyer-Lindenberg, Andreas last_name: Meyer-Lindenberg - first_name: Nina full_name: Christmann, Nina last_name: Christmann - first_name: Karina full_name: Janson, Karina last_name: Janson - first_name: Kerstin full_name: Schepanski, Kerstin last_name: Schepanski - first_name: Tatjana full_name: Schütz, Tatjana last_name: Schütz - first_name: Ulrike Helene full_name: Taron, Ulrike Helene last_name: Taron - first_name: Roland full_name: Eils, Roland last_name: Eils - first_name: Jean Charles full_name: Roy, Jean Charles last_name: Roy - first_name: Tristram A. full_name: Lett, Tristram A. last_name: Lett - first_name: Hedi full_name: Kebir, Hedi last_name: Kebir - first_name: Elli full_name: Polemiti, Elli last_name: Polemiti - first_name: Esther full_name: Hitchen, Esther last_name: Hitchen - first_name: Marcel full_name: Jentsch, Marcel last_name: Jentsch - first_name: Emin full_name: Serin, Emin last_name: Serin - first_name: Antoine full_name: Bernas, Antoine last_name: Bernas - first_name: Nilakshi full_name: Vaidya, Nilakshi last_name: Vaidya - first_name: Sven full_name: Twardziok, Sven last_name: Twardziok - first_name: Markus full_name: Ralser, Markus last_name: Ralser - first_name: Andreas full_name: Heinz, Andreas last_name: Heinz - first_name: Gunter full_name: Schumann, Gunter last_name: Schumann citation: ama: Serin E, Ritter K, Schumann G, et al. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. 2025;8. doi:10.1038/s42003-025-09158-6 apa: Serin, E., Ritter, K., Schumann, G., Banaschewski, T., Marquand, A., Walter, H., … Schumann, G. (2025). Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-025-09158-6 chicago: Serin, Emin, Kerstin Ritter, Gunter Schumann, Tobias Banaschewski, Andre Marquand, Henrik Walter, George Ogoh, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” Communications Biology. Springer Nature, 2025. https://doi.org/10.1038/s42003-025-09158-6. ieee: E. Serin et al., “Generating synthetic task-based brain fingerprints for population neuroscience using deep learning,” Communications Biology, vol. 8. Springer Nature, 2025. ista: Serin E, Ritter K, Schumann G, Banaschewski T, Marquand A, Walter H, Ogoh G, Stahl BC, Brandlistuen R, Schikowski T, Young AH, Xinyang Y, Zhang Z, Agunbiade K, Chen D, Desrivières S, Clinton N, Thompson P, Köhler V, Schwalber A, Calhoun VD, Chang X, Zhang Y, Li Y, Dai Y, Yuan J, Xia Y, Jia T, Renner P, Hese S, Spanlang B, Pearmund C, Athanasiadis AP, Petkoski S, Jirsa V, Schmitt K, Wilbertz JH, Patraskaki M, Sommer P, Heilmann-Heimbach S, Mathey CM, Miller AJ, Claus I, Nöthen MM, Hoffmann P, Forstner AJ, Pastor A, Gallego J, Itatani R, Eiroa-Orosa F, Feixas G, Slater M, Novarino G, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes R, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B, Nees F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg A, Christmann N, Janson K, Schepanski K, Schütz T, Taron UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz A, Schumann G. 2025. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. 8, 1572. mla: Serin, Emin, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” Communications Biology, vol. 8, 1572, Springer Nature, 2025, doi:10.1038/s42003-025-09158-6. short: E. Serin, K. Ritter, G. Schumann, T. Banaschewski, A. Marquand, H. Walter, G. Ogoh, B.C. Stahl, R. Brandlistuen, T. Schikowski, A.H. Young, Y. Xinyang, Z. Zhang, K. Agunbiade, D. Chen, S. Desrivières, N. Clinton, P. Thompson, V. Köhler, A. Schwalber, V.D. Calhoun, X. Chang, Y. Zhang, Y. Li, Y. Dai, J. Yuan, Y. Xia, T. Jia, P. Renner, S. Hese, B. Spanlang, C. Pearmund, A.P. Athanasiadis, S. Petkoski, V. Jirsa, K. Schmitt, J.H. Wilbertz, M. Patraskaki, P. Sommer, S. Heilmann-Heimbach, C.M. Mathey, A.J. Miller, I. Claus, M.M. Nöthen, P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego, R. Itatani, F. Eiroa-Orosa, G. Feixas, M. Slater, G. Novarino, S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, F. Nees, M. Neidhart, A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg, N. Christmann, K. Janson, K. Schepanski, T. Schütz, U.H. Taron, R. Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin, A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, G. Schumann, Communications Biology 8 (2025). date_created: 2025-11-23T23:01:38Z date_published: 2025-12-01T00:00:00Z date_updated: 2026-07-29T11:13:56Z day: '01' ddc: - '570' department: - _id: GaNo doi: 10.1038/s42003-025-09158-6 external_id: isi: - '001614464000001' pmid: - '41238730' file: - access_level: open_access checksum: b8b3c1abe7048a09b920082a37e786a5 content_type: application/pdf creator: dernst date_created: 2025-11-24T09:12:19Z date_updated: 2025-11-24T09:12:19Z file_id: '20675' file_name: 2025_CommunicationsBiology_Serin.pdf file_size: 1588155 relation: main_file success: 1 file_date_updated: 2025-11-24T09:12:19Z has_accepted_license: '1' intvolume: ' 8' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Published Version pmid: 1 publication: Communications Biology publication_identifier: eissn: - 2399-3642 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Generating synthetic task-based brain fingerprints for population neuroscience using deep learning tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2025' ... --- OA_place: publisher _id: '20735' 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." alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Alexia C full_name: Wilson, Alexia C id: 5230e794-15b2-11ec-abd3-e2d5335ebd1d last_name: Wilson orcid: 0000-0001-6191-1367 citation: 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' 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' 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.' 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.' 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.' 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.' 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.' corr_author: '1' date_created: 2025-12-08T09:49:41Z date_published: 2025-12-09T00:00:00Z date_updated: 2026-07-29T12:55:12Z day: '09' ddc: - '570' - '596' - '005' degree_awarded: MS department: - _id: GradSch - _id: TiVo - _id: LoSw doi: 10.15479/AT-ISTA-20735 doi_confirm: '1' file: - access_level: closed checksum: 9e3b6b73f8cbec2c3687d17fe8e30410 content_type: application/zip creator: awilson date_created: 2026-01-01T17:26:30Z date_updated: 2026-01-02T13:05:07Z file_id: '20919' file_name: tadpoleAdEx.zip file_size: 566072368 relation: source_file - access_level: open_access checksum: 13f4c0d33923e9d5c9d56731345cf21d content_type: application/pdf creator: awilson date_created: 2026-01-04T12:58:49Z date_updated: 2026-01-04T12:58:49Z file_id: '20923' file_name: Masters_Thesis_Alexia_Wilson_FINAL_pdfA.pdf file_size: 7170097 relation: main_file success: 1 file_date_updated: 2026-01-04T12:58:49Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: '110' publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13097' relation: part_of_dissertation status: public status: public supervisor: - first_name: Tim P full_name: Vogels, Tim P id: CB6FF8D2-008F-11EA-8E08-2637E6697425 last_name: Vogels orcid: 0000-0003-3295-6181 - first_name: Lora Beatrice Jaeger full_name: Sweeney, Lora Beatrice Jaeger id: 56BE8254-C4F0-11E9-8E45-0B23E6697425 last_name: Sweeney orcid: 0000-0001-9242-5601 title: 'Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher _id: '20607' acknowledged_ssus: - _id: Bio - _id: SSU - _id: LifeSc - _id: M-Shop acknowledgement: "I gratefully acknowledge the support of the ISTA Graduate School and the Scientific Service Units of\r\nISTA, whose resources made this work possible—especially the Imaging & Optics Facility, the Lab\r\nSupport Facility, and the Miba Machine Shop. I would like to thank two staff scientists in particular:\r\nRobert Hauschild (Imaging & Optics Facility) and Daniel Balazs (Lab Support Facility), for their\r\nassistance and advice. My PhD was partially funded by the Austrian Science Fund (FWF)\r\n(10.55776/P37169 and 10.55776/COE5)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Soumyadip full_name: Mondal, Soumyadip id: d25d21ef-dc8d-11ea-abe3-ec4576307f48 last_name: Mondal citation: ama: 'Mondal S. Oxygen and sulfur redox: Conversion kinetics and phase equilibria. 2025. doi:10.15479/AT-ISTA-20607' apa: 'Mondal, S. (2025). Oxygen and sulfur redox: Conversion kinetics and phase equilibria. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20607' chicago: 'Mondal, Soumyadip. “Oxygen and Sulfur Redox: Conversion Kinetics and Phase Equilibria.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20607.' ieee: 'S. Mondal, “Oxygen and sulfur redox: Conversion kinetics and phase equilibria,” Institute of Science and Technology Austria, 2025.' ista: 'Mondal S. 2025. Oxygen and sulfur redox: Conversion kinetics and phase equilibria. Institute of Science and Technology Austria.' mla: 'Mondal, Soumyadip. Oxygen and Sulfur Redox: Conversion Kinetics and Phase Equilibria. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20607.' short: 'S. Mondal, Oxygen and Sulfur Redox: Conversion Kinetics and Phase Equilibria, Institute of Science and Technology Austria, 2025.' corr_author: '1' das_tickbox: '1' date_created: 2025-11-07T12:40:54Z date_published: 2025-09-19T00:00:00Z date_updated: 2026-07-29T12:57:15Z day: '19' ddc: - '541' - '543' - '542' degree_awarded: PhD department: - _id: GradSch - _id: StFr doi: 10.15479/AT-ISTA-20607 doi_confirm: '1' file: - access_level: closed checksum: b5eed6a3dccb83cd2a8a22e11fd7d867 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: smondal date_created: 2025-11-13T16:47:47Z date_updated: 2025-11-13T16:47:47Z file_id: '20644' file_name: 2025_Mondal_Soumyadip_Thesis.docx file_size: 32589295 relation: source_file - access_level: closed checksum: 89b1529e0a7b524f46624d73ecadf8cb content_type: application/pdf creator: smondal date_created: 2025-11-13T16:47:46Z date_updated: 2025-11-13T16:47:46Z embargo: 2026-11-13 embargo_to: open_access file_id: '20645' file_name: 2025_Mondal_Soumyadip_Thesis.pdf file_size: 5007370 relation: main_file file_date_updated: 2025-11-13T16:47:47Z has_accepted_license: '1' language: - iso: eng month: '09' oa_version: Published Version page: '71' project: - _id: 8df062be-16d5-11f0-9cad-f559b6612c7e grant_number: P37169 name: Singlet oxygen in non-aqueous oxygen redox chemistry publication_identifier: isbn: - 978-3-99078-071-8 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12065' relation: part_of_dissertation status: public - id: '13044' relation: part_of_dissertation status: public - id: '20437' relation: part_of_dissertation status: deleted - id: '14687' relation: part_of_dissertation status: public status: public supervisor: - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 title: 'Oxygen and sulfur redox: Conversion kinetics and phase equilibria' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: repository OA_type: green _id: '21398' abstract: - lang: eng 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. 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." article_number: '2509.20539' article_processing_charge: No arxiv: 1 author: - first_name: Martin full_name: Dvorak, Martin id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425 last_name: Dvorak orcid: 0000-0001-5293-214X - first_name: Tristan full_name: Figueroa-Reid, Tristan last_name: Figueroa-Reid - first_name: Rida full_name: Hamadani, Rida last_name: Hamadani - first_name: Byung-Hak full_name: Hwang, Byung-Hak last_name: Hwang - first_name: Evgenia full_name: Karunus, Evgenia last_name: Karunus - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Alexander full_name: Meiburg, Alexander last_name: Meiburg - first_name: Alexander full_name: Nelson, Alexander last_name: Nelson - first_name: Peter full_name: Nelson, Peter last_name: Nelson - first_name: Mark full_name: Sandey, Mark last_name: Sandey - first_name: Ivan full_name: Sergeev, Ivan id: ca3c9187-9a72-11ee-a009-8af825d896b0 last_name: Sergeev orcid: 0009-0004-9145-8785 citation: 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 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 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. ieee: M. Dvorak et al., “Composition direction of Seymour’s theorem for regular matroids — Formally verified,” arXiv. . 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. 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. 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.). corr_author: '1' das_tickbox: '1' date_created: 2026-03-04T11:56:29Z date_published: 2025-09-23T00:00:00Z date_updated: 2026-07-29T12:56:51Z day: '23' department: - _id: GradSch - _id: VlKo doi: 10.48550/arXiv.2509.20539 external_id: arxiv: - '2509.20539' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2509.20539 month: '09' oa: 1 oa_version: Preprint publication: arXiv publication_status: draft related_material: record: - id: '21393' relation: dissertation_contains status: public status: public title: Composition direction of Seymour's theorem for regular matroids — Formally verified type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '20811' abstract: - lang: eng text: "\tThis thesis is organized into two parts, each comprising two chapters: Chapter 1 and 2 offer models for the evolution of vaccine resistance in response to diverse vaccination strategies. Chapter 3 and 4 review the statistics of records, their connection to models of innovation and an application to the cultural evolution of sports.\r\n\tIn chapter 1 we present a modelling study from 2021 on the evolution of SARS-CoV-2. At that time the vaccine-resistant Omicron variant had not yet evolved. In our model we consider a population that is becoming vaccinated over time, while a pathogen is spreading in the population and eventually becoming resistant to the vaccine. We explore effective pharmaceutical and non-pharmaceutical interventions to prevent the emergence of vaccine resistance. \r\n\tIn chapter 2 we model a particular set of complex vaccination strategies, mosaic and pyramid vaccination, where an immunologically diverse portfolio of vaccines is considered. We find that a bet-hatching strategy, in which vaccine types are distributed in the population, is effective at hindering the evolution of vaccine resistance if mutation rates are high. \r\n\tIn chapter 3 we switch gears and present a review on the statistics of records. We highlight similarities and analogies to other models in the fields of statistical physics, evolution and innovation. This offers interesting complimentary perspectives on well-known models. \r\n\tIn chapter 4 we apply models of record statistics and innovation to study cultural evolution in sport. We propose a model of sport evolution that combines deterministic improvements in performance and stochastic bursts of improvements due to innovation. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Simon full_name: Rella, Simon id: B4765ACA-AA38-11E9-AC9A-0930E6697425 last_name: Rella citation: ama: 'Rella S. Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation. 2025. doi:10.15479/AT-ISTA-20811' apa: 'Rella, S. (2025). Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20811' chicago: 'Rella, Simon. “Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20811.' ieee: 'S. Rella, “Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation,” Institute of Science and Technology Austria, 2025.' ista: 'Rella S. 2025. Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation. Institute of Science and Technology Austria.' mla: 'Rella, Simon. Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20811.' short: 'S. Rella, Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-12-12T14:39:56Z date_published: 2025-12-15T00:00:00Z date_updated: 2026-07-29T12:57:49Z day: '15' ddc: - '616' - '576' - '614' - '519' degree_awarded: PhD department: - _id: GradSch - _id: GaTk - _id: FyKo doi: 10.15479/AT-ISTA-20811 doi_confirm: '1' file: - access_level: open_access checksum: a0bd7a585720e60df284101b8afdf6bb content_type: application/pdf creator: srella date_created: 2025-12-16T21:49:52Z date_updated: 2025-12-16T21:49:52Z file_id: '20831' file_name: 2025_Rella_Simon_Thesis.pdf file_size: 29019662 relation: main_file success: 1 - access_level: open_access checksum: b8b3a90932ae1d96d307838710f46e32 content_type: application/zip creator: srella date_created: 2025-12-16T21:52:19Z date_updated: 2025-12-16T21:52:19Z file_id: '20832' file_name: 2025_Rella_Simon_Thesis_Sourcefiles.zip file_size: 42094025 relation: source_file file_date_updated: 2025-12-16T21:52:19Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '12' oa: 1 oa_version: Published Version page: '95' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '18307' relation: part_of_dissertation status: public - id: '9905' relation: part_of_dissertation status: public status: public supervisor: - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: 0000-0002-6699-1455 - first_name: Fyodor full_name: Kondrashov, Fyodor id: 44FDEF62-F248-11E8-B48F-1D18A9856A87 last_name: Kondrashov orcid: 0000-0001-8243-4694 title: 'Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher _id: '20276' abstract: - lang: eng text: "Complex 3D shapes can be created by morphing flat 2D configurations. Such deformations\r\neither preserve the intrinsic material geometry (e.g., folding paper) or modify it through\r\nlocalized contraction. Once transformed, the 3D shape can be further controlled to achieve a\r\ntarget functionality. A key challenge is to take the material specifications and the actuation\r\nprocess as input to automatically design the target 3D shape and its functionality. This thesis\r\npresents two novel computational pipelines for the design and control of shape-morphing\r\nstructures used to create functional prototypes.\r\nThe first pipeline borrows from the art of origami to fold paper into intricate shapes and\r\napplies this principle to make 3D lighting displays. We introduce, PCBend a computational\r\ndesign approach that covers a surface with individually addressable RGB LEDs, effectively\r\nforming a low-resolution surface by folding rigid printed circuit boards (PCBs). We optimize\r\ncut patterns on PCBs to act as hinges and co-design LED placement, circuit routing, and\r\nfabrication constraints to produce PCB blueprints. The PCBs are fabricated using automated\r\nstandard manufacturing services with LEDs embedded on them. Finally, the fabricated PCBs\r\nare cut along the contour and folded onto a 3D-printed support. The 3D lighting display is\r\nthen controlled to display complex surface light patterns.\r\nCreating 3D shapes through folding is only possible if their planar configuration, called ”unfolding” exists without any distortion or overlap. Existing methods often permit distortion\r\nor require multiple patches, which are unsuitable for fabrication pipelines that rely on folding\r\nnon-stretchable materials. We reinforce such fabrication pipelines by providing a geometric\r\nrelaxation to the problem, where the input shape is modified to admit overlap-free unfolding.\r\nThe second fabrication pipeline extends shape morphing to soft robotics by emulating nature’s\r\nblueprint of distributed actuation. Inspired by vertebrates, we build musculoskeletal robots\r\nusing modular active actuators, employing Liquid Crystal Elastomers (LCEs) as shrinkable\r\nartificial muscles integrated with 3D-printed bones. The chemical composition of LCEs is\r\naltered to enable untethered actuation through infrared radiation, allowing active control of\r\nindividual muscles and their corresponding bones. The combined motion of individual bones\r\ndefines the robot’s overall shape and functionality. Our proposed system significantly expands\r\nboth the design and control spaces of soft robots, which we harness using our computational\r\ndesign tools. We build several physical robots that exhibit complex shape morphing and varied\r\nterrain navigation, showcasing the versatility of our pipeline.\r\nThis thesis explores applications ranging from intricate light patterns displayed on 3D shapes\r\nformed by folding rigid PCBs to untethered robots that use contractile muscles to exhibit\r\nshape morphing and locomotion. Through these examples, the thesis highlights how computational design and distributed actuation, integrated with novel materials, can transform\r\npassive structures into functional prototypes." acknowledgement: "Financial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design\r\nand Modeling that I gratefully acknowledge.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Manas full_name: Bhargava, Manas id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425 last_name: Bhargava orcid: 0009-0007-6138-6890 citation: ama: 'Bhargava M. Design and control of deformable structures: From PCB lighting displays to elastomer robots. 2025. doi:10.15479/AT-ISTA-20276' apa: 'Bhargava, M. (2025). Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20276' chicago: 'Bhargava, Manas. “Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20276.' ieee: 'M. Bhargava, “Design and control of deformable structures: From PCB lighting displays to elastomer robots,” Institute of Science and Technology Austria, 2025.' ista: 'Bhargava M. 2025. Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria.' mla: 'Bhargava, Manas. Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20276.' short: 'M. Bhargava, Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-09-02T14:48:39Z date_published: 2025-09-02T00:00:00Z date_updated: 2026-07-29T13:03:31Z day: '02' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: BeBi doi: 10.15479/AT-ISTA-20276 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 5baf8ca46c86a94fc8380ff1007aabd4 content_type: application/pdf creator: mbhargav date_created: 2025-09-03T10:40:52Z date_updated: 2025-09-03T10:40:52Z file_id: '20284' file_name: 2025-Bhargava-Manas-Thesis.pdf file_size: 161436245 relation: main_file success: 1 - access_level: closed checksum: 66878fafbc0074f88ddd18f24a9fc647 content_type: application/x-zip-compressed creator: mbhargav date_created: 2025-09-03T13:18:05Z date_updated: 2025-09-04T09:22:29Z file_id: '20285' file_name: manas_phd_thesis_source_files.zip file_size: 198831315 relation: source_file file_date_updated: 2025-09-04T09:22:29Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '09' oa: 1 oa_version: Published Version page: '96' project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication_identifier: isbn: - 978-3-99078-065-7 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '13049' relation: part_of_dissertation status: public - id: '18565' relation: part_of_dissertation status: public - id: '20286' relation: part_of_dissertation status: public status: public supervisor: - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 title: 'Design and control of deformable structures: From PCB lighting displays to elastomer robots' tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher _id: '20203' abstract: - lang: eng text: Tribocharging, or contact electrification, is the phenomenon in which two initially neutral materials exchange electric charge through contact and subsequent separation. While it is widely observed in everyday life and crucial to numerous natural processes, even the most basic aspects of tribocharging are still a mystery—what are the charge carriers involved and what drives their exchange? This work spans three separate projects that address different aspects of tribocharging. First, we introduce a novel strategy combining Finite Element Method (FEM) simulations with Kelvin Probe Force Microscopy (KPFM) to quantitatively extract surface charge density from surface voltage maps. Second, we present a simple theoretical model that allows for the existence of triboelectric cycles, under the assumption that multiple charge carrying species are involved. Third, we present experimental evidence that identical materials can spontaneously evolve into a triboelectric series, driven by contact history. Modeling this behavior enables the replication of experimental results with simulations, and even experimentally forcing the appearance of a pre-designed series by manipulating contact history. Together, the findings from these projects challenge traditional views on tribocharging, provide new tools for probing it, and open up new avenues of research—all with the hopes of bringing us closer to understanding this puzzling phenomenon. acknowledged_ssus: - _id: M-Shop - _id: NanoFab - _id: EM-Fac - _id: LifeSc - _id: ScienComp acknowledgement: "The project in Chapter 2 has received funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 949120).\r\nThe project in Chapter 3 has received funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 949120).\r\nThe project in Chapter 4 has received financing from the European Research Council grant\r\nagreement No. 949120 under the European Union’s Horizon 2020 research and innovation\r\nprogramme. The Analytical Instrumentation Center of the TU Wien acknowledges support by\r\nthe FFG project ‘ELSA’ under grant no. 884672. C.M.P. and M.O. acknowledge the state\r\nof Lower Austria and the European Regional Development Fund under grant no. WST3-F542638/004-2021.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Juan Carlos A full_name: Sobarzo Ponce, Juan Carlos A id: 4B807D68-AE37-11E9-AC72-31CAE5697425 last_name: Sobarzo Ponce citation: ama: 'Sobarzo Ponce JCA. Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges. 2025. doi:10.15479/AT-ISTA-20203' apa: 'Sobarzo Ponce, J. C. A. (2025). Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20203' chicago: 'Sobarzo Ponce, Juan Carlos A. “Tribocharging of Identical Insulators: Triboelectric Series, Triboelectric Cycles and Surface Charges.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20203.' ieee: 'J. C. A. Sobarzo Ponce, “Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges,” Institute of Science and Technology Austria, 2025.' ista: 'Sobarzo Ponce JCA. 2025. Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges. Institute of Science and Technology Austria.' mla: 'Sobarzo Ponce, Juan Carlos A. Tribocharging of Identical Insulators: Triboelectric Series, Triboelectric Cycles and Surface Charges. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20203.' short: 'J.C.A. Sobarzo Ponce, Tribocharging of Identical Insulators: Triboelectric Series, Triboelectric Cycles and Surface Charges, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-08-21T11:42:59Z date_published: 2025-08-27T00:00:00Z date_updated: 2026-07-29T13:11:25Z day: '27' ddc: - '530' degree_awarded: PhD department: - _id: GradSch - _id: ScWa doi: 10.15479/AT-ISTA-20203 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 661b9d3786cfc985be811befc3262bf5 content_type: application/pdf creator: jsobarzo date_created: 2025-08-27T14:50:32Z date_updated: 2025-08-27T14:50:32Z file_id: '20237' file_name: 2025_Sobarzo_JuanCarlos_Thesis.pdf file_size: 12667200 relation: main_file success: 1 - access_level: closed checksum: ca2f24e6c3b55912982521707552a0f5 content_type: application/x-zip-compressed creator: jsobarzo date_created: 2025-08-27T14:50:32Z date_updated: 2025-08-28T08:19:07Z file_id: '20238' file_name: 2025_Sobarzo_JuanCarlos_Thesis.zip file_size: 18940521 relation: source_file file_date_updated: 2025-08-28T08:19:07Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '96' project: - _id: 0aa60e99-070f-11eb-9043-a6de6bdc3afa call_identifier: H2020 grant_number: '949120' name: 'Tribocharge: a multi-scale approach to an enduring problem in physics' publication_identifier: isbn: - 978-3-99078-062-6 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12109' relation: part_of_dissertation status: public - id: '15322' relation: part_of_dissertation status: public - id: '19278' relation: part_of_dissertation status: public status: public supervisor: - first_name: Scott R full_name: Waitukaitis, Scott R id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87 last_name: Waitukaitis orcid: 0000-0002-2299-3176 title: 'Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '18565' abstract: - lang: eng text: 'We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: We modify the input shape until it admits an overlap‐free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper.' acknowledgement: Researchers from INRIA received support from the DORNELL Inria Challenge. Silvia Sellán acknowledges support from NSERC Vanier Doctoral Scholarship and an MIT SoE Postdoctoral Fellowship for Engineering Excellence. article_number: e15269 article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Manas full_name: Bhargava, Manas id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425 last_name: Bhargava orcid: 0009-0007-6138-6890 - first_name: Camille full_name: Schreck, Camille id: 2B14B676-F248-11E8-B48F-1D18A9856A87 last_name: Schreck - first_name: M. full_name: Freire, M. last_name: Freire - first_name: P. A. full_name: Hugron, P. A. last_name: Hugron - first_name: S. full_name: Lefebvre, S. last_name: Lefebvre - first_name: S. full_name: Sellán, S. last_name: Sellán - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Bhargava M, Schreck C, Freire M, et al. Mesh simplification for unfolding. Computer Graphics Forum. 2025;44(1). doi:10.1111/cgf.15269 apa: Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., & Bickel, B. (2025). Mesh simplification for unfolding. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.15269 chicago: Bhargava, Manas, Camille Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, and Bernd Bickel. “Mesh Simplification for Unfolding.” Computer Graphics Forum. Wiley, 2025. https://doi.org/10.1111/cgf.15269. ieee: M. Bhargava et al., “Mesh simplification for unfolding,” Computer Graphics Forum, vol. 44, no. 1. Wiley, 2025. ista: Bhargava M, Schreck C, Freire M, Hugron PA, Lefebvre S, Sellán S, Bickel B. 2025. Mesh simplification for unfolding. Computer Graphics Forum. 44(1), e15269. mla: Bhargava, Manas, et al. “Mesh Simplification for Unfolding.” Computer Graphics Forum, vol. 44, no. 1, e15269, Wiley, 2025, doi:10.1111/cgf.15269. short: M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025). corr_author: '1' date_created: 2024-11-19T09:14:32Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-07-29T13:03:30Z day: '01' ddc: - '006' department: - _id: GradSch - _id: BeBi doi: 10.1111/cgf.15269 external_id: arxiv: - '2408.06944' isi: - '001357046100001' file: - access_level: open_access checksum: 34acdd9bfbe43f00eb6c7656afef3ac6 content_type: video/mp4 creator: mbhargav date_created: 2024-11-19T09:23:20Z date_updated: 2024-11-19T09:23:20Z file_id: '18567' file_name: Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4 file_size: 36999751 relation: main_file success: 1 - access_level: open_access checksum: efb06b01bae37f470954601bc004374d content_type: application/pdf creator: dernst date_created: 2025-04-16T09:06:45Z date_updated: 2025-04-16T09:06:45Z file_id: '19576' file_name: 2025_CompGraphicsForum_Bhargava.pdf file_size: 5188265 relation: main_file success: 1 file_date_updated: 2025-04-16T09:06:45Z has_accepted_license: '1' intvolume: ' 44' isi: 1 issue: '1' keyword: - fabrication - single patch unfolding - mesh simplification language: - iso: eng month: '02' oa: 1 oa_version: Published Version publication: Computer Graphics Forum publication_identifier: eissn: - 1467-8659 issn: - 0167-7055 publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '20276' relation: dissertation_contains status: public scopus_import: '1' status: public title: Mesh simplification for unfolding tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 44 year: '2025' ... --- OA_place: repository _id: '20286' abstract: - lang: eng 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." 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)." article_processing_charge: No arxiv: 1 author: - first_name: Manas full_name: Bhargava, Manas id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425 last_name: Bhargava orcid: 0009-0007-6138-6890 - first_name: Takefumi full_name: Hiraki, Takefumi last_name: Hiraki - first_name: Irina-Malina full_name: Strugaru, Irina-Malina id: 2afc607f-f128-11eb-9611-8f2a0dfcf074 last_name: Strugaru - first_name: Yuhan full_name: Zhang, Yuhan last_name: Zhang - first_name: Michael full_name: Piovarci, Michael id: 62E473F4-5C99-11EA-A40E-AF823DDC885E last_name: Piovarci orcid: 0000-0002-5062-4474 - first_name: Chiara full_name: Daraio, Chiara last_name: Daraio - first_name: Daisuke full_name: Iwai, Daisuke last_name: Iwai - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: 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 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 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. ieee: M. Bhargava et al., “Computational design and fabrication of modular robots with untethered control,” arXiv. . 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. mla: Bhargava, Manas, 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.). corr_author: '1' date_created: 2025-09-04T09:14:11Z date_published: 2025-08-31T00:00:00Z date_updated: 2026-07-29T13:03:30Z day: '31' department: - _id: BeBi doi: 10.48550/arXiv.2508.05410 ec_funded: 1 external_id: arxiv: - '2508.05410' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2508.05410 month: '08' oa: 1 oa_version: Preprint project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: arXiv publication_status: draft related_material: record: - id: '20276' relation: dissertation_contains status: public status: public title: Computational design and fabrication of modular robots with untethered control tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher _id: '20371' 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" acknowledged_ssus: - _id: NanoFab - _id: M-Shop 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Andrea full_name: Trioni, Andrea id: 42F71B44-F248-11E8-B48F-1D18A9856A87 last_name: Trioni citation: ama: 'Trioni A. High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. 2025. doi:10.15479/AT-ISTA-20371' 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' 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.' ieee: 'A. Trioni, “High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains,” Institute of Science and Technology Austria, 2025.' ista: 'Trioni A. 2025. High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. Institute of Science and Technology Austria.' 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.' short: 'A. Trioni, High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-09-23T09:57:57Z date_published: 2025-09-23T00:00:00Z date_updated: 2026-07-29T13:12:10Z day: '23' ddc: - '539' degree_awarded: PhD department: - _id: GradSch - _id: JoFi doi: 10.15479/AT-ISTA-20371 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 6fb925648dfa5f4384814c552ee2f099 content_type: application/pdf creator: atrioni date_created: 2025-09-25T07:15:05Z date_updated: 2025-09-25T14:25:31Z file_id: '20392' file_name: 2025_Trioni_Andrea_Thesis.pdf file_size: 22351676 relation: main_file - access_level: closed checksum: 619dc614bdfbf3999b76ac8890b2cebd content_type: application/x-zip-compressed creator: atrioni date_created: 2025-09-25T14:45:43Z date_updated: 2025-09-26T07:20:48Z file_id: '20396' file_name: 2025_Trioni_Andrea_Thesis.zip file_size: 60079009 relation: source_file file_date_updated: 2025-09-26T07:20:48Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '202' project: - _id: eb9b30ac-77a9-11ec-83b8-871f581d53d2 name: Protected states of quantum matter - _id: bdb108fd-d553-11ed-ba76-83dc74a9864f grant_number: F07105 name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: isbn: - 978-3-99078-067-1 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8755' relation: part_of_dissertation status: public status: public supervisor: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X title: 'High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '20008' 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.' 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. article_processing_charge: Yes (in subscription journal) author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov orcid: 0000-0002-7840-5062 - first_name: Marek full_name: Filakovský, Marek id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87 last_name: Filakovský - first_name: Jakub full_name: Opršal, Jakub id: ec596741-c539-11ec-b829-c79322a91242 last_name: Opršal orcid: 0000-0003-1245-3456 - first_name: Gianluca full_name: Tasinato, Gianluca id: 0433290C-AF8F-11E9-A4C7-F729E6697425 last_name: Tasinato - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: 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' 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' 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. 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.' 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. 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. conference: end_date: 2025-06-27 location: Prague, Czechia name: 'STOC: Symposium on Theory of Computing' start_date: 2025-06-23 corr_author: '1' date_created: 2025-07-13T22:01:23Z date_published: 2025-06-15T00:00:00Z date_updated: 2026-07-29T13:13:17Z day: '15' ddc: - '000' department: - _id: UlWa doi: 10.1145/3717823.3718154 ec_funded: 1 file: - access_level: open_access checksum: 2c9ae7ad0102c41124976f4cb5182760 content_type: application/pdf creator: dernst date_created: 2025-07-14T06:42:58Z date_updated: 2025-07-14T06:42:58Z file_id: '20013' file_name: 2025_STOC_Avvakumov.pdf file_size: 940827 relation: main_file success: 1 file_date_updated: 2025-07-14T06:42:58Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 72-83 project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Proceedings of the 57th Annual ACM Symposium on Theory of Computing publication_identifier: isbn: - '9798400715105' issn: - 0737-8017 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '20339' relation: dissertation_contains status: public scopus_import: '1' status: public title: Hardness of 4-colouring G-colourable graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '20339' abstract: - lang: eng text: "This thesis investigates the interplay between algebraic and topological methods and combinatorial problems, focusing on approximate graph colourings and mass partitioning. The unifying theme throughout the dissertation is the use of continuous maps and symmetry constraints to extract combinatorial insights.\r\n\r\nWe first explore approximate graph colouring problems and more generally promise constraint satisfaction problems. Using tools from equivariant topology in combination with the general theory of polymorphism of a promise constraint satisfaction problem, we establish hardness for specific types of approximations.\r\n\r\nIn the second part, we address mass partitioning problems, where one seeks to divide geometric objects or measures in Euclidean space into parts of equal size using hyperplanes. Employing techniques from topological combinatorics (configuration space/test map setup and Borsuk–Ulam type theorems), we both obtain a new equipartitioning result in the and provide a fast algorithm for computing equipartitioning of point sets in 3D.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Gianluca full_name: Tasinato, Gianluca id: 0433290C-AF8F-11E9-A4C7-F729E6697425 last_name: Tasinato citation: ama: 'Tasinato G. Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems. 2025. doi:10.15479/AT-ISTA-20339' apa: 'Tasinato, G. (2025). Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20339' chicago: 'Tasinato, Gianluca. “Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20339.' ieee: 'G. Tasinato, “Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems,” Institute of Science and Technology Austria, 2025.' ista: 'Tasinato G. 2025. Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems. Institute of Science and Technology Austria.' mla: 'Tasinato, Gianluca. Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20339.' short: 'G. Tasinato, Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-09-10T12:17:55Z date_published: 2025-09-10T00:00:00Z date_updated: 2026-07-29T13:13:18Z day: '10' ddc: - '516' degree_awarded: PhD department: - _id: GradSch - _id: UlWa doi: 10.15479/AT-ISTA-20339 doi_confirm: '1' file: - access_level: closed checksum: ae097a515b9bb4d4b025ca854ae2ed76 content_type: application/x-zip-compressed creator: gtasinat date_created: 2025-09-11T12:24:12Z date_updated: 2025-09-11T12:24:12Z file_id: '20344' file_name: thesis-source.zip file_size: 2218562 relation: source_file - access_level: open_access checksum: 04b2e016409e52167ce42b0eef839fbf content_type: application/pdf creator: gtasinat date_created: 2025-09-11T12:26:14Z date_updated: 2025-09-11T12:26:14Z file_id: '20345' file_name: 2025_Tasinato_Gianluca_Thesis.pdf file_size: 10071982 relation: main_file success: 1 file_date_updated: 2025-09-11T12:26:14Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '09' oa: 1 oa_version: Published Version page: '106' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20008' relation: part_of_dissertation status: public - id: '15168' relation: part_of_dissertation status: public - id: '19860' relation: part_of_dissertation status: public status: public supervisor: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 title: 'Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher _id: '20234' abstract: - lang: eng text: "Game Theory is the mathematical formalization of social dynamics - systems where agents interact over time and the evolution of the state of the system depends on the decisions of every player. \r\nThis thesis takes the perspective of a single player and focuses on what they can guarantee in the worst case over the behavior of other players.\r\nIn other words, we consider that the objective of every other player in the game is exactly the opposite to the player.\r\nWe focus on sustained interactions over time, where the players repeatedly obtain quantitative rewards over time, and they are interested in maximizing their long-term performance.\t\r\nFormally, this thesis focuses on zero-sum games with the liminf average objective.\r\nTwo fundamental questions that Game Theory aims to answer are the following.\r\n\r\n1. How much can a player guarantee to obtain after the interaction?\r\n\r\n2. How to act in order to obtain the previously mentioned guarantee?\r\n\r\nThese questions are formalized by the concepts of \"value\" and \"optimal strategies\". \t\r\nWe study their properties on games that exhibit one or more of the following properties. \r\n\r\n1. Partial Observation: \r\nthe players can not perfectly observe the current state of the system during the game. We consider the model of (finite) Partially Observable Markov Decision Processes and prove that finite-memory strategies are sufficient to approximately guarantee the value.\r\n\r\n2. Perturbed Description: \r\nthe formal description of the game is perturbed by a small parameter.\r\nWe consider the model of (finite) Perturbed Matrix Games, and provide algorithms to check various robustness properties and to compute the parameterized value and optimal strategies.\r\n\r\n3. Stochastic Transitions: \r\nthe actions of the players determine the behavior of the evolution of the system, described as a probability distribution over the next state.\r\nWe consider the model of (finite) Perturbed Stochastic Games and provide formulas for the marginal value.\r\n\r\n4. Infinite States: \r\nthe system can be in infinitely many states.\r\nWe consider the model of Random Dynamic Games on a class of infinite graphs, prove the existence of the value, and quantify the concentration of finite-horizon values." acknowledgement: "Funding sources The works included in this thesis were partially supported by:\r\n• Austrian Science Fund (FWF), grants 10.55776/COE12 and No RiSE/SHiNE S11407,\r\n• French Agence Nationale de la Recherche (ANR), grants ANR-21-CE40-0020 (CONVERGENCE) and ANR-20-CE40-0002 (GrHyDy),\r\n• Fondation Mathématique Jaques Hadamard, grant PGMO RSG 2018-0031H,\r\n• European Research Council (ERC), Consolidator grant 863818 (ForM-SMArt),\r\n• Agencia Nacional de Investigación y Desarrollo (ANID Chile), grant ACT210005,\r\n• Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt Chile), grant 1220174,\r\n• Comisión Nacional de Investigación Científica y Tecnológica (CONICYT Chile), grant\r\nPII 20150140,\r\n• Evaluation-orientation de la Coopération Scientifique and Comisión Nacional de Investigación Científica y Tecnológica (ECOS-CONICYT), grant C15E03,\r\n• European Cooperation in Science and Technology (E-COST), grants CA16228 - European\r\nNetwork for Game Theory (GAMENET) and E-COST-GRANT-CA16228-c5a69859.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X citation: ama: 'Saona Urmeneta RJ. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. 2025. doi:10.15479/AT-ISTA-20234' apa: 'Saona Urmeneta, R. J. (2025). Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20234' chicago: 'Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20234.' ieee: 'R. J. Saona Urmeneta, “Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games,” Institute of Science and Technology Austria, 2025.' ista: 'Saona Urmeneta RJ. 2025. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria.' mla: 'Saona Urmeneta, Raimundo J. Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20234.' short: 'R.J. Saona Urmeneta, Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-08-27T14:00:13Z date_published: 2025-08-27T00:00:00Z date_updated: 2026-07-29T13:14:37Z day: '27' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/AT-ISTA-20234 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: 394a651f7de7085e509ef856ffe7bd97 content_type: application/pdf creator: rsaonaur date_created: 2025-08-28T14:47:07Z date_updated: 2025-08-28T14:47:07Z file_id: '20240' file_name: 2025_Saona_Raimundo_Thesis.pdf file_size: 1503623 relation: main_file success: 1 - access_level: closed checksum: 09fb2633e66aac80433d373f4180c5b4 content_type: application/zip creator: rsaonaur date_created: 2025-08-28T14:47:12Z date_updated: 2025-08-28T14:47:12Z file_id: '20241' file_name: 2025_Saona_Raimundo_Thesis.zip file_size: 622747 relation: source_file file_date_updated: 2025-08-28T14:47:12Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '125' project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9311' relation: part_of_dissertation status: public - id: '18266' relation: part_of_dissertation status: public - id: '19508' relation: part_of_dissertation status: public - id: '17037' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: 'Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '19508' abstract: - lang: eng text: We consider random two-player zero-sum dynamic games with perfect information on a class of infinite directed graphs. Starting from a fixed vertex, the players take turns to move a token along the edges of the graph. Every vertex is assigned a payoff known in advance by both players. Every time the token visits a vertex, Player 2 pays Player 1 the corresponding payoff. We consider a distribution over such games by assigning i.i.d. payoffs to the vertices. On the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that, when the duration of the game tends to infinity, the value converges almost surely to a constant at an exponential rate dominated in terms of the expansion. On the other hand, for the infinite d-ary tree (that does not fall into the previous class of graphs), we show convergence at a double-exponential rate. acknowledgement: Open access funding provided by Institute of Science and Technology (IST Austria). This work was supported by the French Agence Nationale de la Recherche (ANR) under references ANR-21-CE40-0020 (CONVERGENCE project) and ANR-20-CE40-0002 (GrHyDy), by Fondecyt grant 1220174, by ANID Chile grant ACT210005, and by the ERC CoG 863818 (ForM-SMArt) grant. This collaboration was mainly conducted during a 1-year visit of Bruno Ziliotto to the Center for Mathematical Modeling (CMM) at University of Chile in 2023, under the IRL program of CNRS. This work was supported by Fondation CFM pour la Recherche. This paper has also been funded by the Agence Nationale de la Recherche under grant ANR-17-EURE-0010 (Investissements d’Avenir program). article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Luc full_name: Attia, Luc last_name: Attia - first_name: Lyuben full_name: Lichev, Lyuben id: 9aa8388e-d003-11ee-8458-c4c1d7447977 last_name: Lichev - first_name: Dieter full_name: Mitsche, Dieter last_name: Mitsche - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X - first_name: Bruno full_name: Ziliotto, Bruno last_name: Ziliotto citation: ama: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 2025;15:1517-1535. doi:10.1007/s13235-025-00636-4 apa: Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (2025). Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00636-4 chicago: Attia, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications. Springer Nature, 2025. https://doi.org/10.1007/s13235-025-00636-4. ieee: L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Random zero-sum dynamic games on infinite directed graphs,” Dynamic Games and Applications, vol. 15. Springer Nature, pp. 1517–1535, 2025. ista: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. 2025. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 15, 1517–1535. mla: Attia, Luc, et al. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications, vol. 15, Springer Nature, 2025, pp. 1517–35, doi:10.1007/s13235-025-00636-4. short: L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications 15 (2025) 1517–1535. corr_author: '1' date_created: 2025-04-06T22:01:32Z date_published: 2025-11-01T00:00:00Z date_updated: 2026-07-29T13:14:36Z day: '01' ddc: - '000' department: - _id: MaKw - _id: KrCh doi: 10.1007/s13235-025-00636-4 ec_funded: 1 external_id: isi: - '001449708900001' file: - access_level: open_access checksum: b3a1b7eef40c9ac2acf3fef563081694 content_type: application/pdf creator: dernst date_created: 2025-12-30T08:13:04Z date_updated: 2025-12-30T08:13:04Z file_id: '20891' file_name: 2025_DynGamesAppl_Attia.pdf file_size: 570994 relation: main_file success: 1 file_date_updated: 2025-12-30T08:13:04Z has_accepted_license: '1' intvolume: ' 15' isi: 1 language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 1517-1535 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Dynamic Games and Applications publication_identifier: eissn: - 2153-0793 issn: - 2153-0785 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '20234' relation: dissertation_contains status: public scopus_import: '1' status: public title: Random zero-sum dynamic games on infinite directed graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2025' ... --- OA_type: closed access _id: '17037' abstract: - lang: eng text: Zero-sum stochastic games are parameterized by payoffs, transitions, and possibly a discount rate. In this article, we study how the main solution concepts, the discounted and undiscounted values, vary when these parameters are perturbed. We focus on the marginal values, introduced by Mills in 1956 in the context of matrix games—that is, the directional derivatives of the value along any fixed perturbation. We provide a formula for the marginal values of a discounted stochastic game. Further, under mild assumptions on the perturbation, we provide a formula for their limit as the discount rate vanishes and for the marginal values of an undiscounted stochastic game. We also show, via an example, that the two latter differ in general. acknowledgement: This work was supported by Fondation CFM pour la Recherche; the European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)]; and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020]. article_processing_charge: No article_type: original author: - first_name: Luc full_name: Attia, Luc last_name: Attia - first_name: Miquel full_name: Oliu-Barton, Miquel last_name: Oliu-Barton - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X citation: ama: Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. Mathematics of Operations Research. 2025;50(1):482-505. doi:10.1287/moor.2023.0297 apa: Attia, L., Oliu-Barton, M., & Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2023.0297 chicago: Attia, Luc, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Marginal Values of a Stochastic Game.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2025. https://doi.org/10.1287/moor.2023.0297. ieee: L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” Mathematics of Operations Research, vol. 50, no. 1. Institute for Operations Research and the Management Sciences, pp. 482–505, 2025. ista: Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505. mla: Attia, Luc, et al. “Marginal Values of a Stochastic Game.” Mathematics of Operations Research, vol. 50, no. 1, Institute for Operations Research and the Management Sciences, 2025, pp. 482–505, doi:10.1287/moor.2023.0297. short: L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505. das_tickbox: '1' date_created: 2024-05-22T11:41:14Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-07-29T13:14:36Z day: '01' department: - _id: GradSch - _id: KrCh doi: 10.1287/moor.2023.0297 ec_funded: 1 external_id: isi: - '001184648000001' intvolume: ' 50' isi: 1 issue: '1' language: - iso: eng month: '02' oa_version: None page: 482-505 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Mathematics of Operations Research publication_identifier: eissn: - 1526-5471 issn: - 0364-765X publication_status: published publisher: Institute for Operations Research and the Management Sciences quality_controlled: '1' related_material: record: - id: '20234' relation: dissertation_contains status: public scopus_import: '1' status: public title: Marginal values of a stochastic game type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 50 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '18112' 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.' 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. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X citation: 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 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 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. 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. ista: Henheik SJ. 2025. Deformational rigidity of integrable metrics on the torus. Ergodic Theory and Dynamical Systems. 45(2), 467–503. 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. short: S.J. Henheik, Ergodic Theory and Dynamical Systems 45 (2025) 467–503. corr_author: '1' date_created: 2024-09-22T22:01:43Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-07-29T13:18:16Z day: '01' ddc: - '510' department: - _id: LaEr doi: 10.1017/etds.2024.48 ec_funded: 1 external_id: isi: - '001308182000001' file: - access_level: open_access checksum: 650fe115d998fe0ac3a8d0c7519447c8 content_type: application/pdf creator: dernst date_created: 2025-01-13T08:51:40Z date_updated: 2025-01-13T08:51:40Z file_id: '18828' file_name: 2025_ErgodicTheory_Henheik.pdf file_size: 659100 relation: main_file success: 1 file_date_updated: 2025-01-13T08:51:40Z has_accepted_license: '1' intvolume: ' 45' isi: 1 issue: '2' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 467-503 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication: Ergodic Theory and Dynamical Systems publication_identifier: eissn: - 1469-4417 issn: - 0143-3857 publication_status: published publisher: Cambridge University Press quality_controlled: '1' related_material: record: - id: '19540' relation: dissertation_contains status: public scopus_import: '1' status: public title: Deformational rigidity of integrable metrics on the torus tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 45 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19001' 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. 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. article_number: '14' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Oleksii full_name: Kolupaiev, Oleksii id: 149b70d4-896a-11ed-bdf8-8c63fd44ca61 last_name: Kolupaiev orcid: 0000-0003-1491-4623 citation: 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 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 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. 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. ista: Erdös L, Henheik SJ, Kolupaiev O. 2025. Loschmidt echo for deformed Wigner matrices. Letters in Mathematical Physics. 115, 14. 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. short: L. Erdös, S.J. Henheik, O. Kolupaiev, Letters in Mathematical Physics 115 (2025). corr_author: '1' date_created: 2025-02-05T06:48:29Z date_published: 2025-01-30T00:00:00Z date_updated: 2026-07-29T13:18:16Z day: '30' ddc: - '510' department: - _id: LaEr doi: 10.1007/s11005-025-01904-5 ec_funded: 1 external_id: arxiv: - '2410.08108' isi: - '001409618800002' pmid: - '39896265' file: - access_level: open_access checksum: ee07edf5f85a6f2651926b2f8760af74 content_type: application/pdf creator: dernst date_created: 2025-02-05T07:01:40Z date_updated: 2025-02-05T07:01:40Z file_id: '19004' file_name: 2025_LettersMathPhysics_Erdoes.pdf file_size: 828335 relation: main_file success: 1 file_date_updated: 2025-02-05T07:01:40Z has_accepted_license: '1' intvolume: ' 115' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Letters in Mathematical Physics publication_identifier: issn: - 1573-0530 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19540' relation: dissertation_contains status: public scopus_import: '1' status: public title: Loschmidt echo for deformed Wigner matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 115 year: '2025' ... --- OA_place: repository _id: '19546' abstract: - lang: eng text: "We study the sensitivity of the eigenvectors of random matrices, showing that\r\neven small perturbations make the eigenvectors almost orthogonal. More\r\nprecisely, we consider two deformed Wigner matrices $W+D_1$, $W+D_2$ and show\r\nthat their bulk eigenvectors become asymptotically orthogonal as soon as\r\n$\\mathrm{Tr}(D_1-D_2)^2\\gg 1$, or their respective energies are separated on a\r\nscale much bigger than the local eigenvalue spacing. Furthermore, we show that\r\nquadratic forms of eigenvectors of $W+D_1$, $W+D_2$ with any deterministic\r\nmatrix $A\\in\\mathbf{C}^{N\\times N}$ in a specific subspace of codimension one\r\nare of size $N^{-1/2}$. This proves a generalization of the Eigenstate\r\nThermalization Hypothesis to eigenvectors belonging to two different spectral\r\nfamilies." acknowledgement: Supported by the ERC Advanced Grant “RMTBeyond” No. 101020331. article_processing_charge: No arxiv: 1 author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Oleksii full_name: Kolupaiev, Oleksii id: 149b70d4-896a-11ed-bdf8-8c63fd44ca61 last_name: Kolupaiev orcid: 0000-0003-1491-4623 citation: ama: Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. Eigenvector decorrelation for random matrices. arXiv. doi:10.48550/arXiv.2410.10718 apa: Cipolloni, G., Erdös, L., Henheik, S. J., & Kolupaiev, O. (n.d.). Eigenvector decorrelation for random matrices. arXiv. https://doi.org/10.48550/arXiv.2410.10718 chicago: Cipolloni, Giorgio, László Erdös, Sven Joscha Henheik, and Oleksii Kolupaiev. “Eigenvector Decorrelation for Random Matrices.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2410.10718. ieee: G. Cipolloni, L. Erdös, S. J. Henheik, and O. Kolupaiev, “Eigenvector decorrelation for random matrices,” arXiv. . ista: Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. Eigenvector decorrelation for random matrices. arXiv, 10.48550/arXiv.2410.10718. mla: Cipolloni, Giorgio, et al. “Eigenvector Decorrelation for Random Matrices.” ArXiv, doi:10.48550/arXiv.2410.10718. short: G. Cipolloni, L. Erdös, S.J. Henheik, O. Kolupaiev, ArXiv (n.d.). corr_author: '1' date_created: 2025-04-11T08:34:49Z date_published: 2025-01-30T00:00:00Z date_updated: 2026-07-29T13:18:16Z day: '30' department: - _id: LaEr doi: 10.48550/arXiv.2410.10718 ec_funded: 1 external_id: arxiv: - '2410.10718' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2410.10718 month: '01' oa: 1 oa_version: Preprint project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: arXiv publication_status: draft related_material: record: - id: '19540' relation: dissertation_contains status: public status: public title: Eigenvector decorrelation for random matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher _id: '19540' abstract: - lang: eng text: "This thesis deals with several different models for complex quantum mechanical systems and is structured in three main parts. \r\n\t\r\nIn Part I, we study mean field random matrices as models for quantum Hamiltonians. Our focus lies on proving concentration estimates for resolvents of random matrices, so-called local laws, mostly in the setting of multiple resolvents. These estimates have profound consequences for eigenvector overlaps and thermalization problems. More concretely, we obtain, e.g., the optimal eigenstate thermalization hypothesis (ETH) uniformly in the spectrum for Wigner matrices, an optimal lower bound on non-Hermitian eigenvector overlaps, and prethermalization for deformed Wigner matrices.\tIn order to prove our novel multi-resolvent local laws, we develop and devise two main methods, the static Psi-method and the dynamical Zigzag strategy. \r\n\t\r\nIn Part II, we study Bardeen-Cooper-Schrieffer (BCS) theory, the standard mean field microscopic theory of superconductivity. We focus on asymptotic formulas for the characteristic critical temperature and energy gap of a superconductor and prove universality of their ratio in various physical regimes. Additionally, we investigate multi-band superconductors and show that inter-band coupling effects can only enhance the critical temperature. \r\n\t\r\nIn Part III, we study quantum lattice systems. On the one hand, we show a strong version of the local-perturbations-perturb-locally (LPPL) principle for the ground state of weakly interacting quantum spin systems with a uniform on-site gap. On the other hand, we introduce a notion of a local gap and rigorously justify response theory and the Kubo formula under the weakened assumption of a local gap. \r\n\t\r\nAdditionally, we discuss two classes of problems which do not fit into the three main parts of the thesis. These are deformational rigidity of Liouville metrics on the torus and relativistic toy models of particle creation via interior-boundary-conditions (IBCs). " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X citation: ama: 'Henheik SJ. Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems. 2025. doi:10.15479/AT-ISTA-19540' apa: 'Henheik, S. J. (2025). Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19540' chicago: 'Henheik, Sven Joscha. “Modeling Complex Quantum Systems: Random Matrices, BCS Theory, and Quantum Lattice Systems.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19540.' ieee: 'S. J. Henheik, “Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems,” Institute of Science and Technology Austria, 2025.' ista: 'Henheik SJ. 2025. Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems. Institute of Science and Technology Austria.' mla: 'Henheik, Sven Joscha. Modeling Complex Quantum Systems: Random Matrices, BCS Theory, and Quantum Lattice Systems. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19540.' short: 'S.J. Henheik, Modeling Complex Quantum Systems: Random Matrices, BCS Theory, and Quantum Lattice Systems, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-04-10T21:21:18Z date_published: 2025-04-10T00:00:00Z date_updated: 2026-07-29T13:18:17Z day: '10' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/AT-ISTA-19540 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: b8477ae5578436c72c3bb4193ad34ac5 content_type: application/zip creator: shenheik date_created: 2025-04-10T21:14:18Z date_updated: 2025-04-10T21:14:18Z file_id: '19542' file_name: Henheik-Thesis_source_final.zip file_size: 4107587 relation: source_file - access_level: open_access checksum: e9fc0ea12ec46c9f71110c33217c4140 content_type: application/pdf creator: shenheik date_created: 2025-04-11T13:16:05Z date_updated: 2025-04-11T13:16:05Z file_id: '19553' file_name: Henheik-Thesis-pdfa_FINAL.pdf file_size: 9999492 relation: main_file success: 1 - access_level: closed checksum: f94580f86c785e7108eb116cd189e225 content_type: application/pdf creator: cchlebak date_created: 2025-04-23T14:10:27Z date_updated: 2025-04-23T14:10:27Z file_id: '19615' file_name: Henheik-Thesis-Volume1_print.pdf file_size: 13276442 relation: other - access_level: closed checksum: b927ead3c78020ffb32918911deedb74 content_type: application/pdf creator: cchlebak date_created: 2025-04-23T14:11:05Z date_updated: 2025-04-23T14:11:05Z file_id: '19616' file_name: Henheik-Thesis-Volume2_print.pdf file_size: 7628767 relation: other file_date_updated: 2025-04-23T14:11:05Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '720' project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication_identifier: isbn: - 978-3-99078-057-2 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '14343' relation: part_of_dissertation status: public - id: '13317' relation: part_of_dissertation status: public - id: '11732' relation: part_of_dissertation status: public - id: '12184' relation: part_of_dissertation status: public - id: '14421' relation: part_of_dissertation status: public - id: '10623' relation: part_of_dissertation status: public - id: '18112' relation: part_of_dissertation status: public - id: '19001' relation: part_of_dissertation status: public - id: '10642' relation: part_of_dissertation status: public - id: '19545' relation: part_of_dissertation status: public - id: '19546' relation: part_of_dissertation status: public - id: '19550' relation: part_of_dissertation status: public - id: '19551' relation: part_of_dissertation status: public - id: '19552' relation: part_of_dissertation status: public - id: '14542' relation: part_of_dissertation status: public - id: '17049' relation: part_of_dissertation status: public - id: '18764' relation: part_of_dissertation status: public - id: '19547' relation: part_of_dissertation status: public - id: '19548' relation: part_of_dissertation status: public - id: '18656' relation: part_of_dissertation status: public status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: 'Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '19548' abstract: - lang: eng text: "We consider the BCS energy gap „.T / (essentially given by „.T / \x19 \x81.T; p\x16/,\r\nthe BCS order parameter) at all temperatures 0 \x14 T \x14 Tc up to the critical one, Tc, and show\r\nthat, in the limit of weak coupling, the ratio „.T /=Tc is given by a universal function of the relative temperature T =Tc. On the one hand, this recovers a recent result by Langmann and Triola\r\n[Phys. Rev. B 108 (2023), no. 10, article no. 104503] on three-dimensional s-wave superconductors for temperatures bounded uniformly away from Tc. On the other hand, our result lifts these\r\nrestrictions, as we consider arbitrary spatial dimensions d 2 ¹1; 2; 3º, discuss superconductors\r\nwith non-zero angular momentum (primarily in two dimensions), and treat the perhaps physically most interesting (due to the occurrence of the superconducting phase transition) regime of\r\ntemperatures close to Tc.\r\n\r\n​\r\n ." acknowledgement: "We thank Andreas Deuchert, Christian Hainzl, Edwin Langmann, Marius Lemm, Robert Seiringer, and Jan Philip Solovej for helpful discussions,\r\nand Edwin Langmann and Robert Seiringer for valuable comments on an earlier version of the manuscript.\r\nFunding. Joscha Henheik gratefully acknowledges partial financial support by the\r\nERC Advanced Grant “RMTBeyond” No. 101020331. Asbjørn Bækgaard Lauritsen\r\ngratefully acknowledges partial financial support by the Austrian Science Fund (FWF)\r\nthrough grant DOI 10.55776/I6427 (as part of the SFB/TRR 352).\r\n" article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Asbjørn Bækgaard full_name: Lauritsen, Asbjørn Bækgaard id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1 last_name: Lauritsen orcid: 0000-0003-4476-2288 citation: ama: Henheik SJ, Lauritsen AB. Universal behavior of the BCS energy gap. Journal of Spectral Theory. 2025;15(1):305–352. doi:10.4171/JST/540 apa: Henheik, S. J., & Lauritsen, A. B. (2025). Universal behavior of the BCS energy gap. Journal of Spectral Theory. EMS Press. https://doi.org/10.4171/JST/540 chicago: Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “Universal Behavior of the BCS Energy Gap.” Journal of Spectral Theory. EMS Press, 2025. https://doi.org/10.4171/JST/540. ieee: S. J. Henheik and A. B. Lauritsen, “Universal behavior of the BCS energy gap,” Journal of Spectral Theory, vol. 15, no. 1. EMS Press, pp. 305–352, 2025. ista: Henheik SJ, Lauritsen AB. 2025. Universal behavior of the BCS energy gap. Journal of Spectral Theory. 15(1), 305–352. mla: Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “Universal Behavior of the BCS Energy Gap.” Journal of Spectral Theory, vol. 15, no. 1, EMS Press, 2025, pp. 305–352, doi:10.4171/JST/540. short: S.J. Henheik, A.B. Lauritsen, Journal of Spectral Theory 15 (2025) 305–352. corr_author: '1' date_created: 2025-04-11T09:19:28Z date_published: 2025-01-09T00:00:00Z date_updated: 2026-07-29T13:18:17Z day: '09' ddc: - '500' department: - _id: LaEr - _id: RoSe doi: 10.4171/JST/540 ec_funded: 1 external_id: arxiv: - '2312.11310' isi: - '001438931600009' file: - access_level: open_access checksum: f49e06e8dba819f7ad52a202e287ebca content_type: application/pdf creator: cchlebak date_created: 2025-04-11T09:13:31Z date_updated: 2025-04-11T09:13:31Z file_id: '19549' file_name: Henheik_JSpectralTheory_2025.pdf file_size: 779158 relation: main_file success: 1 file_date_updated: 2025-04-11T09:13:31Z has_accepted_license: '1' intvolume: ' 15' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 305–352 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta - _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b grant_number: I06427 name: Mathematical Challenges in BCS Theory of Superconductivity publication: Journal of Spectral Theory publication_identifier: eissn: - 1664-0403 publication_status: published publisher: EMS Press quality_controlled: '1' related_material: record: - id: '19540' relation: dissertation_contains status: public scopus_import: '1' status: public title: Universal behavior of the BCS energy gap tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2025' ...