[{"month":"01","article_type":"original","keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"publisher":"De Gruyter","type":"journal_article","publication_status":"published","oa_version":"Published Version","arxiv":1,"_id":"10856","isi":1,"publication_identifier":{"issn":["2299-3274"]},"date_updated":"2023-08-17T07:07:58Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"UlWa"}],"title":"On the volume of sections of the cube","file":[{"file_size":789801,"file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","date_created":"2022-03-18T09:31:59Z","checksum":"7e615ac8489f5eae580b6517debfdc53","date_updated":"2022-03-18T09:31:59Z","relation":"main_file","creator":"dernst","file_id":"10857"}],"date_published":"2021-01-29T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["2004.02674"],"isi":["000734286800001"]},"author":[{"full_name":"Ivanov, Grigory","last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","first_name":"Grigory"},{"last_name":"Tsiutsiurupa","full_name":"Tsiutsiurupa, Igor","first_name":"Igor"}],"volume":9,"acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","status":"public","year":"2021","publication":"Analysis and Geometry in Metric Spaces","page":"1-18","language":[{"iso":"eng"}],"issue":"1","intvolume":"         9","doi":"10.1515/agms-2020-0103","scopus_import":"1","quality_controlled":"1","date_created":"2022-03-18T09:25:14Z","citation":{"ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>","ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18."},"day":"29","article_processing_charge":"No","has_accepted_license":"1","ddc":["510"],"abstract":[{"text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2.","lang":"eng"}],"file_date_updated":"2022-03-18T09:31:59Z","oa":1},{"has_accepted_license":"1","article_processing_charge":"No","article_number":"1827","file_date_updated":"2022-03-18T09:53:15Z","oa":1,"ddc":["540"],"abstract":[{"text":"The cost-effective conversion of low-grade heat into electricity using thermoelectric devices requires developing alternative materials and material processing technologies able to reduce the currently high device manufacturing costs. In this direction, thermoelectric materials that do not rely on rare or toxic elements such as tellurium or lead need to be produced using high-throughput technologies not involving high temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative to Bi2Te3 for ambient temperature thermoelectric applications, but its performance is still low for practical applications, and additional efforts toward finding proper dopants are required. Here, we report a scalable method to produce Bi2Se3 nanosheets at low synthesis temperatures. We studied the influence of different dopants on the thermoelectric properties of this material. Among the elements tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a reduction in the thermal conductivity in the direction of the hot-press axis, resulting in an overall 60% improvement in the thermoelectric figure of merit of Bi2Se3.","lang":"eng"}],"doi":"10.3390/nano11071827","intvolume":"        11","corr_author":"1","day":"14","scopus_import":"1","date_created":"2022-03-18T09:45:02Z","quality_controlled":"1","citation":{"ieee":"M. Li <i>et al.</i>, “Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping,” <i>Nanomaterials</i>, vol. 11, no. 7. MDPI, 2021.","short":"M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu, A. Cabot, Nanomaterials 11 (2021).","ama":"Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. 2021;11(7). doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>","chicago":"Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>.","apa":"Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021). Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. MDPI. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>","mla":"Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>, vol. 11, no. 7, 1827, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>.","ista":"Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A. 2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. Nanomaterials. 11(7), 1827."},"year":"2021","issue":"7","publication":"Nanomaterials","language":[{"iso":"eng"}],"author":[{"last_name":"Li","full_name":"Li, Mengyao","first_name":"Mengyao"},{"first_name":"Yu","last_name":"Zhang","full_name":"Zhang, Yu"},{"full_name":"Zhang, Ting","last_name":"Zhang","first_name":"Ting"},{"first_name":"Yong","last_name":"Zuo","full_name":"Zuo, Yong"},{"first_name":"Ke","full_name":"Xiao, Ke","last_name":"Xiao"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu","first_name":"Yu"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"external_id":{"isi":["000676570000001"],"pmid":["34361214"]},"volume":11,"file":[{"date_updated":"2022-03-18T09:53:15Z","file_id":"10859","creator":"dernst","relation":"main_file","file_name":"2021_Nanomaterials_Li.pdf","success":1,"file_size":4867547,"checksum":"f28a8b5cf80f5605828359bb398463b0","date_created":"2022-03-18T09:53:15Z","access_level":"open_access","content_type":"application/pdf"}],"date_published":"2021-07-14T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3.","status":"public","date_updated":"2025-06-12T06:42:18Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"MaIb"}],"title":"Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping","pmid":1,"ec_funded":1,"_id":"10858","publication_identifier":{"issn":["2079-4991"]},"isi":1,"oa_version":"Published Version","type":"journal_article","publication_status":"published","publisher":"MDPI","article_type":"original","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"month":"07","keyword":["General Materials Science","General Chemical Engineering"]},{"intvolume":"        64","doi":"10.4153/s000843952000096x","scopus_import":"1","date_created":"2022-03-18T09:55:59Z","quality_controlled":"1","citation":{"mla":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>.","chicago":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society, 2021. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>.","apa":"Ivanov, G. (2021). Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>","ista":"Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 64(4), 942–963.","ama":"Ivanov G. Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. 2021;64(4):942-963. doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>","ieee":"G. Ivanov, “Tight frames and related geometric problems,” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.","short":"G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963."},"corr_author":"1","day":"18","article_processing_charge":"No","abstract":[{"text":"A tight frame is the orthogonal projection of some orthonormal basis of Rn onto Rk. We show that a set of vectors is a tight frame if and only if the set of all cross products of these vectors is a tight frame. We reformulate a range of problems on the volume of projections (or sections) of regular polytopes in terms of tight frames and write a first-order necessary condition for local extrema of these problems. As applications, we prove new results for the problem of maximization of the volume of zonotopes.","lang":"eng"}],"oa":1,"date_published":"2021-12-18T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000730165300021"],"arxiv":["1804.10055"]},"author":[{"full_name":"Ivanov, Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","first_name":"Grigory"}],"volume":64,"acknowledgement":"The author was supported by the Swiss National Science Foundation grant 200021_179133. The author acknowledges the financial support from the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no. 075-15-2019-1926.","status":"public","year":"2021","publication":"Canadian Mathematical Bulletin","page":"942-963","language":[{"iso":"eng"}],"issue":"4","_id":"10860","isi":1,"publication_identifier":{"eissn":["1496-4287"],"issn":["0008-4395"]},"date_updated":"2024-10-09T21:01:50Z","department":[{"_id":"UlWa"}],"title":"Tight frames and related geometric problems","month":"12","article_type":"original","keyword":["General Mathematics","Tight frame","Grassmannian","zonotope"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10055"}],"publisher":"Canadian Mathematical Society","type":"journal_article","publication_status":"published","oa_version":"Preprint","arxiv":1},{"date_created":"2022-03-21T11:41:28Z","citation":{"ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>."},"day":"17","_id":"10912","ec_funded":1,"doi":"10.48550/ARXIV.2108.06686","abstract":[{"text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"ddc":["570"],"department":[{"_id":"GaTk"}],"title":"Quantifying the coexistence of neuronal oscillations and avalanches","oa":1,"date_updated":"2024-10-22T11:24:26Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.06686"}],"acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","status":"public","date_published":"2021-08-17T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"author":[{"last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425","full_name":"Lombardi, Fabrizio","orcid":"0000-0003-2623-5249","first_name":"Fabrizio"},{"first_name":"Selver","full_name":"Pepic, Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","last_name":"Pepic"},{"full_name":"Shriki, Oren","last_name":"Shriki","first_name":"Oren"},{"last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","first_name":"Gašper"},{"full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele"}],"external_id":{"arxiv":["2108.06686"]},"language":[{"iso":"eng"}],"page":"37","arxiv":1,"publication_status":"submitted","publisher":"arXiv","type":"preprint","oa_version":"Preprint","year":"2021"},{"doi":"10.1016/j.devcel.2021.10.008","intvolume":"        56","day":"08","citation":{"ama":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. <i>Developmental Cell</i>. 2021;56(21):P2952-2965.e9. doi:<a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">10.1016/j.devcel.2021.10.008</a>","short":"S. Krishna, R. Arrojo e Drigo, J.S. Capitanio, R. Ramachandra, M. Ellisman, M. Hetzer, Developmental Cell 56 (2021) P2952–2965.e9.","ieee":"S. Krishna, R. Arrojo e Drigo, J. S. Capitanio, R. Ramachandra, M. Ellisman, and M. Hetzer, “Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain,” <i>Developmental Cell</i>, vol. 56, no. 21. Elsevier, p. P2952–2965.e9, 2021.","ista":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. 2021. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. Developmental Cell. 56(21), P2952–2965.e9.","apa":"Krishna, S., Arrojo e Drigo, R., Capitanio, J. S., Ramachandra, R., Ellisman, M., &#38; Hetzer, M. (2021). Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">https://doi.org/10.1016/j.devcel.2021.10.008</a>","chicago":"Krishna, Shefali, Rafael Arrojo e Drigo, Juliana S. Capitanio, Ranjan Ramachandra, Mark Ellisman, and Martin Hetzer. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” <i>Developmental Cell</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">https://doi.org/10.1016/j.devcel.2021.10.008</a>.","mla":"Krishna, Shefali, et al. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” <i>Developmental Cell</i>, vol. 56, no. 21, Elsevier, 2021, p. P2952–2965.e9, doi:<a href=\"https://doi.org/10.1016/j.devcel.2021.10.008\">10.1016/j.devcel.2021.10.008</a>."},"quality_controlled":"1","date_created":"2022-04-07T07:43:14Z","scopus_import":"1","article_processing_charge":"No","abstract":[{"text":"In order to combat molecular damage, most cellular proteins undergo rapid turnover. We have previously identified large nuclear protein assemblies that can persist for years in post-mitotic tissues and are subject to age-related decline. Here, we report that mitochondria can be long lived in the mouse brain and reveal that specific mitochondrial proteins have half-lives longer than the average proteome. These mitochondrial long-lived proteins (mitoLLPs) are core components of the electron transport chain (ETC) and display increased longevity in respiratory supercomplexes. We find that COX7C, a mitoLLP that forms a stable contact site between complexes I and IV, is required for complex IV and supercomplex assembly. Remarkably, even upon depletion of COX7C transcripts, ETC function is maintained for days, effectively uncoupling mitochondrial function from ongoing transcription of its mitoLLPs. Our results suggest that modulating protein longevity within the ETC is critical for mitochondrial proteome maintenance and the robustness of mitochondrial function.","lang":"eng"}],"extern":"1","volume":56,"author":[{"first_name":"Shefali","full_name":"Krishna, Shefali","last_name":"Krishna"},{"full_name":"Arrojo e Drigo, Rafael","last_name":"Arrojo e Drigo","first_name":"Rafael"},{"last_name":"Capitanio","full_name":"Capitanio, Juliana S.","first_name":"Juliana S."},{"first_name":"Ranjan","full_name":"Ramachandra, Ranjan","last_name":"Ramachandra"},{"first_name":"Mark","full_name":"Ellisman, Mark","last_name":"Ellisman"},{"first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"}],"external_id":{"pmid":["34715012"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-11-08T00:00:00Z","status":"public","year":"2021","issue":"21","publication":"Developmental Cell","language":[{"iso":"eng"}],"page":"P2952-2965.e9","pmid":1,"_id":"11052","publication_identifier":{"issn":["1534-5807"]},"date_updated":"2025-12-15T10:01:56Z","title":"Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain","department":[{"_id":"MaHe"}],"article_type":"original","month":"11","keyword":["Developmental Biology","Cell Biology","General Biochemistry","Genetics and Molecular Biology","Molecular Biology"],"oa_version":"None","publisher":"Elsevier","type":"journal_article","publication_status":"published"},{"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1905.11845","open_access":"1"}],"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"month":"05","arxiv":1,"type":"conference","publication_status":"published","publisher":"AAAI Press","oa_version":"Preprint","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781713835974"],"issn":["2159-5399"]},"_id":"11436","ec_funded":1,"title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","department":[{"_id":"DaAl"}],"date_updated":"2025-04-14T07:43:57Z","acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","status":"public","date_published":"2021-05-18T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":35,"author":[{"first_name":"Vyacheslav","last_name":"Kungurtsev","full_name":"Kungurtsev, Vyacheslav"},{"full_name":"Egan, Malcolm","last_name":"Egan","first_name":"Malcolm"},{"full_name":"Chatterjee, Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Bapi"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"external_id":{"arxiv":["1905.11845"]},"language":[{"iso":"eng"}],"publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","page":"8209-8216","issue":"9B","year":"2021","date_created":"2022-06-05T22:01:52Z","quality_controlled":"1","citation":{"ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press.","mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16.","chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216."},"scopus_import":"1","day":"18","intvolume":"        35","abstract":[{"text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy.","lang":"eng"}],"oa":1,"conference":{"start_date":"2021-02-02","name":"AAAI: Conference on Artificial Intelligence","location":"Virtual, Online","end_date":"2021-02-09"},"article_processing_charge":"No"},{"type":"journal_article","publisher":"Association for Research in Vision and Ophthalmology","publication_status":"published","oa_version":"Published Version","month":"08","article_type":"original","date_updated":"2023-08-14T06:35:17Z","department":[{"_id":"SaSi"}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","_id":"10000","pmid":1,"isi":1,"publication_identifier":{"eissn":["1552-5783"],"issn":["0146-0404"]},"year":"2021","language":[{"iso":"eng"}],"publication":"Investigative Ophthalmology and Visual Science","issue":"10","file":[{"file_name":"2021_IOVS_Schmitt.pdf","success":1,"file_size":19707796,"checksum":"c430967746f653aa1ae84ee617f62b73","date_created":"2022-05-13T07:40:15Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-05-13T07:40:15Z","file_id":"11369","creator":"dernst","relation":"main_file"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-08-16T00:00:00Z","author":[{"first_name":"Heather M.","last_name":"Schmitt","full_name":"Schmitt, Heather M."},{"first_name":"Rachel L.","full_name":"Fehrman, Rachel L.","last_name":"Fehrman"},{"full_name":"Maes, Margaret E","orcid":"0000-0001-9642-1085","id":"3838F452-F248-11E8-B48F-1D18A9856A87","last_name":"Maes","first_name":"Margaret E"},{"full_name":"Yang, Huan","last_name":"Yang","first_name":"Huan"},{"first_name":"Lian Wang","last_name":"Guo","full_name":"Guo, Lian Wang"},{"last_name":"Schlamp","full_name":"Schlamp, Cassandra L.","first_name":"Cassandra L."},{"first_name":"Heather R.","full_name":"Pelzel, Heather R.","last_name":"Pelzel"},{"first_name":"Robert W.","full_name":"Nickells, Robert W.","last_name":"Nickells"}],"external_id":{"pmid":["34398198"],"isi":["000695230000014"]},"volume":62,"status":"public","acknowledgement":"The authors thank Joel Dietz for maintaining the mice used in this study, Satoshi Kinoshita and the Translational Research Initiative in Pathology Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed in this study, and Mark Banghart for statistical review of the data analysis. Supported by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809 (LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness, Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick A. Davis Research Chair (RWN). ","article_processing_charge":"Yes","article_number":"14","has_accepted_license":"1","ddc":["570"],"abstract":[{"text":"Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs) after acute optic nerve damage. Consistent with this, induced HDAC3 expression in cultured cells shows selective toxicity to neurons. Despite an established role for HDAC3 in neuronal pathology, little is known regarding the mechanism of this pathology.","lang":"eng"}],"file_date_updated":"2022-05-13T07:40:15Z","oa":1,"intvolume":"        62","doi":"10.1167/IOVS.62.10.14","scopus_import":"1","citation":{"ista":"Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 62(10), 14.","chicago":"Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision and Ophthalmology, 2021. <a href=\"https://doi.org/10.1167/IOVS.62.10.14\">https://doi.org/10.1167/IOVS.62.10.14</a>.","mla":"Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology and Visual Science</i>, vol. 62, no. 10, 14, Association for Research in Vision and Ophthalmology, 2021, doi:<a href=\"https://doi.org/10.1167/IOVS.62.10.14\">10.1167/IOVS.62.10.14</a>.","apa":"Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp, C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision and Ophthalmology. <a href=\"https://doi.org/10.1167/IOVS.62.10.14\">https://doi.org/10.1167/IOVS.62.10.14</a>","ama":"Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology and Visual Science</i>. 2021;62(10). doi:<a href=\"https://doi.org/10.1167/IOVS.62.10.14\">10.1167/IOVS.62.10.14</a>","short":"H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R. Pelzel, R.W. Nickells, Investigative Ophthalmology and Visual Science 62 (2021).","ieee":"H. M. Schmitt <i>et al.</i>, “Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression,” <i>Investigative Ophthalmology and Visual Science</i>, vol. 62, no. 10. Association for Research in Vision and Ophthalmology, 2021."},"date_created":"2021-09-12T22:01:23Z","quality_controlled":"1","day":"16"},{"_id":"10002","ec_funded":1,"publication_identifier":{"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"],"isbn":["978-1-6654-4896-3"]},"isi":1,"date_updated":"2025-07-10T11:15:45Z","title":"Symbolic time and space tradeoffs for probabilistic verification","department":[{"_id":"KrCh"}],"month":"07","project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"main_file_link":[{"url":"https://arxiv.org/abs/2104.07466","open_access":"1"}],"keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"oa_version":"Preprint","publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","type":"conference","arxiv":1,"doi":"10.1109/LICS52264.2021.9470739","day":"07","date_created":"2021-09-12T22:01:24Z","quality_controlled":"1","citation":{"apa":"Chatterjee, K., Dvorak, W., Henzinger, M., &#38; Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">https://doi.org/10.1109/LICS52264.2021.9470739</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">https://doi.org/10.1109/LICS52264.2021.9470739</a>.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">10.1109/LICS52264.2021.9470739</a>.","ista":"Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","ama":"Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470739\">10.1109/LICS52264.2021.9470739</a>","short":"K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ieee":"K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021, pp. 1–13."},"scopus_import":"1","conference":{"start_date":"2021-06-29","location":"Rome, Italy","name":"LICS: Logic in Computer Science","end_date":"2021-07-02"},"article_processing_charge":"No","oa":1,"abstract":[{"lang":"eng","text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with  n  vertices and  m  edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires  O(n2)  symbolic operations and  O(1)  symbolic space. The only other symbolic algorithm for the MEC decomposition requires  O(nm−−√)  symbolic operations and  O(m−−√)  symbolic space. A main open question is whether the worst-case  O(n2)  bound for symbolic operations can be beaten. We present a symbolic algorithm that requires  O˜(n1.5)  symbolic operations and  O˜(n−−√)  symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all  0<ϵ≤1/2  the symbolic algorithm requires  O˜(n2−ϵ)  symbolic operations and  O˜(nϵ)  symbolic space ( O˜  hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of  ω -regular objectives for MDPs. We consider the canonical parity objectives for  ω -regular objectives, and for parity objectives with  d -priorities we present an algorithm that computes the almost-sure winning region with  O˜(n2−ϵ)  symbolic operations and  O˜(nϵ)  symbolic space, for all  0<ϵ≤1/2 ."}],"external_id":{"isi":["000947350400089"],"arxiv":["2104.07466"]},"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dvorak, Wolfgang","last_name":"Dvorak","first_name":"Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-07-07T00:00:00Z","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506.","status":"public","year":"2021","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","page":"1-13","language":[{"iso":"eng"}]},{"publisher":"Institute of Electrical and Electronics Engineers","type":"conference","publication_status":"published","oa_version":"Preprint","arxiv":1,"month":"07","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"main_file_link":[{"url":"https://arxiv.org/abs/2104.07278","open_access":"1"}],"date_updated":"2025-09-08T14:54:13Z","title":"Stochastic processes with expected stopping time","department":[{"_id":"KrCh"}],"_id":"10004","ec_funded":1,"isi":1,"publication_identifier":{"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"],"isbn":["978-1-6654-4896-3"]},"year":"2021","language":[{"iso":"eng"}],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","page":"1-13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-07-07T00:00:00Z","external_id":{"arxiv":["2104.07278"],"isi":["000947350400036"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"status":"public","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","conference":{"start_date":"2021-06-29","end_date":"2021-07-02","location":"Rome, Italy","name":"LICS: Logic in Computer Science"},"article_processing_charge":"No","abstract":[{"text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.","lang":"eng"}],"oa":1,"related_material":{"record":[{"id":"18630","status":"public","relation":"later_version"}]},"doi":"10.1109/LICS52264.2021.9470595","citation":{"ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.","apa":"Chatterjee, K., &#38; Doyen, L. (2021). Stochastic processes with expected stopping time. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">https://doi.org/10.1109/LICS52264.2021.9470595</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">https://doi.org/10.1109/LICS52264.2021.9470595</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">10.1109/LICS52264.2021.9470595</a>.","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021, pp. 1–13.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470595\">10.1109/LICS52264.2021.9470595</a>"},"quality_controlled":"1","date_created":"2021-09-12T22:01:25Z","scopus_import":"1","day":"07"},{"year":"2021","language":[{"iso":"eng"}],"publication":"Mathematical Models and Methods in Applied Sciences","issue":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-08-25T00:00:00Z","external_id":{"arxiv":["2009.06917"],"isi":["000722222900004"]},"author":[{"last_name":"Bulíček","full_name":"Bulíček, Miroslav","first_name":"Miroslav"},{"full_name":"Maringová, Erika","last_name":"Maringová","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","first_name":"Erika"},{"full_name":"Málek, Josef","last_name":"Málek","first_name":"Josef"}],"volume":31,"status":"public","acknowledgement":"M. Bulíček and J. Málek acknowledge the support of the project No. 18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers of the Nečas Center for Mathematical Modelling.\r\n","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study systems of nonlinear partial differential equations of parabolic type, in which the elliptic operator is replaced by the first-order divergence operator acting on a flux function, which is related to the spatial gradient of the unknown through an additional implicit equation. This setting, broad enough in terms of applications, significantly expands the paradigm of nonlinear parabolic problems. Formulating four conditions concerning the form of the implicit equation, we first show that these conditions describe a maximal monotone p-coercive graph. We then establish the global-in-time and large-data existence of a (weak) solution and its uniqueness. To this end, we adopt and significantly generalize Minty’s method of monotone mappings. A unified theory, containing several novel tools, is developed in a way to be tractable from the point of view of numerical approximations."}],"oa":1,"intvolume":"        31","doi":"10.1142/S0218202521500457","scopus_import":"1","quality_controlled":"1","citation":{"chicago":"Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0218202521500457\">https://doi.org/10.1142/S0218202521500457</a>.","mla":"Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 09, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/S0218202521500457\">10.1142/S0218202521500457</a>.","apa":"Bulíček, M., Maringová, E., &#38; Málek, J. (2021). On nonlinear problems of parabolic type with implicit constitutive equations involving flux. <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218202521500457\">https://doi.org/10.1142/S0218202521500457</a>","ista":"Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. 31(09).","ama":"Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. <i>Mathematical Models and Methods in Applied Sciences</i>. 2021;31(09). doi:<a href=\"https://doi.org/10.1142/S0218202521500457\">10.1142/S0218202521500457</a>","ieee":"M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic type with implicit constitutive equations involving flux,” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 09. World Scientific Publishing, 2021.","short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021)."},"date_created":"2021-09-12T22:01:25Z","day":"25","type":"journal_article","publisher":"World Scientific Publishing","publication_status":"published","oa_version":"Preprint","arxiv":1,"month":"08","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"article_type":"original","keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06917"}],"date_updated":"2025-05-14T10:50:14Z","title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","department":[{"_id":"JuFi"}],"_id":"10005","isi":1,"publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]}},{"quality_controlled":"1","citation":{"ama":"Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. <i>Communications in Information and Systems</i>. 2021;21(4):481-536. doi:<a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">10.4310/CIS.2021.v21.n4.a1</a>","ieee":"I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and gradient flow for the relative entropy in Markov chains,” <i>Communications in Information and Systems</i>, vol. 21, no. 4. International Press, pp. 481–536, 2021.","short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","ista":"Karatzas I, Maas J, Schachermayer W. 2021. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 21(4), 481–536.","mla":"Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” <i>Communications in Information and Systems</i>, vol. 21, no. 4, International Press, 2021, pp. 481–536, doi:<a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">10.4310/CIS.2021.v21.n4.a1</a>.","apa":"Karatzas, I., Maas, J., &#38; Schachermayer, W. (2021). Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. <i>Communications in Information and Systems</i>. International Press. <a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">https://doi.org/10.4310/CIS.2021.v21.n4.a1</a>","chicago":"Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” <i>Communications in Information and Systems</i>. International Press, 2021. <a href=\"https://doi.org/10.4310/CIS.2021.v21.n4.a1\">https://doi.org/10.4310/CIS.2021.v21.n4.a1</a>."},"date_created":"2021-09-19T08:53:19Z","day":"04","intvolume":"        21","doi":"10.4310/CIS.2021.v21.n4.a1","abstract":[{"lang":"eng","text":"We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance in terms of an appropriate Hilbertian norm; and in the case of the relative entropy, in terms of a Dirichlet form which morphs into a version of the familiar Fisher information under conditions of detailed balance. Here we obtain trajectorial versions of these results, valid along almost every path of the random motion and most transparent in the backwards direction of time. Martingale arguments and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer and Tschiderer for conservative diffusions. Extensions are developed to general “convex divergences” and to countable state-spaces. The steepest descent and gradient flow properties for the variance, the relative entropy, and appropriate generalizations, are studied along with their respective geometries under conditions of detailed balance, leading to a very direct proof for the HWI inequality of Otto and Villani in the present context."}],"oa":1,"article_processing_charge":"No","acknowledgement":"I.K. acknowledges support from the U.S. National Science Foundation under Grant NSF-DMS-20-04997. J.M. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and from the Austrian Science Fund (FWF) through project F65. W.S. acknowledges support from the Austrian Science Fund (FWF) under grant P28861 and by the Vienna Science and Technology Fund (WWTF) through projects MA14-008 and MA16-021.","status":"public","date_published":"2021-06-04T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":21,"external_id":{"arxiv":["2005.14177"]},"author":[{"full_name":"Karatzas, Ioannis","last_name":"Karatzas","first_name":"Ioannis"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","first_name":"Jan"},{"first_name":"Walter","full_name":"Schachermayer, Walter","last_name":"Schachermayer"}],"publication":"Communications in Information and Systems","page":"481-536","language":[{"iso":"eng"}],"issue":"4","year":"2021","publication_identifier":{"issn":["1526-7555"]},"_id":"10023","ec_funded":1,"department":[{"_id":"JaMa"}],"title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","date_updated":"2025-04-14T07:27:45Z","keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"main_file_link":[{"url":"https://arxiv.org/abs/2005.14177","open_access":"1"}],"month":"06","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"article_type":"original","arxiv":1,"type":"journal_article","publication_status":"published","publisher":"International Press","oa_version":"Preprint"},{"date_updated":"2025-04-14T07:43:46Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"JaMa"}],"title":"Hydrodynamics for the partial exclusion process in random environment","ec_funded":1,"_id":"10024","isi":1,"publication_identifier":{"issn":["0304-4149"]},"publisher":"Elsevier","type":"journal_article","publication_status":"published","oa_version":"Published Version","arxiv":1,"month":"08","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"article_type":"original","keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"],"article_processing_charge":"Yes","has_accepted_license":"1","ddc":["519"],"abstract":[{"lang":"eng","text":"In this paper, we introduce a random environment for the exclusion process in  obtained by assigning a maximal occupancy to each site. This maximal occupancy is allowed to randomly vary among sites, and partial exclusion occurs. Under the assumption of ergodicity under translation and uniform ellipticity of the environment, we derive a quenched hydrodynamic limit in path space by strengthening the mild solution approach initiated in Nagy (2002) and Faggionato (2007). To this purpose, we prove, employing the technology developed for the random conductance model, a homogenization result in the form of an arbitrary starting point quenched invariance principle for a single particle in the same environment, which is a result of independent interest. The self-duality property of the partial exclusion process allows us to transfer this homogenization result to the particle system and, then, apply the tightness criterion in Redig et al. (2020)."}],"file_date_updated":"2022-05-13T07:55:50Z","oa":1,"intvolume":"       142","doi":"10.1016/j.spa.2021.08.006","scopus_import":"1","quality_controlled":"1","citation":{"ieee":"S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion process in random environment,” <i>Stochastic Processes and their Applications</i>, vol. 142. Elsevier, pp. 124–158, 2021.","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","ama":"Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process in random environment. <i>Stochastic Processes and their Applications</i>. 2021;142:124-158. doi:<a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">10.1016/j.spa.2021.08.006</a>","ista":"Floreani S, Redig F, Sau F. 2021. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 142, 124–158.","mla":"Floreani, Simone, et al. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” <i>Stochastic Processes and Their Applications</i>, vol. 142, Elsevier, 2021, pp. 124–58, doi:<a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">10.1016/j.spa.2021.08.006</a>.","chicago":"Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” <i>Stochastic Processes and Their Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">https://doi.org/10.1016/j.spa.2021.08.006</a>.","apa":"Floreani, S., Redig, F., &#38; Sau, F. (2021). Hydrodynamics for the partial exclusion process in random environment. <i>Stochastic Processes and Their Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.spa.2021.08.006\">https://doi.org/10.1016/j.spa.2021.08.006</a>"},"date_created":"2021-09-19T22:01:25Z","day":"27","year":"2021","page":"124-158","publication":"Stochastic Processes and their Applications","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-08-27T00:00:00Z","file":[{"checksum":"56768c553d7218ee5714902ffec90ec4","date_created":"2022-05-13T07:55:50Z","content_type":"application/pdf","access_level":"open_access","success":1,"file_name":"2021_StochasticProcessesAppl_Floreani.pdf","file_size":2115791,"file_id":"11370","creator":"dernst","relation":"main_file","date_updated":"2022-05-13T07:55:50Z"}],"external_id":{"isi":["000697748500005"],"arxiv":["1911.12564"]},"author":[{"last_name":"Floreani","full_name":"Floreani, Simone","first_name":"Simone"},{"first_name":"Frank","last_name":"Redig","full_name":"Redig, Frank"},{"id":"E1836206-9F16-11E9-8814-AEFDE5697425","last_name":"Sau","full_name":"Sau, Federico","first_name":"Federico"}],"volume":142,"acknowledgement":"The authors would like to thank Marek Biskup and Alberto Chiarini for useful suggestions and  Cristian  Giardina,  Frank  den  Hollander  and  Shubhamoy  Nandan  for  inspiring  discussions.  S.F.  acknowledges  Simona  Villa  for  her  help  in  creating  the  picture.  Furthermore, the  authors  thank  two  anonymous  referees  for  the  careful  reading  of  the  manuscript.  S.F. acknowledges  financial  support  from  NWO,  The  Netherlands  via  the  grant  TOP1.17.019. F.S.  acknowledges  financial  support  from  NWO  via  the  TOP1  grant  613.001.552  as  well  as funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.","status":"public"},{"keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.00653"}],"project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"month":"09","article_type":"original","arxiv":1,"publication_status":"published","publisher":"Springer Nature","type":"journal_article","oa_version":"Preprint","isi":1,"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"ec_funded":1,"_id":"10025","title":"Half and quarter metals in rhombohedral trilayer graphene","department":[{"_id":"MaSe"},{"_id":"MiLe"}],"date_updated":"2025-04-14T07:43:46Z","acknowledgement":"The authors acknowledge discussions with A. Macdonald, L. Fu, F. Wang and M. Zaletel. AFY acknowledges support of the National Science Foundation under DMR1654186, and the Gordon and Betty Moore Foundation under award GBMF9471. The authors acknowledge the use of the research facilities within the California NanoSystems Institute, supported by the University of California, Santa Barbara and the University of California, Office of the President.\r\nK.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, Grant Number JPMXP0112101001 and JSPS KAKENHI, Grant Number JP20H00354. EB and TH were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement No. 817799). A.G. acknowledges support by the European Unions Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement\r\nNo. 754411.\r\n","status":"public","date_published":"2021-09-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Zhou, Haoxin","last_name":"Zhou","first_name":"Haoxin"},{"full_name":"Xie, Tian","last_name":"Xie","first_name":"Tian"},{"last_name":"Ghazaryan","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543","first_name":"Areg"},{"last_name":"Holder","full_name":"Holder, Tobias","first_name":"Tobias"},{"full_name":"Ehrets, James R.","last_name":"Ehrets","first_name":"James R."},{"first_name":"Eric M.","last_name":"Spanton","full_name":"Spanton, Eric M."},{"full_name":"Taniguchi, Takashi","last_name":"Taniguchi","first_name":"Takashi"},{"full_name":"Watanabe, Kenji","last_name":"Watanabe","first_name":"Kenji"},{"full_name":"Berg, Erez","last_name":"Berg","first_name":"Erez"},{"full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","first_name":"Maksym"},{"first_name":"Andrea F.","last_name":"Young","full_name":"Young, Andrea F."}],"external_id":{"isi":["000706977400002"],"arxiv":["2104.00653"]},"language":[{"iso":"eng"}],"publication":"Nature","year":"2021","scopus_import":"1","quality_controlled":"1","date_created":"2021-09-19T22:01:25Z","citation":{"ama":"Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral trilayer graphene. <i>Nature</i>. 2021. doi:<a href=\"https://doi.org/10.1038/s41586-021-03938-w\">10.1038/s41586-021-03938-w</a>","ieee":"H. Zhou <i>et al.</i>, “Half and quarter metals in rhombohedral trilayer graphene,” <i>Nature</i>. Springer Nature, 2021.","short":"H. Zhou, T. Xie, A. Ghazaryan, T. Holder, J.R. Ehrets, E.M. Spanton, T. Taniguchi, K. Watanabe, E. Berg, M. Serbyn, A.F. Young, Nature (2021).","ista":"Zhou H, Xie T, Ghazaryan A, Holder T, Ehrets JR, Spanton EM, Taniguchi T, Watanabe K, Berg E, Serbyn M, Young AF. 2021. Half and quarter metals in rhombohedral trilayer graphene. Nature.","mla":"Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” <i>Nature</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41586-021-03938-w\">10.1038/s41586-021-03938-w</a>.","apa":"Zhou, H., Xie, T., Ghazaryan, A., Holder, T., Ehrets, J. R., Spanton, E. M., … Young, A. F. (2021). Half and quarter metals in rhombohedral trilayer graphene. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-021-03938-w\">https://doi.org/10.1038/s41586-021-03938-w</a>","chicago":"Zhou, Haoxin, Tian Xie, Areg Ghazaryan, Tobias Holder, James R. Ehrets, Eric M. Spanton, Takashi Taniguchi, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” <i>Nature</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41586-021-03938-w\">https://doi.org/10.1038/s41586-021-03938-w</a>."},"day":"01","related_material":{"link":[{"url":"https://doi.org/10.1038/s41586-021-04181-z","relation":"erratum"}]},"doi":"10.1038/s41586-021-03938-w","abstract":[{"lang":"eng","text":"Ferromagnetism is most common in transition metal compounds but may also arise in low-density two-dimensional electron systems, with signatures observed in silicon, III-V semiconductor systems, and graphene moiré heterostructures. Here we show that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive the spontaneous ferromagnetic polarization of the electron system into one or more spin- and valley flavors. Using capacitance measurements on graphite-gated van der Waals heterostructures, we find a cascade of density- and electronic displacement field tuned phase transitions marked by negative electronic compressibility. The transitions define the boundaries between phases where quantum oscillations have either four-fold, two-fold, or one-fold degeneracy, associated with a spin and valley degenerate normal metal, spin-polarized `half-metal', and spin and valley polarized `quarter metal', respectively. For electron doping, the salient features are well captured by a phenomenological Stoner model with a valley-anisotropic Hund's coupling, likely arising from interactions at the lattice scale. For hole filling, we observe a richer phase diagram featuring a delicate interplay of broken symmetries and transitions in the Fermi surface topology. Finally, by rotational alignment of a hexagonal boron nitride substrate to induce a moiré superlattice, we find that the superlattice perturbs the preexisting isospin order only weakly, leaving the basic phase diagram intact while catalyzing the formation of topologically nontrivial gapped states whenever itinerant half- or quarter metal states occur at half- or quarter superlattice band filling. Our results show that rhombohedral trilayer graphene is an ideal platform for well-controlled tests of many-body theory and reveal magnetism in moiré materials to be fundamentally itinerant in nature."}],"oa":1,"article_processing_charge":"No"},{"oa_version":"Preprint","publication_status":"draft","type":"preprint","arxiv":1,"month":"07","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"main_file_link":[{"url":"https://arxiv.org/abs/2107.03695","open_access":"1"}],"date_updated":"2025-04-15T06:54:43Z","title":"Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid","department":[{"_id":"MaSe"},{"_id":"AnHi"},{"_id":"MiLe"}],"_id":"10029","ec_funded":1,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"year":"2021","language":[{"iso":"eng"}],"publication":"arXiv","external_id":{"arxiv":["2107.03695"]},"author":[{"full_name":"Phan, Duc T","last_name":"Phan","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","first_name":"Duc T"},{"first_name":"Jorden L","id":"5479D234-2D30-11EA-89CC-40953DDC885E","last_name":"Senior","full_name":"Senior, Jorden L","orcid":"0000-0002-0672-9295"},{"orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","last_name":"Ghazaryan","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Areg"},{"last_name":"Hatefipour","full_name":"Hatefipour, M.","first_name":"M."},{"last_name":"Strickland","full_name":"Strickland, W. M.","first_name":"W. M."},{"first_name":"J.","last_name":"Shabani","full_name":"Shabani, J."},{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","first_name":"Maksym"},{"last_name":"Higginbotham","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2607-2363","full_name":"Higginbotham, Andrew P","first_name":"Andrew P"}],"date_published":"2021-07-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","acknowledgement":"This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility. JS and AG were supported by funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No.754411.","article_number":"2107.03695","article_processing_charge":"No","oa":1,"abstract":[{"lang":"eng","text":"Superconductor-semiconductor hybrids are platforms for realizing effective p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect, causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and application of magnetic field can then result in transitions to the normal state, partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes. Experimentally probing the hybrid superconductor-semiconductor interface is challenging due to the shunting effect of the conventional superconductor. Consequently, the nature of induced pairing remains an open question. Here, we use the circuit quantum electrodynamics architecture to probe induced superconductivity in a two dimensional Al-InAs hybrid system. We observe a strong suppression of superfluid density and enhanced dissipation driven by magnetic field, which cannot be accounted for by the depairing theory of an s-wave superconductor. These observations are explained by a picture of independent intraband p±ip superconductors giving way to partial Bogoliubov Fermi surfaces, and allow for the first characterization of key properties of the hybrid superconducting system."}],"doi":"10.48550/arXiv.2107.03695","related_material":{"record":[{"status":"public","relation":"research_data","id":"9636"},{"id":"10851","relation":"later_version","status":"public"}]},"day":"08","citation":{"ista":"Phan DT, Senior JL, Ghazaryan A, Hatefipour M, Strickland WM, Shabani J, Serbyn M, Higginbotham AP. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. arXiv, 2107.03695.","chicago":"Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland, J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.03695\">https://doi.org/10.48550/arXiv.2107.03695</a>.","apa":"Phan, D. T., Senior, J. L., Ghazaryan, A., Hatefipour, M., Strickland, W. M., Shabani, J., … Higginbotham, A. P. (n.d.). Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.03695\">https://doi.org/10.48550/arXiv.2107.03695</a>","mla":"Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” <i>ArXiv</i>, 2107.03695, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03695\">10.48550/arXiv.2107.03695</a>.","ama":"Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03695\">10.48550/arXiv.2107.03695</a>","ieee":"D. T. Phan <i>et al.</i>, “Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid,” <i>arXiv</i>. .","short":"D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J. Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.)."},"date_created":"2021-09-21T08:41:02Z"},{"oa_version":"Published Version","publication_status":"published","type":"journal_article","publisher":"Elsevier","arxiv":1,"article_type":"original","month":"09","project":[{"grant_number":"M02751","call_identifier":"FWF","name":"Algebro-Geometric Applications of Factorization Homology","_id":"26B96266-B435-11E9-9278-68D0E5697425"}],"keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"date_updated":"2025-04-14T09:09:35Z","title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"TaHa"}],"_id":"10033","publication_identifier":{"eissn":["1090-2082"],"issn":["0001-8708"]},"isi":1,"year":"2021","publication":"Advances in Mathematics","language":[{"iso":"eng"}],"volume":392,"external_id":{"arxiv":["1610.00212"],"isi":["000707040300031"]},"author":[{"first_name":"Quoc P","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","last_name":"Ho","full_name":"Ho, Quoc P","orcid":"0000-0001-6889-1418"}],"file":[{"date_created":"2021-09-21T15:58:52Z","content_type":"application/pdf","access_level":"open_access","checksum":"f3c0086d41af11db31c00014efb38072","file_size":840635,"file_name":"1-s2.0-S000187082100431X-main.pdf","relation":"main_file","file_id":"10034","creator":"qho","date_updated":"2021-09-21T15:58:52Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-09-21T00:00:00Z","acknowledgement":"The author would like to express his gratitude to D. Gaitsgory, without whose tireless guidance and encouragement in pursuing this problem, this work would not have been possible. The author is grateful to his advisor B.C. Ngô for many years of patient guidance and support. This paper is revised while the author is a postdoc in Hausel group at IST Austria. We thank him and the group for providing a wonderful research environment. The author also gratefully acknowledges the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization Homology,” Austrian Science Fund (FWF): M 2751.","status":"public","has_accepted_license":"1","article_number":"107992","article_processing_charge":"Yes (via OA deal)","oa":1,"file_date_updated":"2021-09-21T15:58:52Z","abstract":[{"text":"The ⊗*-monoidal structure on the category of sheaves on the Ran space is not pro-nilpotent in the sense of [3]. However, under some connectivity assumptions, we prove that Koszul duality induces an equivalence of categories and that this equivalence behaves nicely with respect to Verdier duality on the Ran space and integrating along the Ran space, i.e. taking factorization homology. Based on ideas sketched in [4], we show that these results also offer a simpler alternative to one of the two main steps in the proof of the Atiyah-Bott formula given in [7] and [5].","lang":"eng"}],"ddc":["514"],"doi":"10.1016/j.aim.2021.107992","intvolume":"       392","corr_author":"1","day":"21","quality_controlled":"1","citation":{"ama":"Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. <i>Advances in Mathematics</i>. 2021;392. doi:<a href=\"https://doi.org/10.1016/j.aim.2021.107992\">10.1016/j.aim.2021.107992</a>","short":"Q.P. Ho, Advances in Mathematics 392 (2021).","ieee":"Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,” <i>Advances in Mathematics</i>, vol. 392. Elsevier, 2021.","ista":"Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 392, 107992.","chicago":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” <i>Advances in Mathematics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.aim.2021.107992\">https://doi.org/10.1016/j.aim.2021.107992</a>.","apa":"Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul duality. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2021.107992\">https://doi.org/10.1016/j.aim.2021.107992</a>","mla":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” <i>Advances in Mathematics</i>, vol. 392, 107992, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.aim.2021.107992\">10.1016/j.aim.2021.107992</a>."},"date_created":"2021-09-21T15:58:59Z","scopus_import":"1"},{"date_updated":"2023-08-14T06:56:30Z","title":"RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"RySh"}],"pmid":1,"_id":"10051","publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"isi":1,"oa_version":"Published Version","publication_status":"published","publisher":"Society for Neuroscience","type":"journal_article","article_type":"original","month":"09","has_accepted_license":"1","article_processing_charge":"No","oa":1,"file_date_updated":"2022-05-31T09:10:15Z","ddc":["570"],"abstract":[{"lang":"eng","text":"Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated Ca2+ channels (CaV), it is considered to be a central organizer of the topography of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2 knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs) with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway with high release probability. Disruption of RIM-BP2 lowered release probability altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics during high-frequency train stimulation indicated a reduction of SVs with high release probability but an overall normal size of the readily releasable SV pool (RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion was slowed. Ultrastructural analysis by superresolution light and electron microscopy revealed an impaired topography of presynaptic CaV and a reduction of docked and membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for establishing a high initial release probability as required to reliably signal sound onset information that we found to be degraded in BCs of RIM-BP2-deficient mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins (BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach to the calyceal endbulb of Held synapse that transmits auditory information at rates of up to hundreds of Hertz with submillisecond precision we demonstrate a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+ influx and abundance of the key priming protein Munc13-1, a reduced rate of SV replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+ channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This hampers transmission of sound onset information likely affecting downstream neural computations such as of sound localization."}],"doi":"10.1523/JNEUROSCI.0586-21.2021","intvolume":"        41","day":"15","quality_controlled":"1","date_created":"2021-09-27T14:33:13Z","citation":{"chicago":"Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2021. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>.","mla":"Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca<sup>21</sup> Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” <i>Journal of Neuroscience</i>, vol. 41, no. 37, Society for Neuroscience, 2021, pp. 7742–67, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>.","apa":"Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto, R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">https://doi.org/10.1523/JNEUROSCI.0586-21.2021</a>","ista":"Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R, Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 41(37), 7742–7767.","short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.","ieee":"T. Butola <i>et al.</i>, “RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse,” <i>Journal of Neuroscience</i>, vol. 41, no. 37. Society for Neuroscience, pp. 7742–7767, 2021.","ama":"Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse. <i>Journal of Neuroscience</i>. 2021;41(37):7742-7767. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0586-21.2021\">10.1523/JNEUROSCI.0586-21.2021</a>"},"scopus_import":"1","year":"2021","issue":"37","publication":"Journal of Neuroscience","page":"7742-7767","language":[{"iso":"eng"}],"volume":41,"external_id":{"pmid":["34353898"],"isi":["000752287700005"]},"author":[{"first_name":"Tanvi","last_name":"Butola","full_name":"Butola, Tanvi"},{"first_name":"Theocharis","full_name":"Alvanos, Theocharis","last_name":"Alvanos"},{"first_name":"Anika","full_name":"Hintze, Anika","last_name":"Hintze"},{"first_name":"Peter","orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter","last_name":"Koppensteiner","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","last_name":"Kleindienst","full_name":"Kleindienst, David"},{"first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"first_name":"Carolin","last_name":"Wichmann","full_name":"Wichmann, Carolin"},{"first_name":"Tobias","last_name":"Moser","full_name":"Moser, Tobias"}],"date_published":"2021-09-15T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"relation":"main_file","creator":"dernst","file_id":"11423","date_updated":"2022-05-31T09:10:15Z","access_level":"open_access","content_type":"application/pdf","date_created":"2022-05-31T09:10:15Z","checksum":"769ab627c7355a50ccfd445e43a5f351","file_size":11571961,"file_name":"2021_JourNeuroscience_Butola.pdf","success":1}],"acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Collaborative Sensory Research Center 1286 [to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940. We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance; G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke for technical support and discussion regarding in vivo experiments. We also thank Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody, and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang and J. Neef for constant support and scientific discussion.","status":"public"},{"date_created":"2021-09-27T14:33:14Z","citation":{"ieee":"I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in <i>32nd International Conference on Concurrency Theory</i>, Paris, France, 2021, vol. 203.","short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ama":"Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: <i>32nd International Conference on Concurrency Theory</i>. Vol 203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">10.4230/LIPIcs.CONCUR.2021.18</a>","apa":"Jecker, I. R., Mazzocchi, N., &#38; Wolf, P. (2021). Decomposing permutation automata. In <i>32nd International Conference on Concurrency Theory</i> (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">https://doi.org/10.4230/LIPIcs.CONCUR.2021.18</a>","mla":"Jecker, Ismael R., et al. “Decomposing Permutation Automata.” <i>32nd International Conference on Concurrency Theory</i>, vol. 203, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">10.4230/LIPIcs.CONCUR.2021.18</a>.","chicago":"Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.” In <i>32nd International Conference on Concurrency Theory</i>, Vol. 203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2021.18\">https://doi.org/10.4230/LIPIcs.CONCUR.2021.18</a>.","ista":"Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 203, 18."},"quality_controlled":"1","scopus_import":"1","day":"13","alternative_title":["LIPIcs"],"intvolume":"       203","doi":"10.4230/LIPIcs.CONCUR.2021.18","ddc":["000"],"abstract":[{"text":"A deterministic finite automaton (DFA) 𝒜 is composite if its language L(𝒜) can be decomposed into an intersection ⋂_{i = 1}^k L(𝒜_i) of languages of smaller DFAs. Otherwise, 𝒜 is prime. This notion of primality was introduced by Kupferman and Mosheiff in 2013, and while they proved that we can decide whether a DFA is composite, the precise complexity of this problem is still open, with a doubly-exponential gap between the upper and lower bounds. In this work, we focus on permutation DFAs, i.e., those for which the transition monoid is a group. We provide an NP algorithm to decide whether a permutation DFA is composite, and show that the difficulty of this problem comes from the number of non-accepting states of the instance: we give a fixed-parameter tractable algorithm with the number of rejecting states as the parameter. Moreover, we investigate the class of commutative permutation DFAs. Their structural properties allow us to decide compositionality in NL, and even in LOGSPACE if the alphabet size is fixed. Despite this low complexity, we show that complex behaviors still arise in this class: we provide a family of composite DFAs each requiring polynomially many factors with respect to its size. We also consider the variant of the problem that asks whether a DFA is k-factor composite, that is, decomposable into k smaller DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation DFAs, restricting the number of factors makes the decision computationally harder, and yields a problem with tight bounds: it is NP-complete. Finally, we show that in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton alphabet.","lang":"eng"}],"oa":1,"file_date_updated":"2021-10-01T11:10:53Z","article_number":"18","conference":{"end_date":"2021-08-27","location":"Paris, France","name":"CONCUR: Conference on Concurrency Theory","start_date":"2021-08-23"},"article_processing_charge":"No","has_accepted_license":"1","status":"public","acknowledgement":"Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411. Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project FE 560/9-1.\r\n","date_published":"2021-08-13T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","creator":"cchlebak","file_id":"10064","date_updated":"2021-10-01T11:10:53Z","content_type":"application/pdf","access_level":"open_access","date_created":"2021-10-01T11:10:53Z","checksum":"4722c81be82265cf45e78adf9db91250","file_size":1003552,"file_name":"2021_CONCUR_Jecker.pdf","success":1}],"volume":203,"external_id":{"arxiv":["2107.04683"]},"author":[{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R"},{"last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas","first_name":"Nicolas"},{"last_name":"Wolf","full_name":"Wolf, Petra","first_name":"Petra"}],"publication":"32nd International Conference on Concurrency Theory","language":[{"iso":"eng"}],"year":"2021","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7203-7"]},"_id":"10052","ec_funded":1,"title":"Decomposing permutation automata","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"KrCh"}],"date_updated":"2025-05-14T10:55:28Z","month":"08","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"arxiv":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","publication_status":"published","oa_version":"Published Version"},{"abstract":[{"lang":"eng","text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations."}],"oa":1,"article_processing_charge":"No","conference":{"start_date":"2021-07-12","name":"ISIT: International Symposium on Information Theory","location":"Melbourne, Australia","end_date":"2021-07-20"},"scopus_import":"1","date_created":"2021-09-27T14:33:14Z","quality_controlled":"1","citation":{"ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 2369–2374.","apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith, A. (2021). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In <i>2021 IEEE International Symposium on Information Theory</i> (pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">https://doi.org/10.1109/ISIT45174.2021.9518153</a>","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” In <i>2021 IEEE International Symposium on Information Theory</i>, 2369–74. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">https://doi.org/10.1109/ISIT45174.2021.9518153</a>.","mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>2021 IEEE International Symposium on Information Theory</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–74, doi:<a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">10.1109/ISIT45174.2021.9518153</a>.","ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” in <i>2021 IEEE International Symposium on Information Theory</i>, Melbourne, Australia, 2021, pp. 2369–2374.","short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–2374.","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In: <i>2021 IEEE International Symposium on Information Theory</i>. Institute of Electrical and Electronics Engineers; 2021:2369-2374. doi:<a href=\"https://doi.org/10.1109/ISIT45174.2021.9518153\">10.1109/ISIT45174.2021.9518153</a>"},"day":"01","related_material":{"record":[{"status":"public","relation":"later_version","id":"10364"}]},"doi":"10.1109/ISIT45174.2021.9518153","publication":"2021 IEEE International Symposium on Information Theory","page":"2369-2374","language":[{"iso":"eng"}],"year":"2021","status":"public","acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei. M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104.","date_published":"2021-09-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","first_name":"Marco"},{"first_name":"Arman","last_name":"Fazeli","full_name":"Fazeli, Arman"},{"last_name":"Vardy","full_name":"Vardy, Alexander","first_name":"Alexander"},{"first_name":"John","full_name":"Cioffi, John","last_name":"Cioffi"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"external_id":{"arxiv":["2012.13378"],"isi":["000701502202078"]},"title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","department":[{"_id":"MaMo"}],"date_updated":"2025-04-15T07:50:11Z","isi":1,"publication_identifier":{"eisbn":["978-1-5386-8209-8"],"issn":["2157-8095"],"isbn":["978-1-5386-8210-4"]},"_id":"10053","arxiv":1,"publication_status":"published","type":"conference","publisher":"Institute of Electrical and Electronics Engineers","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2012.13378","open_access":"1"}],"month":"09","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}]},{"abstract":[{"lang":"eng","text":"Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a \"good\" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives."}],"ddc":["000"],"file_date_updated":"2021-10-01T08:49:26Z","oa":1,"article_processing_charge":"No","conference":{"start_date":"2021-07-12","location":"Glasgow, Scotland","name":"ICALP: Automata, Languages and Programming","end_date":"2021-07-16"},"article_number":"124","has_accepted_license":"1","scopus_import":"1","date_created":"2021-09-27T14:33:15Z","quality_controlled":"1","citation":{"ieee":"K. Chatterjee, M. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in <i>48th International Colloquium on Automata, Languages, and Programming</i>, Glasgow, Scotland, 2021, vol. 198.","short":"K. Chatterjee, M. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ama":"Chatterjee K, Henzinger M, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: <i>48th International Colloquium on Automata, Languages, and Programming</i>. Vol 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>","apa":"Chatterjee, K., Henzinger, M., Kale, S. S., &#38; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In <i>48th International Colloquium on Automata, Languages, and Programming</i> (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” <i>48th International Colloquium on Automata, Languages, and Programming</i>, vol. 198, 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">10.4230/LIPIcs.ICALP.2021.124</a>.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In <i>48th International Colloquium on Automata, Languages, and Programming</i>, Vol. 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2021.124\">https://doi.org/10.4230/LIPIcs.ICALP.2021.124</a>.","ista":"Chatterjee K, Henzinger M, Kale SS, Svozil A. 2021. Faster algorithms for bounded liveness in graphs and game graphs. 48th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 198, 124."},"alternative_title":["LIPIcs"],"day":"02","corr_author":"1","intvolume":"       198","doi":"10.4230/LIPIcs.ICALP.2021.124","language":[{"iso":"eng"}],"publication":"48th International Colloquium on Automata, Languages, and Programming","year":"2021","status":"public","acknowledgement":"Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt). Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","date_published":"2021-07-02T00:00:00Z","file":[{"relation":"main_file","file_id":"10062","creator":"cchlebak","date_updated":"2021-10-01T08:49:26Z","date_created":"2021-10-01T08:49:26Z","access_level":"open_access","content_type":"application/pdf","checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","file_size":854576,"success":1,"file_name":"2021_LIPIcs_Chatterjee.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"first_name":"Sagar Sudhir","full_name":"Kale, Sagar Sudhir","last_name":"Kale"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"volume":198,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Faster algorithms for bounded liveness in graphs and game graphs","department":[{"_id":"KrCh"}],"date_updated":"2025-05-14T10:55:19Z","publication_identifier":{"isbn":["978-3-95977-195-5"],"issn":["1868-8969"]},"ec_funded":1,"_id":"10054","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","publication_status":"published","oa_version":"Published Version","month":"07","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}]},{"oa_version":"Published Version","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"month":"03","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"A Ramsey theorem for finite monoids","department":[{"_id":"KrCh"}],"date_updated":"2025-05-14T10:55:11Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7180-1"]},"isi":1,"_id":"10055","ec_funded":1,"publication":"38th International Symposium on Theoretical Aspects of Computer Science","language":[{"iso":"eng"}],"year":"2021","status":"public","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman for their valuable insights concerning Green’s relations.","volume":187,"external_id":{"isi":["000635691700044"]},"author":[{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"17432a05733f408de300e17e390a90e4","date_created":"2021-10-01T09:55:00Z","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_LIPIcs_Jecker.pdf","file_size":720250,"file_id":"10063","creator":"cchlebak","relation":"main_file","date_updated":"2021-10-01T09:55:00Z"}],"date_published":"2021-03-10T00:00:00Z","oa":1,"file_date_updated":"2021-10-01T09:55:00Z","ddc":["000"],"abstract":[{"lang":"eng","text":"Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2."}],"has_accepted_license":"1","conference":{"start_date":"2021-03-16","end_date":"2021-03-19","location":"Saarbrücken, Germany","name":"STACS: Symposium on Theoretical Aspects of Computer Science"},"article_number":"44","article_processing_charge":"No","day":"10","alternative_title":["LIPIcs"],"citation":{"ista":"Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, vol. 187, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>.","chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Vol. 187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>.","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In <i>38th International Symposium on Theoretical Aspects of Computer Science</i> (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">https://doi.org/10.4230/LIPIcs.STACS.2021.44</a>","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in <i>38th International Symposium on Theoretical Aspects of Computer Science</i>, Saarbrücken, Germany, 2021, vol. 187.","ama":"Jecker IR. A Ramsey theorem for finite monoids. In: <i>38th International Symposium on Theoretical Aspects of Computer Science</i>. Vol 187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.44\">10.4230/LIPIcs.STACS.2021.44</a>"},"date_created":"2021-09-27T14:33:15Z","quality_controlled":"1","scopus_import":"1","doi":"10.4230/LIPIcs.STACS.2021.44","intvolume":"       187"}]