[{"abstract":[{"lang":"eng","text":"We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it handles programs with non-determinism, provides relative completeness guarantees and supports programs with polynomial arithmetic. The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving a non-trivial improvement under a proper configuration of its parameters."}],"publication_identifier":{"isbn":["9781450383912"]},"publication_status":"published","oa_version":"Preprint","title":"Proving non-termination by program reversal","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"},{"first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"orcid":"0000-0002-4681-1699","first_name":"Dorde","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic"}],"scopus_import":"1","day":"01","date_created":"2021-07-11T22:01:17Z","language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.","short":"K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.","ama":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1033-1048. doi:10.1145/3453483.3454093","apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454093","mla":"Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.","ista":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048."},"arxiv":1,"month":"06","department":[{"_id":"KrCh"}],"page":"1033-1048","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.01189"}],"publisher":"Association for Computing Machinery","doi":"10.1145/3453483.3454093","article_processing_charge":"No","type":"conference","date_updated":"2025-07-14T09:10:06Z","_id":"9644","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"status":"public","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","date_published":"2021-06-01T00:00:00Z","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was partially supported by the ERCCoG 863818 (ForM-SMArt) and the Czech Science Foundation grant No. GJ19-15134Y.","conference":{"location":"Online","name":"PLDI: Programming Language Design and Implementation","start_date":"2021-06-20","end_date":"2021-06-26"},"ec_funded":1,"external_id":{"isi":["000723661700067"],"arxiv":["2104.01189"]},"related_material":{"record":[{"id":"14539","status":"public","relation":"dissertation_contains"}]},"isi":1,"year":"2021"},{"year":"2021","isi":1,"external_id":{"isi":["000723661700050"]},"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","status":"public","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"date_published":"2021-06-01T00:00:00Z","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the National Natural Science Foundation of China (NSFC) Grant No. 61802254, the Huawei Innovation Research Program, the Facebook PhD Fellowship Program, and DOC Fellowship No. 24956 of the Austrian Academy of Sciences (ÖAW).","conference":{"location":"Online","name":" PLDI: Programming Language Design and Implementation","end_date":"2021-06-26","start_date":"2021-06-20"},"article_processing_charge":"No","doi":"10.1145/3453483.3454076","publisher":"Association for Computing Machinery","_id":"9645","date_updated":"2025-07-14T09:10:06Z","type":"conference","page":"772-787","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-03183862/","open_access":"1"}],"quality_controlled":"1","month":"06","department":[{"_id":"KrCh"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"chicago":"Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454076.","ista":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 772–787.","apa":"Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076","mla":"Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–87, doi:10.1145/3453483.3454076.","ama":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. Polynomial reachability witnesses via Stellensätze. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:772-787. doi:10.1145/3453483.3454076","ieee":"A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.","short":"A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–787."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","day":"01","author":[{"last_name":"Asadi","full_name":"Asadi, Ali","first_name":"Ali"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","last_name":"Fu"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"last_name":"Mahdavi","full_name":"Mahdavi, Mohammad","first_name":"Mohammad"}],"oa_version":"Submitted Version","title":"Polynomial reachability witnesses via Stellensätze","date_created":"2021-07-11T22:01:17Z","abstract":[{"text":"We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis.\r\n\r\nWe first show that our IRW-based approach is sound and complete for reachability analysis of imperative programs. Then, we focus on linear and polynomial programs and develop automated methods for synthesizing linear and polynomial IRWs. In the linear case, we follow the well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial case, where we present a push-button semi-complete algorithm. We achieve this using a novel combination of classical theorems in real algebraic geometry, such as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally, our experimental results show we can prove complex reachability objectives over various benchmarks that were beyond the reach of previous methods.","lang":"eng"}],"publication_identifier":{"isbn":["9781450383912"]},"publication_status":"published"},{"project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","status":"public","date_published":"2021-06-01T00:00:00Z","conference":{"end_date":"2021-06-26","start_date":"2021-06-20","name":"PLDI: Programming Language Design and Implementation","location":"Online"},"acknowledgement":"We are very thankful to the anonymous reviewers for the helpful and valuable comments. The work was partially supported by the National Natural Science Foundation of China (NSFC) Grant No. 61802254, the Huawei Innovation Research Program, the ERC CoG 863818 (ForM-SMArt), the Facebook PhD Fellowship Program and DOC Fellowship #24956 of the Austrian Academy of Sciences (ÖAW).","ec_funded":1,"external_id":{"arxiv":["2011.14617"],"isi":["000723661700076"]},"isi":1,"year":"2021","page":"1171-1186","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2011.14617","open_access":"1"}],"publisher":"Association for Computing Machinery","doi":"10.1145/3453483.3454102","article_processing_charge":"No","type":"conference","date_updated":"2025-07-14T09:10:06Z","_id":"9646","language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. Quantitative analysis of assertion violations in probabilistic programs. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1171-1186. doi:10.1145/3453483.3454102","short":"J. Wang, Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–1186.","ieee":"J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.","ista":"Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. 2021. Quantitative analysis of assertion violations in probabilistic programs. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1171–1186.","chicago":"Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454102.","mla":"Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.” Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.","apa":"Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454102"},"arxiv":1,"month":"06","department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on the assertion violation probability. The main novelty of our approach is that we prove new and dedicated fixed-point theorems which serve as the theoretical basis of our algorithms and enable us to reason about assertion violation bounds in terms of pre and post fixed-point functions. To synthesize such fixed-points, we devise algorithms that utilize a wide range of mathematical tools, including repulsing ranking supermartingales, Hoeffding's lemma, Minkowski decompositions, Jensen's inequality, and convex optimization. On the theoretical side, we provide (i) the first automated algorithm for lower-bounds on assertion violation probabilities, (ii) the first complete algorithm for upper-bounds of exponential form in affine programs, and (iii) provably and significantly tighter upper-bounds than the previous approaches. On the practical side, we show our algorithms can handle a wide variety of programs from the literature and synthesize bounds that are remarkably tighter than previous results, in some cases by thousands of orders of magnitude.","lang":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781450383912"]},"oa_version":"Preprint","title":"Quantitative analysis of assertion violations in probabilistic programs","author":[{"full_name":"Wang, Jinyi","last_name":"Wang","first_name":"Jinyi"},{"first_name":"Yican","last_name":"Sun","full_name":"Sun, Yican"},{"first_name":"Hongfei","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584"}],"day":"01","scopus_import":"1","date_created":"2021-07-11T22:01:18Z"},{"language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"short":"T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.","ieee":"T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.","ama":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. Long lived transients in gene regulation. Theoretical Computer Science. 2021;893:1-16. doi:10.1016/j.tcs.2021.05.023","mla":"Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science, vol. 893, Elsevier, 2021, pp. 1–16, doi:10.1016/j.tcs.2021.05.023.","apa":"Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., & Guet, C. C. (2021). Long lived transients in gene regulation. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2021.05.023","chicago":"Petrov, Tatjana, Claudia Igler, Ali Sezgin, Thomas A Henzinger, and Calin C Guet. “Long Lived Transients in Gene Regulation.” Theoretical Computer Science. Elsevier, 2021. https://doi.org/10.1016/j.tcs.2021.05.023.","ista":"Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16."},"month":"06","file":[{"checksum":"d3aef34cfb13e53bba4cf44d01680793","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_TheoreticalComputerScience_Petrov.pdf","file_id":"11364","date_updated":"2022-05-12T12:13:27Z","creator":"dernst","date_created":"2022-05-12T12:13:27Z","file_size":2566504}],"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"intvolume":" 893","abstract":[{"text":"Gene expression is regulated by the set of transcription factors (TFs) that bind to the promoter. The ensuing regulating function is often represented as a combinational logic circuit, where output (gene expression) is determined by current input values (promoter bound TFs) only. However, the simultaneous arrival of TFs is a strong assumption, since transcription and translation of genes introduce intrinsic time delays and there is no global synchronisation among the arrival times of different molecular species at their targets. We present an experimentally implementable genetic circuit with two inputs and one output, which in the presence of small delays in input arrival, exhibits qualitatively distinct population-level phenotypes, over timescales that are longer than typical cell doubling times. From a dynamical systems point of view, these phenotypes represent long-lived transients: although they converge to the same value eventually, they do so after a very long time span. The key feature of this toy model genetic circuit is that, despite having only two inputs and one output, it is regulated by twenty-three distinct DNA-TF configurations, two of which are more stable than others (DNA looped states), one promoting and another blocking the expression of the output gene. Small delays in input arrival time result in a majority of cells in the population quickly reaching the stable state associated with the first input, while exiting of this stable state occurs at a slow timescale. In order to mechanistically model the behaviour of this genetic circuit, we used a rule-based modelling language, and implemented a grid-search to find parameter combinations giving rise to long-lived transients. Our analysis shows that in the absence of feedback, there exist path-dependent gene regulatory mechanisms based on the long timescale of transients. The behaviour of this toy model circuit suggests that gene regulatory networks can exploit event timing to create phenotypes, and it opens the possibility that they could use event timing to memorise events, without regulatory feedback. The model reveals the importance of (i) mechanistically modelling the transitions between the different DNA-TF states, and (ii) employing transient analysis thereof.","lang":"eng"}],"has_accepted_license":"1","file_date_updated":"2022-05-12T12:13:27Z","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"oa_version":"Published Version","title":"Long lived transients in gene regulation","day":"04","scopus_import":"1","author":[{"first_name":"Tatjana","last_name":"Petrov","full_name":"Petrov, Tatjana"},{"last_name":"Igler","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia"},{"full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin","first_name":"Ali"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0001-6220-2052","first_name":"Calin C","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet"}],"date_created":"2021-07-11T22:01:18Z","article_type":"original","volume":893,"publication":"Theoretical Computer Science","status":"public","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_published":"2021-06-04T00:00:00Z","acknowledgement":"Tatjana Petrov’s research was supported in part by SNSF Advanced Postdoctoral Mobility Fellowship grant number P300P2 161067, the Ministry of Science, Research and the Arts of the state of Baden-Wurttemberg, and the DFG Centre of Excellence 2117 ‘Centre for the Advanced Study of Collective Behaviour’ (ID: 422037984). Claudia Igler is the recipient of a DOC Fellowship of the Austrian Academy of Sciences. Thomas A. Henzinger’s research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","external_id":{"isi":["000710180500002"]},"isi":1,"year":"2021","ddc":["004"],"page":"1-16","quality_controlled":"1","publisher":"Elsevier","article_processing_charge":"No","doi":"10.1016/j.tcs.2021.05.023","type":"journal_article","_id":"9647","date_updated":"2023-08-10T14:11:19Z"},{"date_published":"2021-10-01T00:00:00Z","acknowledgement":"We are grateful to Lukas Fiedler, Alexandra Mally (IST Austria) and Dr. Bartel Vanholme (VIB, Ghent) for their critical comments on the manuscript. We apologize to those researchers whose great work was not cited. This work is supported by the European Research Council under the European Union’s Horizon 2020 research and innovation Programme (ERC grant agreement number 742985), and the Austrian Science Fund (FWF, grant number I 3630-B25) to JF. HH is supported by the China Scholarship Council (CSC scholarship, 201506870018) and a starting grant from Jiangxi Agriculture University (9232308314).","ec_funded":1,"pmid":1,"publication":"New Phytologist","status":"public","project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants"}],"external_id":{"pmid":["34254313"],"isi":["000680587100001"]},"isi":1,"year":"2021","quality_controlled":"1","ddc":["580"],"page":"510-522","type":"journal_article","_id":"9656","date_updated":"2023-08-10T14:02:41Z","publisher":"Wiley","article_processing_charge":"Yes (via OA deal)","doi":"10.1111/nph.17617","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Han, Huibin, Maciek Adamowski, Linlin Qi, SS Alotaibi, and Jiří Friml. “PIN-Mediated Polar Auxin Transport Regulations in Plant Tropic Responses.” New Phytologist. Wiley, 2021. https://doi.org/10.1111/nph.17617.","ista":"Han H, Adamowski M, Qi L, Alotaibi S, Friml J. 2021. PIN-mediated polar auxin transport regulations in plant tropic responses. New Phytologist. 232(2), 510–522.","apa":"Han, H., Adamowski, M., Qi, L., Alotaibi, S., & Friml, J. (2021). PIN-mediated polar auxin transport regulations in plant tropic responses. New Phytologist. Wiley. https://doi.org/10.1111/nph.17617","mla":"Han, Huibin, et al. “PIN-Mediated Polar Auxin Transport Regulations in Plant Tropic Responses.” New Phytologist, vol. 232, no. 2, Wiley, 2021, pp. 510–22, doi:10.1111/nph.17617.","ama":"Han H, Adamowski M, Qi L, Alotaibi S, Friml J. PIN-mediated polar auxin transport regulations in plant tropic responses. New Phytologist. 2021;232(2):510-522. doi:10.1111/nph.17617","ieee":"H. Han, M. Adamowski, L. Qi, S. Alotaibi, and J. Friml, “PIN-mediated polar auxin transport regulations in plant tropic responses,” New Phytologist, vol. 232, no. 2. Wiley, pp. 510–522, 2021.","short":"H. Han, M. Adamowski, L. Qi, S. Alotaibi, J. Friml, New Phytologist 232 (2021) 510–522."},"issue":"2","language":[{"iso":"eng"}],"oa":1,"file":[{"access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_NewPhytologist_Han.pdf","checksum":"6422a6eb329b52d96279daaee0fcf189","relation":"main_file","date_updated":"2021-10-07T13:42:47Z","creator":"kschuh","file_size":1939800,"date_created":"2021-10-07T13:42:47Z","file_id":"10105"}],"department":[{"_id":"JiFr"}],"month":"10","file_date_updated":"2021-10-07T13:42:47Z","publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646x"]},"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":" 232","abstract":[{"lang":"eng","text":"Tropisms, growth responses to environmental stimuli such as light or gravity, are spectacular examples of adaptive plant development. The plant hormone auxin serves as a major coordinative signal. The PIN auxin exporters, through their dynamic polar subcellular localizations, redirect auxin fluxes in response to environmental stimuli and the resulting auxin gradients across organs underly differential cell elongation and bending. In this review, we discuss recent advances concerning regulations of PIN polarity during tropisms, focusing on PIN phosphorylation and trafficking. We also cover how environmental cues regulate PIN actions during tropisms, and a crucial role of auxin feedback on PIN polarity during bending termination. Finally, the interactions between different tropisms are reviewed to understand plant adaptive growth in the natural environment."}],"has_accepted_license":"1","date_created":"2021-07-14T15:29:14Z","article_type":"original","volume":232,"oa_version":"Published Version","title":"PIN-mediated polar auxin transport regulations in plant tropic responses","scopus_import":"1","day":"01","author":[{"first_name":"Huibin","full_name":"Han, Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","last_name":"Han"},{"first_name":"Maciek","orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","full_name":"Adamowski, Maciek","last_name":"Adamowski"},{"first_name":"Linlin","orcid":"0000-0001-5187-8401","last_name":"Qi","full_name":"Qi, Linlin","id":"44B04502-A9ED-11E9-B6FC-583AE6697425"},{"first_name":"SS","full_name":"Alotaibi, SS","last_name":"Alotaibi"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří"}]},{"pmid":1,"date_published":"2021-07-07T00:00:00Z","status":"public","publication":"Plant Cell","isi":1,"year":"2021","external_id":{"isi":["000702165300012"],"pmid":["34240197"]},"quality_controlled":"1","page":"2981–3003","ddc":["580"],"date_updated":"2023-08-10T14:01:41Z","_id":"9657","type":"journal_article","doi":"10.1093/plcell/koab183","article_processing_charge":"No","publisher":"American Society of Plant Biologists","issue":"9","citation":{"short":"Z. Gao, Z. Chen, Y. Cui, M. Ke, H. Xu, Q. Xu, J. Chen, Y. Li, L. Huang, H. Zhao, D. Huang, S. Mai, T. Xu, X. Liu, S. Li, Y. Guan, W. Yang, J. Friml, J. Petrášek, J. Zhang, X. Chen, Plant Cell 33 (2021) 2981–3003.","ieee":"Z. Gao et al., “GmPIN-dependent polar auxin transport is involved in soybean nodule development,” Plant Cell, vol. 33, no. 9. American Society of Plant Biologists, pp. 2981–3003, 2021.","ama":"Gao Z, Chen Z, Cui Y, et al. GmPIN-dependent polar auxin transport is involved in soybean nodule development. Plant Cell. 2021;33(9):2981–3003. doi:10.1093/plcell/koab183","mla":"Gao, Z., et al. “GmPIN-Dependent Polar Auxin Transport Is Involved in Soybean Nodule Development.” Plant Cell, vol. 33, no. 9, American Society of Plant Biologists, 2021, pp. 2981–3003, doi:10.1093/plcell/koab183.","apa":"Gao, Z., Chen, Z., Cui, Y., Ke, M., Xu, H., Xu, Q., … Chen, X. (2021). GmPIN-dependent polar auxin transport is involved in soybean nodule development. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1093/plcell/koab183","chicago":"Gao, Z, Z Chen, Y Cui, M Ke, H Xu, Q Xu, J Chen, et al. “GmPIN-Dependent Polar Auxin Transport Is Involved in Soybean Nodule Development.” Plant Cell. American Society of Plant Biologists, 2021. https://doi.org/10.1093/plcell/koab183.","ista":"Gao Z, Chen Z, Cui Y, Ke M, Xu H, Xu Q, Chen J, Li Y, Huang L, Zhao H, Huang D, Mai S, Xu T, Liu X, Li S, Guan Y, Yang W, Friml J, Petrášek J, Zhang J, Chen X. 2021. GmPIN-dependent polar auxin transport is involved in soybean nodule development. Plant Cell. 33(9), 2981–3003."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"file":[{"content_type":"application/pdf","access_level":"open_access","file_name":"2021_PlantCell_Gao.pdf","success":1,"checksum":"6715712ec306c321f0204c817b7f8ae7","relation":"main_file","creator":"cziletti","date_updated":"2021-07-19T12:13:34Z","file_size":10566921,"date_created":"2021-07-19T12:13:34Z","file_id":"9691"}],"month":"07","publication_identifier":{"eissn":["1532-298x"],"issn":["1040-4651"]},"publication_status":"published","file_date_updated":"2021-07-19T12:13:34Z","has_accepted_license":"1","abstract":[{"text":"To overcome nitrogen deficiency, legume roots establish symbiotic interactions with nitrogen-fixing rhizobia that is fostered in specialized organs (nodules). Similar to other organs, nodule formation is determined by a local maximum of the phytohormone auxin at the primordium site. However, how auxin regulates nodule development remains poorly understood. Here, we found that in soybean, (Glycine max), dynamic auxin transport driven by PIN-FORMED (PIN) transporter GmPIN1 is involved in nodule primordium formation. GmPIN1 was specifically expressed in nodule primordium cells and GmPIN1 was polarly localized in these cells. Two nodulation regulators, (iso)flavonoids trigger expanded distribution of GmPIN1b to root cortical cells, and cytokinin rearranges GmPIN1b polarity. Gmpin1abc triple mutants generated with CRISPR-Cas9 showed impaired establishment of auxin maxima in nodule meristems and aberrant divisions in the nodule primordium cells. Moreover, overexpression of GmPIN1 suppressed nodule primordium initiation. GmPIN9d, an ortholog of Arabidopsis thaliana PIN2, acts together with GmPIN1 later in nodule development to acropetally transport auxin in vascular bundles, fine-tuning the auxin supply for nodule enlargement. Our findings reveal how PIN-dependent auxin transport modulates different aspects of soybean nodule development and suggest that establishment of auxin gradient is a prerequisite for the proper interaction between legumes and rhizobia.","lang":"eng"}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"intvolume":" 33","volume":33,"article_type":"original","date_created":"2021-07-14T15:32:43Z","author":[{"first_name":"Z","last_name":"Gao","full_name":"Gao, Z"},{"last_name":"Chen","full_name":"Chen, Z","first_name":"Z"},{"first_name":"Y","last_name":"Cui","full_name":"Cui, Y"},{"full_name":"Ke, M","last_name":"Ke","first_name":"M"},{"full_name":"Xu, H","last_name":"Xu","first_name":"H"},{"first_name":"Q","full_name":"Xu, Q","last_name":"Xu"},{"first_name":"J","last_name":"Chen","full_name":"Chen, J"},{"first_name":"Y","last_name":"Li","full_name":"Li, Y"},{"full_name":"Huang, L","last_name":"Huang","first_name":"L"},{"first_name":"H","full_name":"Zhao, H","last_name":"Zhao"},{"full_name":"Huang, D","last_name":"Huang","first_name":"D"},{"first_name":"S","last_name":"Mai","full_name":"Mai, S"},{"first_name":"T","last_name":"Xu","full_name":"Xu, T"},{"first_name":"X","full_name":"Liu, X","last_name":"Liu"},{"full_name":"Li, S","last_name":"Li","first_name":"S"},{"full_name":"Guan, Y","last_name":"Guan","first_name":"Y"},{"last_name":"Yang","full_name":"Yang, W","first_name":"W"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","first_name":"Jiří"},{"first_name":"J","last_name":"Petrášek","full_name":"Petrášek, J"},{"full_name":"Zhang, J","last_name":"Zhang","first_name":"J"},{"last_name":"Chen","full_name":"Chen, X","first_name":"X"}],"day":"07","title":"GmPIN-dependent polar auxin transport is involved in soybean nodule development","oa_version":"Published Version"},{"article_processing_charge":"No","doi":"10.1145/3409964.3461785","type":"conference","_id":"9678","date_updated":"2024-03-05T07:13:12Z","page":"129-139","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2005.07761","open_access":"1"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15074"}]},"external_id":{"arxiv":["2005.07761"]},"year":"2021","status":"public","publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","grant_number":"840605"}],"conference":{"location":" Virtual Event, United States","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures ","start_date":"2021-07-06","end_date":"2021-07-08"},"acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. 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. 840605.","date_published":"2021-07-06T00:00:00Z","ec_funded":1,"title":"Efficient load-balancing through distributed token dropping","oa_version":"Preprint","scopus_import":"1","day":"06","author":[{"first_name":"Sebastian","full_name":"Brandt, Sebastian","last_name":"Brandt"},{"first_name":"Barbara","full_name":"Keller, Barbara","last_name":"Keller"},{"first_name":"Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"},{"last_name":"Uitto","full_name":"Uitto, Jara","first_name":"Jara"}],"date_created":"2021-07-18T22:01:22Z","abstract":[{"lang":"eng","text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively."}],"publication_status":"published","publication_identifier":{"isbn":["9781450380706"]},"arxiv":1,"month":"07","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 129–39, 2021. https://doi.org/10.1145/3409964.3461785.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–39, doi:10.1145/3409964.3461785.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 129–139). Virtual Event, United States. https://doi.org/10.1145/3409964.3461785","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ; 2021:129-139. doi:10.1145/3409964.3461785","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2021, pp. 129–139."}},{"language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Huber, David, et al. “Morphology of Three-Body Quantum States from Machine Learning.” New Journal of Physics, vol. 23, no. 6, 065009, IOP Publishing, 2021, doi:10.1088/1367-2630/ac0576.","apa":"Huber, D., Marchukov, O. V., Hammer, H. W., & Volosniev, A. (2021). Morphology of three-body quantum states from machine learning. New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/ac0576","ista":"Huber D, Marchukov OV, Hammer HW, Volosniev A. 2021. Morphology of three-body quantum states from machine learning. New Journal of Physics. 23(6), 065009.","chicago":"Huber, David, Oleksandr V. Marchukov, Hans Werner Hammer, and Artem Volosniev. “Morphology of Three-Body Quantum States from Machine Learning.” New Journal of Physics. IOP Publishing, 2021. https://doi.org/10.1088/1367-2630/ac0576.","short":"D. Huber, O.V. Marchukov, H.W. Hammer, A. Volosniev, New Journal of Physics 23 (2021).","ieee":"D. Huber, O. V. Marchukov, H. W. Hammer, and A. Volosniev, “Morphology of three-body quantum states from machine learning,” New Journal of Physics, vol. 23, no. 6. IOP Publishing, 2021.","ama":"Huber D, Marchukov OV, Hammer HW, Volosniev A. Morphology of three-body quantum states from machine learning. New Journal of Physics. 2021;23(6). doi:10.1088/1367-2630/ac0576"},"issue":"6","month":"06","arxiv":1,"file":[{"file_id":"9690","date_updated":"2021-07-19T11:47:16Z","creator":"cziletti","file_size":3868445,"date_created":"2021-07-19T11:47:16Z","checksum":"e39164ce7ea228d287cf8924e1a0f9fe","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_NewJPhys_Huber.pdf"}],"article_number":"065009","department":[{"_id":"MiLe"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":" 23","abstract":[{"lang":"eng","text":"The relative motion of three impenetrable particles on a ring, in our case two identical fermions and one impurity, is isomorphic to a triangular quantum billiard. Depending on the ratio κ of the impurity and fermion masses, the billiards can be integrable or non-integrable (also referred to in the main text as chaotic). To set the stage, we first investigate the energy level distributions of the billiards as a function of 1/κ ∈ [0, 1] and find no evidence of integrable cases beyond the limiting values 1/κ = 1 and 1/κ = 0. Then, we use machine learning tools to analyze properties of probability distributions of individual quantum states. We find that convolutional neural networks can correctly classify integrable and non-integrable states. The decisive features of the wave functions are the normalization and a large number of zero elements, corresponding to the existence of a nodal line. The network achieves typical accuracies of 97%, suggesting that machine learning tools can be used to analyze and classify the morphology of probability densities obtained in theory or experiment."}],"has_accepted_license":"1","file_date_updated":"2021-07-19T11:47:16Z","publication_status":"published","publication_identifier":{"eissn":["13672630"]},"oa_version":"Published Version","title":"Morphology of three-body quantum states from machine learning","scopus_import":"1","day":"23","author":[{"last_name":"Huber","full_name":"Huber, David","first_name":"David"},{"last_name":"Marchukov","full_name":"Marchukov, Oleksandr V.","first_name":"Oleksandr V."},{"full_name":"Hammer, Hans Werner","last_name":"Hammer","first_name":"Hans Werner"},{"first_name":"Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","full_name":"Volosniev, Artem"}],"date_created":"2021-07-18T22:01:22Z","article_type":"original","volume":23,"status":"public","publication":"New Journal of Physics","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"We thank Aidan Tracy for his input during the initial stages of this project. We thank Nathan Harshman, Achim Richter, Wojciech Rzadkowski, and Dane Hudson Smith for helpful discussions and comments on the manuscript. This work has been supported by European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411 (AGV); by the German Aeronautics and Space Administration (DLR) through Grant No. 50 WM 1957 (OVM); by the Deutsche Forschungsgemeinschaft through Project VO 2437/1-1 (Project No. 413495248) (AGV and HWH); by the Deutsche Forschungsgemeinschaft through Collaborative Research Center SFB 1245 (Project No. 279384907) and by the Bundesministerium für Bildung und Forschung under Contract 05P18RDFN1 (HWH). HWH also thanks the ECT* for hospitality during the workshop 'Universal physics in Many-Body Quantum Systems—From Atoms to Quarks'. This infrastructure is part of a project that has received funding from the European Union's Horizon 2020 research and innovation program under Grant Agreement No. 824093. We acknowledge support by the Deutsche Forschungsgemeinschaft and the Open Access Publishing Fund of Technische Universität Darmstadt.","date_published":"2021-06-23T00:00:00Z","ec_funded":1,"external_id":{"isi":["000664736300001"],"arxiv":["2102.04961"]},"year":"2021","isi":1,"ddc":["530"],"quality_controlled":"1","publisher":"IOP Publishing","article_processing_charge":"Yes","doi":"10.1088/1367-2630/ac0576","type":"journal_article","_id":"9679","date_updated":"2023-08-10T13:58:09Z"},{"publication":"Investigative Ophthalmology and Visual Science","status":"public","pmid":1,"date_published":"2021-08-16T00:00:00Z","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). ","year":"2021","isi":1,"external_id":{"isi":["000695230000014"],"pmid":["34398198"]},"ddc":["570"],"quality_controlled":"1","article_processing_charge":"Yes","doi":"10.1167/IOVS.62.10.14","publisher":"Association for Research in Vision and Ophthalmology","_id":"10000","date_updated":"2023-08-14T06:35:17Z","type":"journal_article","oa":1,"language":[{"iso":"eng"}],"citation":{"short":"H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R. Pelzel, R.W. Nickells, Investigative Ophthalmology and Visual Science 62 (2021).","ieee":"H. M. Schmitt et al., “Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression,” Investigative Ophthalmology and Visual Science, vol. 62, no. 10. Association for Research in Vision and Ophthalmology, 2021.","ama":"Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 2021;62(10). doi:10.1167/IOVS.62.10.14","mla":"Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” Investigative Ophthalmology and Visual Science, vol. 62, no. 10, 14, Association for Research in Vision and Ophthalmology, 2021, doi:10.1167/IOVS.62.10.14.","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. Investigative Ophthalmology and Visual Science. Association for Research in Vision and Ophthalmology. https://doi.org/10.1167/IOVS.62.10.14","ista":"Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 62(10), 14.","chicago":"Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.” Investigative Ophthalmology and Visual Science. Association for Research in Vision and Ophthalmology, 2021. https://doi.org/10.1167/IOVS.62.10.14."},"issue":"10","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","department":[{"_id":"SaSi"}],"file":[{"file_id":"11369","creator":"dernst","date_updated":"2022-05-13T07:40:15Z","date_created":"2022-05-13T07:40:15Z","file_size":19707796,"checksum":"c430967746f653aa1ae84ee617f62b73","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_IOVS_Schmitt.pdf"}],"article_number":"14","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"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."}],"intvolume":" 62","file_date_updated":"2022-05-13T07:40:15Z","publication_identifier":{"issn":["0146-0404"],"eissn":["1552-5783"]},"publication_status":"published","day":"16","scopus_import":"1","author":[{"last_name":"Schmitt","full_name":"Schmitt, Heather M.","first_name":"Heather M."},{"first_name":"Rachel L.","full_name":"Fehrman, Rachel L.","last_name":"Fehrman"},{"first_name":"Margaret E","orcid":"0000-0001-9642-1085","full_name":"Maes, Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","last_name":"Maes"},{"full_name":"Yang, Huan","last_name":"Yang","first_name":"Huan"},{"last_name":"Guo","full_name":"Guo, Lian Wang","first_name":"Lian Wang"},{"first_name":"Cassandra L.","last_name":"Schlamp","full_name":"Schlamp, Cassandra L."},{"first_name":"Heather R.","full_name":"Pelzel, Heather R.","last_name":"Pelzel"},{"last_name":"Nickells","full_name":"Nickells, Robert W.","first_name":"Robert W."}],"oa_version":"Published Version","title":"Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression","volume":62,"date_created":"2021-09-12T22:01:23Z","article_type":"original"},{"ec_funded":1,"conference":{"location":"Rome, Italy","name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","end_date":"2021-07-02"},"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.","date_published":"2021-07-07T00:00:00Z","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","status":"public","project":[{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"isi":1,"year":"2021","external_id":{"isi":["000947350400089"],"arxiv":["2104.07466"]},"main_file_link":[{"url":"https://arxiv.org/abs/2104.07466","open_access":"1"}],"quality_controlled":"1","page":"1-13","_id":"10002","date_updated":"2025-07-14T09:10:07Z","type":"conference","article_processing_charge":"No","doi":"10.1109/LICS52264.2021.9470739","publisher":"Institute of Electrical and Electronics Engineers","citation":{"ieee":"K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","short":"K. Chatterjee, W. Dvorak, M.H. 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.","ama":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739","apa":"Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.","ista":"Chatterjee K, Dvorak W, Henzinger MH, 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: Symposium on Logic in Computer Science, 1–13.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"month":"07","arxiv":1,"publication_status":"published","publication_identifier":{"isbn":["978-1-6654-4896-3"],"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"]},"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"}],"date_created":"2021-09-12T22:01:24Z","scopus_import":"1","day":"07","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Wolfgang","last_name":"Dvorak","full_name":"Dvorak, Wolfgang"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"oa_version":"Preprint","title":"Symbolic time and space tradeoffs for probabilistic verification"},{"oa_version":"Preprint","title":"Stochastic processes with expected stopping time","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"scopus_import":"1","day":"07","date_created":"2021-09-12T22:01:25Z","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","publication_identifier":{"isbn":["978-1-6654-4896-3"],"issn":["1043-6871"],"eisbn":["978-1-6654-4895-6"]},"arxiv":1,"month":"07","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.","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: Symposium on Logic in Computer Science, 1–13.","apa":"Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595."},"publisher":"Institute of Electrical and Electronics Engineers","doi":"10.1109/LICS52264.2021.9470595","article_processing_charge":"No","type":"conference","date_updated":"2025-07-14T09:10:08Z","_id":"10004","page":"1-13","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2104.07278","open_access":"1"}],"external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"isi":1,"year":"2021","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","status":"public","conference":{"start_date":"2021-06-29","end_date":"2021-07-02","name":"LICS: Symposium on Logic in Computer Science","location":"Rome, Italy"},"date_published":"2021-07-07T00:00:00Z","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).","ec_funded":1},{"oa":1,"language":[{"iso":"eng"}],"issue":"09","citation":{"ama":"Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with implicit constitutive equations involving flux. Mathematical Models and Methods in Applied Sciences. 2021;31(09). doi:10.1142/S0218202521500457","short":"M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied Sciences 31 (2021).","ieee":"M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic type with implicit constitutive equations involving flux,” Mathematical Models and Methods in Applied Sciences, vol. 31, no. 09. World Scientific, 2021.","chicago":"Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” Mathematical Models and Methods in Applied Sciences. World Scientific, 2021. https://doi.org/10.1142/S0218202521500457.","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).","mla":"Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit Constitutive Equations Involving Flux.” Mathematical Models and Methods in Applied Sciences, vol. 31, no. 09, World Scientific, 2021, doi:10.1142/S0218202521500457.","apa":"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. World Scientific. https://doi.org/10.1142/S0218202521500457"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","arxiv":1,"department":[{"_id":"JuFi"}],"intvolume":" 31","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","publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]},"author":[{"last_name":"Bulíček","full_name":"Bulíček, Miroslav","first_name":"Miroslav"},{"first_name":"Erika","last_name":"Maringová","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4","full_name":"Maringová, Erika"},{"last_name":"Málek","full_name":"Málek, Josef","first_name":"Josef"}],"scopus_import":"1","day":"25","oa_version":"Preprint","title":"On nonlinear problems of parabolic type with implicit constitutive equations involving flux","volume":31,"article_type":"original","date_created":"2021-09-12T22:01:25Z","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"publication":"Mathematical Models and Methods in Applied Sciences","status":"public","acknowledgement":"M. Bulíček and J. Málek acknowledge the support of the project No. 18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers of the Nečas Center for Mathematical Modelling.\r\n","date_published":"2021-08-25T00:00:00Z","year":"2021","isi":1,"external_id":{"isi":["000722222900004"],"arxiv":["2009.06917"]},"keyword":["Nonlinear parabolic systems","implicit constitutive theory","weak solutions","existence","uniqueness"],"main_file_link":[{"url":"https://arxiv.org/abs/2009.06917","open_access":"1"}],"quality_controlled":"1","doi":"10.1142/S0218202521500457","article_processing_charge":"No","publisher":"World Scientific","date_updated":"2023-09-04T11:43:45Z","_id":"10005","type":"journal_article"},{"related_material":{"record":[{"id":"10012","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10013"},{"id":"7489","relation":"part_of_dissertation","status":"public"}]},"year":"2021","status":"public","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"},{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials","grant_number":"948819"}],"degree_awarded":"PhD","date_published":"2021-09-14T00:00:00Z","ec_funded":1,"publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","doi":"10.15479/at:ista:10007","type":"dissertation","_id":"10007","date_updated":"2023-09-07T13:30:45Z","ddc":["515"],"page":"300","month":"09","supervisor":[{"last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L","first_name":"Julian L","orcid":"0000-0002-0479-558X"}],"file":[{"file_id":"10008","date_created":"2021-09-13T11:03:24Z","file_size":15022154,"creator":"shensel","date_updated":"2021-09-15T14:37:30Z","relation":"source_file","checksum":"c8475faaf0b680b4971f638f1db16347","file_name":"thesis_final_Hensel.zip","content_type":"application/x-zip-compressed","access_level":"closed"},{"access_level":"open_access","content_type":"application/pdf","file_name":"thesis_final_Hensel.pdf","checksum":"1a609937aa5275452822f45f2da17f07","relation":"main_file","creator":"shensel","date_updated":"2021-09-14T09:52:47Z","date_created":"2021-09-13T14:18:56Z","file_size":6583638,"file_id":"10014"}],"department":[{"_id":"GradSch"},{"_id":"JuFi"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.","chicago":"Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","apa":"Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007","mla":"Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007."},"title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","oa_version":"Published Version","day":"14","author":[{"orcid":"0000-0001-7252-8072","first_name":"Sebastian","last_name":"Hensel","full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2021-09-13T11:12:34Z","abstract":[{"text":"The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.","lang":"eng"}],"has_accepted_license":"1","file_date_updated":"2021-09-15T14:37:30Z","publication_status":"published","publication_identifier":{"issn":["2663-337X"]}},{"year":"2021","month":"09","arxiv":1,"external_id":{"arxiv":["2109.04233"]},"department":[{"_id":"JuFi"}],"article_number":"2109.04233","keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"],"oa":1,"language":[{"iso":"eng"}],"publication":"arXiv","status":"public","project":[{"name":"Bridging Scales in Random Materials","grant_number":"948819","call_identifier":"H2020","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"ec_funded":1,"citation":{"ista":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv, 2109.04233.","chicago":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2109.04233.","mla":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” ArXiv, 2109.04233, doi:10.48550/arXiv.2109.04233.","apa":"Hensel, S., & Laux, T. (n.d.). A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv. https://doi.org/10.48550/arXiv.2109.04233","ama":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv. doi:10.48550/arXiv.2109.04233","short":"S. Hensel, T. Laux, ArXiv (n.d.).","ieee":"S. Hensel and T. Laux, “A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness,” arXiv. ."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-09-09T00:00:00Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. The content of this paper was developed and parts of it were written during a visit of the first author to the Hausdorff Center of Mathematics (HCM), University of Bonn. The hospitality and the support of HCM are gratefully acknowledged.","article_processing_charge":"No","day":"09","author":[{"orcid":"0000-0001-7252-8072","first_name":"Sebastian","full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel"},{"first_name":"Tim","last_name":"Laux","full_name":"Laux, Tim"}],"doi":"10.48550/arXiv.2109.04233","title":"A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness","oa_version":"Preprint","_id":"10011","date_updated":"2023-05-03T10:34:38Z","date_created":"2021-09-13T12:17:10Z","type":"preprint","abstract":[{"lang":"eng","text":"We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow - is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2109.04233"}],"publication_status":"submitted"},{"title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","oa_version":"Preprint","article_processing_charge":"No","day":"03","doi":"10.48550/arXiv.2108.01733","author":[{"first_name":"Sebastian","orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel"},{"first_name":"Tim","full_name":"Laux, Tim","last_name":"Laux"}],"date_created":"2021-09-13T12:17:11Z","type":"preprint","_id":"10013","date_updated":"2023-09-07T13:30:45Z","abstract":[{"lang":"eng","text":"We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions."}],"publication_status":"submitted","main_file_link":[{"url":"https://arxiv.org/abs/2108.01733","open_access":"1"}],"month":"08","arxiv":1,"related_material":{"record":[{"id":"13043","relation":"later_version","status":"public"},{"status":"public","relation":"dissertation_contains","id":"10007"}]},"external_id":{"arxiv":["2108.01733"]},"year":"2021","article_number":"2108.01733","department":[{"_id":"JuFi"}],"language":[{"iso":"eng"}],"status":"public","publication":"arXiv","project":[{"call_identifier":"H2020","name":"Bridging Scales in Random Materials","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-08-03T00:00:00Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","ec_funded":1,"citation":{"apa":"Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733","mla":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733.","chicago":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733.","ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733.","ieee":"S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” arXiv. .","short":"S. Hensel, T. Laux, ArXiv (n.d.).","ama":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. doi:10.48550/arXiv.2108.01733"}},{"isi":1,"year":"2021","external_id":{"pmid":["34359847"],"isi":["000676604700001"]},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10083"}]},"keyword":["primary root","(phospho)proteomics","auxin","(receptor) kinase"],"project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"status":"public","publication":"Cells","pmid":1,"ec_funded":1,"date_published":"2021-07-02T00:00:00Z","acknowledgement":"We thank the Nottingham Stock Centre for seeds, Frank Van Breusegem for the phb3 mutant, and Herman Höfte for the the1 mutant. Open Access Funding by the Austrian Science Fund (FWF).","doi":"10.3390/cells10071665","article_processing_charge":"Yes","alternative_title":["Protein Phosphorylation and Cell Signaling in Plants"],"publisher":"MDPI","date_updated":"2024-10-29T10:22:44Z","_id":"10015","type":"journal_article","ddc":["575"],"quality_controlled":"1","month":"07","department":[{"_id":"JiFr"}],"article_number":"1665 ","file":[{"relation":"main_file","checksum":"2a9f534b9c2200e72e2cde95afaf4eed","success":1,"file_name":"2021_Cells_Nikonorova.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"10021","file_size":2667848,"date_created":"2021-09-16T09:07:06Z","creator":"cchlebak","date_updated":"2021-09-16T09:07:06Z"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"apa":"Nikonorova, N., Murphy, E., Fonseca de Lima, C., Zhu, S., van de Cotte, B., Vu, L., … De Smet, I. (2021). The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. MDPI. https://doi.org/10.3390/cells10071665","mla":"Nikonorova, N., et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells, vol. 10, 1665, MDPI, 2021, doi:10.3390/cells10071665.","chicago":"Nikonorova, N, E Murphy, CF Fonseca de Lima, S Zhu, B van de Cotte, LD Vu, D Balcerowicz, et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells. MDPI, 2021. https://doi.org/10.3390/cells10071665.","ista":"Nikonorova N, Murphy E, Fonseca de Lima C, Zhu S, van de Cotte B, Vu L, Balcerowicz D, Li L, Kong X, De Rop G, Beeckman T, Friml J, Vissenberg K, Morris P, Ding Z, De Smet I. 2021. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 10, 1665.","ieee":"N. Nikonorova et al., “The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators,” Cells, vol. 10. MDPI, 2021.","short":"N. Nikonorova, E. Murphy, C. Fonseca de Lima, S. Zhu, B. van de Cotte, L. Vu, D. Balcerowicz, L. Li, X. Kong, G. De Rop, T. Beeckman, J. Friml, K. Vissenberg, P. Morris, Z. Ding, I. De Smet, Cells 10 (2021).","ama":"Nikonorova N, Murphy E, Fonseca de Lima C, et al. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 2021;10. doi:10.3390/cells10071665"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Nikonorova, N","last_name":"Nikonorova","first_name":"N"},{"last_name":"Murphy","full_name":"Murphy, E","first_name":"E"},{"first_name":"CF","last_name":"Fonseca de Lima","full_name":"Fonseca de Lima, CF"},{"first_name":"S","full_name":"Zhu, S","last_name":"Zhu"},{"full_name":"van de Cotte, B","last_name":"van de Cotte","first_name":"B"},{"full_name":"Vu, LD","last_name":"Vu","first_name":"LD"},{"full_name":"Balcerowicz, D","last_name":"Balcerowicz","first_name":"D"},{"first_name":"Lanxin","orcid":"0000-0002-5607-272X","last_name":"Li","full_name":"Li, Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"X","full_name":"Kong, X","last_name":"Kong"},{"first_name":"G","last_name":"De Rop","full_name":"De Rop, G"},{"full_name":"Beeckman, T","last_name":"Beeckman","first_name":"T"},{"first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"},{"full_name":"Vissenberg, K","last_name":"Vissenberg","first_name":"K"},{"last_name":"Morris","full_name":"Morris, PC","first_name":"PC"},{"full_name":"Ding, Z","last_name":"Ding","first_name":"Z"},{"full_name":"De Smet, I","last_name":"De Smet","first_name":"I"}],"day":"02","oa_version":"Published Version","title":"The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators","volume":10,"article_type":"original","date_created":"2021-09-14T11:36:20Z","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Auxin plays a dual role in growth regulation and, depending on the tissue and concentration of the hormone, it can either promote or inhibit division and expansion processes in plants. Recent studies have revealed that, beyond transcriptional reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here, we explored the impact of different concentrations of the synthetic auxin NAA that establish growth-promoting and -repressing conditions on the root tip proteome and phosphoproteome, generating a unique resource. From the phosphoproteome data, we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results, together with previously published studies, suggest that auxin, H+-ATPases, cell wall modifications and cell wall sensing receptor-like kinases are tightly embedded in a pathway regulating cell elongation. Furthermore, our study assigned a novel role to MKK2 as a regulator of primary root growth and a (potential) regulator of auxin biosynthesis and signalling, and suggests the importance of the MKK2\r\nThr31 phosphorylation site for growth regulation in the Arabidopsis root tip."}],"intvolume":" 10","publication_identifier":{"issn":["2073-4409"]},"publication_status":"published","file_date_updated":"2021-09-16T09:07:06Z"},{"publication_status":"published","publication_identifier":{"issn":["1526-7555"]},"abstract":[{"lang":"eng","text":"We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance in terms of an appropriate Hilbertian norm; and in the case of the relative entropy, in terms of a Dirichlet form which morphs into a version of the familiar Fisher information under conditions of detailed balance. Here we obtain trajectorial versions of these results, valid along almost every path of the random motion and most transparent in the backwards direction of time. Martingale arguments and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer and Tschiderer for conservative diffusions. Extensions are developed to general “convex divergences” and to countable state-spaces. The steepest descent and gradient flow properties for the variance, the relative entropy, and appropriate generalizations, are studied along with their respective geometries under conditions of detailed balance, leading to a very direct proof for the HWI inequality of Otto and Villani in the present context."}],"intvolume":" 21","volume":21,"date_created":"2021-09-19T08:53:19Z","article_type":"original","day":"04","author":[{"last_name":"Karatzas","full_name":"Karatzas, Ioannis","first_name":"Ioannis"},{"first_name":"Jan","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas"},{"first_name":"Walter","full_name":"Schachermayer, Walter","last_name":"Schachermayer"}],"oa_version":"Preprint","title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","citation":{"ieee":"I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and gradient flow for the relative entropy in Markov chains,” Communications in Information and Systems, vol. 21, no. 4. International Press, pp. 481–536, 2021.","short":"I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and Systems 21 (2021) 481–536.","ama":"Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. 2021;21(4):481-536. doi:10.4310/CIS.2021.v21.n4.a1","apa":"Karatzas, I., Maas, J., & Schachermayer, W. (2021). Trajectorial dissipation and gradient flow for the relative entropy in Markov chains. Communications in Information and Systems. International Press. https://doi.org/10.4310/CIS.2021.v21.n4.a1","mla":"Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” Communications in Information and Systems, vol. 21, no. 4, International Press, 2021, pp. 481–536, doi:10.4310/CIS.2021.v21.n4.a1.","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.","chicago":"Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation and Gradient Flow for the Relative Entropy in Markov Chains.” Communications in Information and Systems. International Press, 2021. https://doi.org/10.4310/CIS.2021.v21.n4.a1."},"issue":"4","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"month":"06","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.14177"}],"quality_controlled":"1","page":"481-536","_id":"10023","date_updated":"2021-09-20T12:51:18Z","type":"journal_article","article_processing_charge":"No","doi":"10.4310/CIS.2021.v21.n4.a1","publisher":"International Press","ec_funded":1,"date_published":"2021-06-04T00:00:00Z","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.","publication":"Communications in Information and Systems","status":"public","project":[{"call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"keyword":["Markov Chain","relative entropy","time reversal","steepest descent","gradient flow"],"year":"2021","external_id":{"arxiv":["2005.14177"]}},{"publisher":"Elsevier","article_processing_charge":"Yes","doi":"10.1016/j.spa.2021.08.006","type":"journal_article","_id":"10024","date_updated":"2023-08-14T06:52:43Z","ddc":["519"],"page":"124-158","quality_controlled":"1","external_id":{"arxiv":["1911.12564"],"isi":["000697748500005"]},"isi":1,"year":"2021","keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"],"status":"public","publication":"Stochastic Processes and their Applications","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"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.","date_published":"2021-08-27T00:00:00Z","ec_funded":1,"title":"Hydrodynamics for the partial exclusion process in random environment","oa_version":"Published Version","scopus_import":"1","day":"27","author":[{"full_name":"Floreani, Simone","last_name":"Floreani","first_name":"Simone"},{"full_name":"Redig, Frank","last_name":"Redig","first_name":"Frank"},{"last_name":"Sau","id":"E1836206-9F16-11E9-8814-AEFDE5697425","full_name":"Sau, Federico","first_name":"Federico"}],"date_created":"2021-09-19T22:01:25Z","article_type":"original","volume":142,"intvolume":" 142","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"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).","lang":"eng"}],"has_accepted_license":"1","file_date_updated":"2022-05-13T07:55:50Z","publication_identifier":{"issn":["0304-4149"]},"publication_status":"published","arxiv":1,"month":"08","file":[{"file_name":"2021_StochasticProcessesAppl_Floreani.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"56768c553d7218ee5714902ffec90ec4","date_created":"2022-05-13T07:55:50Z","file_size":2115791,"date_updated":"2022-05-13T07:55:50Z","creator":"dernst","file_id":"11370"}],"department":[{"_id":"JaMa"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” Stochastic Processes and Their Applications. Elsevier, 2021. https://doi.org/10.1016/j.spa.2021.08.006.","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.” Stochastic Processes and Their Applications, vol. 142, Elsevier, 2021, pp. 124–58, doi:10.1016/j.spa.2021.08.006.","apa":"Floreani, S., Redig, F., & Sau, F. (2021). Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and Their Applications. Elsevier. https://doi.org/10.1016/j.spa.2021.08.006","ama":"Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 2021;142:124-158. doi:10.1016/j.spa.2021.08.006","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","ieee":"S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion process in random environment,” Stochastic Processes and their Applications, vol. 142. Elsevier, pp. 124–158, 2021."}},{"month":"09","arxiv":1,"department":[{"_id":"MaSe"},{"_id":"MiLe"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"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).","ieee":"H. Zhou et al., “Half and quarter metals in rhombohedral trilayer graphene,” Nature. Springer Nature, 2021.","ama":"Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral trilayer graphene. Nature. 2021. doi:10.1038/s41586-021-03938-w","mla":"Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” Nature, Springer Nature, 2021, doi:10.1038/s41586-021-03938-w.","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. Nature. Springer Nature. https://doi.org/10.1038/s41586-021-03938-w","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.” Nature. Springer Nature, 2021. https://doi.org/10.1038/s41586-021-03938-w.","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."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","scopus_import":"1","author":[{"last_name":"Zhou","full_name":"Zhou, Haoxin","first_name":"Haoxin"},{"first_name":"Tian","full_name":"Xie, Tian","last_name":"Xie"},{"orcid":"0000-0001-9666-3543","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","full_name":"Ghazaryan, Areg","last_name":"Ghazaryan"},{"last_name":"Holder","full_name":"Holder, Tobias","first_name":"Tobias"},{"first_name":"James R.","last_name":"Ehrets","full_name":"Ehrets, James R."},{"full_name":"Spanton, Eric M.","last_name":"Spanton","first_name":"Eric M."},{"full_name":"Taniguchi, Takashi","last_name":"Taniguchi","first_name":"Takashi"},{"full_name":"Watanabe, Kenji","last_name":"Watanabe","first_name":"Kenji"},{"last_name":"Berg","full_name":"Berg, Erez","first_name":"Erez"},{"last_name":"Serbyn","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","orcid":"0000-0002-2399-5827"},{"full_name":"Young, Andrea F.","last_name":"Young","first_name":"Andrea F."}],"title":"Half and quarter metals in rhombohedral trilayer graphene","oa_version":"Preprint","date_created":"2021-09-19T22:01:25Z","article_type":"original","abstract":[{"lang":"eng","text":"Ferromagnetism is most common in transition metal compounds but may also arise in low-density two-dimensional electron systems, with signatures observed in silicon, III-V semiconductor systems, and graphene moiré heterostructures. Here we show that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive the spontaneous ferromagnetic polarization of the electron system into one or more spin- and valley flavors. Using capacitance measurements on graphite-gated van der Waals heterostructures, we find a cascade of density- and electronic displacement field tuned phase transitions marked by negative electronic compressibility. The transitions define the boundaries between phases where quantum oscillations have either four-fold, two-fold, or one-fold degeneracy, associated with a spin and valley degenerate normal metal, spin-polarized `half-metal', and spin and valley polarized `quarter metal', respectively. For electron doping, the salient features are well captured by a phenomenological Stoner model with a valley-anisotropic Hund's coupling, likely arising from interactions at the lattice scale. For hole filling, we observe a richer phase diagram featuring a delicate interplay of broken symmetries and transitions in the Fermi surface topology. Finally, by rotational alignment of a hexagonal boron nitride substrate to induce a moiré superlattice, we find that the superlattice perturbs the preexisting isospin order only weakly, leaving the basic phase diagram intact while catalyzing the formation of topologically nontrivial gapped states whenever itinerant half- or quarter metal states occur at half- or quarter superlattice band filling. Our results show that rhombohedral trilayer graphene is an ideal platform for well-controlled tests of many-body theory and reveal magnetism in moiré materials to be fundamentally itinerant in nature."}],"publication_status":"published","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"isi":1,"year":"2021","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s41586-021-04181-z"}]},"external_id":{"isi":["000706977400002"],"arxiv":["2104.00653"]},"keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"status":"public","publication":"Nature","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"ec_funded":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_published":"2021-09-01T00:00:00Z","article_processing_charge":"No","doi":"10.1038/s41586-021-03938-w","publisher":"Springer Nature","_id":"10025","date_updated":"2023-08-14T07:04:06Z","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/2104.00653","open_access":"1"}],"quality_controlled":"1"},{"article_processing_charge":"No","day":"08","author":[{"first_name":"Duc T","full_name":"Phan, Duc T","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan"},{"first_name":"Jorden L","orcid":"0000-0002-0672-9295","id":"5479D234-2D30-11EA-89CC-40953DDC885E","full_name":"Senior, Jorden L","last_name":"Senior"},{"orcid":"0000-0001-9666-3543","first_name":"Areg","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hatefipour, M.","last_name":"Hatefipour","first_name":"M."},{"last_name":"Strickland","full_name":"Strickland, W. M.","first_name":"W. M."},{"first_name":"J.","last_name":"Shabani","full_name":"Shabani, J."},{"last_name":"Serbyn","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym"},{"first_name":"Andrew P","orcid":"0000-0003-2607-2363","last_name":"Higginbotham","full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","title":"Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid","_id":"10029","date_updated":"2024-02-21T12:36:52Z","date_created":"2021-09-21T08:41:02Z","type":"preprint","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"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"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.03695"}],"publication_status":"submitted","year":"2021","related_material":{"record":[{"id":"10851","status":"public","relation":"later_version"},{"status":"public","relation":"research_data","id":"9636"}]},"month":"07","arxiv":1,"external_id":{"arxiv":["2107.03695"]},"department":[{"_id":"MaSe"},{"_id":"AnHi"},{"_id":"MiLe"}],"article_number":"2107.03695","oa":1,"language":[{"iso":"eng"}],"publication":"arXiv","status":"public","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"citation":{"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. arXiv.","mla":"Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, 2107.03695.","chicago":"Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland, J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, n.d.","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.","ieee":"D. T. Phan et al., “Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid,” arXiv. .","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. arXiv."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-07-08T00:00:00Z","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."}]