[{"date_published":"2021-08-16T00:00:00Z","status":"public","publication_status":"published","abstract":[{"lang":"eng","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."}],"ddc":["570"],"doi":"10.1167/IOVS.62.10.14","pmid":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"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)","image":"/images/cc_by_nc_nd.png"},"month":"08","oa":1,"language":[{"iso":"eng"}],"issue":"10","date_updated":"2023-08-14T06:35:17Z","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file":[{"file_name":"2021_IOVS_Schmitt.pdf","file_size":19707796,"success":1,"checksum":"c430967746f653aa1ae84ee617f62b73","file_id":"11369","date_created":"2022-05-13T07:40:15Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_updated":"2022-05-13T07:40:15Z"}],"day":"16","article_type":"original","external_id":{"isi":["000695230000014"],"pmid":["34398198"]},"title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","volume":62,"year":"2021","publication":"Investigative Ophthalmology and Visual Science","department":[{"_id":"SaSi"}],"date_created":"2021-09-12T22:01:23Z","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","publication_identifier":{"eissn":["1552-5783"],"issn":["0146-0404"]},"author":[{"full_name":"Schmitt, Heather M.","last_name":"Schmitt","first_name":"Heather M."},{"first_name":"Rachel L.","last_name":"Fehrman","full_name":"Fehrman, Rachel L."},{"orcid":"0000-0001-9642-1085","last_name":"Maes","id":"3838F452-F248-11E8-B48F-1D18A9856A87","first_name":"Margaret E","full_name":"Maes, Margaret E"},{"full_name":"Yang, Huan","first_name":"Huan","last_name":"Yang"},{"last_name":"Guo","first_name":"Lian Wang","full_name":"Guo, Lian Wang"},{"full_name":"Schlamp, Cassandra L.","first_name":"Cassandra L.","last_name":"Schlamp"},{"last_name":"Pelzel","first_name":"Heather R.","full_name":"Pelzel, Heather R."},{"last_name":"Nickells","first_name":"Robert W.","full_name":"Nickells, Robert W."}],"file_date_updated":"2022-05-13T07:40:15Z","_id":"10000","has_accepted_license":"1","article_number":"14","quality_controlled":"1","scopus_import":"1","citation":{"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>.","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>","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).","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>","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.","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>.","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."},"type":"journal_article","isi":1,"intvolume":"        62","publisher":"Association for Research in Vision and Ophthalmology"},{"isi":1,"type":"conference","publisher":"Institute of Electrical and Electronics Engineers","_id":"10002","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Dvorak, Wolfgang","first_name":"Wolfgang","last_name":"Dvorak"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"quality_controlled":"1","scopus_import":"1","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"citation":{"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>","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.","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.","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>.","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.","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>"},"conference":{"name":"LICS: Logic in Computer Science","start_date":"2021-06-29","end_date":"2021-07-02","location":"Rome, Italy"},"department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2021-09-12T22:01:24Z","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.","publication_identifier":{"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"]},"external_id":{"arxiv":["2104.07466"],"isi":["000947350400089"]},"title":"Symbolic time and space tradeoffs for probabilistic verification","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"year":"2021","page":"1-13","day":"07","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"date_updated":"2025-07-10T11:15:45Z","oa_version":"Preprint","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/LICS52264.2021.9470739","month":"07","main_file_link":[{"url":"https://arxiv.org/abs/2104.07466","open_access":"1"}],"date_published":"2021-07-07T00:00:00Z","status":"public","abstract":[{"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 .","lang":"eng"}],"publication_status":"published"},{"_id":"10004","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"quality_controlled":"1","scopus_import":"1","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"citation":{"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>","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.","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.","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>.","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.","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>"},"isi":1,"type":"conference","publisher":"Institute of Electrical and Electronics Engineers","title":"Stochastic processes with expected stopping time","external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","project":[{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"year":"2021","page":"1-13","related_material":{"record":[{"relation":"later_version","id":"18630","status":"public"}]},"conference":{"location":"Rome, Italy","start_date":"2021-06-29","end_date":"2021-07-02","name":"LICS: Logic in Computer Science"},"department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2021-09-12T22:01:25Z","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).","publication_identifier":{"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"],"issn":["1043-6871"]},"ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-09-08T14:54:13Z","oa_version":"Preprint","arxiv":1,"day":"07","date_published":"2021-07-07T00:00:00Z","status":"public","abstract":[{"lang":"eng","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."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/LICS52264.2021.9470595","month":"07","main_file_link":[{"url":"https://arxiv.org/abs/2104.07278","open_access":"1"}]},{"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."}],"publication_status":"published","date_published":"2021-08-25T00:00:00Z","status":"public","month":"08","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06917"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1142/S0218202521500457","date_updated":"2025-05-14T10:50:14Z","oa_version":"Preprint","issue":"09","arxiv":1,"language":[{"iso":"eng"}],"oa":1,"day":"25","volume":31,"article_type":"original","title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","external_id":{"arxiv":["2009.06917"],"isi":["000722222900004"]},"publication":"Mathematical Models and Methods in Applied Sciences","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"year":"2021","article_processing_charge":"No","date_created":"2021-09-12T22:01:25Z","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","publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]},"department":[{"_id":"JuFi"}],"scopus_import":"1","quality_controlled":"1","keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"citation":{"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>.","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).","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.","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>","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>","short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021).","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>."},"_id":"10005","author":[{"full_name":"Bulíček, Miroslav","last_name":"Bulíček","first_name":"Miroslav"},{"id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","last_name":"Maringová","first_name":"Erika","full_name":"Maringová, Erika"},{"first_name":"Josef","last_name":"Málek","full_name":"Málek, Josef"}],"intvolume":"        31","publisher":"World Scientific Publishing","isi":1,"type":"journal_article"},{"title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","article_type":"original","external_id":{"arxiv":["2005.14177"]},"volume":21,"year":"2021","publication":"Communications in Information and Systems","project":[{"grant_number":"716117","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"page":"481-536","department":[{"_id":"JaMa"}],"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.","date_created":"2021-09-19T08:53:19Z","article_processing_charge":"No","publication_identifier":{"issn":["1526-7555"]},"author":[{"first_name":"Ioannis","last_name":"Karatzas","full_name":"Karatzas, Ioannis"},{"first_name":"Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan"},{"first_name":"Walter","last_name":"Schachermayer","full_name":"Schachermayer, Walter"}],"_id":"10023","quality_controlled":"1","citation":{"short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","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>.","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.","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>.","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>"},"keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"type":"journal_article","intvolume":"        21","publisher":"International Press","date_published":"2021-06-04T00:00:00Z","status":"public","publication_status":"published","abstract":[{"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.","lang":"eng"}],"doi":"10.4310/CIS.2021.v21.n4.a1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.14177"}],"ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"issue":"4","date_updated":"2025-04-14T07:27:45Z","oa_version":"Preprint","arxiv":1,"day":"04"},{"department":[{"_id":"JaMa"}],"date_created":"2021-09-19T22:01:25Z","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.","article_processing_charge":"Yes","publication_identifier":{"issn":["0304-4149"]},"article_type":"original","title":"Hydrodynamics for the partial exclusion process in random environment","external_id":{"arxiv":["1911.12564"],"isi":["000697748500005"]},"volume":142,"year":"2021","publication":"Stochastic Processes and their Applications","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"page":"124-158","type":"journal_article","isi":1,"intvolume":"       142","publisher":"Elsevier","author":[{"full_name":"Floreani, Simone","first_name":"Simone","last_name":"Floreani"},{"first_name":"Frank","last_name":"Redig","full_name":"Redig, Frank"},{"full_name":"Sau, Federico","last_name":"Sau","id":"E1836206-9F16-11E9-8814-AEFDE5697425","first_name":"Federico"}],"file_date_updated":"2022-05-13T07:55:50Z","_id":"10024","has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","citation":{"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>.","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.","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>.","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","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>"},"keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"],"doi":"10.1016/j.spa.2021.08.006","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"short":"CC BY (4.0)","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"},"month":"08","date_published":"2021-08-27T00:00:00Z","status":"public","publication_status":"published","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)."}],"ddc":["519"],"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"file_id":"11370","date_created":"2022-05-13T07:55:50Z","checksum":"56768c553d7218ee5714902ffec90ec4","file_name":"2021_StochasticProcessesAppl_Floreani.pdf","file_size":2115791,"success":1,"date_updated":"2022-05-13T07:55:50Z","access_level":"open_access","creator":"dernst","relation":"main_file","content_type":"application/pdf"}],"day":"27","language":[{"iso":"eng"}],"ec_funded":1,"oa":1,"oa_version":"Published Version","date_updated":"2025-04-14T07:43:46Z","arxiv":1},{"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","date_created":"2021-09-19T22:01:25Z","article_processing_charge":"No","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"department":[{"_id":"MaSe"},{"_id":"MiLe"}],"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s41586-021-04181-z"}]},"article_type":"original","external_id":{"isi":["000706977400002"],"arxiv":["2104.00653"]},"title":"Half and quarter metals in rhombohedral trilayer graphene","year":"2021","publication":"Nature","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"publisher":"Springer Nature","type":"journal_article","isi":1,"quality_controlled":"1","scopus_import":"1","citation":{"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>.","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>","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).","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>","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>.","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.","ieee":"H. Zhou <i>et al.</i>, “Half and quarter metals in rhombohedral trilayer graphene,” <i>Nature</i>. Springer Nature, 2021."},"keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"author":[{"first_name":"Haoxin","last_name":"Zhou","full_name":"Zhou, Haoxin"},{"full_name":"Xie, Tian","last_name":"Xie","first_name":"Tian"},{"orcid":"0000-0001-9666-3543","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","first_name":"Areg","full_name":"Ghazaryan, Areg"},{"last_name":"Holder","first_name":"Tobias","full_name":"Holder, Tobias"},{"full_name":"Ehrets, James R.","last_name":"Ehrets","first_name":"James R."},{"full_name":"Spanton, Eric M.","first_name":"Eric M.","last_name":"Spanton"},{"first_name":"Takashi","last_name":"Taniguchi","full_name":"Taniguchi, Takashi"},{"full_name":"Watanabe, Kenji","first_name":"Kenji","last_name":"Watanabe"},{"full_name":"Berg, Erez","first_name":"Erez","last_name":"Berg"},{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym","full_name":"Serbyn, Maksym"},{"first_name":"Andrea F.","last_name":"Young","full_name":"Young, Andrea F."}],"_id":"10025","month":"09","main_file_link":[{"url":"https://arxiv.org/abs/2104.00653","open_access":"1"}],"doi":"10.1038/s41586-021-03938-w","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"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.","lang":"eng"}],"publication_status":"published","date_published":"2021-09-01T00:00:00Z","status":"public","day":"01","oa_version":"Preprint","date_updated":"2025-04-14T07:43:46Z","arxiv":1,"language":[{"iso":"eng"}],"oa":1,"ec_funded":1},{"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"publication":"arXiv","year":"2021","external_id":{"arxiv":["2107.03695"]},"title":"Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid","related_material":{"record":[{"relation":"research_data","id":"9636","status":"public"},{"status":"public","id":"10851","relation":"later_version"}]},"department":[{"_id":"MaSe"},{"_id":"AnHi"},{"_id":"MiLe"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"article_processing_charge":"No","date_created":"2021-09-21T08:41:02Z","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.","_id":"10029","author":[{"full_name":"Phan, Duc T","first_name":"Duc T","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan"},{"full_name":"Senior, Jorden L","first_name":"Jorden L","id":"5479D234-2D30-11EA-89CC-40953DDC885E","last_name":"Senior","orcid":"0000-0002-0672-9295"},{"first_name":"Areg","last_name":"Ghazaryan","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg"},{"last_name":"Hatefipour","first_name":"M.","full_name":"Hatefipour, M."},{"full_name":"Strickland, W. M.","last_name":"Strickland","first_name":"W. M."},{"full_name":"Shabani, J.","last_name":"Shabani","first_name":"J."},{"full_name":"Serbyn, Maksym","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","orcid":"0000-0002-2399-5827"},{"last_name":"Higginbotham","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2607-2363","first_name":"Andrew P","full_name":"Higginbotham, Andrew P"}],"citation":{"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>","short":"D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J. Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.).","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>. .","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.","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>."},"article_number":"2107.03695","type":"preprint","status":"public","date_published":"2021-07-08T00:00:00Z","abstract":[{"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.","lang":"eng"}],"publication_status":"draft","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.48550/arXiv.2107.03695","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.03695"}],"month":"07","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"arxiv":1,"date_updated":"2025-04-15T06:54:43Z","oa_version":"Preprint","day":"08"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1016/j.aim.2021.107992","month":"09","tmp":{"short":"CC BY (4.0)","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"},"date_published":"2021-09-21T00:00:00Z","status":"public","ddc":["514"],"publication_status":"published","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"}],"corr_author":"1","file":[{"content_type":"application/pdf","relation":"main_file","creator":"qho","access_level":"open_access","date_updated":"2021-09-21T15:58:52Z","file_name":"1-s2.0-S000187082100431X-main.pdf","file_size":840635,"checksum":"f3c0086d41af11db31c00014efb38072","date_created":"2021-09-21T15:58:52Z","file_id":"10034"}],"day":"21","language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-04-14T09:09:35Z","oa_version":"Published Version","arxiv":1,"department":[{"_id":"TaHa"}],"article_processing_charge":"Yes (via OA deal)","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.","date_created":"2021-09-21T15:58:59Z","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"volume":392,"article_type":"original","title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality","external_id":{"arxiv":["1610.00212"],"isi":["000707040300031"]},"publication":"Advances in Mathematics","project":[{"_id":"26B96266-B435-11E9-9278-68D0E5697425","name":"Algebro-Geometric Applications of Factorization Homology","grant_number":"M02751","call_identifier":"FWF"}],"year":"2021","isi":1,"type":"journal_article","intvolume":"       392","publisher":"Elsevier","file_date_updated":"2021-09-21T15:58:52Z","_id":"10033","author":[{"full_name":"Ho, Quoc P","first_name":"Quoc P","last_name":"Ho","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6889-1418"}],"scopus_import":"1","article_number":"107992","quality_controlled":"1","has_accepted_license":"1","keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"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>","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>.","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>","short":"Q.P. Ho, Advances in Mathematics 392 (2021)."}},{"isi":1,"type":"journal_article","intvolume":"        41","publisher":"Society for Neuroscience","_id":"10051","file_date_updated":"2022-05-31T09:10:15Z","author":[{"last_name":"Butola","first_name":"Tanvi","full_name":"Butola, Tanvi"},{"full_name":"Alvanos, Theocharis","first_name":"Theocharis","last_name":"Alvanos"},{"last_name":"Hintze","first_name":"Anika","full_name":"Hintze, Anika"},{"first_name":"Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","last_name":"Koppensteiner","orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter"},{"full_name":"Kleindienst, David","first_name":"David","last_name":"Kleindienst","id":"42E121A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto"},{"full_name":"Wichmann, Carolin","first_name":"Carolin","last_name":"Wichmann"},{"full_name":"Moser, Tobias","last_name":"Moser","first_name":"Tobias"}],"scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","citation":{"short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.","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>","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>.","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.","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.","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>.","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>"},"department":[{"_id":"RySh"}],"article_processing_charge":"No","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.","date_created":"2021-09-27T14:33:13Z","publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"volume":41,"title":"RIM-binding protein 2 organizes Ca<sup>21</sup> channel topography and regulates release probability and vesicle replenishment at a fast central synapse","external_id":{"pmid":["34353898"],"isi":["000752287700005"]},"article_type":"original","publication":"Journal of Neuroscience","year":"2021","page":"7742-7767","file":[{"creator":"dernst","access_level":"open_access","date_updated":"2022-05-31T09:10:15Z","content_type":"application/pdf","relation":"main_file","checksum":"769ab627c7355a50ccfd445e43a5f351","date_created":"2022-05-31T09:10:15Z","file_id":"11423","success":1,"file_name":"2021_JourNeuroscience_Butola.pdf","file_size":11571961}],"day":"15","language":[{"iso":"eng"}],"oa":1,"date_updated":"2023-08-14T06:56:30Z","oa_version":"Published Version","issue":"37","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","pmid":1,"doi":"10.1523/JNEUROSCI.0586-21.2021","month":"09","tmp":{"short":"CC BY (4.0)","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"},"date_published":"2021-09-15T00:00:00Z","status":"public","ddc":["570"],"abstract":[{"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.","lang":"eng"}],"publication_status":"published"},{"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       203","author":[{"last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R"},{"full_name":"Mazzocchi, Nicolas","first_name":"Nicolas","last_name":"Mazzocchi"},{"full_name":"Wolf, Petra","last_name":"Wolf","first_name":"Petra"}],"file_date_updated":"2021-10-01T11:10:53Z","_id":"10052","citation":{"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.","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.","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>.","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>","short":"I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","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>."},"has_accepted_license":"1","quality_controlled":"1","article_number":"18","scopus_import":"1","department":[{"_id":"KrCh"}],"conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Paris, France","start_date":"2021-08-23","end_date":"2021-08-27"},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7203-7"]},"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_created":"2021-09-27T14:33:14Z","article_processing_charge":"No","year":"2021","publication":"32nd International Conference on Concurrency Theory","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["2107.04683"]},"title":"Decomposing permutation automata","volume":203,"file":[{"file_name":"2021_CONCUR_Jecker.pdf","file_size":1003552,"success":1,"checksum":"4722c81be82265cf45e78adf9db91250","file_id":"10064","date_created":"2021-10-01T11:10:53Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"cchlebak","date_updated":"2021-10-01T11:10:53Z"}],"day":"13","ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_updated":"2025-05-14T10:55:28Z","oa_version":"Published Version","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.CONCUR.2021.18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","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"},"month":"08","status":"public","date_published":"2021-08-13T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","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."}],"ddc":["000"]},{"oa":1,"language":[{"iso":"eng"}],"arxiv":1,"oa_version":"Preprint","date_updated":"2025-04-15T07:50:11Z","day":"01","status":"public","date_published":"2021-09-01T00:00:00Z","publication_status":"published","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."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1109/ISIT45174.2021.9518153","main_file_link":[{"url":"https://arxiv.org/abs/2012.13378","open_access":"1"}],"month":"09","_id":"10053","author":[{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Mondelli, Marco","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli"},{"last_name":"Fazeli","first_name":"Arman","full_name":"Fazeli, Arman"},{"full_name":"Vardy, Alexander","last_name":"Vardy","first_name":"Alexander"},{"first_name":"John","last_name":"Cioffi","full_name":"Cioffi, John"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"citation":{"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.","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>.","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.","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>.","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.","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>"},"scopus_import":"1","quality_controlled":"1","isi":1,"type":"conference","publisher":"Institute of Electrical and Electronics Engineers","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"publication":"2021 IEEE International Symposium on Information Theory","year":"2021","external_id":{"arxiv":["2012.13378"],"isi":["000701502202078"]},"title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","related_material":{"record":[{"relation":"later_version","id":"10364","status":"public"}]},"page":"2369-2374","department":[{"_id":"MaMo"}],"conference":{"location":"Melbourne, Australia","end_date":"2021-07-20","start_date":"2021-07-12","name":"ISIT: International Symposium on Information Theory"},"publication_identifier":{"issn":["2157-8095"],"eisbn":["978-1-5386-8209-8"],"isbn":["978-1-5386-8210-4"]},"article_processing_charge":"No","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_created":"2021-09-27T14:33:14Z"},{"intvolume":"       198","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","quality_controlled":"1","article_number":"124","scopus_import":"1","has_accepted_license":"1","citation":{"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>","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.","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.","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.","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>.","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>"},"file_date_updated":"2021-10-01T08:49:26Z","_id":"10054","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Kale, Sagar Sudhir","first_name":"Sagar Sudhir","last_name":"Kale"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"article_processing_charge":"No","date_created":"2021-09-27T14:33:15Z","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.","publication_identifier":{"isbn":["978-3-95977-195-5"],"issn":["1868-8969"]},"conference":{"end_date":"2021-07-16","start_date":"2021-07-12","location":"Glasgow, Scotland","name":"ICALP: Automata, Languages and Programming"},"department":[{"_id":"KrCh"}],"volume":198,"title":"Faster algorithms for bounded liveness in graphs and game graphs","publication":"48th International Colloquium on Automata, Languages, and Programming","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"year":"2021","day":"02","corr_author":"1","file":[{"checksum":"5a3fed8dbba8c088cbeac1e24cc10bc5","date_created":"2021-10-01T08:49:26Z","file_id":"10062","success":1,"file_name":"2021_LIPIcs_Chatterjee.pdf","file_size":854576,"creator":"cchlebak","access_level":"open_access","date_updated":"2021-10-01T08:49:26Z","content_type":"application/pdf","relation":"main_file"}],"date_updated":"2025-05-14T10:55:19Z","alternative_title":["LIPIcs"],"oa_version":"Published Version","ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"month":"07","tmp":{"short":"CC BY (4.0)","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.ICALP.2021.124","ddc":["000"],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"date_published":"2021-07-02T00:00:00Z","status":"public"},{"ddc":["000"],"publication_status":"published","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."}],"status":"public","date_published":"2021-03-10T00:00:00Z","month":"03","tmp":{"short":"CC BY (4.0)","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.STACS.2021.44","date_updated":"2025-05-14T10:55:11Z","alternative_title":["LIPIcs"],"oa_version":"Published Version","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"day":"10","file":[{"file_name":"2021_LIPIcs_Jecker.pdf","file_size":720250,"success":1,"file_id":"10063","date_created":"2021-10-01T09:55:00Z","checksum":"17432a05733f408de300e17e390a90e4","relation":"main_file","content_type":"application/pdf","date_updated":"2021-10-01T09:55:00Z","access_level":"open_access","creator":"cchlebak"}],"publication":"38th International Symposium on Theoretical Aspects of Computer Science","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"year":"2021","volume":187,"external_id":{"isi":["000635691700044"]},"title":"A Ramsey theorem for finite monoids","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7180-1"]},"article_processing_charge":"No","date_created":"2021-09-27T14:33:15Z","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.","department":[{"_id":"KrCh"}],"conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","location":"Saarbrücken, Germany","start_date":"2021-03-16","end_date":"2021-03-19"},"citation":{"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>.","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.","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>","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.","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>."},"scopus_import":"1","quality_controlled":"1","article_number":"44","has_accepted_license":"1","file_date_updated":"2021-10-01T09:55:00Z","_id":"10055","author":[{"last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       187","isi":1,"type":"conference"},{"file":[{"creator":"cchlebak","access_level":"open_access","date_updated":"2021-10-05T14:56:48Z","content_type":"application/pdf","relation":"main_file","checksum":"f002ec22f609f58e1263b79e7f79601e","date_created":"2021-10-05T14:56:48Z","file_id":"10091","success":1,"file_size":6970368,"file_name":"2021_ScientificReports_Robinson.pdf"}],"corr_author":"1","day":"28","oa":1,"language":[{"iso":"eng"}],"oa_version":"Published Version","date_updated":"2024-10-09T21:00:57Z","pmid":1,"doi":"10.1038/s41598-021-98411-z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"short":"CC BY (4.0)","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"},"month":"09","status":"public","date_published":"2021-09-28T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups."}],"ddc":["618"],"type":"journal_article","isi":1,"publisher":"Springer Nature","intvolume":"        11","author":[{"full_name":"Robinson, Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard"},{"full_name":"Patxot, Marion","first_name":"Marion","last_name":"Patxot"},{"first_name":"Miloš","last_name":"Stojanov","full_name":"Stojanov, Miloš"},{"full_name":"Blum, Sabine","last_name":"Blum","first_name":"Sabine"},{"full_name":"Baud, David","last_name":"Baud","first_name":"David"}],"_id":"10069","file_date_updated":"2021-10-05T14:56:48Z","citation":{"ieee":"M. R. Robinson, M. Patxot, M. Stojanov, S. Blum, and D. Baud, “Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy,” <i>Scientific Reports</i>, vol. 11. Springer Nature, 2021.","ista":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. 2021. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. Scientific Reports. 11, 19238.","mla":"Robinson, Matthew Richard, et al. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” <i>Scientific Reports</i>, vol. 11, 19238, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-98411-z\">10.1038/s41598-021-98411-z</a>.","ama":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. <i>Scientific Reports</i>. 2021;11. doi:<a href=\"https://doi.org/10.1038/s41598-021-98411-z\">10.1038/s41598-021-98411-z</a>","short":"M.R. Robinson, M. Patxot, M. Stojanov, S. Blum, D. Baud, Scientific Reports 11 (2021).","apa":"Robinson, M. R., Patxot, M., Stojanov, M., Blum, S., &#38; Baud, D. (2021). Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-98411-z\">https://doi.org/10.1038/s41598-021-98411-z</a>","chicago":"Robinson, Matthew Richard, Marion Patxot, Miloš Stojanov, Sabine Blum, and David Baud. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-98411-z\">https://doi.org/10.1038/s41598-021-98411-z</a>."},"has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","article_number":"19238","department":[{"_id":"MaRo"}],"publication_identifier":{"eissn":["2045-2322"]},"acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the study and all the midwives and doctors for the computerized obstetrical data.","date_created":"2021-10-03T22:01:21Z","article_processing_charge":"Yes","year":"2021","publication":"Scientific Reports","title":"Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy","article_type":"original","external_id":{"isi":["000701575500083"],"pmid":["34584125"]},"volume":11},{"language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"oa_version":"Preprint","date_updated":"2025-04-14T07:27:45Z","issue":"11","arxiv":1,"corr_author":"1","day":"15","date_published":"2021-09-15T00:00:00Z","status":"public","publication_status":"published","abstract":[{"text":"We extensively discuss the Rademacher and Sobolev-to-Lipschitz properties for generalized intrinsic distances on strongly local Dirichlet spaces possibly without square field operator. We present many non-smooth and infinite-dimensional examples. As an application, we prove the integral Varadhan short-time asymptotic with respect to a given distance function for a large class of strongly local Dirichlet forms.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1016/j.jfa.2021.109234","month":"09","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2008.01492","open_access":"1"}],"_id":"10070","author":[{"full_name":"Dello Schiavo, Lorenzo","orcid":"0000-0002-9881-6870","last_name":"Dello Schiavo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","first_name":"Lorenzo"},{"first_name":"Kohei","last_name":"Suzuki","full_name":"Suzuki, Kohei"}],"scopus_import":"1","article_number":"109234","quality_controlled":"1","citation":{"chicago":"Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” <i>Journal of Functional Analysis</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">https://doi.org/10.1016/j.jfa.2021.109234</a>.","short":"L. Dello Schiavo, K. Suzuki, Journal of Functional Analysis 281 (2021).","apa":"Dello Schiavo, L., &#38; Suzuki, K. (2021). Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">https://doi.org/10.1016/j.jfa.2021.109234</a>","ama":"Dello Schiavo L, Suzuki K. Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. <i>Journal of Functional Analysis</i>. 2021;281(11). doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">10.1016/j.jfa.2021.109234</a>","ista":"Dello Schiavo L, Suzuki K. 2021. Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces. Journal of Functional Analysis. 281(11), 109234.","ieee":"L. Dello Schiavo and K. Suzuki, “Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces,” <i>Journal of Functional Analysis</i>, vol. 281, no. 11. Elsevier, 2021.","mla":"Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” <i>Journal of Functional Analysis</i>, vol. 281, no. 11, 109234, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109234\">10.1016/j.jfa.2021.109234</a>."},"isi":1,"type":"journal_article","intvolume":"       281","publisher":"Elsevier","volume":281,"title":"Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces","article_type":"original","external_id":{"isi":["000703896600005"],"arxiv":["2008.01492"]},"publication":"Journal of Functional Analysis","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"year":"2021","department":[{"_id":"JaMa"}],"article_processing_charge":"No","acknowledgement":"The authors are grateful to Professor Kazuhiro Kuwae for kindly providing a copy of [49]. They are also grateful to Dr. Bang-Xian Han for helpful discussions on the Sobolev-to-Lipschitz property on metric measure spaces. They wish to express their deepest gratitude to an anonymous Reviewer, whose punctual remarks and comments greatly improved the accessibility and overall quality of the initial submission. This work was completed while L.D.S. was a member of the Institut für Angewandte Mathematik of the University of Bonn. He acknowledges funding of his position at that time by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Sonderforschungsbereich (Sfb, Collaborative Research Center) 1060 - project number 211504053. He also acknowledges funding of his current position by the Austrian Science Fund (FWF) grant F65, and by the European Research Council (ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas). K.S. gratefully acknowledges funding by: the JSPS Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research Center Initiative (WPI), MEXT, Japan; and JSPS Grant-in-Aid for Scientific Research on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number 17H06465.","date_created":"2021-10-03T22:01:21Z","publication_identifier":{"issn":["0022-1236"],"eissn":["1096-0783"]}},{"main_file_link":[{"url":"http://www.ams.org/notices/","open_access":"1"}],"month":"10","doi":"10.1090/noti2349","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"published","status":"public","date_published":"2021-10-01T00:00:00Z","day":"01","issue":"9","oa_version":"Published Version","date_updated":"2021-12-03T07:31:26Z","alternative_title":["Early Career"],"language":[{"iso":"eng"}],"oa":1,"publication_identifier":{"eissn":["1088-9477"],"issn":["0002-9920"]},"date_created":"2021-10-03T22:01:22Z","article_processing_charge":"No","department":[{"_id":"HeEd"}],"page":"1511-1514","year":"2021","publication":"Notices of the American Mathematical Society","article_type":"letter_note","title":"How to tutorial-a-thon","volume":68,"publisher":"American Mathematical Society","intvolume":"        68","type":"journal_article","citation":{"chicago":"Adams, Henry, Hana Kourimska, Teresa Heiss, Sarah Percival, and Lori Ziegelmeier. “How to Tutorial-a-Thon.” <i>Notices of the American Mathematical Society</i>. American Mathematical Society, 2021. <a href=\"https://doi.org/10.1090/noti2349\">https://doi.org/10.1090/noti2349</a>.","short":"H. Adams, H. Kourimska, T. Heiss, S. Percival, L. Ziegelmeier, Notices of the American Mathematical Society 68 (2021) 1511–1514.","apa":"Adams, H., Kourimska, H., Heiss, T., Percival, S., &#38; Ziegelmeier, L. (2021). How to tutorial-a-thon. <i>Notices of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/noti2349\">https://doi.org/10.1090/noti2349</a>","ama":"Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon. <i>Notices of the American Mathematical Society</i>. 2021;68(9):1511-1514. doi:<a href=\"https://doi.org/10.1090/noti2349\">10.1090/noti2349</a>","ieee":"H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to tutorial-a-thon,” <i>Notices of the American Mathematical Society</i>, vol. 68, no. 9. American Mathematical Society, pp. 1511–1514, 2021.","mla":"Adams, Henry, et al. “How to Tutorial-a-Thon.” <i>Notices of the American Mathematical Society</i>, vol. 68, no. 9, American Mathematical Society, 2021, pp. 1511–14, doi:<a href=\"https://doi.org/10.1090/noti2349\">10.1090/noti2349</a>.","ista":"Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. 2021. How to tutorial-a-thon. Notices of the American Mathematical Society. 68(9), 1511–1514."},"quality_controlled":"1","scopus_import":"1","author":[{"first_name":"Henry","last_name":"Adams","full_name":"Adams, Henry"},{"id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","last_name":"Kourimska","first_name":"Hana","full_name":"Kourimska, Hana"},{"last_name":"Heiss","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1780-2689","first_name":"Teresa","full_name":"Heiss, Teresa"},{"first_name":"Sarah","last_name":"Percival","full_name":"Percival, Sarah"},{"full_name":"Ziegelmeier, Lori","first_name":"Lori","last_name":"Ziegelmeier"}],"_id":"10071"},{"status":"public","date_published":"2021-09-15T00:00:00Z","ddc":["000"],"publication_status":"published","abstract":[{"lang":"eng","text":"The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, \"are they parallelizable?\", \"how many solutions can they output?\", \"what is the expected \"weight\" of a solution?\", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.APPROX/RANDOM.2021.31","month":"09","tmp":{"short":"CC BY (4.0)","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"},"ec_funded":1,"language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_updated":"2026-02-10T09:59:59Z","oa_version":"Published Version","alternative_title":["LIPIcs"],"file":[{"file_name":"2021_LIPIcs_Harris.pdf","file_size":804472,"success":1,"file_id":"10098","date_created":"2021-10-06T13:51:54Z","checksum":"9d2544d53aa5b01565c6891d97a4d765","relation":"main_file","content_type":"application/pdf","date_updated":"2021-10-06T13:51:54Z","access_level":"open_access","creator":"cchlebak"}],"day":"15","project":[{"grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publication":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","year":"2021","volume":207,"external_id":{"arxiv":["2008.05569"]},"title":"A new notion of commutativity for the algorithmic Lovász Local Lemma","related_material":{"record":[{"relation":"later_version","id":"21143","status":"public"}]},"department":[{"_id":"VlKo"}],"conference":{"name":"APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation","end_date":"2021-08-18","start_date":"2021-08-16","location":"Virtual"},"publication_identifier":{"isbn":["978-3-9597-7207-5"],"issn":["1868-8969"]},"article_processing_charge":"Yes","acknowledgement":"Fotis Iliopoulos: This material is based upon work directly supported by the IAS Fund for Math and indirectly supported by the National Science Foundation Grant No. CCF-1900460. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is also supported by the National Science Foundation Grant No. CCF-1815328.\r\nVladimir Kolmogorov: Supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160.","date_created":"2021-10-03T22:01:22Z","file_date_updated":"2021-10-06T13:51:54Z","_id":"10072","author":[{"full_name":"Harris, David G.","first_name":"David G.","last_name":"Harris"},{"last_name":"Iliopoulos","first_name":"Fotis","full_name":"Iliopoulos, Fotis"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs, vol. 207, 31.","mla":"Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, vol. 207, 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>.","ieee":"D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity for the algorithmic Lovász Local Lemma,” in <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, Virtual, 2021, vol. 207.","ama":"Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>. Vol 207. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>","short":"D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","apa":"Harris, D. G., Iliopoulos, F., &#38; Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i> (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>","chicago":"Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.” In <i>Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</i>, Vol. 207. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>."},"article_number":"31","quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       207"},{"acknowledged_ssus":[{"_id":"EM-Fac"}],"publication_identifier":{"eissn":["1996-1944"]},"article_processing_charge":"Yes","acknowledgement":"The authors thank the EMF facility in IST Austria for providing SEM and EDX measurements.\r\n","date_created":"2021-10-03T22:01:23Z","department":[{"_id":"MaIb"}],"project":[{"grant_number":"M02889","name":"Bottom-up Engineering for Thermoelectric Applications","_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A"}],"publication":"Materials","year":"2021","volume":14,"article_type":"original","title":"Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites","external_id":{"isi":["000700689400001"],"pmid":["34576640"]},"publisher":"MDPI","intvolume":"        14","isi":1,"type":"journal_article","citation":{"ama":"Chang C, Ibáñez M. Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. <i>Materials</i>. 2021;14(18). doi:<a href=\"https://doi.org/10.3390/ma14185416\">10.3390/ma14185416</a>","ieee":"C. Chang and M. Ibáñez, “Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites,” <i>Materials</i>, vol. 14, no. 18. MDPI, 2021.","mla":"Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface Engineering in SnTe-PbS Nanocomposites.” <i>Materials</i>, vol. 14, no. 18, 5416, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/ma14185416\">10.3390/ma14185416</a>.","ista":"Chang C, Ibáñez M. 2021. Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. Materials. 14(18), 5416.","chicago":"Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface Engineering in SnTe-PbS Nanocomposites.” <i>Materials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/ma14185416\">https://doi.org/10.3390/ma14185416</a>.","short":"C. Chang, M. Ibáñez, Materials 14 (2021).","apa":"Chang, C., &#38; Ibáñez, M. (2021). Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites. <i>Materials</i>. MDPI. <a href=\"https://doi.org/10.3390/ma14185416\">https://doi.org/10.3390/ma14185416</a>"},"quality_controlled":"1","article_number":"5416","scopus_import":"1","has_accepted_license":"1","_id":"10073","file_date_updated":"2021-10-14T11:56:39Z","author":[{"first_name":"Cheng","last_name":"Chang","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","orcid":"0000-0002-9515-4277","full_name":"Chang, Cheng"},{"first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria"}],"month":"09","tmp":{"short":"CC BY (4.0)","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"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.3390/ma14185416","pmid":1,"ddc":["540"],"abstract":[{"lang":"eng","text":"Thermoelectric materials enable the direct conversion between heat and electricity. SnTe is a promising candidate due to its high charge transport performance. Here, we prepared SnTe nanocomposites by employing an aqueous method to synthetize SnTe nanoparticles (NP), followed by a unique surface treatment prior NP consolidation. This synthetic approach allowed optimizing the charge and phonon transport synergistically. The novelty of this strategy was the use of a soluble PbS molecular complex prepared using a thiol-amine solvent mixture that upon blending is adsorbed on the SnTe NP surface. Upon consolidation with spark plasma sintering, SnTe-PbS nanocomposite is formed. The presence of PbS complexes significantly compensates for the Sn vacancy and increases the average grain size of the nanocomposite, thus improving the carrier mobility. Moreover, lattice thermal conductivity is also reduced by the Pb and S-induced mass and strain fluctuation. As a result, an enhanced ZT of ca. 0.8 is reached at 873 K. Our finding provides a novel strategy to conduct rational surface treatment on NP-based thermoelectrics."}],"publication_status":"published","status":"public","date_published":"2021-09-19T00:00:00Z","day":"19","file":[{"file_id":"10140","date_created":"2021-10-14T11:56:39Z","checksum":"4929dfc673a3ae77c010b6174279cc1d","file_name":"2021_Materials_Chang.pdf","file_size":4404141,"success":1,"date_updated":"2021-10-14T11:56:39Z","access_level":"open_access","creator":"cchlebak","relation":"main_file","content_type":"application/pdf"}],"corr_author":"1","date_updated":"2025-04-14T09:29:32Z","oa_version":"Published Version","issue":"18","language":[{"iso":"eng"}],"oa":1},{"project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"publication":"46th International Symposium on Mathematical Foundations of Computer Science","year":"2021","volume":202,"external_id":{"arxiv":["2105.02611"]},"title":"A bit of nondeterminism makes pushdown automata expressive and succinct","department":[{"_id":"KrCh"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2021-08-23","end_date":"2021-08-27","location":"Tallinn, Estonia"},"publication_identifier":{"isbn":["978-3-9597-7201-3"],"issn":["1868-8969"]},"article_processing_charge":"No","acknowledgement":"Ismaël Jecker: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411. Karoliina Lehtinen: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 892704.","date_created":"2021-10-03T22:01:23Z","file_date_updated":"2021-10-06T12:44:05Z","_id":"10075","author":[{"full_name":"Guha, Shibashis","first_name":"Shibashis","last_name":"Guha"},{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"last_name":"Lehtinen","first_name":"Karoliina","full_name":"Lehtinen, Karoliina"},{"full_name":"Zimmermann, Martin","first_name":"Martin","last_name":"Zimmermann"}],"citation":{"ieee":"S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Tallinn, Estonia, 2021, vol. 202.","ista":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.","mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 202, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>.","ama":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: <i>46th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">10.4230/LIPIcs.MFCS.2021.53</a>","short":"S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","apa":"Guha, S., Jecker, I. R., Lehtinen, K., &#38; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In <i>46th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>","chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In <i>46th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2021.53\">https://doi.org/10.4230/LIPIcs.MFCS.2021.53</a>."},"article_number":"53","scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       202","status":"public","date_published":"2021-08-18T00:00:00Z","ddc":["000"],"publication_status":"published","abstract":[{"text":"We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.MFCS.2021.53","month":"08","tmp":{"short":"CC BY (4.0)","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"},"oa":1,"ec_funded":1,"language":[{"iso":"eng"}],"arxiv":1,"alternative_title":["LIPIcs"],"date_updated":"2025-05-14T10:54:50Z","oa_version":"Published Version","file":[{"checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","file_id":"10097","date_created":"2021-10-06T12:44:05Z","file_name":"2021_LIPIcs_Guha.pdf","file_size":825567,"success":1,"access_level":"open_access","creator":"cchlebak","date_updated":"2021-10-06T12:44:05Z","relation":"main_file","content_type":"application/pdf"}],"day":"18"}]