[{"day":"25","type":"journal_article","citation":{"apa":"Li, L., Chen, H., Alotaibi, S. S., Pěnčík, A., Adamowski, M., Novák, O., &#38; Friml, J. (2022). RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2121058119\">https://doi.org/10.1073/pnas.2121058119</a>","chicago":"Li, Lanxin, Huihuang Chen, Saqer S. Alotaibi, Aleš Pěnčík, Maciek Adamowski, Ondřej Novák, and Jiří Friml. “RALF1 Peptide Triggers Biphasic Root Growth Inhibition Upstream of Auxin Biosynthesis.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2121058119\">https://doi.org/10.1073/pnas.2121058119</a>.","ista":"Li L, Chen H, Alotaibi SS, Pěnčík A, Adamowski M, Novák O, Friml J. 2022. RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. Proceedings of the National Academy of Sciences. 119(31), e2121058119.","ama":"Li L, Chen H, Alotaibi SS, et al. RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis. <i>Proceedings of the National Academy of Sciences</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2121058119\">10.1073/pnas.2121058119</a>","ieee":"L. Li <i>et al.</i>, “RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 119, no. 31. Proceedings of the National Academy of Sciences, 2022.","short":"L. Li, H. Chen, S.S. Alotaibi, A. Pěnčík, M. Adamowski, O. Novák, J. Friml, Proceedings of the National Academy of Sciences 119 (2022).","mla":"Li, Lanxin, et al. “RALF1 Peptide Triggers Biphasic Root Growth Inhibition Upstream of Auxin Biosynthesis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 119, no. 31, e2121058119, Proceedings of the National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2121058119\">10.1073/pnas.2121058119</a>."},"doi":"10.1073/pnas.2121058119","quality_controlled":"1","oa_version":"Published Version","intvolume":"       119","article_number":"e2121058119","article_type":"original","issue":"31","volume":119,"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)"},"abstract":[{"text":"Plant cell growth responds rapidly to various stimuli, adapting architecture to environmental changes. Two major endogenous signals regulating growth are the phytohormone auxin and the secreted peptides rapid alkalinization factors (RALFs). Both trigger very rapid cellular responses and also exert long-term effects [Du et al., Annu. Rev. Plant Biol. 71, 379–402 (2020); Blackburn et al., Plant Physiol. 182, 1657–1666 (2020)]. However, the way, in which these distinct signaling pathways converge to regulate growth, remains unknown. Here, using vertical confocal microscopy combined with a microfluidic chip, we addressed the mechanism of RALF action on growth. We observed correlation between RALF1-induced rapid Arabidopsis thaliana root growth inhibition and apoplast alkalinization during the initial phase of the response, and revealed that RALF1 reversibly inhibits primary root growth through apoplast alkalinization faster than within 1 min. This rapid apoplast alkalinization was the result of RALF1-induced net H+ influx and was mediated by the receptor FERONIA (FER). Furthermore, we investigated the cross-talk between RALF1 and the auxin signaling pathways during root growth regulation. The results showed that RALF-FER signaling triggered auxin signaling with a delay of approximately 1 h by up-regulating auxin biosynthesis, thus contributing to sustained RALF1-induced growth inhibition. This biphasic RALF1 action on growth allows plants to respond rapidly to environmental stimuli and also reprogram growth and development in the long term.","lang":"eng"}],"title":"RALF1 peptide triggers biphasic root growth inhibition upstream of auxin biosynthesis","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2022-08-04T20:06:49Z","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"has_accepted_license":"1","publisher":"Proceedings of the National Academy of Sciences","file_date_updated":"2022-08-08T07:42:09Z","pmid":1,"publication":"Proceedings of the National Academy of Sciences","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"file_size":2506262,"checksum":"ae6f19b0d9efba6687f9e4dc1bab1d6e","date_created":"2022-08-08T07:42:09Z","file_name":"2022_PNAS_Li.pdf","access_level":"open_access","creator":"dernst","date_updated":"2022-08-08T07:42:09Z","file_id":"11747"}],"month":"07","author":[{"id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin","first_name":"Lanxin"},{"last_name":"Chen","id":"83c96512-15b2-11ec-abd3-b7eede36184f","full_name":"Chen, Huihuang","first_name":"Huihuang"},{"first_name":"Saqer S.","full_name":"Alotaibi, Saqer S.","last_name":"Alotaibi"},{"last_name":"Pěnčík","full_name":"Pěnčík, Aleš","first_name":"Aleš"},{"last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257","first_name":"Maciek","full_name":"Adamowski, Maciek"},{"last_name":"Novák","first_name":"Ondřej","full_name":"Novák, Ondřej"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"}],"external_id":{"isi":["000881496900002"],"pmid":["35878023"]},"isi":1,"keyword":["Multidisciplinary"],"oa":1,"acknowledgement":"We thank Sarah M. Assmann, Kris Vissenberg, and Nadine Paris for kindly sharing seeds; Matyáš Fendrych for initiating this project and providing constant support; Lukas Fiedler for revising the manuscript; and Huibin Han and Arseny Savin for contributing to genotyping. This work was supported by the Austrian Science Fund (FWF) I 3630-B25 (to J.F.) and the Doctoral Fellowship Progrmme of the Austrian Academy of Sciences (to L.L.) We also acknowledge Taif University Researchers Supporting Project TURSP-HC2021/02 and funding “Plants as a tool for sustainable global development (no. CZ.02.1.01/0.0/0.0/16_019/0000827).”","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_published":"2022-07-25T00:00:00Z","ddc":["580"],"status":"public","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"year":"2022","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","date_updated":"2024-10-29T10:12:30Z","project":[{"name":"Molecular mechanisms of endocytic cargo recognition in plants","call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630"},{"name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root","_id":"26B4D67E-B435-11E9-9278-68D0E5697425","grant_number":"25351"}],"_id":"11723"},{"_id":"11732","publication_status":"published","ec_funded":1,"date_updated":"2023-09-05T14:57:49Z","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"status":"public","date_published":"2022-07-29T00:00:00Z","ddc":["530"],"year":"2022","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"article_processing_charge":"Yes (via OA deal)","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"oa":1,"author":[{"orcid":"0000-0003-1106-327X","full_name":"Henheik, Sven Joscha","first_name":"Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik"},{"first_name":"Asbjørn Bækgaard","full_name":"Lauritsen, Asbjørn Bækgaard","orcid":"0000-0003-4476-2288","last_name":"Lauritsen","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1"}],"external_id":{"isi":["000833007200002"]},"acknowledgement":"We are grateful to Robert Seiringer for helpful discussions and many valuable comments\r\non an earlier version of the manuscript. J.H. acknowledges partial financial support by the ERC Advanced Grant “RMTBeyond’ No. 101020331. Open access funding provided by Institute of Science and Technology (IST Austria)","file":[{"file_id":"11746","creator":"dernst","date_updated":"2022-08-08T07:36:34Z","access_level":"open_access","date_created":"2022-08-08T07:36:34Z","file_name":"2022_JourStatisticalPhysics_Henheik.pdf","checksum":"b398c4dbf65f71d417981d6e366427e9","file_size":419563,"success":1,"relation":"main_file","content_type":"application/pdf"}],"month":"07","publication":"Journal of Statistical Physics","file_date_updated":"2022-08-08T07:36:34Z","publisher":"Springer Nature","has_accepted_license":"1","language":[{"iso":"eng"}],"date_created":"2022-08-05T11:36:56Z","department":[{"_id":"GradSch"},{"_id":"LaEr"},{"_id":"RoSe"}],"title":"The BCS energy gap at high density","scopus_import":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"abstract":[{"lang":"eng","text":"We study the BCS energy gap Ξ in the high–density limit and derive an asymptotic formula, which strongly depends on the strength of the interaction potential V on the Fermi surface. In combination with the recent result by one of us (Math. Phys. Anal. Geom. 25, 3, 2022) on the critical temperature Tc at high densities, we prove the universality of the ratio of the energy gap and the critical temperature."}],"volume":189,"intvolume":"       189","article_type":"original","article_number":"5","oa_version":"Published Version","quality_controlled":"1","doi":"10.1007/s10955-022-02965-9","type":"journal_article","day":"29","citation":{"chicago":"Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “The BCS Energy Gap at High Density.” <i>Journal of Statistical Physics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10955-022-02965-9\">https://doi.org/10.1007/s10955-022-02965-9</a>.","ista":"Henheik SJ, Lauritsen AB. 2022. The BCS energy gap at high density. Journal of Statistical Physics. 189, 5.","apa":"Henheik, S. J., &#38; Lauritsen, A. B. (2022). The BCS energy gap at high density. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-022-02965-9\">https://doi.org/10.1007/s10955-022-02965-9</a>","short":"S.J. Henheik, A.B. Lauritsen, Journal of Statistical Physics 189 (2022).","ieee":"S. J. Henheik and A. B. Lauritsen, “The BCS energy gap at high density,” <i>Journal of Statistical Physics</i>, vol. 189. Springer Nature, 2022.","ama":"Henheik SJ, Lauritsen AB. The BCS energy gap at high density. <i>Journal of Statistical Physics</i>. 2022;189. doi:<a href=\"https://doi.org/10.1007/s10955-022-02965-9\">10.1007/s10955-022-02965-9</a>","mla":"Henheik, Sven Joscha, and Asbjørn Bækgaard Lauritsen. “The BCS Energy Gap at High Density.” <i>Journal of Statistical Physics</i>, vol. 189, 5, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10955-022-02965-9\">10.1007/s10955-022-02965-9</a>."}},{"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["570"],"date_published":"2022-07-29T00:00:00Z","status":"public","publication_identifier":{"eissn":["1091-6490"]},"year":"2022","acknowledgement":"This project was funded by Swiss National Science Foundation Eccellenza Grant PCEGP3-181181(toM.R.R.) and by core funding from the Institute of Science and Technology Austria. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). K.L. and R.M. were supported by the Estonian Research Council Grant PRG687. Estonian Biobank computations were performed in the High-Performance Computing Centre, University of Tartu.","author":[{"last_name":"Orliac","full_name":"Orliac, Etienne J.","first_name":"Etienne J."},{"last_name":"Trejo Banos","full_name":"Trejo Banos, Daniel","first_name":"Daniel"},{"first_name":"Sven E.","full_name":"Ojavee, Sven E.","last_name":"Ojavee"},{"last_name":"Läll","first_name":"Kristi","full_name":"Läll, Kristi"},{"full_name":"Mägi, Reedik","first_name":"Reedik","last_name":"Mägi"},{"first_name":"Peter M.","full_name":"Visscher, Peter M.","last_name":"Visscher"},{"orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson"}],"oa":1,"external_id":{"isi":["000881496900003"]},"isi":1,"_id":"11733","date_updated":"2023-08-03T12:40:38Z","publication_status":"published","file_date_updated":"2022-08-08T07:31:19Z","has_accepted_license":"1","publisher":"Proceedings of the National Academy of Sciences","month":"07","file":[{"file_name":"2022_PNAS_Orliac.pdf","date_created":"2022-08-08T07:31:19Z","file_id":"11745","access_level":"open_access","creator":"dernst","date_updated":"2022-08-08T07:31:19Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":1001164,"checksum":"b5d2024e19fbad6f85a5e384e44d0f3b"}],"publication":"Proceedings of the National Academy of Sciences of the United States of America","volume":119,"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)"},"abstract":[{"text":"Genetically informed, deep-phenotyped biobanks are an important research resource and it is imperative that the most powerful, versatile, and efficient analysis approaches are used. Here, we apply our recently developed Bayesian grouped mixture of regressions model (GMRM) in the UK and Estonian Biobanks and obtain the highest genomic prediction accuracy reported to date across 21 heritable traits. When compared to other approaches, GMRM accuracy was greater than annotation prediction models run in the LDAK or LDPred-funct software by 15% (SE 7%) and 14% (SE 2%), respectively, and was 18% (SE 3%) greater than a baseline BayesR model without single-nucleotide polymorphism (SNP) markers grouped into minor allele frequency–linkage disequilibrium (MAF-LD) annotation categories. For height, the prediction accuracy R2 was 47% in a UK Biobank holdout sample, which was 76% of the estimated h2SNP. We then extend our GMRM prediction model to provide mixed-linear model association (MLMA) SNP marker estimates for genome-wide association (GWAS) discovery, which increased the independent loci detected to 16,162 in unrelated UK Biobank individuals, compared to 10,550 from BoltLMM and 10,095 from Regenie, a 62 and 65% increase, respectively. The average χ2 value of the leading markers increased by 15.24 (SE 0.41) for every 1% increase in prediction accuracy gained over a baseline BayesR model across the traits. Thus, we show that modeling genetic associations accounting for MAF and LD differences among SNP markers, and incorporating prior knowledge of genomic function, is important for both genomic prediction and discovery in large-scale individual-level studies.","lang":"eng"}],"intvolume":"       119","article_number":"e2121279119","issue":"31","article_type":"original","department":[{"_id":"MaRo"}],"language":[{"iso":"eng"}],"date_created":"2022-08-07T22:01:56Z","title":"Improving GWAS discovery and genomic prediction accuracy in biobank data","scopus_import":"1","related_material":{"record":[{"id":"13064","status":"public","relation":"research_data"}]},"citation":{"chicago":"Orliac, Etienne J., Daniel Trejo Banos, Sven E. Ojavee, Kristi Läll, Reedik Mägi, Peter M. Visscher, and Matthew Richard Robinson. “Improving GWAS Discovery and Genomic Prediction Accuracy in Biobank Data.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. Proceedings of the National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2121279119\">https://doi.org/10.1073/pnas.2121279119</a>.","apa":"Orliac, E. J., Trejo Banos, D., Ojavee, S. E., Läll, K., Mägi, R., Visscher, P. M., &#38; Robinson, M. R. (2022). Improving GWAS discovery and genomic prediction accuracy in biobank data. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2121279119\">https://doi.org/10.1073/pnas.2121279119</a>","ista":"Orliac EJ, Trejo Banos D, Ojavee SE, Läll K, Mägi R, Visscher PM, Robinson MR. 2022. Improving GWAS discovery and genomic prediction accuracy in biobank data. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2121279119.","ieee":"E. J. Orliac <i>et al.</i>, “Improving GWAS discovery and genomic prediction accuracy in biobank data,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. Proceedings of the National Academy of Sciences, 2022.","ama":"Orliac EJ, Trejo Banos D, Ojavee SE, et al. Improving GWAS discovery and genomic prediction accuracy in biobank data. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2121279119\">10.1073/pnas.2121279119</a>","short":"E.J. Orliac, D. Trejo Banos, S.E. Ojavee, K. Läll, R. Mägi, P.M. Visscher, M.R. Robinson, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","mla":"Orliac, Etienne J., et al. “Improving GWAS Discovery and Genomic Prediction Accuracy in Biobank Data.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2121279119, Proceedings of the National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2121279119\">10.1073/pnas.2121279119</a>."},"type":"journal_article","day":"29","oa_version":"Published Version","doi":"10.1073/pnas.2121279119","quality_controlled":"1"},{"doi":"10.1073/pnas.2122460119","quality_controlled":"1","oa_version":"Published Version","citation":{"ieee":"R. Abualia <i>et al.</i>, “Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. Proceedings of the National Academy of Sciences, 2022.","short":"R. Abualia, K. Ötvös, O. Novák, E. Bouguyon, K. Domanegg, A. Krapp, P. Nacry, A. Gojon, B. Lacombe, E. Benková, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","ama":"Abualia R, Ötvös K, Novák O, et al. Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2122460119\">10.1073/pnas.2122460119</a>","chicago":"Abualia, Rashed, Krisztina Ötvös, Ondřej Novák, Eleonore Bouguyon, Kevin Domanegg, Anne Krapp, Philip Nacry, Alain Gojon, Benoit Lacombe, and Eva Benková. “Molecular Framework Integrating Nitrate Sensing in Root and Auxin-Guided Shoot Adaptive Responses.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. Proceedings of the National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2122460119\">https://doi.org/10.1073/pnas.2122460119</a>.","ista":"Abualia R, Ötvös K, Novák O, Bouguyon E, Domanegg K, Krapp A, Nacry P, Gojon A, Lacombe B, Benková E. 2022. Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2122460119.","apa":"Abualia, R., Ötvös, K., Novák, O., Bouguyon, E., Domanegg, K., Krapp, A., … Benková, E. (2022). Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2122460119\">https://doi.org/10.1073/pnas.2122460119</a>","mla":"Abualia, Rashed, et al. “Molecular Framework Integrating Nitrate Sensing in Root and Auxin-Guided Shoot Adaptive Responses.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2122460119, Proceedings of the National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2122460119\">10.1073/pnas.2122460119</a>."},"day":"25","type":"journal_article","title":"Molecular framework integrating nitrate sensing in root and auxin-guided shoot adaptive responses","scopus_import":"1","department":[{"_id":"EvBe"}],"language":[{"iso":"eng"}],"date_created":"2022-08-07T22:01:57Z","intvolume":"       119","issue":"31","article_number":"e2122460119","article_type":"original","abstract":[{"text":"Mineral nutrition is one of the key environmental factors determining plant development and growth. Nitrate is the major form of macronutrient nitrogen that plants take up from the soil. Fluctuating availability or deficiency of this element severely limits plant growth and negatively affects crop production in the agricultural system. To cope with the heterogeneity of nitrate distribution in soil, plants evolved a complex regulatory mechanism that allows rapid adjustment of physiological and developmental processes to the status of this nutrient. The root, as a major exploitation organ that controls the uptake of nitrate to the plant body, acts as a regulatory hub that, according to nitrate availability, coordinates the growth and development of other plant organs. Here, we identified a regulatory framework, where cytokinin response factors (CRFs) play a central role as a molecular readout of the nitrate status in roots to guide shoot adaptive developmental response. We show that nitrate-driven activation of NLP7, a master regulator of nitrate response in plants, fine tunes biosynthesis of cytokinin in roots and its translocation to shoots where it enhances expression of CRFs. CRFs, through direct transcriptional regulation of PIN auxin transporters, promote the flow of auxin and thereby stimulate the development of shoot organs.","lang":"eng"}],"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)"},"volume":119,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"publication":"Proceedings of the National Academy of Sciences of the United States of America","pmid":1,"month":"07","file":[{"file_id":"11744","creator":"dernst","date_updated":"2022-08-08T07:09:58Z","access_level":"open_access","file_name":"2022_PNAS_Abualia.pdf","date_created":"2022-08-08T07:09:58Z","checksum":"6e97dedc281247fc3fe238a209f14af0","file_size":3092330,"success":1,"relation":"main_file","content_type":"application/pdf"}],"has_accepted_license":"1","publisher":"Proceedings of the National Academy of Sciences","file_date_updated":"2022-08-08T07:09:58Z","date_updated":"2023-08-03T12:39:29Z","project":[{"name":"Hormone cross-talk drives nutrient dependent plant development","call_identifier":"FWF","_id":"2542D156-B435-11E9-9278-68D0E5697425","grant_number":"I 1774-B16"}],"publication_status":"published","_id":"11734","acknowledgement":"We acknowledge Hana Semeradova, Juan Carlos Montesinos, Nicola Cavallari, Marc¸al Gallem\u0003ı, Kaori Tabata, Andrej Hurn\u0003y, and Sascha Waidmann for sharing materials; and Marina Borges Osorio for critical reading of the manuscript. Work in the E. Benkova laboratory was supported by the Austrian Science Fund (FWF01_I1774S) to K.O., R.A., and E. Benkova. We acknowledge the Bioimaging Facility and Life Science Facilities of the Institute of Science\r\nand Technology Austria. We give sincere thanks to Hana Martınkova and Petra Amakorova for their help with cytokinin analyses. This work was funded by the Czech Science Foundation (Project No. 19-00973S).","isi":1,"oa":1,"author":[{"first_name":"Rashed","full_name":"Abualia, Rashed","orcid":"0000-0002-9357-9415","last_name":"Abualia","id":"4827E134-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ötvös","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5503-4983","first_name":"Krisztina","full_name":"Ötvös, Krisztina"},{"last_name":"Novák","full_name":"Novák, Ondřej","first_name":"Ondřej"},{"last_name":"Bouguyon","first_name":"Eleonore","full_name":"Bouguyon, Eleonore"},{"last_name":"Domanegg","id":"a24c7829-16e8-11ed-8527-c4d36ffb7539","orcid":"0000-0002-1215-4264","full_name":"Domanegg, Kevin","first_name":"Kevin"},{"full_name":"Krapp, Anne","first_name":"Anne","last_name":"Krapp"},{"first_name":"Philip","full_name":"Nacry, Philip","last_name":"Nacry"},{"last_name":"Gojon","first_name":"Alain","full_name":"Gojon, Alain"},{"last_name":"Lacombe","full_name":"Lacombe, Benoit","first_name":"Benoit"},{"first_name":"Eva","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"pmid":["35878040"],"isi":["000881496900007"]},"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","ddc":["570"],"date_published":"2022-07-25T00:00:00Z","year":"2022","publication_identifier":{"eissn":["1091-6490"]}},{"year":"2022","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"ddc":["000"],"status":"public","date_published":"2022-07-22T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","isi":1,"external_id":{"isi":["000830989200018"]},"author":[{"last_name":"Chen","full_name":"Chen, Rulin","first_name":"Rulin"},{"full_name":"Wang, Ziqi","first_name":"Ziqi","last_name":"Wang"},{"first_name":"Peng","full_name":"Song, Peng","last_name":"Song"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd"}],"oa":1,"acknowledgement":"We thank the reviewers for the valuable comments, David Gontier for sharing the source code of the baseline design approach, Christian Hafner for proofreading the paper, Keenan Crane for the 3D model of Cow, and Thingiverse for the 3D models of Moai and Owl. This work was supported by the SUTD Start-up Research Grant (Number: SRG ISTD 2019 148), the Swiss National Science Foundation (NCCR Digital Fabrication Agreement #51NF40-141853), and\r\nthe European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No 715767 – MATERIALIZABLE).","_id":"11735","ec_funded":1,"publication_status":"published","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"date_updated":"2023-08-03T13:21:22Z","file_date_updated":"2022-08-28T07:56:19Z","publisher":"Association for Computing Machinery","has_accepted_license":"1","file":[{"date_created":"2022-08-28T07:56:19Z","file_name":"Chen-2022-High-LevelPuzzle_authorVersion.pdf","access_level":"open_access","creator":"bbickel","date_updated":"2022-08-28T07:56:19Z","file_id":"11992","relation":"main_file","content_type":"application/pdf","success":1,"file_size":16896871,"checksum":"0b51651be45b1b33f2072bd5d2686c69"}],"month":"07","publication":"ACM Transactions on Graphics","volume":41,"abstract":[{"lang":"eng","text":"Interlocking puzzles are intriguing geometric games where the puzzle pieces are held together based on their geometric arrangement, preventing the puzzle from falling apart. High-level-of-difficulty, or simply high-level, interlocking puzzles are a subclass of interlocking puzzles that require multiple moves to take out the first subassembly from the puzzle. Solving a high-level interlocking puzzle is a challenging task since one has to explore many different configurations of the puzzle pieces until reaching a configuration where the first subassembly can be taken out. Designing a high-level interlocking puzzle with a user-specified level of difficulty is even harder since the puzzle pieces have to be interlocking in all the configurations before the first subassembly is taken out.\r\n\r\nIn this paper, we present a computational approach to design high-level interlocking puzzles. The core idea is to represent all possible configurations of an interlocking puzzle as well as transitions among these configurations using a rooted, undirected graph called a disassembly graph and leverage this graph to find a disassembly plan that requires a minimal number of moves to take out the first subassembly from the puzzle. At the design stage, our algorithm iteratively constructs the geometry of each puzzle piece to expand the disassembly graph incrementally, aiming to achieve a user-specified level of difficulty. We show that our approach allows efficient generation of high-level interlocking puzzles of various shape complexities, including new solutions not attainable by state-of-the-art approaches."}],"issue":"4","article_number":"150","article_type":"original","intvolume":"        41","date_created":"2022-08-07T22:01:57Z","language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"scopus_import":"1","title":"Computational design of high-level interlocking puzzles","day":"22","type":"journal_article","citation":{"chicago":"Chen, Rulin, Ziqi Wang, Peng Song, and Bernd Bickel. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>.","ista":"Chen R, Wang Z, Song P, Bickel B. 2022. Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. 41(4), 150.","apa":"Chen, R., Wang, Z., Song, P., &#38; Bickel, B. (2022). Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>","ieee":"R. Chen, Z. Wang, P. Song, and B. Bickel, “Computational design of high-level interlocking puzzles,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","short":"R. Chen, Z. Wang, P. Song, B. Bickel, ACM Transactions on Graphics 41 (2022).","ama":"Chen R, Wang Z, Song P, Bickel B. Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>","mla":"Chen, Rulin, et al. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 150, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>."},"related_material":{"link":[{"url":"https://ista.ac.at/en/news/unlocking-interlocking-riddles/","description":"News on ISTA website","relation":"press_release"}]},"oa_version":"Submitted Version","doi":"10.1145/3528223.3530071","quality_controlled":"1"},{"date_updated":"2023-08-03T12:38:30Z","publication_status":"published","_id":"11736","acknowledgement":"We wish to thank the anonymous reviewers for their helpful comments. To develop this project, we were helped by many people both at Under Armour (Clay Dean, Randall Harward, Kyle Blakely, Craig Simile, Michael Seiz, Brooke Malone, Brittainy McFarland, Emilie Phan, Lindsey Kern, Courtney Oswald, Haley Barkley, Bob Chin, Adam Bayer, Connie Kwok, Marielle Newman, Nick Pence, Allison Hicks, Allison White, Candace Rubenstein, Jeremy Stangland, Fred Fagergren, Michael Mazzoleni, Nathaniel Berry, Manuel Frank) and SEDDI (Gabriel Cirio, Alejandro Rodríguez, Sofía Dominguez, Alicia Nicas, Elena Garcés, Daniel Rodríguez, David Pascual, Manuel Godoy, Sergio Suja, Sergio Ruiz, Roberto Condori, Alberto Martín, Graham Sullivan). We also thank the members of the Visual Computing Group at IST Austria and the Multimodal Simulation Lab at URJC for their feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing, and it was funded in part by the European Research Council (ERC Consolidator Grant 772738 TouchDesign).","oa":1,"isi":1,"author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","last_name":"Sperl","first_name":"Georg","full_name":"Sperl, Georg"},{"full_name":"Sánchez-Banderas, Rosa M.","first_name":"Rosa M.","last_name":"Sánchez-Banderas"},{"full_name":"Li, Manwen","first_name":"Manwen","last_name":"Li"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","full_name":"Wojtan, Christopher J","first_name":"Christopher J","orcid":"0000-0001-6646-5546"},{"first_name":"Miguel A.","full_name":"Otaduy, Miguel A.","last_name":"Otaduy"}],"external_id":{"isi":["000830989200114"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"year":"2022","date_published":"2022-07-22T00:00:00Z","status":"public","publication":"ACM Transactions on Graphics","month":"07","publisher":"Association for Computing Machinery","scopus_import":"1","title":"Estimation of yarn-level simulation models for production fabrics","department":[{"_id":"ChWo"}],"date_created":"2022-08-07T22:01:58Z","language":[{"iso":"eng"}],"article_number":"65","issue":"4","article_type":"original","intvolume":"        41","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"This paper introduces a methodology for inverse-modeling of yarn-level mechanics of cloth, based on the mechanical response of fabrics in the real world. We compiled a database from physical tests of several different knitted fabrics used in the textile industry. These data span different types of complex knit patterns, yarn compositions, and fabric finishes, and the results demonstrate diverse physical properties like stiffness, nonlinearity, and anisotropy.\r\n\r\nWe then develop a system for approximating these mechanical responses with yarn-level cloth simulation. To do so, we introduce an efficient pipeline for converting between fabric-level data and yarn-level simulation, including a novel swatch-level approximation for speeding up computation, and some small-but-necessary extensions to yarn-level models used in computer graphics. The dataset used for this paper can be found at http://mslab.es/projects/YarnLevelFabrics.","lang":"eng"}],"volume":41,"doi":"10.1145/3528223.3530167","quality_controlled":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3528223.3530167"}],"citation":{"short":"G. Sperl, R.M. Sánchez-Banderas, M. Li, C. Wojtan, M.A. Otaduy, ACM Transactions on Graphics 41 (2022).","ieee":"G. Sperl, R. M. Sánchez-Banderas, M. Li, C. Wojtan, and M. A. Otaduy, “Estimation of yarn-level simulation models for production fabrics,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","ama":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>","ista":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. 2022. Estimation of yarn-level simulation models for production fabrics. ACM Transactions on Graphics. 41(4), 65.","apa":"Sperl, G., Sánchez-Banderas, R. M., Li, M., Wojtan, C., &#38; Otaduy, M. A. (2022). Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>","chicago":"Sperl, Georg, Rosa M. Sánchez-Banderas, Manwen Li, Chris Wojtan, and Miguel A. Otaduy. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>.","mla":"Sperl, Georg, et al. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 65, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>."},"related_material":{"record":[{"relation":"dissertation_contains","id":"12358","status":"public"}],"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/digital-yarn-real-socks/","description":"News on the ISTA website"}]},"type":"journal_article","day":"22"},{"citation":{"mla":"Dziom, Uladzislau, et al. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” <i>Physical Review B</i>, vol. 106, no. 4, 045302, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">10.1103/PhysRevB.106.045302</a>.","short":"U. Dziom, A. Shuvaev, J. Gospodarič, E.G. Novik, A.A. Dobretsova, N.N. Mikhailov, Z.D. Kvon, Z. Alpichshev, A. Pimenov, Physical Review B 106 (2022).","ama":"Dziom U, Shuvaev A, Gospodarič J, et al. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. <i>Physical Review B</i>. 2022;106(4). doi:<a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">10.1103/PhysRevB.106.045302</a>","ieee":"U. Dziom <i>et al.</i>, “Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells,” <i>Physical Review B</i>, vol. 106, no. 4. American Physical Society, 2022.","apa":"Dziom, U., Shuvaev, A., Gospodarič, J., Novik, E. G., Dobretsova, A. A., Mikhailov, N. N., … Pimenov, A. (2022). Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">https://doi.org/10.1103/PhysRevB.106.045302</a>","ista":"Dziom U, Shuvaev A, Gospodarič J, Novik EG, Dobretsova AA, Mikhailov NN, Kvon ZD, Alpichshev Z, Pimenov A. 2022. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. Physical Review B. 106(4), 045302.","chicago":"Dziom, Uladzislau, A. Shuvaev, J. Gospodarič, E. G. Novik, A. A. Dobretsova, N. N. Mikhailov, Z. D. Kvon, Zhanybek Alpichshev, and A. Pimenov. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” <i>Physical Review B</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">https://doi.org/10.1103/PhysRevB.106.045302</a>."},"day":"15","type":"journal_article","oa_version":"Published Version","doi":"10.1103/PhysRevB.106.045302","quality_controlled":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"abstract":[{"lang":"eng","text":"Spin-orbit coupling in thin HgTe quantum wells results in a relativistic-like electron band structure, making it a versatile solid state platform to observe and control nontrivial electrodynamic phenomena. Here we report an observation of universal terahertz (THz) transparency determined by fine-structure constant α≈1/137 in 6.5-nm-thick HgTe layer, close to the critical thickness separating phases with topologically different electronic band structure. Using THz spectroscopy in a magnetic field we obtain direct evidence of asymmetric spin splitting of the Dirac cone. This particle-hole asymmetry facilitates optical control of edge spin currents in the quantum wells."}],"volume":106,"intvolume":"       106","article_number":"045302","issue":"4","article_type":"original","department":[{"_id":"ZhAl"}],"language":[{"iso":"eng"}],"date_created":"2022-08-07T22:01:58Z","title":"Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells","scopus_import":"1","file_date_updated":"2022-08-08T06:58:22Z","publisher":"American Physical Society","has_accepted_license":"1","month":"07","file":[{"date_updated":"2022-08-08T06:58:22Z","creator":"dernst","access_level":"open_access","file_id":"11743","date_created":"2022-08-08T06:58:22Z","file_name":"2022_PhysRevB_Dziom.pdf","checksum":"115aff9e0cde2f806cb26953d7262791","file_size":774455,"success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Physical Review B","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["530"],"status":"public","date_published":"2022-07-15T00:00:00Z","year":"2022","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"acknowledgement":"This work was supported by the Austrian Science Funds (W 1243, I 3456-N27, I 5539-N).","isi":1,"oa":1,"author":[{"id":"6A9A37C2-8C5C-11E9-AE53-F2FDE5697425","last_name":"Dziom","full_name":"Dziom, Uladzislau","first_name":"Uladzislau","orcid":"0000-0002-1648-0999"},{"last_name":"Shuvaev","full_name":"Shuvaev, A.","first_name":"A."},{"last_name":"Gospodarič","full_name":"Gospodarič, J.","first_name":"J."},{"first_name":"E. G.","full_name":"Novik, E. G.","last_name":"Novik"},{"first_name":"A. A.","full_name":"Dobretsova, A. A.","last_name":"Dobretsova"},{"last_name":"Mikhailov","full_name":"Mikhailov, N. N.","first_name":"N. N."},{"last_name":"Kvon","full_name":"Kvon, Z. D.","first_name":"Z. D."},{"orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev"},{"last_name":"Pimenov","first_name":"A.","full_name":"Pimenov, A."}],"external_id":{"isi":["000834349200010"]},"_id":"11737","date_updated":"2023-08-03T12:38:57Z","publication_status":"published"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"4297-4333","article_processing_charge":"No","year":"2022","publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"status":"public","date_published":"2022-07-18T00:00:00Z","acknowledgement":"This work was supported by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme grant 716117 and by the AustrianScience Fund (FWF) through grants F65 and W1245.","external_id":{"isi":["000889274600001"],"arxiv":["2008.10962"]},"isi":1,"author":[{"id":"35C79D68-F248-11E8-B48F-1D18A9856A87","last_name":"Forkert","first_name":"Dominik L","full_name":"Forkert, Dominik L"},{"full_name":"Maas, Jan","first_name":"Jan","orcid":"0000-0002-0845-1338","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Portinale","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","full_name":"Portinale, Lorenzo"}],"keyword":["Fokker--Planck equation","gradient flow","evolutionary $\\Gamma$-convergence"],"oa":1,"_id":"11739","arxiv":1,"project":[{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations","_id":"260788DE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"date_updated":"2023-08-03T12:37:21Z","ec_funded":1,"publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","month":"07","publication":"SIAM Journal on Mathematical Analysis","volume":54,"abstract":[{"text":"We consider finite-volume approximations of Fokker--Planck equations on bounded convex domains in $\\mathbb{R}^d$ and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker--Planck equation via the method of evolutionary $\\Gamma$-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalizing the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.","lang":"eng"}],"issue":"4","article_type":"original","intvolume":"        54","department":[{"_id":"JaMa"}],"date_created":"2022-08-07T22:01:59Z","language":[{"iso":"eng"}],"scopus_import":"1","title":"Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","citation":{"ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4. Society for Industrial and Applied Mathematics, pp. 4297–4333, 2022.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. 2022;54(4):4297-4333. doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>","short":"D.L. Forkert, J. Maas, L. Portinale, SIAM Journal on Mathematical Analysis 54 (2022) 4297–4333.","apa":"Forkert, D. L., Maas, J., &#38; Portinale, L. (2022). Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>.","ista":"Forkert DL, Maas J, Portinale L. 2022. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. SIAM Journal on Mathematical Analysis. 54(4), 4297–4333.","mla":"Forkert, Dominik L., et al. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4, Society for Industrial and Applied Mathematics, 2022, pp. 4297–333, doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>."},"related_material":{"record":[{"status":"public","id":"10022","relation":"earlier_version"}]},"type":"journal_article","day":"18","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2008.10962","open_access":"1"}],"oa_version":"Preprint","doi":"10.1137/21M1410968","quality_controlled":"1"},{"publication":"Electronic Journal of Combinatorics","file":[{"relation":"main_file","content_type":"application/pdf","success":1,"file_size":1768663,"checksum":"057c676dcee70236aa234d4ce6138c69","file_name":"2022_ElecJournCombinatorics_Cooley.pdf","date_created":"2022-08-08T06:28:52Z","file_id":"11742","access_level":"open_access","date_updated":"2022-08-08T06:28:52Z","creator":"dernst"}],"month":"07","publisher":"Electronic Journal of Combinatorics","has_accepted_license":"1","file_date_updated":"2022-08-08T06:28:52Z","publication_status":"published","date_updated":"2023-08-03T12:37:54Z","_id":"11740","arxiv":1,"external_id":{"isi":["000836200300001"],"arxiv":["2005.07103"]},"author":[{"last_name":"Cooley","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","full_name":"Cooley, Oliver","first_name":"Oliver"},{"last_name":"Del Giudice","first_name":"Nicola","full_name":"Del Giudice, Nicola"},{"last_name":"Kang","first_name":"Mihyun","full_name":"Kang, Mihyun"},{"last_name":"Sprüssel","full_name":"Sprüssel, Philipp","first_name":"Philipp"}],"isi":1,"oa":1,"acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","date_published":"2022-07-29T00:00:00Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","ddc":["510"],"status":"public","year":"2022","publication_identifier":{"eissn":["1077-8926"]},"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","doi":"10.37236/10607","oa_version":"Published Version","type":"journal_article","day":"29","citation":{"ieee":"O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.","short":"O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).","ama":"Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. 2022;29(3). doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>","ista":"Cooley O, Del Giudice N, Kang M, Sprüssel P. 2022. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 29(3), P3.27.","chicago":"Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>.","apa":"Cooley, O., Del Giudice, N., Kang, M., &#38; Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>","mla":"Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>."},"title":"Phase transition in cohomology groups of non-uniform random simplicial complexes","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2022-08-07T22:01:59Z","department":[{"_id":"MaKw"}],"intvolume":"        29","article_type":"original","article_number":"P3.27","issue":"3","tmp":{"short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"abstract":[{"lang":"eng","text":"We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].\r\nWe consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition."}],"volume":29},{"_id":"11775","date_updated":"2023-08-03T13:38:46Z","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"ec_funded":1,"publication_status":"published","article_processing_charge":"Yes","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"200-220","date_published":"2022-09-23T00:00:00Z","ddc":["000"],"status":"public","publication_identifier":{"issn":["0302-9743"]},"year":"2022","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","oa":1,"external_id":{"isi":["000866539700011"]},"author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","full_name":"Sarac, Naci E","first_name":"Naci E"}],"isi":1,"month":"09","file":[{"date_created":"2023-01-20T07:34:50Z","file_name":"2022_LNCS_RV_Henzinger.pdf","access_level":"open_access","creator":"dernst","date_updated":"2023-01-20T07:34:50Z","file_id":"12317","content_type":"application/pdf","relation":"main_file","success":1,"file_size":477110,"checksum":"05c7dcfbb9053a98f46441fb2eccb213"}],"publication":"22nd International Conference on Runtime Verification","file_date_updated":"2023-01-20T07:34:50Z","has_accepted_license":"1","publisher":"Springer Nature","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"conference":{"start_date":"2022-09-28","name":"RV: Runtime Verification","end_date":"2022-09-30","location":"Tbilisi, Georgia"},"date_created":"2022-08-08T17:09:09Z","alternative_title":["LNCS"],"title":"Abstract monitors for quantitative specifications","scopus_import":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"abstract":[{"lang":"eng","text":"Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or “resource use”) that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time. "}],"volume":13498,"intvolume":"     13498","oa_version":"Published Version","quality_controlled":"1","doi":"10.1007/978-3-031-17196-3_11","citation":{"apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2022). Abstract monitors for quantitative specifications. In <i>22nd International Conference on Runtime Verification</i> (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Abstract Monitors for Quantitative Specifications.” In <i>22nd International Conference on Runtime Verification</i>, 13498:200–220. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">https://doi.org/10.1007/978-3-031-17196-3_11</a>.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2022. Abstract monitors for quantitative specifications. 22nd International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 13498, 200–220.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in <i>22nd International Conference on Runtime Verification</i>, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Abstract monitors for quantitative specifications. In: <i>22nd International Conference on Runtime Verification</i>. Vol 13498. Springer Nature; 2022:200-220. doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference on Runtime Verification, Springer Nature, 2022, pp. 200–220.","mla":"Henzinger, Thomas A., et al. “Abstract Monitors for Quantitative Specifications.” <i>22nd International Conference on Runtime Verification</i>, vol. 13498, Springer Nature, 2022, pp. 200–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-17196-3_11\">10.1007/978-3-031-17196-3_11</a>."},"type":"conference","day":"23"},{"oa":1,"author":[{"full_name":"Wild, Pascal","first_name":"Pascal","id":"4C20D868-F248-11E8-B48F-1D18A9856A87","last_name":"Wild"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"170","date_published":"2022-08-11T00:00:00Z","status":"public","ddc":["500","516","514"],"year":"2022","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-021-3"]},"date_updated":"2023-06-22T09:56:36Z","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"ec_funded":1,"publication_status":"published","_id":"11777","has_accepted_license":"1","publisher":"Institute of Science and Technology","supervisor":[{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"file_date_updated":"2022-08-11T16:09:19Z","month":"08","file":[{"file_name":"flags.py","date_created":"2022-08-10T15:34:04Z","description":"Code for computer-assisted proofs in Section 8.4.7 in Thesis","file_id":"11780","access_level":"open_access","creator":"pwild","date_updated":"2022-08-10T15:34:04Z","relation":"supplementary_material","content_type":"text/x-python","file_size":16828,"checksum":"f5f3af1fb7c8a24b71ddc88ad7f7c5b4"},{"date_created":"2022-08-10T15:34:10Z","file_name":"lowerbound.cpp","access_level":"open_access","date_updated":"2022-08-10T15:34:10Z","creator":"pwild","description":"Code for proof of Lemma 8.20 in Thesis","file_id":"11781","content_type":"text/x-c++src","relation":"supplementary_material","file_size":12226,"checksum":"1f7c12dfe3bdaa9b147e4fbc3d34e3d5"},{"file_name":"upperbound.py","date_created":"2022-08-10T15:34:17Z","creator":"pwild","date_updated":"2022-08-10T15:34:17Z","access_level":"open_access","description":"Code for proof of Proposition 7.9 in Thesis","file_id":"11782","relation":"supplementary_material","content_type":"text/x-python","checksum":"4cf81455c49e5dec3b9b2e3980137eeb","file_size":3240},{"content_type":"application/pdf","relation":"main_file","checksum":"4e96575b10cbe4e0d0db2045b2847774","file_size":5086282,"date_created":"2022-08-11T16:08:33Z","file_name":"finalthesisPascalWildPDFA.pdf","date_updated":"2022-08-11T16:08:33Z","creator":"pwild","access_level":"open_access","title":"High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes","file_id":"11809"},{"date_created":"2022-08-11T16:09:19Z","file_name":"ThesisSubmission.zip","file_id":"11810","access_level":"closed","creator":"pwild","date_updated":"2022-08-11T16:09:19Z","relation":"source_file","content_type":"application/zip","file_size":18150068,"checksum":"92d94842a1fb6dca5808448137573b2e"}],"degree_awarded":"PhD","abstract":[{"text":"In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications.\r\nOur main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"title":"High-dimensional expansion and crossing numbers of simplicial complexes","department":[{"_id":"GradSch"},{"_id":"UlWa"}],"language":[{"iso":"eng"}],"date_created":"2022-08-10T15:51:19Z","citation":{"apa":"Wild, P. (2022). <i>High-dimensional expansion and crossing numbers of simplicial complexes</i>. Institute of Science and Technology. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>","chicago":"Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology, 2022. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>.","ista":"Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology.","short":"P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology, 2022.","ama":"Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>","ieee":"P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology, 2022.","mla":"Wild, Pascal. <i>High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes</i>. Institute of Science and Technology, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>."},"day":"11","type":"dissertation","doi":"10.15479/at:ista:11777","oa_version":"Published Version"},{"volume":63,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"abstract":[{"text":"We consider a gas of N bosons with interactions in the mean-field scaling regime. We review the proof of an asymptotic expansion of its low-energy spectrum, eigenstates, and dynamics, which provides corrections to Bogoliubov theory to all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer, and Soffer. In addition, we derive a full asymptotic expansion of the ground state one-body reduced density matrix.","lang":"eng"}],"intvolume":"        63","article_number":"061102","issue":"6","article_type":"original","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"date_created":"2022-08-11T06:37:52Z","title":"Low-energy spectrum and dynamics of the weakly interacting Bose gas","scopus_import":"1","citation":{"short":"L. Bossmann, Journal of Mathematical Physics 63 (2022).","ieee":"L. Bossmann, “Low-energy spectrum and dynamics of the weakly interacting Bose gas,” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6. AIP Publishing, 2022.","ama":"Bossmann L. Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. 2022;63(6). doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>","apa":"Bossmann, L. (2022). Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>","ista":"Bossmann L. 2022. Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. 63(6), 061102.","chicago":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2022. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>.","mla":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6, 061102, AIP Publishing, 2022, doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>."},"type":"journal_article","day":"10","oa_version":"Published Version","doi":"10.1063/5.0089983","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["530"],"date_published":"2022-06-10T00:00:00Z","status":"public","publication_identifier":{"issn":["0022-2488"],"eissn":["1089-7658"]},"year":"2022","acknowledgement":"The author thanks Nataˇsa Pavlovic, Sören Petrat, Peter Pickl, Robert Seiringer, and Avy Soffer for the collaboration on Refs. 1, 2 and 21. Funding from the European Union’s Horizon 2020 Research and Innovation Programme under Marie Skℓodowska-Curie Grant Agreement\r\nNo. 754411 is gratefully acknowledged.","external_id":{"isi":["000809648100002"],"arxiv":["2203.00730"]},"oa":1,"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"isi":1,"author":[{"last_name":"Bossmann","id":"A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425","orcid":"0000-0002-6854-1343","full_name":"Bossmann, Lea","first_name":"Lea"}],"_id":"11783","arxiv":1,"date_updated":"2023-08-03T12:46:28Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"ec_funded":1,"publication_status":"published","file_date_updated":"2022-08-11T07:03:02Z","publisher":"AIP Publishing","has_accepted_license":"1","month":"06","file":[{"relation":"main_file","content_type":"application/pdf","success":1,"file_size":5957888,"checksum":"d0d32c338c1896680174be88c70968fa","file_name":"2022_JourMathPhysics_Bossmann.pdf","date_created":"2022-08-11T07:03:02Z","file_id":"11784","access_level":"open_access","date_updated":"2022-08-11T07:03:02Z","creator":"dernst"}],"publication":"Journal of Mathematical Physics"},{"day":"01","type":"journal_article","citation":{"ieee":"A. Akopyan and R. Karasev, “When different norms lead to same billiard trajectories?,” <i>European Journal of Mathematics</i>, vol. 8, no. 4. Springer Nature, pp. 1309–1312, 2022.","ama":"Akopyan A, Karasev R. When different norms lead to same billiard trajectories? <i>European Journal of Mathematics</i>. 2022;8(4):1309-1312. doi:<a href=\"https://doi.org/10.1007/s40879-020-00405-0\">10.1007/s40879-020-00405-0</a>","short":"A. Akopyan, R. Karasev, European Journal of Mathematics 8 (2022) 1309–1312.","apa":"Akopyan, A., &#38; Karasev, R. (2022). When different norms lead to same billiard trajectories? <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00405-0\">https://doi.org/10.1007/s40879-020-00405-0</a>","ista":"Akopyan A, Karasev R. 2022. When different norms lead to same billiard trajectories? European Journal of Mathematics. 8(4), 1309–1312.","chicago":"Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard Trajectories?” <i>European Journal of Mathematics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s40879-020-00405-0\">https://doi.org/10.1007/s40879-020-00405-0</a>.","mla":"Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard Trajectories?” <i>European Journal of Mathematics</i>, vol. 8, no. 4, Springer Nature, 2022, pp. 1309–12, doi:<a href=\"https://doi.org/10.1007/s40879-020-00405-0\">10.1007/s40879-020-00405-0</a>."},"doi":"10.1007/s40879-020-00405-0","quality_controlled":"1","oa_version":"Published Version","intvolume":"         8","article_type":"original","issue":"4","abstract":[{"text":"Extending a result of Milena Radnovic and Serge Tabachnikov, we establish conditionsfor two different non-symmetric norms to define the same billiard reflection law.","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":8,"title":"When different norms lead to same billiard trajectories?","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2020-05-03T22:00:48Z","department":[{"_id":"HeEd"}],"has_accepted_license":"1","publisher":"Springer Nature","file_date_updated":"2020-07-14T12:48:03Z","publication":"European Journal of Mathematics","file":[{"checksum":"f53e71fd03744075adcd0b8fc1b8423d","file_size":263926,"content_type":"application/pdf","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:48:03Z","access_level":"open_access","file_id":"7796","date_created":"2020-05-04T10:33:42Z","file_name":"2020_EuropMathematics_Akopyan.pdf"}],"month":"12","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"last_name":"Karasev","full_name":"Karasev, Roman","first_name":"Roman"}],"oa":1,"external_id":{"arxiv":["1912.12685"]},"acknowledgement":"AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha). RK was supported by the Federal professorship program Grant 1.456.2016/1.4 and the Russian Foundation for Basic Research Grants 18-01-00036 and 19-01-00169. Open access funding provided by Institute of Science and Technology (IST Austria). The authors thank Alexey Balitskiy, Milena Radnović, and Serge Tabachnikov for useful discussions.","ddc":["510"],"status":"public","date_published":"2022-12-01T00:00:00Z","year":"2022","publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"article_processing_charge":"Yes (via OA deal)","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"1309 - 1312","ec_funded":1,"publication_status":"published","date_updated":"2024-02-22T15:58:42Z","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"arxiv":1,"_id":"7791"},{"doi":"10.1101/2020.01.08.898528","publication":"bioRxiv","oa_version":"Preprint","month":"12","publisher":"Cold Spring Harbor Laboratory","main_file_link":[{"url":"https://doi.org/10.1101/2020.01.08.898528 ","open_access":"1"}],"day":"21","type":"preprint","citation":{"mla":"Podlaski, William F., et al. “High Capacity and Dynamic Accessibility in Associative Memory Networks with Context-Dependent Neuronal and Synaptic Gating.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, 2022, doi:<a href=\"https://doi.org/10.1101/2020.01.08.898528\">10.1101/2020.01.08.898528</a>.","short":"W.F. Podlaski, E.J. Agnes, T.P. Vogels, BioRxiv (2022).","ieee":"W. F. Podlaski, E. J. Agnes, and T. P. Vogels, “High capacity and dynamic accessibility in associative memory networks with context-dependent neuronal and synaptic gating,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory, 2022.","ama":"Podlaski WF, Agnes EJ, Vogels TP. High capacity and dynamic accessibility in associative memory networks with context-dependent neuronal and synaptic gating. <i>bioRxiv</i>. 2022. doi:<a href=\"https://doi.org/10.1101/2020.01.08.898528\">10.1101/2020.01.08.898528</a>","apa":"Podlaski, W. F., Agnes, E. J., &#38; Vogels, T. P. (2022). High capacity and dynamic accessibility in associative memory networks with context-dependent neuronal and synaptic gating. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/2020.01.08.898528\">https://doi.org/10.1101/2020.01.08.898528</a>","ista":"Podlaski WF, Agnes EJ, Vogels TP. 2022. High capacity and dynamic accessibility in associative memory networks with context-dependent neuronal and synaptic gating. bioRxiv, <a href=\"https://doi.org/10.1101/2020.01.08.898528\">10.1101/2020.01.08.898528</a>.","chicago":"Podlaski, William F., Everton J. Agnes, and Tim P Vogels. “High Capacity and Dynamic Accessibility in Associative Memory Networks with Context-Dependent Neuronal and Synaptic Gating.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, 2022. <a href=\"https://doi.org/10.1101/2020.01.08.898528\">https://doi.org/10.1101/2020.01.08.898528</a>."},"publication_status":"published","title":"High capacity and dynamic accessibility in associative memory networks with context-dependent neuronal and synaptic gating","locked":"1","date_updated":"2024-03-06T12:03:59Z","date_created":"2020-07-16T12:24:28Z","language":[{"iso":"eng"}],"_id":"8125","department":[{"_id":"TiVo"}],"oa":1,"author":[{"last_name":"Podlaski","full_name":"Podlaski, William F.","first_name":"William F.","orcid":"0000-0001-6619-7502"},{"last_name":"Agnes","first_name":"Everton J.","full_name":"Agnes, Everton J.","orcid":"0000-0001-7184-7311"},{"first_name":"Tim P","full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels"}],"year":"2022","abstract":[{"lang":"eng","text":"Context, such as behavioral state, is known to modulate memory formation and retrieval, but is usually ignored in associative memory models. Here, we propose several types of contextual modulation for associative memory networks that greatly increase their performance. In these networks, context inactivates specific neurons and connections, which modulates the effective connectivity of the network. Memories are stored only by the active components, thereby reducing interference from memories acquired in other contexts. Such networks exhibit several beneficial characteristics, including enhanced memory capacity, high robustness to noise, increased robustness to memory overloading, and better memory retention during continual learning. Furthermore, memories can be biased to have different relative strengths, or even gated on or off, according to contextual cues, providing a candidate model for cognitive control of memory and efficient memory search. An external context-encoding network can dynamically switch the memory network to a desired state, which we liken to experimentally observed contextual signals in prefrontal cortex and hippocampus. Overall, our work illustrates the benefits of organizing memory around context, and provides an important link between behavioral studies of memory and mechanistic details of neural circuits.</jats:p><jats:sec><jats:title>SIGNIFICANCE</jats:title><jats:p>Memory is context dependent — both encoding and recall vary in effectiveness and speed depending on factors like location and brain state during a task. We apply this idea to a simple computational model of associative memory through contextual gating of neurons and synaptic connections. Intriguingly, this results in several advantages, including vastly enhanced memory capacity, better robustness, and flexible memory gating. Our model helps to explain (i) how gating and inhibition contribute to memory processes, (ii) how memory access dynamically changes over time, and (iii) how context representations, such as those observed in hippocampus and prefrontal cortex, may interact with and control memory processes."}],"status":"public","date_published":"2022-12-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No"},{"title":"Weak convergence for variational inequalities with inertial-type method","scopus_import":"1","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"date_created":"2020-03-09T07:06:52Z","intvolume":"       101","issue":"1","article_type":"original","abstract":[{"lang":"eng","text":"Weak convergence of inertial iterative method for solving variational inequalities is the focus of this paper. The cost function is assumed to be non-Lipschitz and monotone. We propose a projection-type method with inertial terms and give weak convergence analysis under appropriate conditions. Some test results are performed and compared with relevant methods in the literature to show the efficiency and advantages given by our proposed methods."}],"volume":101,"quality_controlled":"1","doi":"10.1080/00036811.2020.1736287","oa_version":"Submitted Version","citation":{"ieee":"Y. Shehu and O. S. Iyiola, “Weak convergence for variational inequalities with inertial-type method,” <i>Applicable Analysis</i>, vol. 101, no. 1. Taylor &#38; Francis, pp. 192–216, 2022.","short":"Y. Shehu, O.S. Iyiola, Applicable Analysis 101 (2022) 192–216.","ama":"Shehu Y, Iyiola OS. Weak convergence for variational inequalities with inertial-type method. <i>Applicable Analysis</i>. 2022;101(1):192-216. doi:<a href=\"https://doi.org/10.1080/00036811.2020.1736287\">10.1080/00036811.2020.1736287</a>","ista":"Shehu Y, Iyiola OS. 2022. Weak convergence for variational inequalities with inertial-type method. Applicable Analysis. 101(1), 192–216.","chicago":"Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities with Inertial-Type Method.” <i>Applicable Analysis</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/00036811.2020.1736287\">https://doi.org/10.1080/00036811.2020.1736287</a>.","apa":"Shehu, Y., &#38; Iyiola, O. S. (2022). Weak convergence for variational inequalities with inertial-type method. <i>Applicable Analysis</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00036811.2020.1736287\">https://doi.org/10.1080/00036811.2020.1736287</a>","mla":"Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities with Inertial-Type Method.” <i>Applicable Analysis</i>, vol. 101, no. 1, Taylor &#38; Francis, 2022, pp. 192–216, doi:<a href=\"https://doi.org/10.1080/00036811.2020.1736287\">10.1080/00036811.2020.1736287</a>."},"type":"journal_article","day":"01","date_updated":"2024-03-05T14:01:52Z","project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"ec_funded":1,"publication_status":"published","arxiv":1,"_id":"7577","acknowledgement":"The project of the first author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7 - 2007-2013) (Grant agreement No. 616160).","oa":1,"author":[{"first_name":"Yekini","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","last_name":"Shehu"},{"last_name":"Iyiola","full_name":"Iyiola, Olaniyi S.","first_name":"Olaniyi S."}],"isi":1,"external_id":{"arxiv":["2101.08057"],"isi":["000518364100001"]},"article_processing_charge":"No","page":"192-216","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510","515","518"],"date_published":"2022-01-01T00:00:00Z","status":"public","publication_identifier":{"issn":["0003-6811"],"eissn":["1563-504X"]},"year":"2022","publication":"Applicable Analysis","month":"01","file":[{"file_id":"8648","date_updated":"2021-03-16T23:30:06Z","creator":"dernst","access_level":"open_access","file_name":"2020_ApplicAnalysis_Shehu.pdf","date_created":"2020-10-12T10:42:54Z","embargo":"2021-03-15","checksum":"869efe8cb09505dfa6012f67d20db63d","file_size":4282586,"content_type":"application/pdf","relation":"main_file"}],"has_accepted_license":"1","publisher":"Taylor & Francis","file_date_updated":"2021-03-16T23:30:06Z"},{"date_published":"2022-01-01T00:00:00Z","status":"public","year":"2022","abstract":[{"lang":"eng","text":"Expander graphs (sparse but highly connected graphs) have, since their inception, been the source of deep links between Mathematics and Computer Science as well as applications to other areas. In recent years, a fascinating theory of high-dimensional expanders has begun to emerge, which is still in a formative stage but has nonetheless already lead to a number of striking results. Unlike for graphs, in higher dimensions there is a rich array of non-equivalent notions of expansion (coboundary expansion, cosystolic expansion, topological expansion, spectral expansion, etc.), with differents strengths and applications. In this talk, we will survey this landscape of high-dimensional expansion, with a focus on two main results. First, we will present Gromov’s Topological Overlap Theorem, which asserts that coboundary expansion (a quantitative version of vanishing mod 2 cohomology) implies topological expansion (roughly, the property that for every map from a simplicial complex to a manifold of the same dimension, the images of a positive fraction of the simplices have a point in common). Second, we will outline a construction of bounded degree 2-dimensional topological expanders, due to Kaufman, Kazhdan, and Lubotzky."}],"publication_identifier":{"eissn":["2102-622X"],"issn":["0037-9484"]},"volume":438,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"281-294","author":[{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"intvolume":"       438","article_type":"original","_id":"14381","language":[{"iso":"eng"}],"date_created":"2023-10-01T22:01:14Z","department":[{"_id":"UlWa"}],"title":"High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others)","publication_status":"published","scopus_import":"1","date_updated":"2023-10-03T08:04:03Z","day":"01","type":"journal_article","citation":{"mla":"Wagner, Uli. “High-Dimensional Expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and Others).” <i>Bulletin de La Societe Mathematique de France</i>, vol. 438, Societe Mathematique de France, 2022, pp. 281–94, doi:<a href=\"https://doi.org/10.24033/ast.1188\">10.24033/ast.1188</a>.","apa":"Wagner, U. (2022). High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). <i>Bulletin de La Societe Mathematique de France</i>. Societe Mathematique de France. <a href=\"https://doi.org/10.24033/ast.1188\">https://doi.org/10.24033/ast.1188</a>","ista":"Wagner U. 2022. High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). Bulletin de la Societe Mathematique de France. 438, 281–294.","chicago":"Wagner, Uli. “High-Dimensional Expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and Others).” <i>Bulletin de La Societe Mathematique de France</i>. Societe Mathematique de France, 2022. <a href=\"https://doi.org/10.24033/ast.1188\">https://doi.org/10.24033/ast.1188</a>.","short":"U. Wagner, Bulletin de La Societe Mathematique de France 438 (2022) 281–294.","ama":"Wagner U. High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). <i>Bulletin de la Societe Mathematique de France</i>. 2022;438:281-294. doi:<a href=\"https://doi.org/10.24033/ast.1188\">10.24033/ast.1188</a>","ieee":"U. Wagner, “High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others),” <i>Bulletin de la Societe Mathematique de France</i>, vol. 438. Societe Mathematique de France, pp. 281–294, 2022."},"publisher":"Societe Mathematique de France","oa_version":"None","month":"01","quality_controlled":"1","doi":"10.24033/ast.1188","publication":"Bulletin de la Societe Mathematique de France"},{"_id":"14437","publication_status":"published","date_updated":"2023-10-18T06:26:30Z","date_published":"2022-12-21T00:00:00Z","status":"public","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"year":"2022","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"638-639","keyword":["Multidisciplinary"],"author":[{"last_name":"Utzat","first_name":"Hendrik","full_name":"Utzat, Hendrik"},{"first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"pmid":["36543947"]},"month":"12","pmid":1,"publication":"Nature","publisher":"Springer Nature","language":[{"iso":"eng"}],"date_created":"2023-10-17T11:14:43Z","department":[{"_id":"MaIb"}],"title":"Molecular engineering enables bright blue LEDs","abstract":[{"lang":"eng","text":"Future LEDs could be based on lead halide perovskites. A breakthrough in preparing device-compatible solids composed of nanoscale perovskite crystals overcomes a long-standing hurdle in making blue perovskite LEDs."}],"volume":612,"intvolume":"       612","article_type":"letter_note","issue":"7941","oa_version":"None","doi":"10.1038/d41586-022-04447-0","quality_controlled":"1","day":"21","type":"journal_article","citation":{"mla":"Utzat, Hendrik, and Maria Ibáñez. “Molecular Engineering Enables Bright Blue LEDs.” <i>Nature</i>, vol. 612, no. 7941, Springer Nature, 2022, pp. 638–39, doi:<a href=\"https://doi.org/10.1038/d41586-022-04447-0\">10.1038/d41586-022-04447-0</a>.","chicago":"Utzat, Hendrik, and Maria Ibáñez. “Molecular Engineering Enables Bright Blue LEDs.” <i>Nature</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/d41586-022-04447-0\">https://doi.org/10.1038/d41586-022-04447-0</a>.","ista":"Utzat H, Ibáñez M. 2022. Molecular engineering enables bright blue LEDs. Nature. 612(7941), 638–639.","apa":"Utzat, H., &#38; Ibáñez, M. (2022). Molecular engineering enables bright blue LEDs. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/d41586-022-04447-0\">https://doi.org/10.1038/d41586-022-04447-0</a>","ieee":"H. Utzat and M. Ibáñez, “Molecular engineering enables bright blue LEDs,” <i>Nature</i>, vol. 612, no. 7941. Springer Nature, pp. 638–639, 2022.","short":"H. Utzat, M. Ibáñez, Nature 612 (2022) 638–639.","ama":"Utzat H, Ibáñez M. Molecular engineering enables bright blue LEDs. <i>Nature</i>. 2022;612(7941):638-639. doi:<a href=\"https://doi.org/10.1038/d41586-022-04447-0\">10.1038/d41586-022-04447-0</a>"}},{"type":"research_data_reference","day":"28","citation":{"mla":"Zemlicka, Martin, et al. <i>Compact Vacuum Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses</i>. Zenodo, 2022, doi:<a href=\"https://doi.org/10.5281/ZENODO.8408897\">10.5281/ZENODO.8408897</a>.","chicago":"Zemlicka, Martin, Elena Redchenko, Matilda Peruzzo, Farid Hassani, Andrea Trioni, Shabir Barzanjeh, and Johannes M Fink. “Compact Vacuum Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” Zenodo, 2022. <a href=\"https://doi.org/10.5281/ZENODO.8408897\">https://doi.org/10.5281/ZENODO.8408897</a>.","ista":"Zemlicka M, Redchenko E, Peruzzo M, Hassani F, Trioni A, Barzanjeh S, Fink JM. 2022. Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8408897\">10.5281/ZENODO.8408897</a>.","apa":"Zemlicka, M., Redchenko, E., Peruzzo, M., Hassani, F., Trioni, A., Barzanjeh, S., &#38; Fink, J. M. (2022). Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8408897\">https://doi.org/10.5281/ZENODO.8408897</a>","ama":"Zemlicka M, Redchenko E, Peruzzo M, et al. Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses. 2022. doi:<a href=\"https://doi.org/10.5281/ZENODO.8408897\">10.5281/ZENODO.8408897</a>","ieee":"M. Zemlicka <i>et al.</i>, “Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses.” Zenodo, 2022.","short":"M. Zemlicka, E. Redchenko, M. Peruzzo, F. Hassani, A. Trioni, S. Barzanjeh, J.M. Fink, (2022)."},"related_material":{"record":[{"id":"14517","status":"public","relation":"used_in_publication"}]},"has_accepted_license":"1","publisher":"Zenodo","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/ZENODO.8408897"}],"oa_version":"Published Version","month":"06","doi":"10.5281/ZENODO.8408897","abstract":[{"text":"This dataset comprises all data shown in the figures of the submitted article \"Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses\" at arxiv.org/abs/2206.14104. Additional raw data are available from the corresponding author on reasonable request.","lang":"eng"}],"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"year":"2022","license":"https://creativecommons.org/publicdomain/zero/1.0/","ddc":["530"],"status":"public","date_published":"2022-06-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Zemlicka, Martin","first_name":"Martin","last_name":"Zemlicka","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Elena","full_name":"Redchenko, Elena","last_name":"Redchenko","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda","first_name":"Matilda","orcid":"0000-0002-3415-4628"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","last_name":"Hassani","full_name":"Hassani, Farid","first_name":"Farid","orcid":"0000-0001-6937-5773"},{"full_name":"Trioni, Andrea","first_name":"Andrea","last_name":"Trioni","id":"42F71B44-F248-11E8-B48F-1D18A9856A87"},{"id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423","full_name":"Barzanjeh, Shabir","first_name":"Shabir"},{"orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink"}],"oa":1,"date_created":"2023-11-13T08:09:10Z","_id":"14520","department":[{"_id":"JoFi"}],"title":"Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses","date_updated":"2024-09-10T12:23:57Z"},{"doi":"10.48550/ARXIV.2203.17143","publication":"arXiv","oa_version":"Preprint","month":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2203.17143"}],"day":"31","type":"preprint","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14587"}]},"citation":{"chicago":"Fischer, Julian L, and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen-Cahn Equation towards Multiphase Mean Curvature Flow.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">https://doi.org/10.48550/ARXIV.2203.17143</a>.","ista":"Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow. arXiv, <a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">10.48550/ARXIV.2203.17143</a>.","apa":"Fischer, J. L., &#38; Marveggio, A. (n.d.). Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">https://doi.org/10.48550/ARXIV.2203.17143</a>","ama":"Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">10.48550/ARXIV.2203.17143</a>","ieee":"J. L. Fischer and A. Marveggio, “Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow,” <i>arXiv</i>. .","short":"J.L. Fischer, A. Marveggio, ArXiv (n.d.).","mla":"Fischer, Julian L., and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen-Cahn Equation towards Multiphase Mean Curvature Flow.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">10.48550/ARXIV.2203.17143</a>."},"title":"Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow","ec_funded":1,"publication_status":"submitted","date_updated":"2023-11-30T13:25:02Z","project":[{"call_identifier":"H2020","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","name":"Bridging Scales in Random Materials"}],"language":[{"iso":"eng"}],"_id":"14597","arxiv":1,"date_created":"2023-11-23T09:30:02Z","department":[{"_id":"JuFi"}],"author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","first_name":"Julian L","full_name":"Fischer, Julian L","orcid":"0000-0002-0479-558X"},{"id":"25647992-AA84-11E9-9D75-8427E6697425","last_name":"Marveggio","first_name":"Alice","full_name":"Marveggio, Alice"}],"oa":1,"external_id":{"arxiv":["2203.17143"]},"status":"public","date_published":"2022-03-31T00:00:00Z","abstract":[{"lang":"eng","text":"Phase-field models such as the Allen-Cahn equation may give rise to the formation and evolution of geometric shapes, a phenomenon that may be analyzed rigorously in suitable scaling regimes. In its sharp-interface limit, the vectorial Allen-Cahn equation with a potential with N≥3 distinct minima has been conjectured to describe the evolution of branched interfaces by multiphase mean curvature flow.\r\nIn the present work, we give a rigorous proof for this statement in two and three ambient dimensions and for a suitable class of potentials: As long as a strong solution to multiphase mean curvature flow exists, solutions to the vectorial Allen-Cahn equation with well-prepared initial data converge towards multiphase mean curvature flow in the limit of vanishing interface width parameter ε↘0. We even establish the rate of convergence O(ε1/2).\r\nOur approach is based on the gradient flow structure of the Allen-Cahn equation and its limiting motion: Building on the recent concept of \"gradient flow calibrations\" for multiphase mean curvature flow, we introduce a notion of relative entropy for the vectorial Allen-Cahn equation with multi-well potential. This enables us to overcome the limitations of other approaches, e.g. avoiding the need for a stability analysis of the Allen-Cahn operator or additional convergence hypotheses for the energy at positive times."}],"year":"2022","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2023-11-24T13:10:09Z","arxiv":1,"_id":"14600","language":[{"iso":"eng"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"date_updated":"2025-07-14T09:10:02Z","publication_status":"submitted","ec_funded":1,"title":"Learning control policies for stochastic systems with reach-avoid guarantees","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold $p\\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on $3$ stochastic non-linear reinforcement learning tasks."}],"tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"year":"2022","license":"https://creativecommons.org/licenses/by-sa/4.0/","date_published":"2022-11-29T00:00:00Z","status":"public","oa":1,"author":[{"full_name":"Zikelic, Dorde","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"external_id":{"arxiv":["2210.05308"]},"month":"11","oa_version":"Preprint","publication":"arXiv","doi":"10.48550/ARXIV.2210.05308","citation":{"ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>.","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., &#38; Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">https://doi.org/10.48550/ARXIV.2210.05308</a>","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">https://doi.org/10.48550/ARXIV.2210.05308</a>.","ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” <i>arXiv</i>. .","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05308\">10.48550/ARXIV.2210.05308</a>."},"related_material":{"record":[{"status":"public","id":"14539","relation":"dissertation_contains"},{"relation":"later_version","status":"public","id":"14830"}]},"day":"29","type":"preprint","main_file_link":[{"url":"https://arxiv.org/abs/2210.05308","open_access":"1"}]}]