[{"day":"22","article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1145/3528223.3530071","quality_controlled":"1","related_material":{"link":[{"relation":"press_release","description":"News on ISTA website","url":"https://ista.ac.at/en/news/unlocking-interlocking-riddles/"}]},"publication":"ACM Transactions on Graphics","issue":"4","ddc":["000"],"status":"public","isi":1,"month":"07","author":[{"first_name":"Rulin","full_name":"Chen, Rulin","last_name":"Chen"},{"last_name":"Wang","first_name":"Ziqi","full_name":"Wang, Ziqi"},{"last_name":"Song","first_name":"Peng","full_name":"Song, Peng"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"citation":{"ieee":"R. Chen, Z. Wang, P. Song, and B. Bickel, “Computational design of high-level interlocking puzzles,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","ama":"Chen R, Wang Z, Song P, Bickel B. Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>","chicago":"Chen, Rulin, Ziqi Wang, Peng Song, and Bernd Bickel. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>.","mla":"Chen, Rulin, et al. “Computational Design of High-Level Interlocking Puzzles.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 150, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530071\">10.1145/3528223.3530071</a>.","short":"R. Chen, Z. Wang, P. Song, B. Bickel, ACM Transactions on Graphics 41 (2022).","apa":"Chen, R., Wang, Z., Song, P., &#38; Bickel, B. (2022). Computational design of high-level interlocking puzzles. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530071\">https://doi.org/10.1145/3528223.3530071</a>","ista":"Chen R, Wang Z, Song P, Bickel B. 2022. Computational design of high-level interlocking puzzles. ACM Transactions on Graphics. 41(4), 150."},"scopus_import":"1","ec_funded":1,"external_id":{"isi":["000830989200018"]},"has_accepted_license":"1","file_date_updated":"2022-08-28T07:56:19Z","acknowledgement":"We thank the reviewers for the valuable comments, David Gontier for sharing the source code of the baseline design approach, Christian Hafner for proofreading the paper, Keenan Crane for the 3D model of Cow, and Thingiverse for the 3D models of Moai and Owl. This work was supported by the SUTD Start-up Research Grant (Number: SRG ISTD 2019 148), the Swiss National Science Foundation (NCCR Digital Fabrication Agreement #51NF40-141853), and\r\nthe European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No 715767 – MATERIALIZABLE).","date_published":"2022-07-22T00:00:00Z","publication_status":"published","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1145/3528223.3530071","oa":1,"article_processing_charge":"No","title":"Computational design of high-level interlocking puzzles","_id":"11735","department":[{"_id":"BeBi"}],"date_created":"2022-08-07T22:01:57Z","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"volume":41,"article_number":"150","abstract":[{"text":"Interlocking puzzles are intriguing geometric games where the puzzle pieces are held together based on their geometric arrangement, preventing the puzzle from falling apart. High-level-of-difficulty, or simply high-level, interlocking puzzles are a subclass of interlocking puzzles that require multiple moves to take out the first subassembly from the puzzle. Solving a high-level interlocking puzzle is a challenging task since one has to explore many different configurations of the puzzle pieces until reaching a configuration where the first subassembly can be taken out. Designing a high-level interlocking puzzle with a user-specified level of difficulty is even harder since the puzzle pieces have to be interlocking in all the configurations before the first subassembly is taken out.\r\n\r\nIn this paper, we present a computational approach to design high-level interlocking puzzles. The core idea is to represent all possible configurations of an interlocking puzzle as well as transitions among these configurations using a rooted, undirected graph called a disassembly graph and leverage this graph to find a disassembly plan that requires a minimal number of moves to take out the first subassembly from the puzzle. At the design stage, our algorithm iteratively constructs the geometry of each puzzle piece to expand the disassembly graph incrementally, aiming to achieve a user-specified level of difficulty. We show that our approach allows efficient generation of high-level interlocking puzzles of various shape complexities, including new solutions not attainable by state-of-the-art approaches.","lang":"eng"}],"file":[{"file_size":16896871,"date_created":"2022-08-28T07:56:19Z","success":1,"relation":"main_file","date_updated":"2022-08-28T07:56:19Z","file_name":"Chen-2022-High-LevelPuzzle_authorVersion.pdf","access_level":"open_access","creator":"bbickel","file_id":"11992","content_type":"application/pdf","checksum":"0b51651be45b1b33f2072bd5d2686c69"}],"intvolume":"        41","date_updated":"2025-04-14T07:28:57Z","year":"2022","project":[{"grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","type":"journal_article"},{"abstract":[{"lang":"eng","text":"This paper introduces a methodology for inverse-modeling of yarn-level mechanics of cloth, based on the mechanical response of fabrics in the real world. We compiled a database from physical tests of several different knitted fabrics used in the textile industry. These data span different types of complex knit patterns, yarn compositions, and fabric finishes, and the results demonstrate diverse physical properties like stiffness, nonlinearity, and anisotropy.\r\n\r\nWe then develop a system for approximating these mechanical responses with yarn-level cloth simulation. To do so, we introduce an efficient pipeline for converting between fabric-level data and yarn-level simulation, including a novel swatch-level approximation for speeding up computation, and some small-but-necessary extensions to yarn-level models used in computer graphics. The dataset used for this paper can be found at http://mslab.es/projects/YarnLevelFabrics."}],"volume":41,"article_number":"65","intvolume":"        41","date_updated":"2026-06-18T17:20:41Z","acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"Association for Computing Machinery","type":"journal_article","year":"2022","language":[{"iso":"eng"}],"oa_version":"Published Version","fulldoi":"https://doi.org/10.1145/3528223.3530167","publication_status":"published","article_processing_charge":"No","oa":1,"department":[{"_id":"ChWo"}],"title":"Estimation of yarn-level simulation models for production fabrics","_id":"11736","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"date_created":"2022-08-07T22:01:58Z","citation":{"ista":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. 2022. Estimation of yarn-level simulation models for production fabrics. ACM Transactions on Graphics. 41(4), 65.","short":"G. Sperl, R.M. Sánchez-Banderas, M. Li, C. Wojtan, M.A. Otaduy, ACM Transactions on Graphics 41 (2022).","apa":"Sperl, G., Sánchez-Banderas, R. M., Li, M., Wojtan, C., &#38; Otaduy, M. A. (2022). Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>","mla":"Sperl, Georg, et al. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, 65, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>.","chicago":"Sperl, Georg, Rosa M. Sánchez-Banderas, Manwen Li, Chris Wojtan, and Miguel A. Otaduy. “Estimation of Yarn-Level Simulation Models for Production Fabrics.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528223.3530167\">https://doi.org/10.1145/3528223.3530167</a>.","ieee":"G. Sperl, R. M. Sánchez-Banderas, M. Li, C. Wojtan, and M. A. Otaduy, “Estimation of yarn-level simulation models for production fabrics,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4. Association for Computing Machinery, 2022.","ama":"Sperl G, Sánchez-Banderas RM, Li M, Wojtan C, Otaduy MA. Estimation of yarn-level simulation models for production fabrics. <i>ACM Transactions on Graphics</i>. 2022;41(4). doi:<a href=\"https://doi.org/10.1145/3528223.3530167\">10.1145/3528223.3530167</a>"},"scopus_import":"1","external_id":{"isi":["000830989200114"]},"date_published":"2022-07-22T00:00:00Z","acknowledgement":"We wish to thank the anonymous reviewers for their helpful comments. To develop this project, we were helped by many people both at Under Armour (Clay Dean, Randall Harward, Kyle Blakely, Craig Simile, Michael Seiz, Brooke Malone, Brittainy McFarland, Emilie Phan, Lindsey Kern, Courtney Oswald, Haley Barkley, Bob Chin, Adam Bayer, Connie Kwok, Marielle Newman, Nick Pence, Allison Hicks, Allison White, Candace Rubenstein, Jeremy Stangland, Fred Fagergren, Michael Mazzoleni, Nathaniel Berry, Manuel Frank) and SEDDI (Gabriel Cirio, Alejandro Rodríguez, Sofía Dominguez, Alicia Nicas, Elena Garcés, Daniel Rodríguez, David Pascual, Manuel Godoy, Sergio Suja, Sergio Ruiz, Roberto Condori, Alberto Martín, Graham Sullivan). We also thank the members of the Visual Computing Group at IST Austria and the Multimodal Simulation Lab at URJC for their feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing, and it was funded in part by the European Research Council (ERC Consolidator Grant 772738 TouchDesign).","day":"22","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/3528223.3530167","publication":"ACM Transactions on Graphics","quality_controlled":"1","related_material":{"record":[{"id":"12358","status":"public","relation":"dissertation_contains"}],"link":[{"description":"News on the ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/digital-yarn-real-socks/"}]},"ddc":["000"],"isi":1,"month":"07","status":"public","author":[{"first_name":"Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","last_name":"Sperl"},{"last_name":"Sánchez-Banderas","full_name":"Sánchez-Banderas, Rosa M.","first_name":"Rosa M."},{"full_name":"Li, Manwen","first_name":"Manwen","last_name":"Li"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan"},{"last_name":"Otaduy","first_name":"Miguel A.","full_name":"Otaduy, Miguel A."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3528223.3530167"}],"issue":"4"},{"doi":"10.1103/PhysRevB.106.045302","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","day":"15","author":[{"last_name":"Dziom","id":"6A9A37C2-8C5C-11E9-AE53-F2FDE5697425","orcid":"0000-0002-1648-0999","full_name":"Dziom, Uladzislau","first_name":"Uladzislau"},{"last_name":"Shuvaev","first_name":"A.","full_name":"Shuvaev, A."},{"full_name":"Gospodarič, J.","first_name":"J.","last_name":"Gospodarič"},{"last_name":"Novik","first_name":"E. G.","full_name":"Novik, E. G."},{"full_name":"Dobretsova, A. A.","first_name":"A. A.","last_name":"Dobretsova"},{"full_name":"Mikhailov, N. N.","first_name":"N. N.","last_name":"Mikhailov"},{"last_name":"Kvon","first_name":"Z. D.","full_name":"Kvon, Z. D."},{"last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","first_name":"Zhanybek"},{"last_name":"Pimenov","full_name":"Pimenov, A.","first_name":"A."}],"status":"public","isi":1,"month":"07","ddc":["530"],"issue":"4","publication":"Physical Review B","quality_controlled":"1","scopus_import":"1","citation":{"chicago":"Dziom, Uladzislau, A. Shuvaev, J. Gospodarič, E. G. Novik, A. A. Dobretsova, N. N. Mikhailov, Z. D. Kvon, Zhanybek Alpichshev, and A. Pimenov. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” <i>Physical Review B</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">https://doi.org/10.1103/PhysRevB.106.045302</a>.","mla":"Dziom, Uladzislau, et al. “Universal Transparency and Asymmetric Spin Splitting near the Dirac Point in HgTe Quantum Wells.” <i>Physical Review B</i>, vol. 106, no. 4, 045302, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">10.1103/PhysRevB.106.045302</a>.","ista":"Dziom U, Shuvaev A, Gospodarič J, Novik EG, Dobretsova AA, Mikhailov NN, Kvon ZD, Alpichshev Z, Pimenov A. 2022. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. Physical Review B. 106(4), 045302.","short":"U. Dziom, A. Shuvaev, J. Gospodarič, E.G. Novik, A.A. Dobretsova, N.N. Mikhailov, Z.D. Kvon, Z. Alpichshev, A. Pimenov, Physical Review B 106 (2022).","apa":"Dziom, U., Shuvaev, A., Gospodarič, J., Novik, E. G., Dobretsova, A. A., Mikhailov, N. N., … Pimenov, A. (2022). Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">https://doi.org/10.1103/PhysRevB.106.045302</a>","ama":"Dziom U, Shuvaev A, Gospodarič J, et al. Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells. <i>Physical Review B</i>. 2022;106(4). doi:<a href=\"https://doi.org/10.1103/PhysRevB.106.045302\">10.1103/PhysRevB.106.045302</a>","ieee":"U. Dziom <i>et al.</i>, “Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells,” <i>Physical Review B</i>, vol. 106, no. 4. American Physical Society, 2022."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-07-15T00:00:00Z","file_date_updated":"2022-08-08T06:58:22Z","has_accepted_license":"1","acknowledgement":"This work was supported by the Austrian Science Funds (W 1243, I 3456-N27, I 5539-N).","external_id":{"isi":["000834349200010"]},"article_processing_charge":"No","oa":1,"fulldoi":"https://doi.org/10.1103/PhysRevB.106.045302","oa_version":"Published Version","publication_status":"published","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"date_created":"2022-08-07T22:01:58Z","department":[{"_id":"ZhAl"}],"_id":"11737","title":"Universal transparency and asymmetric spin splitting near the Dirac point in HgTe quantum wells","date_updated":"2023-08-03T12:38:57Z","intvolume":"       106","file":[{"date_created":"2022-08-08T06:58:22Z","file_size":774455,"success":1,"file_name":"2022_PhysRevB_Dziom.pdf","access_level":"open_access","date_updated":"2022-08-08T06:58:22Z","relation":"main_file","checksum":"115aff9e0cde2f806cb26953d7262791","content_type":"application/pdf","file_id":"11743","creator":"dernst"}],"abstract":[{"lang":"eng","text":"Spin-orbit coupling in thin HgTe quantum wells results in a relativistic-like electron band structure, making it a versatile solid state platform to observe and control nontrivial electrodynamic phenomena. Here we report an observation of universal terahertz (THz) transparency determined by fine-structure constant α≈1/137 in 6.5-nm-thick HgTe layer, close to the critical thickness separating phases with topologically different electronic band structure. Using THz spectroscopy in a magnetic field we obtain direct evidence of asymmetric spin splitting of the Dirac cone. This particle-hole asymmetry facilitates optical control of edge spin currents in the quantum wells."}],"article_number":"045302","volume":106,"type":"journal_article","publisher":"American Physical Society","language":[{"iso":"eng"}],"year":"2022"},{"publisher":"Society for Industrial and Applied Mathematics","type":"journal_article","year":"2022","project":[{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"grant_number":"W1245","call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and dispersion in nonlinear partial differential equations"}],"language":[{"iso":"eng"}],"date_updated":"2025-04-15T08:31:31Z","intvolume":"        54","abstract":[{"lang":"eng","text":"We consider finite-volume approximations of Fokker--Planck equations on bounded convex domains in $\\mathbb{R}^d$ and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker--Planck equation via the method of evolutionary $\\Gamma$-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalizing the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality."}],"arxiv":1,"volume":54,"page":"4297-4333","publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"date_created":"2022-08-07T22:01:59Z","department":[{"_id":"JaMa"}],"title":"Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","_id":"11739","article_processing_charge":"No","oa":1,"oa_version":"Preprint","fulldoi":"https://doi.org/10.1137/21M1410968","publication_status":"published","date_published":"2022-07-18T00:00:00Z","acknowledgement":"This work was supported by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme grant 716117 and by the AustrianScience Fund (FWF) through grants F65 and W1245.","corr_author":"1","external_id":{"isi":["000889274600001"],"arxiv":["2008.10962"]},"ec_funded":1,"scopus_import":"1","citation":{"mla":"Forkert, Dominik L., et al. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4, Society for Industrial and Applied Mathematics, 2022, pp. 4297–333, doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>.","short":"D.L. Forkert, J. Maas, L. Portinale, SIAM Journal on Mathematical Analysis 54 (2022) 4297–4333.","apa":"Forkert, D. L., Maas, J., &#38; Portinale, L. (2022). Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>","ista":"Forkert DL, Maas J, Portinale L. 2022. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. SIAM Journal on Mathematical Analysis. 54(4), 4297–4333.","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. 2022;54(4):4297-4333. doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>","ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4. Society for Industrial and Applied Mathematics, pp. 4297–4333, 2022."},"status":"public","isi":1,"month":"07","author":[{"first_name":"Dominik L","full_name":"Forkert, Dominik L","id":"35C79D68-F248-11E8-B48F-1D18A9856A87","last_name":"Forkert"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas"},{"last_name":"Portinale","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2008.10962","open_access":"1"}],"issue":"4","publication":"SIAM Journal on Mathematical Analysis","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10022"}]},"quality_controlled":"1","keyword":["Fokker--Planck equation","gradient flow","evolutionary $\\Gamma$-convergence"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1137/21M1410968","day":"18","article_type":"original"},{"scopus_import":"1","citation":{"apa":"Cooley, O., Del Giudice, N., Kang, M., &#38; Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>","ista":"Cooley O, Del Giudice N, Kang M, Sprüssel P. 2022. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 29(3), P3.27.","short":"O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).","mla":"Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>.","chicago":"Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>.","ieee":"O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.","ama":"Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. 2022;29(3). doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>"},"date_published":"2022-07-29T00:00:00Z","tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","has_accepted_license":"1","file_date_updated":"2022-08-08T06:28:52Z","corr_author":"1","external_id":{"arxiv":["2005.07103"],"isi":["000836200300001"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.37236/10607","license":"https://creativecommons.org/licenses/by-nd/4.0/","article_type":"original","day":"29","author":[{"last_name":"Cooley","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","full_name":"Cooley, Oliver","first_name":"Oliver"},{"first_name":"Nicola","full_name":"Del Giudice, Nicola","last_name":"Del Giudice"},{"full_name":"Kang, Mihyun","first_name":"Mihyun","last_name":"Kang"},{"last_name":"Sprüssel","first_name":"Philipp","full_name":"Sprüssel, Philipp"}],"isi":1,"month":"07","ddc":["510"],"status":"public","issue":"3","publication":"Electronic Journal of Combinatorics","quality_controlled":"1","date_updated":"2024-10-09T21:03:03Z","intvolume":"        29","file":[{"success":1,"file_size":1768663,"date_created":"2022-08-08T06:28:52Z","creator":"dernst","content_type":"application/pdf","checksum":"057c676dcee70236aa234d4ce6138c69","file_id":"11742","file_name":"2022_ElecJournCombinatorics_Cooley.pdf","access_level":"open_access","date_updated":"2022-08-08T06:28:52Z","relation":"main_file"}],"abstract":[{"lang":"eng","text":"We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].\r\nWe consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition."}],"arxiv":1,"article_number":"P3.27","volume":29,"type":"journal_article","publisher":"Electronic Journal of Combinatorics","language":[{"iso":"eng"}],"year":"2022","article_processing_charge":"No","oa":1,"fulldoi":"https://doi.org/10.37236/10607","oa_version":"Published Version","publication_status":"published","publication_identifier":{"eissn":["1077-8926"]},"date_created":"2022-08-07T22:01:59Z","department":[{"_id":"MaKw"}],"_id":"11740","title":"Phase transition in cohomology groups of non-uniform random simplicial complexes"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","doi":"10.15479/at:ista:11777","alternative_title":["ISTA Thesis"],"supervisor":[{"last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"day":"11","status":"public","ddc":["500","516","514"],"month":"08","author":[{"last_name":"Wild","id":"4C20D868-F248-11E8-B48F-1D18A9856A87","full_name":"Wild, Pascal","first_name":"Pascal"}],"ec_funded":1,"citation":{"ama":"Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>","ieee":"P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology Austria, 2022.","chicago":"Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>.","short":"P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology Austria, 2022.","apa":"Wild, P. (2022). <i>High-dimensional expansion and crossing numbers of simplicial complexes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>","ista":"Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology Austria.","mla":"Wild, Pascal. <i>High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>."},"file_date_updated":"2022-08-11T16:09:19Z","has_accepted_license":"1","date_published":"2022-08-11T00:00:00Z","corr_author":"1","oa":1,"article_processing_charge":"No","publication_status":"published","OA_place":"publisher","oa_version":"Published Version","fulldoi":"https://doi.org/10.15479/at:ista:11777","date_created":"2022-08-10T15:51:19Z","publication_identifier":{"isbn":["978-3-99078-021-3"],"issn":["2663-337X"]},"title":"High-dimensional expansion and crossing numbers of simplicial complexes","_id":"11777","department":[{"_id":"GradSch"},{"_id":"UlWa"}],"degree_awarded":"PhD","file":[{"file_id":"11780","content_type":"text/x-python","checksum":"f5f3af1fb7c8a24b71ddc88ad7f7c5b4","creator":"pwild","relation":"supplementary_material","description":"Code for computer-assisted proofs in Section 8.4.7 in Thesis","date_updated":"2022-08-10T15:34:04Z","access_level":"open_access","file_name":"flags.py","date_created":"2022-08-10T15:34:04Z","file_size":16828},{"date_created":"2022-08-10T15:34:10Z","file_size":12226,"content_type":"text/x-c++src","checksum":"1f7c12dfe3bdaa9b147e4fbc3d34e3d5","file_id":"11781","creator":"pwild","file_name":"lowerbound.cpp","access_level":"open_access","date_updated":"2022-08-10T15:34:10Z","description":"Code for proof of Lemma 8.20 in Thesis","relation":"supplementary_material"},{"date_created":"2022-08-10T15:34:17Z","file_size":3240,"content_type":"text/x-python","checksum":"4cf81455c49e5dec3b9b2e3980137eeb","file_id":"11782","creator":"pwild","access_level":"open_access","file_name":"upperbound.py","description":"Code for proof of Proposition 7.9 in Thesis","date_updated":"2022-08-10T15:34:17Z","relation":"supplementary_material"},{"access_level":"open_access","file_name":"finalthesisPascalWildPDFA.pdf","relation":"main_file","date_updated":"2022-08-11T16:08:33Z","content_type":"application/pdf","checksum":"4e96575b10cbe4e0d0db2045b2847774","file_id":"11809","creator":"pwild","date_created":"2022-08-11T16:08:33Z","file_size":5086282,"title":"High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes"},{"date_created":"2022-08-11T16:09:19Z","file_size":18150068,"checksum":"92d94842a1fb6dca5808448137573b2e","content_type":"application/zip","file_id":"11810","creator":"pwild","file_name":"ThesisSubmission.zip","access_level":"closed","relation":"source_file","date_updated":"2022-08-11T16:09:19Z"}],"date_updated":"2026-04-07T14:18:26Z","page":"170","abstract":[{"text":"In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications.\r\nOur main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise.","lang":"eng"}],"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"year":"2022","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","type":"dissertation"},{"publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1063/5.0089983","oa":1,"article_processing_charge":"Yes (via OA deal)","title":"Low-energy spectrum and dynamics of the weakly interacting Bose gas","_id":"11783","department":[{"_id":"RoSe"}],"date_created":"2022-08-11T06:37:52Z","publication_identifier":{"eissn":["1089-7658"],"issn":["0022-2488"]},"volume":63,"article_number":"061102","abstract":[{"lang":"eng","text":"We consider a gas of N bosons with interactions in the mean-field scaling regime. We review the proof of an asymptotic expansion of its low-energy spectrum, eigenstates, and dynamics, which provides corrections to Bogoliubov theory to all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer, and Soffer. In addition, we derive a full asymptotic expansion of the ground state one-body reduced density matrix."}],"arxiv":1,"file":[{"date_created":"2022-08-11T07:03:02Z","file_size":5957888,"success":1,"relation":"main_file","date_updated":"2022-08-11T07:03:02Z","file_name":"2022_JourMathPhysics_Bossmann.pdf","access_level":"open_access","file_id":"11784","checksum":"d0d32c338c1896680174be88c70968fa","content_type":"application/pdf","creator":"dernst"}],"intvolume":"        63","date_updated":"2025-04-14T07:43:58Z","year":"2022","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"publisher":"AIP Publishing","type":"journal_article","day":"10","article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1063/5.0089983","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"quality_controlled":"1","publication":"Journal of Mathematical Physics","issue":"6","status":"public","isi":1,"ddc":["530"],"month":"06","author":[{"last_name":"Bossmann","first_name":"Lea","orcid":"0000-0002-6854-1343","full_name":"Bossmann, Lea","id":"A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425"}],"citation":{"short":"L. Bossmann, Journal of Mathematical Physics 63 (2022).","apa":"Bossmann, L. (2022). Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>","ista":"Bossmann L. 2022. Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. 63(6), 061102.","mla":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6, 061102, AIP Publishing, 2022, doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>.","chicago":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2022. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>.","ama":"Bossmann L. Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. 2022;63(6). doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>","ieee":"L. Bossmann, “Low-energy spectrum and dynamics of the weakly interacting Bose gas,” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6. AIP Publishing, 2022."},"scopus_import":"1","ec_funded":1,"external_id":{"isi":["000809648100002"],"arxiv":["2203.00730"]},"corr_author":"1","file_date_updated":"2022-08-11T07:03:02Z","acknowledgement":"The author thanks Nataˇsa Pavlovic, Sören Petrat, Peter Pickl, Robert Seiringer, and Avy Soffer for the collaboration on Refs. 1, 2 and 21. Funding from the European Union’s Horizon 2020 Research and Innovation Programme under Marie Skℓodowska-Curie Grant Agreement\r\nNo. 754411 is gratefully acknowledged.","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-06-10T00:00:00Z"},{"publication":"Proceedings of the National Academy of Sciences of the United States of America","quality_controlled":"1","author":[{"full_name":"Toprakcioglu, Zenon","first_name":"Zenon","last_name":"Toprakcioglu"},{"full_name":"Kamada, Ayaka","first_name":"Ayaka","last_name":"Kamada"},{"first_name":"Thomas C.T.","full_name":"Michaels, Thomas C.T.","last_name":"Michaels"},{"last_name":"Xie","full_name":"Xie, Mengqi","first_name":"Mengqi"},{"last_name":"Krausser","first_name":"Johannes","full_name":"Krausser, Johannes"},{"last_name":"Wei","first_name":"Jiapeng","full_name":"Wei, Jiapeng"},{"last_name":"Šarić","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela"},{"last_name":"Vendruscolo","full_name":"Vendruscolo, Michele","first_name":"Michele"},{"last_name":"Knowles","full_name":"Knowles, Tuomas P.J.","first_name":"Tuomas P.J."}],"isi":1,"ddc":["570"],"month":"07","status":"public","issue":"31","article_type":"original","day":"28","doi":"10.1073/pnas.2109718119","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["35901206"],"isi":["000903753500002"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"date_published":"2022-07-28T00:00:00Z","file_date_updated":"2023-10-04T09:05:44Z","has_accepted_license":"1","acknowledgement":"The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP7/2007-2013) through the ERC grant PhysProt\r\n(agreement 337969). We are grateful for financial support from the Biotechnology and Biological Sciences Research Council (BBSRC) (T.P.J.K.), the Newman\r\nFoundation (T.P.J.K.), the Wellcome Trust (T.P.J.K. and M.V.), Peterhouse College\r\nCambridge (T.C.T.M.), the ERC Starting Grant (StG) Non-Equilibrium Protein Assembly (NEPA) (A.S.), the Royal Society (A.S.), the Academy of Medical Sciences\r\n(A.S. and J.K.), and the Cambridge Centre for Misfolding Diseases (CMD).","citation":{"ama":"Toprakcioglu Z, Kamada A, Michaels TCT, et al. Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>","ieee":"Z. Toprakcioglu <i>et al.</i>, “Adsorption free energy predicts amyloid protein nucleation rates,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. National Academy of Sciences, 2022.","mla":"Toprakcioglu, Zenon, et al. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2109718119, National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>.","apa":"Toprakcioglu, Z., Kamada, A., Michaels, T. C. T., Xie, M., Krausser, J., Wei, J., … Knowles, T. P. J. (2022). Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>","ista":"Toprakcioglu Z, Kamada A, Michaels TCT, Xie M, Krausser J, Wei J, Šarić A, Vendruscolo M, Knowles TPJ. 2022. Adsorption free energy predicts amyloid protein nucleation rates. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2109718119.","short":"Z. Toprakcioglu, A. Kamada, T.C.T. Michaels, M. Xie, J. Krausser, J. Wei, A. Šarić, M. Vendruscolo, T.P.J. Knowles, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","chicago":"Toprakcioglu, Zenon, Ayaka Kamada, Thomas C.T. Michaels, Mengqi Xie, Johannes Krausser, Jiapeng Wei, Anđela Šarić, Michele Vendruscolo, and Tuomas P.J. Knowles. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>."},"ec_funded":1,"scopus_import":"1","department":[{"_id":"AnSa"}],"_id":"11841","title":"Adsorption free energy predicts amyloid protein nucleation rates","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"date_created":"2022-08-14T22:01:45Z","pmid":1,"fulldoi":"https://doi.org/10.1073/pnas.2109718119","oa_version":"Published Version","publication_status":"published","article_processing_charge":"No","oa":1,"type":"journal_article","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"project":[{"name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","call_identifier":"H2020","grant_number":"802960"}],"year":"2022","abstract":[{"text":"Primary nucleation is the fundamental event that initiates the conversion of proteins from their normal physiological forms into pathological amyloid aggregates associated with the onset and development of disorders including systemic amyloidosis, as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases. It has become apparent that the presence of surfaces can dramatically modulate nucleation. However, the underlying physicochemical parameters governing this process have been challenging to elucidate, with interfaces in some cases having been found to accelerate aggregation, while in others they can inhibit the kinetics of this process. Here we show through kinetic analysis that for three different fibril-forming proteins, interfaces affect the aggregation reaction mainly through modulating the primary nucleation step. Moreover, we show through direct measurements of the Gibbs free energy of adsorption, combined with theory and coarse-grained computer simulations, that overall nucleation rates are suppressed at high and at low surface interaction strengths but significantly enhanced at intermediate strengths, and we verify these regimes experimentally. Taken together, these results provide a quantitative description of the fundamental process which triggers amyloid formation and shed light on the key factors that control this process.","lang":"eng"}],"article_number":"e2109718119","volume":119,"date_updated":"2025-06-12T06:21:34Z","intvolume":"       119","file":[{"date_created":"2023-10-04T09:05:44Z","file_size":2476021,"success":1,"access_level":"open_access","file_name":"2022_PNAS_Toprakcioglu.pdf","relation":"main_file","date_updated":"2023-10-04T09:05:44Z","content_type":"application/pdf","checksum":"0fe3878896cbeb6c44e29222ec2f336a","file_id":"14386","creator":"dernst"}]},{"article_processing_charge":"No","oa":1,"oa_version":"Published Version","fulldoi":"https://doi.org/10.1007/s00021-022-00722-2","publication_status":"published","publication_identifier":{"issn":["1422-6928"],"eissn":["1422-6952"]},"date_created":"2022-08-14T22:01:45Z","department":[{"_id":"JuFi"}],"title":"Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities","_id":"11842","intvolume":"        24","date_updated":"2026-04-07T13:28:13Z","file":[{"success":1,"file_size":2045570,"date_created":"2022-08-16T06:55:22Z","creator":"cchlebak","file_id":"11848","content_type":"application/pdf","checksum":"75c5f286300e6f0539cf57b4dba108d5","relation":"main_file","date_updated":"2022-08-16T06:55:22Z","access_level":"open_access","file_name":"2022_JMathFluidMech_Hensel.pdf"}],"arxiv":1,"abstract":[{"text":"We consider the flow of two viscous and incompressible fluids within a bounded domain modeled by means of a two-phase Navier–Stokes system. The two fluids are assumed to be immiscible, meaning that they are separated by an interface. With respect to the motion of the interface, we consider pure transport by the fluid flow. Along the boundary of the domain, a complete slip boundary condition for the fluid velocities and a constant ninety degree contact angle condition for the interface are assumed. In the present work, we devise for the resulting evolution problem a suitable weak solution concept based on the framework of varifolds and establish as the main result a weak-strong uniqueness principle in 2D. The proof is based on a relative entropy argument and requires a non-trivial further development of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech. Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects of the necessarily singular geometry of the evolving fluid domains, we work for simplicity in the regime of same viscosities for the two fluids.","lang":"eng"}],"volume":24,"article_number":"93","publisher":"Springer Nature","type":"journal_article","year":"2022","project":[{"name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","grant_number":"948819"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00021-022-00722-2","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","article_type":"original","ddc":["510"],"status":"public","month":"08","isi":1,"author":[{"last_name":"Hensel","orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"id":"25647992-AA84-11E9-9D75-8427E6697425","full_name":"Marveggio, Alice","first_name":"Alice","last_name":"Marveggio"}],"issue":"3","publication":"Journal of Mathematical Fluid Mechanics","related_material":{"record":[{"id":"14587","relation":"dissertation_contains","status":"public"}]},"quality_controlled":"1","ec_funded":1,"scopus_import":"1","citation":{"mla":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3, 93, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>.","apa":"Hensel, S., &#38; Marveggio, A. (2022). Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>","ista":"Hensel S, Marveggio A. 2022. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. Journal of Mathematical Fluid Mechanics. 24(3), 93.","short":"S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022).","chicago":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>.","ama":"Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. 2022;24(3). doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>","ieee":"S. Hensel and A. Marveggio, “Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities,” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3. Springer Nature, 2022."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-08-01T00:00:00Z","has_accepted_license":"1","acknowledgement":"The authors warmly thank their former resp. current PhD advisor Julian Fischer for the suggestion of this problem and for valuable initial discussions on the subjects of this paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819) , and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","file_date_updated":"2022-08-16T06:55:22Z","corr_author":"1","external_id":{"arxiv":["2112.11154"],"isi":["000834834300001"]}},{"arxiv":1,"abstract":[{"lang":"eng","text":"In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs."}],"page":"246-256","date_updated":"2025-12-30T09:04:17Z","conference":{"end_date":"2022-07-29","start_date":"2022-07-25","location":"Salerno, Italy","name":"PODC: Symposium on Principles of Distributed Computing"},"file":[{"creator":"cchlebak","content_type":"application/pdf","checksum":"4c6b29172b8e355b4fbc364a2e0827b2","file_id":"11854","file_name":"2022_PODC_Alistarh.pdf","access_level":"open_access","relation":"main_file","date_updated":"2022-08-16T08:05:15Z","success":1,"file_size":1593474,"date_created":"2022-08-16T08:05:15Z"}],"publisher":"Association for Computing Machinery","type":"conference","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"year":"2022","language":[{"iso":"eng"}],"oa_version":"Published Version","fulldoi":"https://doi.org/10.1145/3519270.3538435","publication_status":"published","article_processing_charge":"Yes (via OA deal)","oa":1,"department":[{"_id":"DaAl"}],"title":"Near-optimal leader election in population protocols on graphs","_id":"11844","publication_identifier":{"isbn":["9781450392624"]},"date_created":"2022-08-14T22:01:46Z","citation":{"ieee":"D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 246–256.","ama":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256. doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>","mla":"Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2022, pp. 246–56, doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>.","short":"D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256.","apa":"Alistarh, D.-A., Rybicki, J., &#38; Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 246–256). Salerno, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>","ista":"Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256.","chicago":"Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, 246–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>."},"ec_funded":1,"scopus_import":"1","corr_author":"1","external_id":{"arxiv":["2205.12597"],"isi":["001031439100030"]},"date_published":"2022-07-21T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","acknowledgement":"We thank the anonymous reviewers for their helpful comments. We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","file_date_updated":"2022-08-16T08:05:15Z","day":"21","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1145/3519270.3538435","publication":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing","quality_controlled":"1","related_material":{"record":[{"id":"19969","relation":"later_version","status":"public"}]},"ddc":["000"],"isi":1,"month":"07","status":"public","author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki"},{"last_name":"Voitovych","full_name":"Voitovych, Sasha","first_name":"Sasha"}]},{"type":"journal_article","publisher":"Springer Nature","language":[{"iso":"eng"}],"year":"2022","date_updated":"2024-10-09T21:03:06Z","intvolume":"        22","file":[{"success":1,"date_created":"2022-08-16T08:52:46Z","file_size":1758371,"file_id":"11862","checksum":"59b99d1b48b6bd40983e7ce298524a21","content_type":"application/pdf","creator":"kschuh","date_updated":"2022-08-16T08:52:46Z","relation":"main_file","file_name":"2022_Journal of Evolution Equations_Agresti.pdf","access_level":"open_access"}],"abstract":[{"text":"This paper is a continuation of Part I of this project, where we developed a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian noise. In the current Part II we consider blow-up criteria and regularization phenomena. As in Part I we can allow nonlinearities with polynomial growth and rough initial values from critical spaces. In the first main result we obtain several new blow-up criteria for quasi- and semilinear stochastic evolution equations. In particular, for semilinear equations we obtain a Serrin type blow-up criterium, which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074, 2018) to the stochastic setting. Blow-up criteria can be used to prove global well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights in time play a central role in the proofs. Our second contribution is a new method to bootstrap Sobolev and Hölder regularity in time and space, which does not require smoothness of the initial data. The blow-up criteria are at the basis of these new methods. Moreover, in applications the bootstrap results can be combined with our blow-up criteria, to obtain efficient ways to prove global existence. This gives new results even in classical 𝐿2-settings, which we illustrate for a concrete SPDE. In future works in preparation we apply the results of the current paper to obtain global well-posedness results and regularity for several concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into a more flexible framework, where less restrictions on the nonlinearities are needed, and we are able to treat rough initial values from critical spaces. Moreover, we will obtain higher-order regularity results.","lang":"eng"}],"article_number":"56","volume":22,"publication_identifier":{"eissn":["1424-3202"],"issn":["1424-3199"]},"date_created":"2022-08-16T08:39:43Z","department":[{"_id":"JuFi"}],"_id":"11858","title":"Nonlinear parabolic stochastic evolution equations in critical spaces part II","article_processing_charge":"Yes (via OA deal)","oa":1,"fulldoi":"https://doi.org/10.1007/s00028-022-00786-7","oa_version":"Published Version","publication_status":"published","date_published":"2022-06-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","acknowledgement":"The authors thank Emiel Lorist for helpful comments. The authors thank the anonymous referees for their helpful remarks to improve the presentation.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","file_date_updated":"2022-08-16T08:52:46Z","corr_author":"1","external_id":{"isi":["000809108500001"]},"scopus_import":"1","citation":{"ieee":"A. Agresti and M. Veraar, “Nonlinear parabolic stochastic evolution equations in critical spaces part II,” <i>Journal of Evolution Equations</i>, vol. 22, no. 2. Springer Nature, 2022.","ama":"Agresti A, Veraar M. Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. 2022;22(2). doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>","short":"A. Agresti, M. Veraar, Journal of Evolution Equations 22 (2022).","apa":"Agresti, A., &#38; Veraar, M. (2022). Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>","ista":"Agresti A, Veraar M. 2022. Nonlinear parabolic stochastic evolution equations in critical spaces part II. Journal of Evolution Equations. 22(2), 56.","mla":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>, vol. 22, no. 2, 56, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>.","chicago":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>."},"author":[{"first_name":"Antonio","full_name":"Agresti, Antonio","orcid":"0000-0002-9573-2962","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","last_name":"Agresti"},{"last_name":"Veraar","first_name":"Mark","full_name":"Veraar, Mark"}],"ddc":["510"],"isi":1,"month":"06","status":"public","issue":"2","publication":"Journal of Evolution Equations","quality_controlled":"1","keyword":["Mathematics (miscellaneous)"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1007/s00028-022-00786-7","article_type":"original","day":"01"},{"type":"journal_article","publisher":"Springer Nature","language":[{"iso":"eng"}],"year":"2022","intvolume":"         7","date_updated":"2024-10-09T21:03:07Z","file":[{"success":1,"file_size":389060,"date_created":"2022-08-18T08:02:34Z","creator":"dernst","file_id":"11921","content_type":"application/pdf","checksum":"913474844a1b38264fb710746d5e2e98","date_updated":"2022-08-18T08:02:34Z","relation":"main_file","file_name":"2022_AdvancesOperatorTheory_Wirth.pdf","access_level":"open_access"}],"abstract":[{"text":"A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained.","lang":"eng"}],"article_number":"38","volume":7,"publication_identifier":{"eissn":["2538-225X"]},"date_created":"2022-08-18T07:22:24Z","department":[{"_id":"JaMa"}],"_id":"11916","title":"Kac regularity and domination of quadratic forms","article_processing_charge":"Yes (via OA deal)","oa":1,"fulldoi":"https://doi.org/10.1007/s43036-022-00199-w","oa_version":"Published Version","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-07-01T00:00:00Z","acknowledgement":"The author was supported by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG) via RTG 1523/2. The author would like to thank Daniel Lenz for his support and encouragement during the author’s ongoing graduate studies and him as well as Marcel Schmidt for fruitful discussions on domination of quadratic forms. He wants to thank Batu Güneysu and Peter Stollmann for valuable comments on a preliminary version of this article. He would also like to thank the organizers of the conference Analysis and Geometry on Graphs and Manifolds in Potsdam, where the initial motivation of this article was conceived, and the organizers of the intense activity period Metric Measure Spaces and Ricci Curvature at MPIM in Bonn, where this work was finished.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","has_accepted_license":"1","file_date_updated":"2022-08-18T08:02:34Z","corr_author":"1","scopus_import":"1","citation":{"chicago":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>.","mla":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>, vol. 7, no. 3, 38, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>.","apa":"Wirth, M. (2022). Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>","ista":"Wirth M. 2022. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 7(3), 38.","short":"M. Wirth, Advances in Operator Theory 7 (2022).","ama":"Wirth M. Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. 2022;7(3). doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>","ieee":"M. Wirth, “Kac regularity and domination of quadratic forms,” <i>Advances in Operator Theory</i>, vol. 7, no. 3. Springer Nature, 2022."},"author":[{"last_name":"Wirth","full_name":"Wirth, Melchior","orcid":"0000-0002-0519-4241","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","first_name":"Melchior"}],"month":"07","status":"public","ddc":["510"],"issue":"3","publication":"Advances in Operator Theory","quality_controlled":"1","keyword":["Algebra and Number Theory","Analysis"],"doi":"10.1007/s43036-022-00199-w","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","day":"01"},{"publication":"Journal of Statistical Physics","quality_controlled":"1","author":[{"last_name":"Rademacher","first_name":"Simone Anna Elvira","full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466","id":"856966FE-A408-11E9-977E-802DE6697425"},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"month":"07","isi":1,"ddc":["510"],"status":"public","article_type":"original","day":"01","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"doi":"10.1007/s10955-022-02940-4","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","corr_author":"1","external_id":{"isi":["000805175000001"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-07-01T00:00:00Z","acknowledgement":"The authors thank Gérard Ben Arous for pointing out the question of a lower bound. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No. 694227 (R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.\r\nOpen access funding provided by IST Austria.","file_date_updated":"2022-08-18T08:09:00Z","has_accepted_license":"1","citation":{"ama":"Rademacher SAE, Seiringer R. Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. 2022;188. doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>","ieee":"S. A. E. Rademacher and R. Seiringer, “Large deviation estimates for weakly interacting bosons,” <i>Journal of Statistical Physics</i>, vol. 188. Springer Nature, 2022.","apa":"Rademacher, S. A. E., &#38; Seiringer, R. (2022). Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>","short":"S.A.E. Rademacher, R. Seiringer, Journal of Statistical Physics 188 (2022).","ista":"Rademacher SAE, Seiringer R. 2022. Large deviation estimates for weakly interacting bosons. Journal of Statistical Physics. 188, 9.","mla":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>, vol. 188, 9, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>.","chicago":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>."},"ec_funded":1,"scopus_import":"1","department":[{"_id":"RoSe"}],"_id":"11917","title":"Large deviation estimates for weakly interacting bosons","publication_identifier":{"eissn":["1572-9613"],"issn":["0022-4715"]},"date_created":"2022-08-18T07:23:26Z","fulldoi":"https://doi.org/10.1007/s10955-022-02940-4","oa_version":"Published Version","publication_status":"published","article_processing_charge":"Yes (via OA deal)","oa":1,"type":"journal_article","publisher":"Springer Nature","language":[{"iso":"eng"}],"project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"year":"2022","abstract":[{"text":"We study the many-body dynamics of an initially factorized bosonic wave function in the mean-field regime. We prove large deviation estimates for the fluctuations around the condensate. We derive an upper bound extending a recent result to more general interactions. Furthermore, we derive a new lower bound which agrees with the upper bound in leading order.","lang":"eng"}],"article_number":"9","volume":188,"intvolume":"       188","date_updated":"2025-04-14T07:26:59Z","file":[{"creator":"dernst","file_id":"11922","checksum":"44418cb44f07fa21ed3907f85abf7f39","content_type":"application/pdf","relation":"main_file","date_updated":"2022-08-18T08:09:00Z","file_name":"2022_JournalStatisticalPhysics_Rademacher.pdf","access_level":"open_access","success":1,"file_size":483481,"date_created":"2022-08-18T08:09:00Z"}]},{"article_type":"original","day":"01","doi":"10.7155/jgaa.00591","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Graph Algorithms and Applications","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"9296"}]},"quality_controlled":"1","author":[{"first_name":"Oswin","full_name":"Aichholzer, Oswin","last_name":"Aichholzer"},{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","first_name":"Alan M","last_name":"Arroyo Guevara"},{"full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","last_name":"Masárová"},{"first_name":"Irene","full_name":"Parada, Irene","last_name":"Parada"},{"full_name":"Perz, Daniel","first_name":"Daniel","last_name":"Perz"},{"last_name":"Pilz","first_name":"Alexander","full_name":"Pilz, Alexander"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec"},{"first_name":"Birgit","full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber"}],"status":"public","month":"06","ddc":["000"],"issue":"2","citation":{"chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2022. <a href=\"https://doi.org/10.7155/jgaa.00591\">https://doi.org/10.7155/jgaa.00591</a>.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” <i>Journal of Graph Algorithms and Applications</i>, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:<a href=\"https://doi.org/10.7155/jgaa.00591\">10.7155/jgaa.00591</a>.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.00591\">https://doi.org/10.7155/jgaa.00591</a>","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. <i>Journal of Graph Algorithms and Applications</i>. 2022;26(2):225-240. doi:<a href=\"https://doi.org/10.7155/jgaa.00591\">10.7155/jgaa.00591</a>","ieee":"O. Aichholzer <i>et al.</i>, “On compatible matchings,” <i>Journal of Graph Algorithms and Applications</i>, vol. 26, no. 2. Brown University, pp. 225–240, 2022."},"ec_funded":1,"scopus_import":"1","corr_author":"1","external_id":{"arxiv":["2101.03928"]},"date_published":"2022-06-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","file_date_updated":"2022-08-22T06:42:42Z","fulldoi":"https://doi.org/10.7155/jgaa.00591","oa_version":"Published Version","publication_status":"published","article_processing_charge":"No","oa":1,"department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"_id":"11938","title":"On compatible matchings","publication_identifier":{"issn":["1526-1719"]},"date_created":"2022-08-21T22:01:56Z","abstract":[{"text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge.","lang":"eng"}],"arxiv":1,"page":"225-240","volume":26,"intvolume":"        26","date_updated":"2026-04-16T09:18:20Z","file":[{"date_created":"2022-08-22T06:42:42Z","file_size":694538,"success":1,"access_level":"open_access","file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","relation":"main_file","date_updated":"2022-08-22T06:42:42Z","checksum":"dc6e255e3558faff924fd9e370886c11","content_type":"application/pdf","file_id":"11940","creator":"dernst"}],"type":"journal_article","publisher":"Brown University","language":[{"iso":"eng"}],"year":"2022","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"}]},{"page":"133","abstract":[{"text":"G protein-coupled receptors (GPCRs) respond to specific ligands and regulate multiple processes ranging from cell growth and immune responses to neuronal signal transmission. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additional challenges exist to dissect cell-type specific responses when the same GPCR is expressed on several cell types within the body. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic a GPCR-of-interest in a desired cell type.\r\nWe validated our approach with β2-adrenergic receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable responses on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Since β2AR is also enriched in microglia, which can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR in primary microglia and successfully recapitulate β2AR-mediated filopodia formation through CNO stimulation. To dissect the role of selected GPCRs during microglial inflammation, we additionally generated DREADD-based chimeras for microglia-enriched GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65 both modulated the inflammatory response with a similar profile as endogenously expressed β2AR, while DREADD-GPR109A showed no impact.\r\nOur DREADD-based approach provides the means to obtain mechanistic and functional insights into GPCR signaling on a cell-type specific level.","lang":"eng"}],"file":[{"relation":"main_file","date_updated":"2022-08-25T08:59:57Z","file_name":"Thesis_Rouven_Schulz_2022_final.pdf","access_level":"open_access","file_id":"11970","checksum":"61b1b666a210ff7cdd0e95ea75207a13","content_type":"application/pdf","creator":"rschulz","date_created":"2022-08-25T08:59:57Z","file_size":28079331,"success":1},{"relation":"source_file","date_updated":"2022-08-25T09:33:31Z","file_name":"Thesis_Rouven_Schulz_2022_final.docx","access_level":"closed","file_id":"11971","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"2b8f95ea1c134dbdb927b41b1dbeeeb5","creator":"rschulz","date_created":"2022-08-25T09:00:11Z","file_size":27226963}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"date_updated":"2026-04-07T14:17:59Z","project":[{"_id":"267F75D8-B435-11E9-9278-68D0E5697425","name":"Modulating microglia through G protein-coupled receptor (GPCR) signaling"}],"year":"2022","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","type":"dissertation","publication_status":"published","OA_place":"publisher","oa_version":"Published Version","fulldoi":"https://doi.org/10.15479/at:ista:11945","oa":1,"article_processing_charge":"No","title":"Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function","_id":"11945","department":[{"_id":"GradSch"},{"_id":"SaSi"}],"degree_awarded":"PhD","date_created":"2022-08-23T11:33:11Z","publication_identifier":{"issn":["2663-337X"]},"citation":{"mla":"Schulz, Rouven. <i>Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11945\">10.15479/at:ista:11945</a>.","apa":"Schulz, R. (2022). <i>Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11945\">https://doi.org/10.15479/at:ista:11945</a>","ista":"Schulz R. 2022. Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function. Institute of Science and Technology Austria.","short":"R. Schulz, Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function, Institute of Science and Technology Austria, 2022.","chicago":"Schulz, Rouven. “Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11945\">https://doi.org/10.15479/at:ista:11945</a>.","ama":"Schulz R. Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11945\">10.15479/at:ista:11945</a>","ieee":"R. Schulz, “Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function,” Institute of Science and Technology Austria, 2022."},"corr_author":"1","file_date_updated":"2022-08-25T09:33:31Z","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-08-23T00:00:00Z","supervisor":[{"id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8635-0877","full_name":"Siegert, Sandra","first_name":"Sandra","last_name":"Siegert"}],"day":"23","doi":"10.15479/at:ista:11945","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"id":"11995","relation":"dissertation_contains","status":"public"}]},"month":"08","ddc":["570"],"status":"public","author":[{"last_name":"Schulz","first_name":"Rouven","full_name":"Schulz, Rouven","orcid":"0000-0001-5297-733X","id":"4C5E7B96-F248-11E8-B48F-1D18A9856A87"}]},{"external_id":{"pmid":["35974109"],"isi":["000841396400008"]},"corr_author":"1","has_accepted_license":"1","file_date_updated":"2022-08-26T11:51:40Z","acknowledgement":"We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility of the Institute of Science and Technology Austria (ISTA) for image analysis scripts and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for help with single-unit clustering. Finally, we also thank B. Suter for discussions, A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service Units of ISTA for efficient support. This project was funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-08-16T00:00:00Z","citation":{"ama":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>","ieee":"Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M. Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","short":"Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas, Nature Communications 13 (2022).","apa":"Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &#38; Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>","ista":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. Nature Communications. 13, 4826.","mla":"Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>, vol. 13, 4826, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>.","chicago":"Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>."},"scopus_import":"1","ec_funded":1,"quality_controlled":"1","publication":"Nature Communications","month":"08","isi":1,"status":"public","ddc":["570"],"author":[{"last_name":"Ben Simon","id":"43DF3136-F248-11E8-B48F-1D18A9856A87","full_name":"Ben Simon, Yoav","first_name":"Yoav"},{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","last_name":"Käfer"},{"first_name":"Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2340-7431","full_name":"Velicky, Philipp","last_name":"Velicky"},{"last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","first_name":"Jozsef L"},{"orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","last_name":"Danzl"},{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas"}],"day":"16","article_type":"original","doi":"10.1038/s41467-022-32559-8","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"year":"2022","project":[{"grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600"},{"call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"Synaptic communication in neuronal microcircuits","grant_number":"Z00312"}],"language":[{"iso":"eng"}],"publisher":"Springer Nature","type":"journal_article","volume":13,"article_number":"4826","abstract":[{"lang":"eng","text":"The mammalian hippocampal formation (HF) plays a key role in several higher brain functions, such as spatial coding, learning and memory. Its simple circuit architecture is often viewed as a trisynaptic loop, processing input originating from the superficial layers of the entorhinal cortex (EC) and sending it back to its deeper layers. Here, we show that excitatory neurons in layer 6b of the mouse EC project to all sub-regions comprising the HF and receive input from the CA1, thalamus and claustrum. Furthermore, their output is characterized by unique slow-decaying excitatory postsynaptic currents capable of driving plateau-like potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs not only acquisition of new spatial memories, but also degradation of previously acquired ones. Our results provide evidence of a functional role for cortical layer 6b neurons in the adult brain."}],"file":[{"file_name":"2022_NatureCommunications_BenSimon.pdf","access_level":"open_access","date_updated":"2022-08-26T11:51:40Z","relation":"main_file","creator":"dernst","checksum":"405936d9e4d33625d80c093c9713a91f","content_type":"application/pdf","file_id":"11990","file_size":5910357,"date_created":"2022-08-26T11:51:40Z","success":1}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"SSU"}],"date_updated":"2025-06-12T06:10:44Z","intvolume":"        13","title":"A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory","_id":"11951","department":[{"_id":"JoCs"},{"_id":"PeJo"},{"_id":"JoDa"}],"date_created":"2022-08-24T08:25:50Z","publication_identifier":{"issn":["2041-1723"]},"publication_status":"published","oa_version":"Published Version","pmid":1,"fulldoi":"https://doi.org/10.1038/s41467-022-32559-8","oa":1,"article_processing_charge":"No"},{"publication_status":"published","fulldoi":"https://doi.org/10.1145/3559736.3559740","oa_version":"Preprint","oa":1,"article_processing_charge":"No","_id":"11991","title":"An invitation to the promise constraint satisfaction problem","department":[{"_id":"UlWa"}],"date_created":"2022-08-27T11:23:37Z","publication_identifier":{"issn":["2372-3491"]},"page":"30-59","volume":9,"arxiv":1,"abstract":[{"text":"The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been.","lang":"eng"}],"intvolume":"         9","date_updated":"2022-09-05T08:19:38Z","language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"Association for Computing Machinery","article_type":"original","day":"01","doi":"10.1145/3559736.3559740","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication":"ACM SIGLOG News","main_file_link":[{"url":"http://arxiv.org/abs/2208.13538","open_access":"1"}],"issue":"3","author":[{"first_name":"Andrei","full_name":"Krokhin, Andrei","last_name":"Krokhin"},{"last_name":"Opršal","id":"ec596741-c539-11ec-b829-c79322a91242","full_name":"Opršal, Jakub","orcid":"0000-0003-1245-3456","first_name":"Jakub"}],"status":"public","month":"07","citation":{"ama":"Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. 2022;9(3):30-59. doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>","ieee":"A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” <i>ACM SIGLOG News</i>, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022.","ista":"Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.","short":"A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.","apa":"Krokhin, A., &#38; Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>","mla":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>.","chicago":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>."},"external_id":{"arxiv":["2208.13538"]},"date_published":"2022-07-01T00:00:00Z"},{"date_published":"2022-09-01T00:00:00Z","file_date_updated":"2022-08-28T18:18:08Z","has_accepted_license":"1","corr_author":"1","external_id":{"isi":["000842638900001"]},"scopus_import":"1","citation":{"ieee":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni, “State of the art in computational mould design,” <i>Computer Graphics Forum</i>, vol. 41, no. 6. Wiley, pp. 435–452, 2022.","ama":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of the art in computational mould design. <i>Computer Graphics Forum</i>. 2022;41(6):435-452. doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>","apa":"Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2022). State of the art in computational mould design. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>","short":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni, Computer Graphics Forum 41 (2022) 435–452.","ista":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022. State of the art in computational mould design. Computer Graphics Forum. 41(6), 435–452.","mla":"Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>.","chicago":"Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni, and Nico Pietroni. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>."},"ddc":["000"],"month":"09","isi":1,"status":"public","author":[{"first_name":"Thomas","full_name":"Alderighi, Thomas","last_name":"Alderighi"},{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"first_name":"Thomas","full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","last_name":"Bickel"},{"full_name":"Cignoni, Paulo","first_name":"Paulo","last_name":"Cignoni"},{"last_name":"Pietroni","full_name":"Pietroni, Nico","first_name":"Nico"}],"issue":"6","publication":"Computer Graphics Forum","quality_controlled":"1","keyword":["Computer Graphics and Computer-Aided Design"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1111/cgf.14581","day":"01","article_type":"original","publisher":"Wiley","type":"journal_article","year":"2022","language":[{"iso":"eng"}],"date_updated":"2024-10-09T21:03:21Z","intvolume":"        41","file":[{"title":"pre-peer reviewed version","date_created":"2022-08-28T18:18:08Z","file_size":32480850,"file_id":"11994","content_type":"application/pdf","checksum":"c40cc8ceb7b7f0512172b883d712198e","creator":"bbickel","description":"This is the pre-peer reviewed version of the following article: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022), State of the Art in Computational Mould Design. Computer Graphics Forum, which has been published in final form at https://doi.org/10.1111/cgf.14581. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.","date_updated":"2022-08-28T18:18:08Z","relation":"main_file","access_level":"open_access","file_name":"star_molding_preprint.pdf"}],"abstract":[{"text":"Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.","lang":"eng"}],"volume":41,"page":"435-452","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"date_created":"2022-08-28T18:17:01Z","department":[{"_id":"BeBi"}],"title":"State of the art in computational mould design","_id":"11993","article_processing_charge":"No","oa":1,"oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1111/cgf.14581","publication_status":"published"},{"publisher":"Springer Nature","type":"journal_article","project":[{"_id":"267F75D8-B435-11E9-9278-68D0E5697425","name":"Modulating microglia through G protein-coupled receptor (GPCR) signaling"}],"year":"2022","language":[{"iso":"eng"}],"date_updated":"2026-04-07T14:17:58Z","intvolume":"        13","file":[{"creator":"cchlebak","file_id":"12002","content_type":"application/pdf","checksum":"191d9db0266e14a28d3a56dc7f65da84","date_updated":"2022-08-29T06:44:30Z","relation":"main_file","file_name":"2022_NatComm_Schulz.pdf","access_level":"open_access","success":1,"file_size":7317396,"date_created":"2022-08-29T06:44:30Z"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"text":"G protein-coupled receptors (GPCRs) regulate processes ranging from immune responses to neuronal signaling. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additionally, dissecting cell type-specific responses is challenging when the same GPCR is expressed on different cells within a tissue. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that bind clozapine-N-oxide and mimic a GPCR-of-interest. We show that chimeric DREADD-β2AR triggers responses comparable to β2AR on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Moreover, we successfully recapitulate β2AR-mediated filopodia formation in microglia, an immune cell capable of driving central nervous system inflammation. When dissecting microglial inflammation, we included two additional DREADD-based chimeras mimicking microglia-enriched GPR65 and GPR109A. DREADD-β2AR and DREADD-GPR65 modulate the inflammatory response with high similarity to endogenous β2AR, while DREADD-GPR109A shows no impact. Our DREADD-based approach allows investigation of cell type-dependent pathways without known endogenous ligands.","lang":"eng"}],"volume":13,"article_number":"4728","publication_identifier":{"eissn":["2041-1723"]},"date_created":"2022-08-28T22:01:59Z","department":[{"_id":"SaSi"}],"title":"Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses","_id":"11995","article_processing_charge":"No","oa":1,"oa_version":"Published Version","pmid":1,"fulldoi":"https://doi.org/10.1038/s41467-022-32390-1","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-08-15T00:00:00Z","acknowledgement":"The authors thank the Scientific Service Units at ISTA, in particular the Molecular Biology Service of the Lab Support Facility, Imaging & Optics Facility, and the Preclinical Facility, and the Novarino group, Harald Janoviak, and Marco Benevento for sharing reagents and expertise. This research was supported by a DOC Fellowship (24979) awarded to R.S. by the Austrian Academy of Sciences.","has_accepted_license":"1","file_date_updated":"2022-08-29T06:44:30Z","corr_author":"1","external_id":{"isi":["000840984400032"],"pmid":["35970889"]},"scopus_import":"1","citation":{"ista":"Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. 2022. Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses. Nature Communications. 13, 4728.","apa":"Schulz, R., Korkut, M., Venturino, A., Colombo, G., &#38; Siegert, S. (2022). Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32390-1\">https://doi.org/10.1038/s41467-022-32390-1</a>","short":"R. Schulz, M. Korkut, A. Venturino, G. Colombo, S. Siegert, Nature Communications 13 (2022).","mla":"Schulz, Rouven, et al. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate Microglia Responses.” <i>Nature Communications</i>, vol. 13, 4728, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32390-1\">10.1038/s41467-022-32390-1</a>.","chicago":"Schulz, Rouven, Medina Korkut, Alessandro Venturino, Gloria Colombo, and Sandra Siegert. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate Microglia Responses.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32390-1\">https://doi.org/10.1038/s41467-022-32390-1</a>.","ieee":"R. Schulz, M. Korkut, A. Venturino, G. Colombo, and S. Siegert, “Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","ama":"Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32390-1\">10.1038/s41467-022-32390-1</a>"},"status":"public","isi":1,"ddc":["570"],"month":"08","author":[{"last_name":"Schulz","first_name":"Rouven","id":"4C5E7B96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5297-733X","full_name":"Schulz, Rouven"},{"id":"4B51CE74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4309-2251","full_name":"Korkut, Medina","first_name":"Medina","last_name":"Korkut"},{"id":"41CB84B2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2356-9403","full_name":"Venturino, Alessandro","first_name":"Alessandro","last_name":"Venturino"},{"last_name":"Colombo","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","full_name":"Colombo, Gloria","orcid":"0000-0001-9434-8902","first_name":"Gloria"},{"id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","full_name":"Siegert, Sandra","orcid":"0000-0001-8635-0877","first_name":"Sandra","last_name":"Siegert"}],"publication":"Nature Communications","quality_controlled":"1","related_material":{"record":[{"id":"11542","status":"public","relation":"research_data"},{"relation":"part_of_dissertation","status":"public","id":"11945"}],"link":[{"url":"https://ista.ac.at/en/news/dreaddful-mimicry/","relation":"press_release","description":"News on ISTA website"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1038/s41467-022-32390-1","day":"15","article_type":"original"},{"volume":377,"page":"710-711","abstract":[{"text":"If you mix fruit syrups with alcohol to make a schnapps, the two liquids will remain perfectly blended forever. But if you mix oil with vinegar to make a vinaigrette, the oil and vinegar will soon separate back into their previous selves. Such liquid-liquid phase separation is a thermodynamically driven phenomenon and plays an important role in many biological processes (1). Although energy injection at the macroscale can reverse the phase separation—a strong shake is the normal response to a separated vinaigrette—little is known about the effect of energy added at the microscopic level on phase separation. This fundamental question has deep ramifications, notably in biology, because active processes also make the interior of a living cell different from a dead one. On page 768 of this issue, Adkins et al. (2) examine how mechanical activity at the microscopic scale affects liquid-liquid phase separation and allows liquids to climb surfaces.","lang":"eng"}],"intvolume":"       377","date_updated":"2024-10-09T21:03:21Z","year":"2022","language":[{"iso":"eng"}],"publisher":"American Association for the Advancement of Science","type":"journal_article","publication_status":"published","oa_version":"None","fulldoi":"https://doi.org/10.1126/science.adc9202","pmid":1,"article_processing_charge":"No","title":"A soft active matter that can climb walls","_id":"11996","department":[{"_id":"JePa"}],"date_created":"2022-08-28T22:02:00Z","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"citation":{"ama":"Palacci JA. A soft active matter that can climb walls. <i>Science</i>. 2022;377(6607):710-711. doi:<a href=\"https://doi.org/10.1126/science.adc9202\">10.1126/science.adc9202</a>","ieee":"J. A. Palacci, “A soft active matter that can climb walls,” <i>Science</i>, vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711, 2022.","chicago":"Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>. American Association for the Advancement of Science, 2022. <a href=\"https://doi.org/10.1126/science.adc9202\">https://doi.org/10.1126/science.adc9202</a>.","short":"J.A. Palacci, Science 377 (2022) 710–711.","ista":"Palacci JA. 2022. A soft active matter that can climb walls. Science. 377(6607), 710–711.","apa":"Palacci, J. A. (2022). A soft active matter that can climb walls. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.adc9202\">https://doi.org/10.1126/science.adc9202</a>","mla":"Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>, vol. 377, no. 6607, American Association for the Advancement of Science, 2022, pp. 710–11, doi:<a href=\"https://doi.org/10.1126/science.adc9202\">10.1126/science.adc9202</a>."},"scopus_import":"1","external_id":{"pmid":["35951689 "]},"corr_author":"1","date_published":"2022-08-12T00:00:00Z","day":"12","article_type":"letter_note","doi":"10.1126/science.adc9202","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication":"Science","issue":"6607","status":"public","month":"08","author":[{"first_name":"Jérémie A","full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","last_name":"Palacci"}]}]