[{"_id":"9728","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","keyword":["Drag Reduction","Transition to Turbulence","Multiphase Flows","particle Laden Flows","Complex Flows","Experiments","Fluid Dynamics"],"status":"public","date_updated":"2024-02-28T13:14:39Z","supervisor":[{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"ddc":["532"],"file_date_updated":"2022-07-29T22:30:05Z","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"abstract":[{"text":"Most real-world flows are multiphase, yet we know little about them compared to their single-phase counterparts. Multiphase flows are more difficult to investigate as their dynamics occur in large parameter space and involve complex phenomena such as preferential concentration, turbulence modulation, non-Newtonian rheology, etc. Over the last few decades, experiments in particle-laden flows have taken a back seat in favour of ever-improving computational resources. However, computers are still not powerful enough to simulate a real-world fluid with millions of finite-size particles. Experiments are essential not only because they offer a reliable way to investigate real-world multiphase flows but also because they serve to validate numerical studies and steer the research in a relevant direction. In this work, we have experimentally investigated particle-laden flows in pipes, and in particular, examined the effect of particles on the laminar-turbulent transition and the drag scaling in turbulent flows.\r\n\r\nFor particle-laden pipe flows, an earlier study [Matas et al., 2003] reported how the sub-critical (i.e., hysteretic) transition that occurs via localised turbulent structures called puffs is affected by the addition of particles. In this study, in addition to this known transition, we found a super-critical transition to a globally fluctuating state with increasing particle concentration. At the same time, the Newtonian-type transition via puffs is delayed to larger Reynolds numbers. At an even higher concentration, only the globally fluctuating state is found. The dynamics of particle-laden flows are hence determined by two competing instabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle-induced globally fluctuating state at high, and a coexistence state at intermediate concentrations.\r\n\r\nThe effect of particles on turbulent drag is ambiguous, with studies reporting drag reduction, no net change, and even drag increase. The ambiguity arises because, in addition to particle concentration, particle shape, size, and density also affect the net drag. Even similar particles might affect the flow dissimilarly in different Reynolds number and concentration ranges. In the present study, we explored a wide range of both Reynolds number and concentration, using spherical as well as cylindrical particles. We found that the spherical particles do not reduce drag while the cylindrical particles are drag-reducing within a specific Reynolds number interval. The interval strongly depends on the particle concentration and the relative size of the pipe and particles. Within this interval, the magnitude of drag reduction reaches a maximum. These drag reduction maxima appear to fall onto a distinct power-law curve irrespective of the pipe diameter and particle concentration, and this curve can be considered as the maximum drag reduction asymptote for a given fibre shape. Such an asymptote is well known for polymeric flows but had not been identified for particle-laden flows prior to this work.","lang":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"07","degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"file_name":"Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.zip","date_created":"2021-07-28T13:32:02Z","creator":"nagrawal","file_size":22859658,"date_updated":"2022-07-29T22:30:05Z","file_id":"9744","checksum":"77436be3563a90435024307b1b5ee7e8","relation":"source_file","access_level":"closed","embargo_to":"open_access","content_type":"application/x-zip-compressed"},{"file_name":"Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.pdf","date_created":"2021-07-28T13:32:05Z","creator":"nagrawal","file_size":18658048,"date_updated":"2022-07-29T22:30:05Z","embargo":"2022-07-28","file_id":"9745","checksum":"72a891d7daba85445c29b868c22575ed","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"related_material":{"record":[{"id":"6189","status":"public","relation":"part_of_dissertation"}]},"citation":{"mla":"Agrawal, Nishchal. Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9728.","apa":"Agrawal, N. (2021). Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9728","ama":"Agrawal N. Transition to turbulence and drag reduction in particle-laden pipe flows. 2021. doi:10.15479/at:ista:9728","short":"N. Agrawal, Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows, Institute of Science and Technology Austria, 2021.","ieee":"N. Agrawal, “Transition to turbulence and drag reduction in particle-laden pipe flows,” Institute of Science and Technology Austria, 2021.","chicago":"Agrawal, Nishchal. “Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9728.","ista":"Agrawal N. 2021. Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"full_name":"Agrawal, Nishchal","last_name":"Agrawal","first_name":"Nishchal","id":"469E6004-F248-11E8-B48F-1D18A9856A87"}],"title":"Transition to turbulence and drag reduction in particle-laden pipe flows","oa":1,"publisher":"Institute of Science and Technology Austria","year":"2021","has_accepted_license":"1","day":"29","page":"118","date_created":"2021-07-27T13:40:30Z","doi":"10.15479/at:ista:9728","date_published":"2021-07-29T00:00:00Z"},{"acknowledgement":"RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n","oa":1,"quality_controlled":"1","publication":"Proceedings of the 37th International Conference on Machine Learning","year":"2020","has_accepted_license":"1","date_created":"2022-01-25T15:50:34Z","date_published":"2020-01-01T00:00:00Z","page":"4082-4093","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.","mla":"Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual."},"title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","article_processing_charge":"No","author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level."}],"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"alternative_title":["PMLR"],"scopus_import":"1","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10691","checksum":"c9a4a29161777fc1a89ef451c040e3b1","success":1,"creator":"cchlebak","date_updated":"2022-01-26T11:08:51Z","file_size":2329798,"date_created":"2022-01-26T11:08:51Z","file_name":"2020_PMLR_Hasani.pdf"}],"publication_status":"published","publication_identifier":{"issn":["2640-3498"]},"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","series_title":"PMLR","_id":"10673","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"start_date":"2020-07-12","end_date":"2020-07-18","location":"Virtual","name":"ML: Machine Learning"},"type":"conference","ddc":["000"],"date_updated":"2022-01-26T11:14:27Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T11:08:51Z"},{"month":"01","main_file_link":[{"url":"https://www.usenix.org/system/files/conference/atc18/atc18-arbel-raviv.pdf","open_access":"1"}],"oa":1,"scopus_import":"1","publisher":"USENIX Association","quality_controlled":"1","oa_version":"Published Version","abstract":[{"text":"Many systems rely on optimistic concurrent search trees for multi-core scalability. In principle, optimistic trees have a simple performance story: searches are read-only and so run in parallel, with writes to shared memory occurring only when modifying the data structure. However, this paper shows that in practice, obtaining the full performance benefits of optimistic search trees is not so simple.\r\n\r\nWe focus on optimistic binary search trees (BSTs) and perform a detailed performance analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both microbenchmarks and an in-memory database system. We find and explain significant unexpected performance differences between BSTs with similar tree structure and search implementations, which we trace to subtle performance-degrading interactions of BSTs with systems software and hardware subsystems. We further derive a prescriptive approach to avoid this performance degradation, as well as algorithmic insights on optimistic BST design. Our work underlines the gap between the theory and practice of multi-core performance, and calls for further research to help bridge this gap.","lang":"eng"}],"date_created":"2020-01-14T07:27:08Z","date_published":"2020-01-01T00:00:00Z","page":"295-306","language":[{"iso":"eng"}],"publication":"Proceedings of the 2018 USENIX Annual Technical Conference","day":"01","year":"2020","publication_status":"published","publication_identifier":{"isbn":["9781939133021"]},"status":"public","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2018-07-11","location":"Boston, MA, United States","end_date":"2018-07-13","name":"USENIX: Annual Technical Conference"},"type":"conference","_id":"7272","title":"Getting to the root of concurrent binary search tree performance","department":[{"_id":"DaAl"}],"article_processing_charge":"No","author":[{"last_name":"Arbel-Raviv","full_name":"Arbel-Raviv, Maya","first_name":"Maya"},{"full_name":"Brown, Trevor A","last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Adam","last_name":"Morrison","full_name":"Morrison, Adam"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"ista":"Arbel-Raviv M, Brown TA, Morrison A. 2020. Getting to the root of concurrent binary search tree performance. Proceedings of the 2018 USENIX Annual Technical Conference. USENIX: Annual Technical Conference, 295–306.","chicago":"Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, 295–306. USENIX Association, 2020.","apa":"Arbel-Raviv, M., Brown, T. A., & Morrison, A. (2020). Getting to the root of concurrent binary search tree performance. In Proceedings of the 2018 USENIX Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX Association.","ama":"Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.","ieee":"M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical Conference, Boston, MA, United States, 2020, pp. 295–306.","short":"M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.","mla":"Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306."},"date_updated":"2021-01-11T15:25:48Z"},{"abstract":[{"lang":"eng","text":"The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to \"one-shot games\"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature. "}],"oa_version":"Preprint","scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 153","month":"02","publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"9a91916ac2c21ab42458fcda39ef0b8d","file_id":"7608","file_size":630752,"date_updated":"2020-07-14T12:47:56Z","creator":"dernst","file_name":"2019_LIPIcS_Schmid.pdf","date_created":"2020-03-23T09:14:06Z"}],"volume":153,"_id":"7346","conference":{"name":"OPODIS: International Conference on Principles of Distributed Systems","start_date":"2019-12-17","end_date":"2019-12-19","location":"Neuchâtel, Switzerland"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","status":"public","date_updated":"2023-02-23T13:05:49Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:56Z","department":[{"_id":"KrCh"}],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","year":"2020","has_accepted_license":"1","publication":"Proceedings of the 23rd International Conference on Principles of Distributed Systems","day":"10","date_created":"2020-01-21T16:00:26Z","doi":"10.4230/LIPIcs.OPODIS.2019.21","date_published":"2020-02-10T00:00:00Z","article_number":"21","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"citation":{"mla":"Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.","ama":"Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21","apa":"Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21","short":"L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd International Conference on Principles of Distributed Systems, Neuchâtel, Switzerland, 2020, vol. 153.","chicago":"Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.","ista":"Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1906.00110"]},"article_processing_charge":"No","author":[{"first_name":"Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","orcid":"0000-0002-6978-7329","full_name":"Schmid, Laura"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"title":"The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game"},{"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"article_number":"20","title":"Monitoring event frequencies","article_processing_charge":"No","external_id":{"arxiv":["1910.06097"]},"author":[{"last_name":"Ferrere","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20.","short":"T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152.","apa":"Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20","ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20","mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20."},"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2020-01-21T11:22:21Z","date_published":"2020-01-15T00:00:00Z","doi":"10.4230/LIPIcs.CSL.2020.20","publication":"28th EACSL Annual Conference on Computer Science Logic","day":"15","year":"2020","has_accepted_license":"1","status":"public","conference":{"name":"CSL: Computer Science Logic","start_date":"2020-01-13","location":"Barcelona, Spain","end_date":"2020-01-16"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"7348","file_date_updated":"2020-07-14T12:47:56Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:13:12Z","intvolume":" 152","month":"01","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. ","lang":"eng"}],"volume":152,"language":[{"iso":"eng"}],"file":[{"checksum":"b9a691d658d075c6369d3304d17fb818","file_id":"7349","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"main.pdf","date_created":"2020-01-21T11:21:04Z","creator":"bkragl","file_size":617206,"date_updated":"2020-07-14T12:47:56Z"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771320"],"issn":["1868-8969"]}},{"date_created":"2020-03-05T13:30:18Z","doi":"10.1007/s11786-020-00461-5","date_published":"2020-03-01T00:00:00Z","page":"141-176","publication":"Mathematics in Computer Science","day":"01","year":"2020","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer Nature","title":"Coxeter triangulations have good quality","article_processing_charge":"Yes (via OA deal)","author":[{"full_name":"Choudhary, Aruni","last_name":"Choudhary","first_name":"Aruni"},{"last_name":"Kachanovich","full_name":"Kachanovich, Siargey","first_name":"Siargey"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science. Springer Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5.","ista":"Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176.","mla":"Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5.","apa":"Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5","ama":"Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5","ieee":"A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” Mathematics in Computer Science, vol. 14. Springer Nature, pp. 141–176, 2020.","short":"A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176."},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ec_funded":1,"volume":14,"language":[{"iso":"eng"}],"file":[{"file_id":"8783","checksum":"1d145f3ab50ccee735983cb89236e609","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-11-20T10:18:02Z","file_name":"2020_MathCompScie_Choudhary.pdf","creator":"dernst","date_updated":"2020-11-20T10:18:02Z","file_size":872275}],"publication_status":"published","publication_identifier":{"issn":["1661-8270"],"eissn":["1661-8289"]},"intvolume":" 14","month":"03","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space."}],"file_date_updated":"2020-11-20T10:18:02Z","department":[{"_id":"HeEd"}],"ddc":["510"],"date_updated":"2021-01-12T08:14:13Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"7567"},{"title":"How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator","author":[{"first_name":"Dorota","full_name":"Gotfryd, Dorota","last_name":"Gotfryd"},{"id":"8275014E-6063-11E9-9B7F-6338E6697425","first_name":"Ekaterina","last_name":"Paerschke","full_name":"Paerschke, Ekaterina","orcid":"0000-0003-0853-8182"},{"first_name":"Jiri","full_name":"Chaloupka, Jiri","last_name":"Chaloupka"},{"full_name":"Oles, Andrzej M.","last_name":"Oles","first_name":"Andrzej M."},{"full_name":"Wohlfeld, Krzysztof","last_name":"Wohlfeld","first_name":"Krzysztof"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles, and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/PhysRevResearch.2.013353.","ista":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2(1), 013353.","mla":"Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353.","short":"D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical Review Research 2 (2020).","ieee":"D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,” Physical Review Research, vol. 2, no. 1. American Physical Society, 2020.","apa":"Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., & Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.2.013353","ama":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2020;2(1). doi:10.1103/PhysRevResearch.2.013353"},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"article_number":"013353","doi":"10.1103/PhysRevResearch.2.013353","date_published":"2020-03-20T00:00:00Z","date_created":"2020-03-20T15:21:10Z","day":"20","publication":"Physical Review Research","has_accepted_license":"1","year":"2020","publisher":"American Physical Society","quality_controlled":"1","oa":1,"file_date_updated":"2020-07-14T12:48:00Z","department":[{"_id":"MiLe"}],"ddc":["530"],"date_updated":"2021-01-12T08:14:23Z","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"7594","volume":2,"issue":"1","ec_funded":1,"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"1be551fd5f5583635076017d7391ffdc","file_id":"7610","creator":"dernst","file_size":1436735,"date_updated":"2020-07-14T12:48:00Z","file_name":"2020_PhysRevResearch_Gotfryd.pdf","date_created":"2020-03-23T10:18:38Z"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"03","intvolume":" 2","oa_version":"Published Version","abstract":[{"text":"The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected.","lang":"eng"}]},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"date_published":"2020-02-01T00:00:00Z","doi":"10.4230/LIPIcs.OPODIS.2019.15","date_created":"2020-03-22T23:00:46Z","page":"15:1-15:16","day":"01","publication":"23rd International Conference on Principles of Distributed Systems","has_accepted_license":"1","year":"2020","title":"In search of the fastest concurrent union-find algorithm","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"full_name":"Koval, Nikita","last_name":"Koval","first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["1911.06347"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.","ista":"Alistarh D-A, Fedorov A, Koval N. 2020. In search of the fastest concurrent union-find algorithm. 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 15:1-15:16.","mla":"Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.","ieee":"D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.","short":"D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.","ama":"Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15","apa":"Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15"},"month":"02","intvolume":" 153","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and analyze the performance of several concurrent Union-Find algorithms and optimization strategies across a wide range of platforms (Intel, AMD, and ARM) and workloads (social, random, and road networks, as well as integrations into more complex algorithms). We first observe that, due to the limited computational cost, the number of induced cache misses is the critical determining factor for the performance of existing algorithms. We introduce new techniques to reduce this cost by storing node priorities implicitly and by using plain reads and writes in a way that does not affect the correctness of the algorithms. Finally, we show that Union-Find implementations are an interesting application for Transactional Memory (TM): one of the fastest algorithm variants we discovered is a sequential one that uses coarse-grained locking with the lock elision optimization to reduce synchronization cost and increase scalability. ","lang":"eng"}],"volume":153,"license":"https://creativecommons.org/licenses/by/3.0/","file":[{"date_created":"2020-03-23T09:22:48Z","file_name":"2019_LIPIcs_Alistarh.pdf","date_updated":"2020-07-14T12:48:01Z","file_size":13074131,"creator":"dernst","file_id":"7609","checksum":"d66f07ecb609d9f02433e39f80a447e9","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959771337"],"issn":["18688969"]},"publication_status":"published","status":"public","type":"conference","conference":{"start_date":"2019-12-17","location":"Neuchatal, Switzerland","end_date":"2019-12-19","name":"OPODIS: International Conference on Principles of Distributed Systems"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"_id":"7605","department":[{"_id":"DaAl"}],"file_date_updated":"2020-07-14T12:48:01Z","ddc":["000"],"date_updated":"2023-02-23T13:12:12Z"},{"month":"02","main_file_link":[{"url":"https://doi.org/10.1101/791137","open_access":"1"}],"oa":1,"publisher":"Cold Spring Harbor Laboratory","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals."}],"date_created":"2020-03-21T16:34:42Z","date_published":"2020-02-19T00:00:00Z","doi":"10.1101/791137","page":"22","language":[{"iso":"eng"}],"publication":"bioRxiv","day":"19","year":"2020","publication_status":"published","status":"public","type":"preprint","_id":"7601","department":[{"_id":"JiFr"}],"title":"Plasmodesmata-like intercellular connections by plant remorin in animal cells","article_processing_charge":"No","author":[{"first_name":"Zhuang","full_name":"Wei, Zhuang","last_name":"Wei"},{"first_name":"Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","last_name":"Tan","full_name":"Tan, Shutang","orcid":"0000-0002-0471-8285"},{"full_name":"Liu, Tao","last_name":"Liu","first_name":"Tao"},{"first_name":"Yuan","last_name":"Wu","full_name":"Wu, Yuan"},{"first_name":"Ji-Gang","full_name":"Lei, Ji-Gang","last_name":"Lei"},{"full_name":"Chen, ZhengJun","last_name":"Chen","first_name":"ZhengJun"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"},{"last_name":"Xue","full_name":"Xue, Hong-Wei","first_name":"Hong-Wei"},{"full_name":"Liao, Kan","last_name":"Liao","first_name":"Kan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:14:26Z","citation":{"chicago":"Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen, Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv. Cold Spring Harbor Laboratory, 2020. https://doi.org/10.1101/791137.","ista":"Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv, 10.1101/791137.","mla":"Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, Cold Spring Harbor Laboratory, 2020, doi:10.1101/791137.","ieee":"Z. Wei et al., “Plasmodesmata-like intercellular connections by plant remorin in animal cells,” bioRxiv. Cold Spring Harbor Laboratory, 2020.","short":"Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K. Liao, BioRxiv (2020).","apa":"Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/791137","ama":"Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137"}},{"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7660","checksum":"4eb102304402f5c56432516b84df86d6","creator":"dernst","date_updated":"2020-07-14T12:48:01Z","file_size":1556190,"date_created":"2020-04-14T12:31:16Z","file_name":"2020_JournRoyalSociety_Larsson.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1742-5689"],"eissn":["1742-5662"]},"publication_status":"published","volume":17,"issue":"163","oa_version":"Published Version","abstract":[{"text":"The growth of snail shells can be described by simple mathematical rules. Variation in a few parameters can explain much of the diversity of shell shapes seen in nature. However, empirical studies of gastropod shell shape variation typically use geometric morphometric approaches, which do not capture this growth pattern. We have developed a way to infer a set of developmentally descriptive shape parameters based on three-dimensional logarithmic helicospiral growth and using landmarks from two-dimensional shell images as input. We demonstrate the utility of this approach, and compare it to the geometric morphometric approach, using a large set of Littorina saxatilis shells in which locally adapted populations differ in shape. Our method can be modified easily to make it applicable to a wide range of shell forms, which would allow for investigations of the similarities and differences between and within many different species of gastropods.","lang":"eng"}],"month":"02","intvolume":" 17","scopus_import":1,"ddc":["570"],"date_updated":"2021-01-12T08:14:41Z","file_date_updated":"2020-07-14T12:48:01Z","department":[{"_id":"NiBa"}],"_id":"7651","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"01","publication":"Journal of The Royal Society Interface","has_accepted_license":"1","year":"2020","doi":"10.1098/rsif.2019.0721","date_published":"2020-02-01T00:00:00Z","date_created":"2020-04-08T15:19:17Z","publisher":"The Royal Society","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"J. Larsson, A.M. Westram, S. Bengmark, T. Lundh, R.K. Butlin, Journal of The Royal Society Interface 17 (2020).","ieee":"J. Larsson, A. M. Westram, S. Bengmark, T. Lundh, and R. K. Butlin, “A developmentally descriptive method for quantifying shape in gastropod shells,” Journal of The Royal Society Interface, vol. 17, no. 163. The Royal Society, 2020.","apa":"Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., & Butlin, R. K. (2020). A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2019.0721","ama":"Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 2020;17(163). doi:10.1098/rsif.2019.0721","mla":"Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface, vol. 17, no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721.","ista":"Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. 2020. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 17(163), 20190721.","chicago":"Larsson, J., Anja M Westram, S. Bengmark, T. Lundh, and R. K. Butlin. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface. The Royal Society, 2020. https://doi.org/10.1098/rsif.2019.0721."},"title":"A developmentally descriptive method for quantifying shape in gastropod shells","author":[{"full_name":"Larsson, J.","last_name":"Larsson","first_name":"J."},{"last_name":"Westram","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M"},{"full_name":"Bengmark, S.","last_name":"Bengmark","first_name":"S."},{"first_name":"T.","full_name":"Lundh, T.","last_name":"Lundh"},{"first_name":"R. K.","last_name":"Butlin","full_name":"Butlin, R. K."}],"article_processing_charge":"No","article_number":"20190721"},{"year":"2020","has_accepted_license":"1","publication":"Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing","day":"01","page":"309-318","date_created":"2020-05-06T09:02:14Z","date_published":"2020-07-01T00:00:00Z","doi":"10.1145/3382734.3405751","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","citation":{"apa":"Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405751","ama":"Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751","short":"A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318.","mla":"Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.","ista":"Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2009.06043"]},"author":[{"full_name":"Czumaj, Artur","orcid":"0000-0002-5646-9524","last_name":"Czumaj","first_name":"Artur"},{"full_name":"Davies, Peter","orcid":"0000-0002-5646-9524","last_name":"Davies","first_name":"Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425"},{"first_name":"Merav","last_name":"Parter","full_name":"Parter, Merav"}],"title":"Simple, deterministic, constant-round coloring in the congested clique","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publication_status":"published","language":[{"iso":"eng"}],"file":[{"creator":"pdavies","file_size":520051,"date_updated":"2020-10-08T08:17:36Z","file_name":"ColoringArxiv.pdf","date_created":"2020-10-08T08:17:36Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8624","checksum":"46fe4fc58a64eb04068115573f631d4c"}],"ec_funded":1,"abstract":[{"text":"We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space.\r\nWe also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds.","lang":"eng"}],"oa_version":"Submitted Version","month":"07","date_updated":"2021-01-12T08:15:37Z","ddc":["000"],"department":[{"_id":"DaAl"}],"file_date_updated":"2020-10-08T08:17:36Z","_id":"7803","conference":{"end_date":"2020-08-07","location":"Salerno, Italy","start_date":"2020-08-03","name":"PODC: Symposium on Principles of Distributed Computing"},"type":"conference","status":"public"},{"conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2020-01-05","location":"Salt Lake City, UT, United States","end_date":"2020-01-08"},"type":"conference","status":"public","_id":"7806","department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T08:15:38Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611975994.47"}],"scopus_import":1,"month":"01","abstract":[{"text":"We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.\r\nOur result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4.","lang":"eng"}],"oa_version":"Published Version","volume":"2020-January","publication_status":"published","publication_identifier":{"isbn":["9781611975994"]},"language":[{"iso":"eng"}],"project":[{"name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","author":[{"id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Filakovský, Marek","last_name":"Filakovský"},{"last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zhechev","full_name":"Zhechev, Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y"}],"title":"Embeddability of simplicial complexes is undecidable","citation":{"mla":"Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.","short":"M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.","ieee":"M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785.","apa":"Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47","ama":"Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47","chicago":"Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47.","ista":"Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"SIAM","page":"767-785","date_created":"2020-05-10T22:00:48Z","doi":"10.1137/1.9781611975994.47","date_published":"2020-01-01T00:00:00Z","year":"2020","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01"},{"article_number":"48","project":[{"call_identifier":"FWF","_id":"264E56E2-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","grant_number":"M02416"},{"_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780"}],"citation":{"chicago":"Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.","ista":"Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 5, 48.","mla":"Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education, vol. 5, 48, Frontiers Media, 2020, doi:10.3389/feduc.2020.00048.","short":"R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020).","ieee":"R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity through Open-Source platforms in education and science,” Frontiers in Education, vol. 5. Frontiers Media, 2020.","apa":"Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048","ama":"Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","first_name":"Robert J","last_name":"Beattie","full_name":"Beattie, Robert J","orcid":"0000-0002-8483-8753"},{"first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"},{"full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"}],"title":"SCOPES: Sparking curiosity through Open-Source platforms in education and science","oa":1,"quality_controlled":"1","publisher":"Frontiers Media","year":"2020","has_accepted_license":"1","publication":"Frontiers in Education","day":"08","date_created":"2020-05-11T08:18:48Z","doi":"10.3389/feduc.2020.00048","date_published":"2020-05-08T00:00:00Z","_id":"7814","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","date_updated":"2021-01-12T08:15:42Z","ddc":["570"],"file_date_updated":"2020-07-14T12:48:03Z","department":[{"_id":"SiHi"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"abstract":[{"lang":"eng","text":"Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org."}],"oa_version":"Published Version","intvolume":" 5","month":"05","publication_status":"published","publication_identifier":{"issn":["2504-284X"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"7818","checksum":"a24ec24e38d843341ae620ec76c53688","creator":"dernst","file_size":1402146,"date_updated":"2020-07-14T12:48:03Z","file_name":"2020_FrontiersEduc_Beattie.pdf","date_created":"2020-05-11T11:34:08Z"}],"ec_funded":1,"volume":5},{"volume":6,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8802","checksum":"6bc6832caacddceee1471291e93dcf1d","success":1,"date_updated":"2020-11-25T08:59:59Z","file_size":8408694,"creator":"dernst","date_created":"2020-11-25T08:59:59Z","file_name":"2020_JourEllipticParabEquat_Fellner.pdf"}],"publication_status":"published","publication_identifier":{"issn":["22969020"],"eissn":["22969039"]},"intvolume":" 6","month":"12","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation.","lang":"eng"}],"department":[{"_id":"JuFi"}],"file_date_updated":"2020-11-25T08:59:59Z","ddc":["510"],"date_updated":"2021-01-12T08:15:47Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","_id":"7866","date_created":"2020-05-17T22:00:45Z","doi":"10.1007/s41808-020-00068-8","date_published":"2020-12-01T00:00:00Z","page":"529-598","publication":"Journal of Elliptic and Parabolic Equations","day":"01","year":"2020","has_accepted_license":"1","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). The second author has been supported by the International Research Training Group IGDK 1754 “Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian Science Fund (FWF) under grant number [W 1244-N18].","title":"Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model","article_processing_charge":"No","author":[{"last_name":"Fellner","full_name":"Fellner, Klemens","first_name":"Klemens"},{"orcid":"0000-0001-5645-4333","full_name":"Kniely, Michael","last_name":"Kniely","first_name":"Michael","id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations. Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8.","ista":"Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 6, 529–598.","mla":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations, vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8.","apa":"Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. Springer Nature. https://doi.org/10.1007/s41808-020-00068-8","ama":"Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8","ieee":"K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature, pp. 529–598, 2020.","short":"K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020) 529–598."},"project":[{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF","name":"FWF Open Access Fund"}]},{"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"7919","file_date_updated":"2020-07-14T12:48:05Z","department":[{"_id":"MiLe"}],"date_updated":"2023-02-23T13:20:16Z","ddc":["530"],"month":"05","intvolume":" 2","abstract":[{"lang":"eng","text":"We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations."}],"oa_version":"Published Version","volume":2,"ec_funded":1,"publication_identifier":{"issn":["2643-1564"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"e1c362fe094d6b246b3cd4a49722e78b","file_id":"7926","creator":"dernst","date_updated":"2020-07-14T12:48:05Z","file_size":1741098,"date_created":"2020-06-04T13:51:59Z","file_name":"2020_PhysRevResearch_Mistakidis.pdf"}],"language":[{"iso":"eng"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"article_number":"023154 ","author":[{"first_name":"S. I.","last_name":"Mistakidis","full_name":"Mistakidis, S. I."},{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"},{"first_name":"P.","full_name":"Schmelcher, P.","last_name":"Schmelcher"}],"article_processing_charge":"No","title":"Induced correlations between impurities in a one-dimensional quenched Bose gas","citation":{"chicago":"Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154.","ista":"Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2, 023154.","mla":"Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American Physical Society, 2020, doi:10.1103/physrevresearch.2.023154.","ieee":"S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between impurities in a one-dimensional quenched Bose gas,” Physical Review Research, vol. 2. American Physical Society, 2020.","short":"S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2 (2020).","ama":"Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2. doi:10.1103/physrevresearch.2.023154","apa":"Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"American Physical Society","oa":1,"date_published":"2020-05-11T00:00:00Z","doi":"10.1103/physrevresearch.2.023154","date_created":"2020-06-03T11:30:10Z","has_accepted_license":"1","year":"2020","day":"11","publication":"Physical Review Research"},{"date_updated":"2021-01-12T08:16:23Z","ddc":["510"],"file_date_updated":"2020-07-14T12:48:06Z","department":[{"_id":"UlWa"}],"_id":"7991","type":"conference","conference":{"start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26","name":"SoCG: Symposium on Computational Geometry"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]},"publication_status":"published","file":[{"date_created":"2020-06-23T11:13:49Z","file_name":"2020_LIPIcsSoCG_Avvakumov.pdf","creator":"dernst","date_updated":"2020-07-14T12:48:06Z","file_size":575896,"checksum":"6872df6549142f709fb6354a1b2f2c06","file_id":"8007","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":164,"abstract":[{"lang":"eng","text":"We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between \"grid peeling\" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","month":"06","intvolume":" 164","citation":{"apa":"Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12","ama":"Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12","short":"S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening flow,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","mla":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.","ista":"Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.","chicago":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.12."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"},{"first_name":"Gabriel","full_name":"Nivasch, Gabriel","last_name":"Nivasch"}],"article_processing_charge":"No","external_id":{"arxiv":["1909.00263"]},"title":"Homotopic curve shortening and the affine curve-shortening flow","article_number":"12:1 - 12:15","project":[{"call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312"}],"has_accepted_license":"1","year":"2020","day":"01","publication":"36th International Symposium on Computational Geometry","date_published":"2020-06-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2020.12","date_created":"2020-06-22T09:14:19Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1},{"external_id":{"arxiv":["1908.01677"]},"article_processing_charge":"No","author":[{"last_name":"Patakova","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana"}],"title":"Bounding radon number via Betti numbers","citation":{"mla":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.","ieee":"Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","apa":"Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61","ama":"Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61","chicago":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61.","ista":"Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 61:1-61:13."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"61:1-61:13","date_created":"2020-06-22T09:14:18Z","doi":"10.4230/LIPIcs.SoCG.2020.61","date_published":"2020-06-01T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"36th International Symposium on Computational Geometry","day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","date_updated":"2021-01-12T08:16:22Z","ddc":["510"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","_id":"7989","volume":164,"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]},"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-07-14T12:48:06Z","file_size":645421,"date_created":"2020-06-23T06:56:23Z","file_name":"2020_LIPIcsSoCG_Patakova_61.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8005","checksum":"d0996ca5f6eb32ce955ce782b4f2afbe"}],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 164","month":"06","abstract":[{"lang":"eng","text":"We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface."}],"oa_version":"Published Version"},{"article_number":"62:1 - 62:16","citation":{"mla":"Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.","ieee":"Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62","apa":"Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62","chicago":"Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62.","ista":"Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana","last_name":"Patakova"},{"first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","last_name":"Tancer"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner"}],"external_id":{"arxiv":["2003.13536"]},"article_processing_charge":"No","title":"Barycentric cuts through a convex body","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"36th International Symposium on Computational Geometry","date_published":"2020-06-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2020.62","date_created":"2020-06-22T09:14:20Z","_id":"7992","type":"conference","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2021-01-12T08:16:23Z","ddc":["510"],"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","abstract":[{"lang":"eng","text":"Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"06","intvolume":" 164","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8004","checksum":"ce1c9194139a664fb59d1efdfc88eaae","creator":"dernst","date_updated":"2020-07-14T12:48:06Z","file_size":750318,"date_created":"2020-06-23T06:45:52Z","file_name":"2020_LIPIcsSoCG_Patakova.pdf"}],"language":[{"iso":"eng"}],"volume":164},{"_id":"7994","status":"public","conference":{"end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","ddc":["510"],"date_updated":"2023-02-23T13:22:12Z","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","oa_version":"Published Version","abstract":[{"text":"In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.","lang":"eng"}],"intvolume":" 164","month":"06","alternative_title":["LIPIcs"],"scopus_import":"1","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"93571b76cf97d5b7c8aabaeaa694dd7e","file_id":"8006","creator":"dernst","file_size":592661,"date_updated":"2020-07-14T12:48:06Z","file_name":"2020_LIPIcsSoCG_Arroyo.pdf","date_created":"2020-06-23T11:06:23Z"}],"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]},"ec_funded":1,"volume":164,"article_number":"9:1 - 9:14","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.","chicago":"Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.","apa":"Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9","ama":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9","ieee":"A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9."},"title":"Extending drawings of graphs to arrangements of pseudolines","external_id":{"arxiv":["1804.09317"]},"article_processing_charge":"No","author":[{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","last_name":"Arroyo Guevara","orcid":"0000-0003-2401-8670","full_name":"Arroyo Guevara, Alan M"},{"first_name":"Julien","last_name":"Bensmail","full_name":"Bensmail, Julien"},{"first_name":"R.","last_name":"Bruce Richter","full_name":"Bruce Richter, R."}],"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"36th International Symposium on Computational Geometry","day":"01","year":"2020","has_accepted_license":"1","date_created":"2020-06-22T09:14:21Z","doi":"10.4230/LIPIcs.SoCG.2020.9","date_published":"2020-06-01T00:00:00Z"},{"publication_identifier":{"issn":["2643-1564"]},"publication_status":"published","file":[{"checksum":"e6959dc8220f14a008d1933858795e6d","file_id":"8050","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-06-29T14:41:27Z","file_name":"2020_PhysicalReviewResearch_Michailidis.pdf","date_updated":"2020-07-14T12:48:08Z","file_size":2066011,"creator":"dernst"}],"language":[{"iso":"eng"}],"issue":"2","volume":2,"ec_funded":1,"abstract":[{"text":"Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.","lang":"eng"}],"oa_version":"Published Version","month":"06","intvolume":" 2","date_updated":"2021-01-12T08:16:30Z","ddc":["530"],"file_date_updated":"2020-07-14T12:48:08Z","department":[{"_id":"MaSe"}],"_id":"8011","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","has_accepted_license":"1","year":"2020","day":"22","publication":"Physical Review Research","date_published":"2020-06-22T00:00:00Z","doi":"10.1103/physrevresearch.2.022065","date_created":"2020-06-23T12:00:19Z","publisher":"American Physical Society","quality_controlled":"1","oa":1,"citation":{"ista":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2(2), 022065.","chicago":"Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065.","apa":"Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065","ama":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2020;2(2). doi:10.1103/physrevresearch.2.022065","short":"A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review Research 2 (2020).","ieee":"A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing two-dimensional quantum scars by deformation and synchronization,” Physical Review Research, vol. 2, no. 2. American Physical Society, 2020.","mla":"Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research, vol. 2, no. 2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Alexios","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","full_name":"Michailidis, Alexios","last_name":"Michailidis"},{"first_name":"C. J.","last_name":"Turner","full_name":"Turner, C. J."},{"full_name":"Papić, Z.","last_name":"Papić","first_name":"Z."},{"first_name":"D. A.","full_name":"Abanin, D. A.","last_name":"Abanin"},{"last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Stabilizing two-dimensional quantum scars by deformation and synchronization","article_number":"022065","project":[{"call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}]}]