[{"day":"01","article_processing_charge":"No","has_accepted_license":"1","page":"59-59","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","citation":{"short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 59–59.","mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 59–59.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 59–59. EuroCC, n.d.","ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :59-59.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 59–59.","apa":"Schlögl, A., Elefante, S., & Hodirnau, V.-V. (n.d.). Running Windows-applications on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 59–59). Maribor, Slovenia: EuroCC.","ista":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59."},"date_published":"2023-07-01T00:00:00Z","type":"conference_abstract","title":"Running Windows-applications on a Linux HPC cluster using WINE","status":"public","ddc":["000"],"_id":"13161","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"date_updated":"2023-07-18T09:18:55Z","date_created":"2023-07-18T09:18:55Z","checksum":"ec8e4295d54171032cdd1b01423eb4a6","success":1,"relation":"main_file","file_id":"13249","file_size":316959,"content_type":"application/pdf","creator":"dernst","file_name":"2023_ASHPC_Schloegl.pdf","access_level":"open_access"}],"month":"07","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"conference":{"start_date":"2023-06-13","location":"Maribor, Slovenia","end_date":"2023-06-15","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2023-07-18T09:18:55Z","publication_status":"inpress","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"publisher":"EuroCC","acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","year":"2023","date_updated":"2023-07-18T09:30:54Z","date_created":"2023-06-23T11:01:23Z","author":[{"full_name":"Schlögl, Alois","first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100"},{"full_name":"Elefante, Stefano","first_name":"Stefano","last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hodirnau, Victor-Valentin","last_name":"Hodirnau","first_name":"Victor-Valentin","id":"3661B498-F248-11E8-B48F-1D18A9856A87"}]},{"ec_funded":1,"file_date_updated":"2023-07-19T06:55:39Z","author":[{"full_name":"Wei, Yujing","first_name":"Yujing","last_name":"Wei","id":"0c5ff007-2600-11ee-b896-98bd8d663294","orcid":"0000-0001-8913-9719"},{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","first_name":"Artem"},{"full_name":"Lorenc, Dusan","last_name":"Lorenc","first_name":"Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zhumekenov","first_name":"Ayan A.","full_name":"Zhumekenov, Ayan A."},{"last_name":"Bakr","first_name":"Osman M.","full_name":"Bakr, Osman M."},{"first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"},{"full_name":"Alpichshev, Zhanybek","first_name":"Zhanybek","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203"}],"volume":14,"date_created":"2023-07-18T11:13:17Z","date_updated":"2023-07-19T06:59:19Z","acknowledgement":"We thank Bingqing Cheng and Hong-Zhou Ye for valuable discussions; Y.W.’s work at IST Austria was supported through ISTernship summer internship program funded by OeADGmbH; D.L. and Z.A. acknowledge support by IST Austria (ISTA); M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).\r\nA.A.Z. and O.M.B. acknowledge support by KAUST.","year":"2023","publisher":"American Chemical Society","department":[{"_id":"MiLe"},{"_id":"ZhAl"}],"publication_status":"published","publication_identifier":{"eissn":["1948-7185"]},"month":"07","doi":"10.1021/acs.jpclett.3c01158","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2304.14198"],"isi":["001022811500001"]},"project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","issue":"27","abstract":[{"lang":"eng","text":"A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy."}],"type":"journal_article","file":[{"file_size":2121252,"content_type":"application/pdf","creator":"dernst","file_name":"2023_JourPhysChemistry_Wei.pdf","access_level":"open_access","date_created":"2023-07-19T06:55:39Z","date_updated":"2023-07-19T06:55:39Z","checksum":"c0c040063f06a51b9c463adc504f1a23","success":1,"relation":"main_file","file_id":"13253"}],"oa_version":"Published Version","_id":"13251","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 14","status":"public","title":"Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites","ddc":["530"],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"05","keyword":["General Materials Science","Physical and Theoretical Chemistry"],"date_published":"2023-07-05T00:00:00Z","citation":{"chicago":"Wei, Yujing, Artem Volosniev, Dusan Lorenc, Ayan A. Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01158.","mla":"Wei, Yujing, et al. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters, vol. 14, no. 27, American Chemical Society, 2023, pp. 6309–14, doi:10.1021/acs.jpclett.3c01158.","short":"Y. Wei, A. Volosniev, D. Lorenc, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, The Journal of Physical Chemistry Letters 14 (2023) 6309–6314.","ista":"Wei Y, Volosniev A, Lorenc D, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 14(27), 6309–6314.","ieee":"Y. Wei et al., “Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites,” The Journal of Physical Chemistry Letters, vol. 14, no. 27. American Chemical Society, pp. 6309–6314, 2023.","apa":"Wei, Y., Volosniev, A., Lorenc, D., Zhumekenov, A. A., Bakr, O. M., Lemeshko, M., & Alpichshev, Z. (2023). Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01158","ama":"Wei Y, Volosniev A, Lorenc D, et al. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 2023;14(27):6309-6314. doi:10.1021/acs.jpclett.3c01158"},"publication":"The Journal of Physical Chemistry Letters","page":"6309-6314","article_type":"original"},{"day":"05","article_processing_charge":"Yes","has_accepted_license":"1","date_published":"2023-07-05T00:00:00Z","page":"129:1--129:20","publication":"50th International Colloquium on Automata, Languages, and Programming","citation":{"ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 129:1--129:20.","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:10.4230/LIPIcs.ICALP.2023.129.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129."},"abstract":[{"text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"content_type":"application/pdf","file_size":859379,"creator":"esarac","file_name":"icalp23.pdf","access_level":"open_access","date_created":"2023-07-24T15:11:05Z","date_updated":"2023-07-24T15:11:05Z","checksum":"5d4c8932ef3450615a53b9bb15d92eb2","success":1,"relation":"main_file","file_id":"13293"}],"oa_version":"Published Version","ddc":["000"],"status":"public","title":"Regular methods for operator precedence languages","intvolume":" 261","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13292","month":"07","publication_identifier":{"isbn":["9783959772785"],"eissn":["1868-8969"]},"language":[{"iso":"eng"}],"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2023-07-10","location":"Paderborn, Germany","end_date":"2023-07-14"},"doi":"10.4230/LIPIcs.ICALP.2023.129","quality_controlled":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2305.03447"]},"oa":1,"file_date_updated":"2023-07-24T15:11:05Z","ec_funded":1,"date_created":"2023-07-24T15:11:41Z","date_updated":"2023-07-31T08:38:38Z","volume":261,"author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"first_name":"Pavol","last_name":"Kebis","full_name":"Kebis, Pavol"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n"},{"ec_funded":1,"file_date_updated":"2023-07-31T09:02:27Z","article_number":"029","author":[{"full_name":"Tucci, Gennaro","last_name":"Tucci","first_name":"Gennaro"},{"full_name":"De Nicola, Stefano","first_name":"Stefano","last_name":"De Nicola","id":"42832B76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4842-6671"},{"last_name":"Wald","first_name":"Sascha","full_name":"Wald, Sascha"},{"full_name":"Gambassi, Andrea","first_name":"Andrea","last_name":"Gambassi"}],"volume":6,"date_created":"2023-07-24T10:47:46Z","date_updated":"2023-07-31T09:03:28Z","acknowledgement":"S. De Nicola acknowledges funding from the Institute of Science and Technology Austria (ISTA), and from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. S. De Nicola also acknowledges funding from the EPSRC Center for Doctoral Training in Cross-Disciplinary Approaches to NonEquilibrium Systems (CANES) under Grant EP/L015854/1. ","year":"2023","publisher":"SciPost Foundation","department":[{"_id":"MaSe"}],"publication_status":"published","publication_identifier":{"issn":["2666-9366"]},"month":"04","doi":"10.21468/scipostphyscore.6.2.029","language":[{"iso":"eng"}],"external_id":{"arxiv":["2211.01923"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","issue":"2","abstract":[{"text":"Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"13329","date_updated":"2023-07-31T09:02:27Z","date_created":"2023-07-31T09:02:27Z","checksum":"b472bc82108747eda5d52adf9e2ac7f3","success":1,"file_name":"2023_SciPostPhysCore_Tucci.pdf","access_level":"open_access","file_size":523236,"content_type":"application/pdf","creator":"dernst"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13277","intvolume":" 6","title":"Stochastic representation of the quantum quartic oscillator","status":"public","ddc":["530"],"has_accepted_license":"1","article_processing_charge":"No","day":"14","keyword":["Statistical and Nonlinear Physics","Atomic and Molecular Physics","and Optics","Nuclear and High Energy Physics","Condensed Matter Physics"],"date_published":"2023-04-14T00:00:00Z","citation":{"ama":"Tucci G, De Nicola S, Wald S, Gambassi A. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 2023;6(2). doi:10.21468/scipostphyscore.6.2.029","apa":"Tucci, G., De Nicola, S., Wald, S., & Gambassi, A. (2023). Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. SciPost Foundation. https://doi.org/10.21468/scipostphyscore.6.2.029","ieee":"G. Tucci, S. De Nicola, S. Wald, and A. Gambassi, “Stochastic representation of the quantum quartic oscillator,” SciPost Physics Core, vol. 6, no. 2. SciPost Foundation, 2023.","ista":"Tucci G, De Nicola S, Wald S, Gambassi A. 2023. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 6(2), 029.","short":"G. Tucci, S. De Nicola, S. Wald, A. Gambassi, SciPost Physics Core 6 (2023).","mla":"Tucci, Gennaro, et al. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core, vol. 6, no. 2, 029, SciPost Foundation, 2023, doi:10.21468/scipostphyscore.6.2.029.","chicago":"Tucci, Gennaro, Stefano De Nicola, Sascha Wald, and Andrea Gambassi. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscore.6.2.029."},"publication":"SciPost Physics Core","article_type":"original"},{"month":"04","publication_identifier":{"issn":["2949-804X"]},"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2202.04603"]},"language":[{"iso":"eng"}],"doi":"10.21468/scipostphyscodeb.12","article_number":"12","file_date_updated":"2023-07-31T09:09:23Z","ec_funded":1,"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"SciPost Foundation","acknowledgement":"We acknowledge fruitful discussions with Hans-Werner Hammer and thank Gerhard Zürn and\r\nPietro Massignan for sending us their data. We thank Fabian Brauneis for beta-testing the\r\nprovided code-package, and comments on the manuscript.\r\nL.R. is supported by FP7/ERC Consolidator Grant QSIMCORR, No.\r\n771891, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under\r\nGermany’s Excellence Strategy –EXC–2111–390814868. A.G.V. acknowledges support\r\nby European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 754411.","year":"2023","date_created":"2023-07-24T10:47:15Z","date_updated":"2023-07-31T09:16:02Z","author":[{"first_name":"Lukas","last_name":"Rammelmüller","full_name":"Rammelmüller, Lukas"},{"full_name":"Huber, David","last_name":"Huber","first_name":"David"},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","first_name":"Artem","last_name":"Volosniev","full_name":"Volosniev, Artem"}],"related_material":{"record":[{"id":"13275","status":"public","relation":"research_data"}]},"day":"19","has_accepted_license":"1","article_processing_charge":"No","article_type":"original","publication":"SciPost Physics Codebases","citation":{"short":"L. Rammelmüller, D. Huber, A. Volosniev, SciPost Physics Codebases (2023).","mla":"Rammelmüller, Lukas, et al. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases, 12, SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12.","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12.","ama":"Rammelmüller L, Huber D, Volosniev A. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. 2023. doi:10.21468/scipostphyscodeb.12","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D,” SciPost Physics Codebases. SciPost Foundation, 2023.","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases., 12."},"date_published":"2023-04-19T00:00:00Z","type":"journal_article","abstract":[{"text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.","lang":"eng"}],"title":"A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D","status":"public","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13276","oa_version":"Published Version","file":[{"creator":"dernst","file_size":551418,"content_type":"application/pdf","file_name":"2023_SciPostPhysCodebase_Rammelmueller.pdf","access_level":"open_access","date_updated":"2023-07-31T09:09:23Z","date_created":"2023-07-31T09:09:23Z","success":1,"checksum":"f583a70fe915d2208c803f5afb426daa","file_id":"13330","relation":"main_file"}]},{"ec_funded":1,"abstract":[{"text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.","lang":"eng"}],"type":"research_data_reference","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"13276"}]},"author":[{"full_name":"Rammelmüller, Lukas","first_name":"Lukas","last_name":"Rammelmüller"},{"full_name":"Huber, David","first_name":"David","last_name":"Huber"},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","first_name":"Artem","last_name":"Volosniev","full_name":"Volosniev, Artem"}],"oa_version":"Published Version","date_created":"2023-07-24T10:46:23Z","date_updated":"2023-07-31T09:16:02Z","_id":"13275","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"SciPost Foundation","department":[{"_id":"MiLe"}],"status":"public","ddc":["530"],"title":"Codebase release 1.0 for FermiFCI","article_processing_charge":"No","day":"19","month":"04","date_published":"2023-04-19T00:00:00Z","doi":"10.21468/scipostphyscodeb.12-r1.0","main_file_link":[{"open_access":"1","url":"https://doi.org/10.21468/SciPostPhysCodeb.12-r1.0"}],"citation":{"ista":"Rammelmüller L, Huber D, Volosniev A. 2023. Codebase release 1.0 for FermiFCI, SciPost Foundation, 10.21468/scipostphyscodeb.12-r1.0.","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “Codebase release 1.0 for FermiFCI.” SciPost Foundation, 2023.","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). Codebase release 1.0 for FermiFCI. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12-r1.0","ama":"Rammelmüller L, Huber D, Volosniev A. Codebase release 1.0 for FermiFCI. 2023. doi:10.21468/scipostphyscodeb.12-r1.0","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “Codebase Release 1.0 for FermiFCI.” SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12-r1.0.","mla":"Rammelmüller, Lukas, et al. Codebase Release 1.0 for FermiFCI. SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12-r1.0.","short":"L. Rammelmüller, D. Huber, A. Volosniev, (2023)."},"oa":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}]},{"publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publication_status":"published","year":"2023","date_created":"2023-07-23T22:01:12Z","date_updated":"2023-07-31T10:54:32Z","author":[{"full_name":"Fedorov, Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","last_name":"Fedorov"},{"full_name":"Hashemi, Diba","id":"ed9595ea-2f8f-11ee-ba95-d2b546540783","last_name":"Hashemi","first_name":"Diba"},{"last_name":"Nadiradze","first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"file_date_updated":"2023-07-31T10:53:08Z","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2304.09331"]},"language":[{"iso":"eng"}],"doi":"10.1145/3558481.3591082","conference":{"end_date":"2023-06-19","start_date":"2023-06-17","location":"Orlando, FL, United States","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"publication_identifier":{"isbn":["9781450395458"]},"month":"06","ddc":["000"],"status":"public","title":"Provably-efficient and internally-deterministic parallel Union-Find","_id":"13262","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2023-07-31T10:53:08Z","date_created":"2023-07-31T10:53:08Z","success":1,"checksum":"72e312aabf0c5248c99b5cd3a88e4c88","file_id":"13334","relation":"main_file","creator":"dernst","file_size":2087937,"content_type":"application/pdf","file_name":"2023_SPAA_Fedorov.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"conference","abstract":[{"lang":"eng","text":"Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms. In this paper, we perform the first such analysis for the fundamental Union-Find problem, in which we are given a graph as a sequence of edges, and must maintain its connectivity structure under edge additions. We prove that classic sequential algorithms for this problem are well-parallelizable under reasonable assumptions, addressing a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential argument that, under uniform random edge ordering, parallel union-find operations are unlikely to interfere: T concurrent threads processing the graph in parallel will encounter memory contention O(T2 · log |V| · log |E|) times in expectation, where |E| and |V| are the number of edges and nodes in the graph, respectively. We leverage this result to design a new parallel Union-Find algorithm that is both internally deterministic, i.e., its results are guaranteed to match those of a sequential execution, but also work-efficient and scalable, as long as the number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε > 0, which holds for most large real-world graphs. We present lower bounds which show that our analysis is close to optimal, and experimental results suggesting that the performance cost of internal determinism is limited."}],"page":"261-271","citation":{"chicago":"Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.","short":"A. Fedorov, D. Hashemi, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–271.","mla":"Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082.","ieee":"A. Fedorov, D. Hashemi, G. Nadiradze, and D.-A. Alistarh, “Provably-efficient and internally-deterministic parallel Union-Find,” in Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Orlando, FL, United States, 2023, pp. 261–271.","apa":"Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient and internally-deterministic parallel Union-Find. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082","ista":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. 2023. Provably-efficient and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 261–271.","ama":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271. doi:10.1145/3558481.3591082"},"publication":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","date_published":"2023-06-17T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","day":"17"},{"date_published":"2023-02-01T00:00:00Z","page":"542-559","article_type":"original","citation":{"mla":"De Jode, Aurélien, et al. “Ten Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary Applications, vol. 16, no. 2, Wiley, 2023, pp. 542–59, doi:10.1111/eva.13428.","short":"A. De Jode, A. Le Moan, K. Johannesson, R. Faria, S. Stankowski, A.M. Westram, R.K. Butlin, M. Rafajlović, C. Fraisse, Evolutionary Applications 16 (2023) 542–559.","chicago":"De Jode, Aurélien, Alan Le Moan, Kerstin Johannesson, Rui Faria, Sean Stankowski, Anja M Westram, Roger K. Butlin, Marina Rafajlović, and Christelle Fraisse. “Ten Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary Applications. Wiley, 2023. https://doi.org/10.1111/eva.13428.","ama":"De Jode A, Le Moan A, Johannesson K, et al. Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. 2023;16(2):542-559. doi:10.1111/eva.13428","ista":"De Jode A, Le Moan A, Johannesson K, Faria R, Stankowski S, Westram AM, Butlin RK, Rafajlović M, Fraisse C. 2023. Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. 16(2), 542–559.","apa":"De Jode, A., Le Moan, A., Johannesson, K., Faria, R., Stankowski, S., Westram, A. M., … Fraisse, C. (2023). Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. Wiley. https://doi.org/10.1111/eva.13428","ieee":"A. De Jode et al., “Ten years of demographic modelling of divergence and speciation in the sea,” Evolutionary Applications, vol. 16, no. 2. Wiley, pp. 542–559, 2023."},"publication":"Evolutionary Applications","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_EvolutionaryApplications_DeJode.pdf","creator":"dernst","content_type":"application/pdf","file_size":2269822,"file_id":"12685","relation":"main_file","success":1,"checksum":"d4d6fa9ddf36643af994a6a757919afb","date_updated":"2023-02-27T07:10:17Z","date_created":"2023-02-27T07:10:17Z"}],"intvolume":" 16","ddc":["576"],"status":"public","title":"Ten years of demographic modelling of divergence and speciation in the sea","_id":"11479","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"2","abstract":[{"lang":"eng","text":"Understanding population divergence that eventually leads to speciation is essential for evolutionary biology. High species diversity in the sea was regarded as a paradox when strict allopatry was considered necessary for most speciation events because geographical barriers seemed largely absent in the sea, and many marine species have high dispersal capacities. Combining genome-wide data with demographic modelling to infer the demographic history of divergence has introduced new ways to address this classical issue. These models assume an ancestral population that splits into two subpopulations diverging according to different scenarios that allow tests for periods of gene flow. Models can also test for heterogeneities in population sizes and migration rates along the genome to account, respectively, for background selection and selection against introgressed ancestry. To investigate how barriers to gene flow arise in the sea, we compiled studies modelling the demographic history of divergence in marine organisms and extracted preferred demographic scenarios together with estimates of demographic parameters. These studies show that geographical barriers to gene flow do exist in the sea but that divergence can also occur without strict isolation. Heterogeneity of gene flow was detected in most population pairs suggesting the predominance of semipermeable barriers during divergence. We found a weak positive relationship between the fraction of the genome experiencing reduced gene flow and levels of genome-wide differentiation. Furthermore, we found that the upper bound of the ‘grey zone of speciation’ for our dataset extended beyond that found before, implying that gene flow between diverging taxa is possible at higher levels of divergence than previously thought. Finally, we list recommendations for further strengthening the use of demographic modelling in speciation research. These include a more balanced representation of taxa, more consistent and comprehensive modelling, clear reporting of results and simulation studies to rule out nonbiological explanations for general results."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1111/eva.13428","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000815663700001"]},"oa":1,"publication_identifier":{"eissn":["1752-4571"]},"month":"02","volume":16,"date_created":"2022-07-03T22:01:33Z","date_updated":"2023-08-01T12:25:44Z","author":[{"last_name":"De Jode","first_name":"Aurélien","full_name":"De Jode, Aurélien"},{"full_name":"Le Moan, Alan","last_name":"Le Moan","first_name":"Alan"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"},{"last_name":"Faria","first_name":"Rui","full_name":"Faria, Rui"},{"last_name":"Stankowski","first_name":"Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E","full_name":"Stankowski, Sean"},{"full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","first_name":"Anja M"},{"full_name":"Butlin, Roger K.","first_name":"Roger K.","last_name":"Butlin"},{"first_name":"Marina","last_name":"Rafajlović","full_name":"Rafajlović, Marina"},{"orcid":"0000-0001-8441-5075","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","last_name":"Fraisse","first_name":"Christelle","full_name":"Fraisse, Christelle"}],"publisher":"Wiley","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"publication_status":"published","year":"2023","acknowledgement":"We greatly thank all the corresponding authors of the studies that were included in our synthesis for the sharing of additional data: Thomas Broquet, Dmitry Filatov, Quentin Rougemont, Paolo Momigliano, Pierre-Alexandre Gagnaire, Carlos Prada, Ahmed Souissi, Michael Møller Hansen, Sylvie Lapègue, Joseph Di Battista, Michael Hellberg and Carlos Prada. RKB and ADJ were supported by the European Research Council. MR was supported by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243; to MR) and Formas (grant number 2019-00882; to KJ and MR), and by additional grants from the European Research Council (to RKB) and Vetenskapsrådet (to KJ) through the Centre for Marine Evolutionary Biology (https://www.gu.se/en/cemeb-marine-evolutionary-biology).","file_date_updated":"2023-02-27T07:10:17Z"},{"date_published":"2023-01-10T00:00:00Z","citation":{"short":"A. Gómez, G. Oliveira, Scientific Reports 13 (2023).","mla":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports, vol. 13, 468, Springer Nature, 2023, doi:10.1038/s41598-022-19827-9.","chicago":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-022-19827-9.","ama":"Gómez A, Oliveira G. New approaches to epidemic modeling on networks. Scientific Reports. 2023;13. doi:10.1038/s41598-022-19827-9","ieee":"A. Gómez and G. Oliveira, “New approaches to epidemic modeling on networks,” Scientific Reports, vol. 13. Springer Nature, 2023.","apa":"Gómez, A., & Oliveira, G. (2023). New approaches to epidemic modeling on networks. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-19827-9","ista":"Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks. Scientific Reports. 13, 468."},"publication":"Scientific Reports","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"10","scopus_import":"1","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_ScientificReports_Gomez.pdf","creator":"dernst","file_size":2167792,"content_type":"application/pdf","file_id":"12336","relation":"main_file","success":1,"checksum":"a8b83739f4a951e83e0b2a778f03b327","date_updated":"2023-01-23T07:53:23Z","date_created":"2023-01-23T07:53:23Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12329","intvolume":" 13","status":"public","title":"New approaches to epidemic modeling on networks","ddc":["510"],"abstract":[{"text":"In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection.","lang":"eng"}],"type":"journal_article","doi":"10.1038/s41598-022-19827-9","language":[{"iso":"eng"}],"external_id":{"isi":["001003345000051"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1,"publication_identifier":{"eissn":["2045-2322"]},"month":"01","author":[{"last_name":"Gómez","first_name":"Arturo","full_name":"Gómez, Arturo"},{"full_name":"Oliveira, Goncalo","last_name":"Oliveira","first_name":"Goncalo","id":"58abbde8-f455-11eb-a497-98c8fd71b905"}],"volume":13,"date_created":"2023-01-22T23:00:55Z","date_updated":"2023-08-01T12:31:40Z","year":"2023","acknowledgement":"Gonçalo Oliveira is supported by the NOMIS Foundation, Fundação Serrapilheira 1812-27395, by CNPq grants 428959/2018-0 and 307475/2018-2, and by FAPERJ through the grant Jovem Cientista do Nosso Estado E-26/202.793/2019.","department":[{"_id":"TaHa"}],"publisher":"Springer Nature","publication_status":"published","file_date_updated":"2023-01-23T07:53:23Z","article_number":"468"},{"oa_version":"Preprint","_id":"9034","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"Integral points of bounded height on a log Fano threefold","intvolume":" 2023","abstract":[{"text":"We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of P3 outside certain planes using universal torsors.","lang":"eng"}],"issue":"8","type":"journal_article","date_published":"2023-04-01T00:00:00Z","publication":"International Mathematics Research Notices","citation":{"ama":"Wilsch FA. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023;2023(8):6780-6808. doi:10.1093/imrn/rnac048","ista":"Wilsch FA. 2023. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023(8), 6780–6808.","apa":"Wilsch, F. A. (2023). Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. Oxford Academic. https://doi.org/10.1093/imrn/rnac048","ieee":"F. A. Wilsch, “Integral points of bounded height on a log Fano threefold,” International Mathematics Research Notices, vol. 2023, no. 8. Oxford Academic, pp. 6780–6808, 2023.","mla":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” International Mathematics Research Notices, vol. 2023, no. 8, Oxford Academic, 2023, pp. 6780–808, doi:10.1093/imrn/rnac048.","short":"F.A. Wilsch, International Mathematics Research Notices 2023 (2023) 6780–6808.","chicago":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” International Mathematics Research Notices. Oxford Academic, 2023. https://doi.org/10.1093/imrn/rnac048."},"article_type":"original","page":"6780-6808","day":"01","article_processing_charge":"No","author":[{"full_name":"Wilsch, Florian Alexander","id":"560601DA-8D36-11E9-A136-7AC1E5697425","orcid":"0000-0001-7302-8256","first_name":"Florian Alexander","last_name":"Wilsch"}],"date_created":"2021-01-22T09:31:09Z","date_updated":"2023-08-01T12:23:55Z","volume":2023,"acknowledgement":"This work was supported by the German Academic Exchange Service. Parts of this article were prepared at the Institut de Mathémathiques de Jussieu—Paris Rive Gauche. I wish to thank Antoine Chambert-Loir for his remarks and the institute for its hospitality, as well as the anonymous referee for several useful remarks and suggestions for improvements.","year":"2023","publication_status":"published","publisher":"Oxford Academic","department":[{"_id":"TiBr"}],"doi":"10.1093/imrn/rnac048","language":[{"iso":"eng"}],"external_id":{"arxiv":["1901.08503"],"isi":["000773116000001"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1901.08503","open_access":"1"}],"isi":1,"quality_controlled":"1","month":"04","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]}}]