[{"publication_identifier":{"issn":["0022-0957"],"eissn":["1460-2431"]},"abstract":[{"lang":"eng","text":"Amid the delays due to the global pandemic, in early October 2022, the auxin community gathered in the idyllic peninsula of Cavtat, Croatia. More than 170 scientists from across the world converged to discuss the latest advancements in fundamental and applied research in the field. The topics, from signalling and transport to plant architecture and response to the environment, show how auxin research must bridge from the molecular realm to macroscopic developmental responses. This is mirrored in this collection of reviews, contributed by participants of the Auxin 2022 meeting."}],"quality_controlled":"1","date_published":"2023-12-01T00:00:00Z","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"},"isi":1,"external_id":{"isi":["001145889700001"],"pmid":["38038239"]},"date_updated":"2025-09-09T14:06:39Z","title":"Auxin research: Creating tools for a greener future","publication_status":"published","type":"journal_article","file":[{"creator":"dernst","access_level":"open_access","date_updated":"2024-01-02T09:23:57Z","success":1,"file_name":"2023_JourExperimentalBotany_DelBianco.pdf","date_created":"2024-01-02T09:23:57Z","checksum":"f66fb960fd791dea53fd0e087f2fbbe8","relation":"main_file","content_type":"application/pdf","file_id":"14724","file_size":425194}],"publication":"Journal of Experimental Botany","pmid":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ista":"Del Bianco M, Friml J, Strader L, Kepinski S. 2023. Auxin research: Creating tools for a greener future. Journal of Experimental Botany. 74(22), 6889–6892.","mla":"Del Bianco, Marta, et al. “Auxin Research: Creating Tools for a Greener Future.” Journal of Experimental Botany, vol. 74, no. 22, Oxford University Press, 2023, pp. 6889–92, doi:10.1093/jxb/erad420.","ama":"Del Bianco M, Friml J, Strader L, Kepinski S. Auxin research: Creating tools for a greener future. Journal of Experimental Botany. 2023;74(22):6889-6892. doi:10.1093/jxb/erad420","ieee":"M. Del Bianco, J. Friml, L. Strader, and S. Kepinski, “Auxin research: Creating tools for a greener future,” Journal of Experimental Botany, vol. 74, no. 22. Oxford University Press, pp. 6889–6892, 2023.","short":"M. Del Bianco, J. Friml, L. Strader, S. Kepinski, Journal of Experimental Botany 74 (2023) 6889–6892.","chicago":"Del Bianco, Marta, Jiří Friml, Lucia Strader, and Stefan Kepinski. “Auxin Research: Creating Tools for a Greener Future.” Journal of Experimental Botany. Oxford University Press, 2023. https://doi.org/10.1093/jxb/erad420.","apa":"Del Bianco, M., Friml, J., Strader, L., & Kepinski, S. (2023). Auxin research: Creating tools for a greener future. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/erad420"},"status":"public","oa_version":"Published Version","ddc":["580"],"_id":"14709","file_date_updated":"2024-01-02T09:23:57Z","month":"12","oa":1,"date_created":"2023-12-24T23:00:53Z","volume":74,"author":[{"first_name":"Marta","full_name":"Del Bianco, Marta","last_name":"Del Bianco"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"},{"last_name":"Strader","full_name":"Strader, Lucia","first_name":"Lucia"},{"first_name":"Stefan","last_name":"Kepinski","full_name":"Kepinski, Stefan"}],"intvolume":" 74","scopus_import":"1","doi":"10.1093/jxb/erad420","department":[{"_id":"JiFr"}],"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","issue":"22","day":"01","publisher":"Oxford University Press","article_type":"original","page":"6889-6892","license":"https://creativecommons.org/licenses/by/4.0/","language":[{"iso":"eng"}],"year":"2023"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ieee":"A. I. Curatolo, O. Kimchi, C. P. Goodrich, R. K. Krueger, and M. P. Brenner, “A computational toolbox for the assembly yield of complex and heterogeneous structures,” Nature Communications, vol. 14. Springer Nature, 2023.","ama":"Curatolo AI, Kimchi O, Goodrich CP, Krueger RK, Brenner MP. A computational toolbox for the assembly yield of complex and heterogeneous structures. Nature Communications. 2023;14. doi:10.1038/s41467-023-43168-4","mla":"Curatolo, Agnese I., et al. “A Computational Toolbox for the Assembly Yield of Complex and Heterogeneous Structures.” Nature Communications, vol. 14, 8328, Springer Nature, 2023, doi:10.1038/s41467-023-43168-4.","ista":"Curatolo AI, Kimchi O, Goodrich CP, Krueger RK, Brenner MP. 2023. A computational toolbox for the assembly yield of complex and heterogeneous structures. Nature Communications. 14, 8328.","chicago":"Curatolo, Agnese I., Ofer Kimchi, Carl Peter Goodrich, Ryan K. Krueger, and Michael P. Brenner. “A Computational Toolbox for the Assembly Yield of Complex and Heterogeneous Structures.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-43168-4.","apa":"Curatolo, A. I., Kimchi, O., Goodrich, C. P., Krueger, R. K., & Brenner, M. P. (2023). A computational toolbox for the assembly yield of complex and heterogeneous structures. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-43168-4","short":"A.I. Curatolo, O. Kimchi, C.P. Goodrich, R.K. Krueger, M.P. Brenner, Nature Communications 14 (2023)."},"pmid":1,"publication":"Nature Communications","file":[{"file_id":"14714","file_size":1342319,"relation":"main_file","content_type":"application/pdf","checksum":"fd9e9d527c2691f03fbc24031a75a3b3","file_name":"2023_NatureComm_Curatolo.pdf","date_created":"2023-12-27T08:40:43Z","date_updated":"2023-12-27T08:40:43Z","success":1,"access_level":"open_access","creator":"kschuh"}],"acknowledgement":"We thank Lucy Colwell for suggesting that we use covariance based methods to predict contacts and Yang Hsia, Scott Boyken, Zibo Chen, and David Baker for collaborations on designed protein complexes. We also thank Ned Wingreen for suggesting the alternative derivation of (11). This research was supported by the Office of Naval Research through ONR N00014-17-1-3029, the Simons Foundation the NSF-Simons Center for Mathematical and Statistical Analysis of Biology at Harvard (award number #1764269), the Peter B. Lewis ’55 Lewis-Sigler Institute/Genomics Fund through the Lewis-Sigler Institute of Integrative Genomics at Princeton University, and the National Science Foundation through the Center for the Physics of Biological Function (PHY-1734030).","type":"journal_article","date_updated":"2025-09-09T14:02:41Z","title":"A computational toolbox for the assembly yield of complex and heterogeneous structures","publication_status":"published","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":["001125281300010"],"pmid":["38097568"]},"date_published":"2023-12-01T00:00:00Z","abstract":[{"lang":"eng","text":"The self-assembly of complex structures from a set of non-identical building blocks is a hallmark of soft matter and biological systems, including protein complexes, colloidal clusters, and DNA-based assemblies. Predicting the dependence of the equilibrium assembly yield on the concentrations and interaction energies of building blocks is highly challenging, owing to the difficulty of computing the entropic contributions to the free energy of the many structures that compete with the ground state configuration. While these calculations yield well known results for spherically symmetric building blocks, they do not hold when the building blocks have internal rotational degrees of freedom. Here we present an approach for solving this problem that works with arbitrary building blocks, including proteins with known structure and complex colloidal building blocks. Our algorithm combines classical statistical mechanics with recently developed computational tools for automatic differentiation. Automatic differentiation allows efficient evaluation of equilibrium averages over configurations that would otherwise be intractable. We demonstrate the validity of our framework by comparison to molecular dynamics simulations of simple examples, and apply it to calculate the yield curves for known protein complexes and for the assembly of colloidal shells."}],"quality_controlled":"1","publication_identifier":{"eissn":["2041-1723"]},"language":[{"iso":"eng"}],"year":"2023","article_type":"original","publisher":"Springer Nature","day":"01","has_accepted_license":"1","article_processing_charge":"Yes","department":[{"_id":"CaGo"}],"scopus_import":"1","doi":"10.1038/s41467-023-43168-4","intvolume":" 14","author":[{"last_name":"Curatolo","full_name":"Curatolo, Agnese I.","first_name":"Agnese I."},{"full_name":"Kimchi, Ofer","last_name":"Kimchi","first_name":"Ofer"},{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","last_name":"Goodrich","full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074"},{"first_name":"Ryan K.","full_name":"Krueger, Ryan K.","last_name":"Krueger"},{"first_name":"Michael P.","last_name":"Brenner","full_name":"Brenner, Michael P."}],"date_created":"2023-12-24T23:00:53Z","volume":14,"oa":1,"month":"12","status":"public","oa_version":"Published Version","_id":"14710","file_date_updated":"2023-12-27T08:40:43Z","ddc":["530"],"article_number":"8328"},{"language":[{"iso":"eng"}],"year":"2023","department":[{"_id":"RoSe"}],"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","day":"01","issue":"12","publisher":"AIP Publishing","article_type":"original","date_created":"2023-12-31T23:01:02Z","volume":64,"author":[{"id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","first_name":"David Johannes","last_name":"Mitrouskas","full_name":"Mitrouskas, David Johannes"},{"last_name":"Pickl","full_name":"Pickl, Peter","first_name":"Peter"}],"intvolume":" 64","scopus_import":"1","doi":"10.1063/5.0172199","article_number":"121901","oa_version":"Published Version","status":"public","ddc":["510"],"_id":"14715","file_date_updated":"2024-01-02T08:45:07Z","month":"12","oa":1,"publication":"Journal of Mathematical Physics","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Mitrouskas, David Johannes, and Peter Pickl. “Exponential Decay of the Number of Excitations in the Weakly Interacting Bose Gas.” Journal of Mathematical Physics, vol. 64, no. 12, 121901, AIP Publishing, 2023, doi:10.1063/5.0172199.","ista":"Mitrouskas DJ, Pickl P. 2023. Exponential decay of the number of excitations in the weakly interacting Bose gas. Journal of Mathematical Physics. 64(12), 121901.","ieee":"D. J. Mitrouskas and P. Pickl, “Exponential decay of the number of excitations in the weakly interacting Bose gas,” Journal of Mathematical Physics, vol. 64, no. 12. AIP Publishing, 2023.","ama":"Mitrouskas DJ, Pickl P. Exponential decay of the number of excitations in the weakly interacting Bose gas. Journal of Mathematical Physics. 2023;64(12). doi:10.1063/5.0172199","short":"D.J. Mitrouskas, P. Pickl, Journal of Mathematical Physics 64 (2023).","chicago":"Mitrouskas, David Johannes, and Peter Pickl. “Exponential Decay of the Number of Excitations in the Weakly Interacting Bose Gas.” Journal of Mathematical Physics. AIP Publishing, 2023. https://doi.org/10.1063/5.0172199.","apa":"Mitrouskas, D. J., & Pickl, P. (2023). Exponential decay of the number of excitations in the weakly interacting Bose gas. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/5.0172199"},"acknowledgement":"We thank Lea Boßmann, Phan Thành Nam and Simone Rademacher for helpful remarks. P.P. acknowledges funding by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Grant No. SFB/TRR 352 “Mathematics of Many-Body Quantum Systems and Their Collective Phenomena.”","type":"journal_article","file":[{"content_type":"application/pdf","relation":"main_file","checksum":"66572f718a36465576cf0d6b3f7e01fc","file_id":"14722","file_size":4346922,"date_updated":"2024-01-02T08:45:07Z","success":1,"creator":"dernst","access_level":"open_access","date_created":"2024-01-02T08:45:07Z","file_name":"2023_JourMathPhysics_Mitrouskas.pdf"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider N trapped bosons in the mean-field limit with coupling constant λN = 1/(N − 1). The ground state of such systems exhibits Bose–Einstein condensation. We prove that the probability of finding ℓ particles outside the condensate wave function decays exponentially in ℓ."}],"date_published":"2023-12-01T00:00:00Z","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"},"isi":1,"external_id":{"arxiv":["2307.11062"],"isi":["001127432200002"]},"date_updated":"2025-09-09T14:05:28Z","publication_status":"published","title":"Exponential decay of the number of excitations in the weakly interacting Bose gas","arxiv":1,"publication_identifier":{"issn":["0022-2488"],"eissn":["1089-7658"]},"corr_author":"1"},{"oa":1,"month":"12","ddc":["570"],"_id":"14716","file_date_updated":"2024-01-02T09:09:32Z","status":"public","oa_version":"Published Version","article_number":"404","doi":"10.1186/s12866-023-03147-7","scopus_import":"1","intvolume":" 23","author":[{"first_name":"Alper","last_name":"Yurtseven","full_name":"Yurtseven, Alper"},{"first_name":"Sofia","id":"2F54A7BC-3902-11EA-AC87-BC9F3DDC885E","full_name":"Buyanova, Sofia","last_name":"Buyanova"},{"first_name":"Amay Ajaykumar A.","last_name":"Agrawal","full_name":"Agrawal, Amay Ajaykumar A."},{"first_name":"Olga","id":"C4558D3C-6102-11E9-A62E-F418E6697425","orcid":"0000-0003-1006-6639","full_name":"Bochkareva, Olga","last_name":"Bochkareva"},{"first_name":"Olga V V.","full_name":"Kalinina, Olga V V.","last_name":"Kalinina"}],"volume":23,"date_created":"2023-12-31T23:01:02Z","publisher":"Springer Nature","article_type":"original","issue":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"FyKo"}],"year":"2023","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1471-2180"]},"publication_status":"published","title":"Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis","date_updated":"2025-09-09T14:06:03Z","date_published":"2023-12-01T00:00:00Z","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"},"isi":1,"external_id":{"pmid":["38124060"],"isi":["001128788700001"]},"abstract":[{"text":"Background: Antimicrobial resistance (AMR) poses a significant global health threat, and an accurate prediction of bacterial resistance patterns is critical for effective treatment and control strategies. In recent years, machine learning (ML) approaches have emerged as powerful tools for analyzing large-scale bacterial AMR data. However, ML methods often ignore evolutionary relationships among bacterial strains, which can greatly impact performance of the ML methods, especially if resistance-associated features are attempted to be detected. Genome-wide association studies (GWAS) methods like linear mixed models accounts for the evolutionary relationships in bacteria, but they uncover only highly significant variants which have already been reported in literature.\r\n\r\nResults: In this work, we introduce a novel phylogeny-related parallelism score (PRPS), which measures whether a certain feature is correlated with the population structure of a set of samples. We demonstrate that PRPS can be used, in combination with SVM- and random forest-based models, to reduce the number of features in the analysis, while simultaneously increasing models’ performance. We applied our pipeline to publicly available AMR data from PATRIC database for Mycobacterium tuberculosis against six common antibiotics.\r\n\r\nConclusions: Using our pipeline, we re-discovered known resistance-associated mutations as well as new candidate mutations which can be related to resistance and not previously reported in the literature. We demonstrated that taking into account phylogenetic relationships not only improves the model performance, but also yields more biologically relevant predicted most contributing resistance markers.","lang":"eng"}],"quality_controlled":"1","file":[{"checksum":"7ff5e95f3496ff663301eb4a13a316d5","content_type":"application/pdf","relation":"main_file","file_id":"14723","file_size":1979922,"access_level":"open_access","creator":"dernst","date_updated":"2024-01-02T09:09:32Z","success":1,"date_created":"2024-01-02T09:09:32Z","file_name":"2023_BMCMicrobiology_Yurtseven.pdf"}],"acknowledgement":"Open Access funding enabled and organized by Projekt DEAL. A.Y. and O.V.K. acknowledge financial support from the Klaus Faber Foundation. A.A.A. was funded by the Helmholtz AI project AMR-XAI. The work of O.O.B. is funded by Fonds zur Förderung der Wissenschaftlichen Forschung (FWF), Grant ESP 253-B.","type":"journal_article","citation":{"ista":"Yurtseven A, Buyanova S, Agrawal AAA, Bochkareva O, Kalinina OVV. 2023. Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis. BMC Microbiology. 23(1), 404.","mla":"Yurtseven, Alper, et al. “Machine Learning and Phylogenetic Analysis Allow for Predicting Antibiotic Resistance in M. Tuberculosis.” BMC Microbiology, vol. 23, no. 1, 404, Springer Nature, 2023, doi:10.1186/s12866-023-03147-7.","ieee":"A. Yurtseven, S. Buyanova, A. A. A. Agrawal, O. Bochkareva, and O. V. V. Kalinina, “Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis,” BMC Microbiology, vol. 23, no. 1. Springer Nature, 2023.","ama":"Yurtseven A, Buyanova S, Agrawal AAA, Bochkareva O, Kalinina OVV. Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis. BMC Microbiology. 2023;23(1). doi:10.1186/s12866-023-03147-7","short":"A. Yurtseven, S. Buyanova, A.A.A. Agrawal, O. Bochkareva, O.V.V. Kalinina, BMC Microbiology 23 (2023).","apa":"Yurtseven, A., Buyanova, S., Agrawal, A. A. A., Bochkareva, O., & Kalinina, O. V. V. (2023). Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis. BMC Microbiology. Springer Nature. https://doi.org/10.1186/s12866-023-03147-7","chicago":"Yurtseven, Alper, Sofia Buyanova, Amay Ajaykumar A. Agrawal, Olga Bochkareva, and Olga V V. Kalinina. “Machine Learning and Phylogenetic Analysis Allow for Predicting Antibiotic Resistance in M. Tuberculosis.” BMC Microbiology. Springer Nature, 2023. https://doi.org/10.1186/s12866-023-03147-7."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"publication":"BMC Microbiology"},{"doi":"10.1093/qmath/haad008","scopus_import":"1","intvolume":" 74","author":[{"first_name":"Tal","id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","full_name":"Horesh, Tal","last_name":"Horesh"},{"first_name":"Yakov","last_name":"Karasik","full_name":"Karasik, Yakov"}],"volume":74,"date_created":"2023-12-31T23:01:03Z","oa":1,"month":"12","file_date_updated":"2024-01-02T07:37:09Z","_id":"14717","ddc":["510"],"status":"public","oa_version":"Published Version","year":"2023","language":[{"iso":"eng"}],"page":"1253-1294","publisher":"Oxford University Press","article_type":"original","issue":"4","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"TiBr"}],"publication_status":"published","title":"Equidistribution of primitive lattices in ℝn","project":[{"grant_number":"EP-P026710-2","name":"Between rational and integral points","_id":"26A8D266-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-09-09T14:03:32Z","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":["001005945400001"],"arxiv":["2012.04508"]},"isi":1,"date_published":"2023-12-01T00:00:00Z","quality_controlled":"1","abstract":[{"text":"We count primitive lattices of rank d inside Zn as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subspace that a lattice spans, namely its projection to the Grassmannian; its homothety class and its equivalence class modulo rescaling and rotation, often referred to as a shape. We add to a prior work of Schmidt by allowing sets in the spaces of parameters that are general enough to conclude the joint equidistribution of these parameters. In addition to the primitive d-lattices Λ themselves, we also consider their orthogonal complements in Zn, A1, and show that the equidistribution occurs jointly for Λ and A1. Finally, our asymptotic formulas for the number of primitive lattices include an explicit bound on the error term.","lang":"eng"}],"corr_author":"1","publication_identifier":{"issn":["0033-5606"],"eissn":["1464-3847"]},"arxiv":1,"citation":{"short":"T. Horesh, Y. Karasik, Quarterly Journal of Mathematics 74 (2023) 1253–1294.","apa":"Horesh, T., & Karasik, Y. (2023). Equidistribution of primitive lattices in ℝn. Quarterly Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qmath/haad008","chicago":"Horesh, Tal, and Yakov Karasik. “Equidistribution of Primitive Lattices in ℝn.” Quarterly Journal of Mathematics. Oxford University Press, 2023. https://doi.org/10.1093/qmath/haad008.","mla":"Horesh, Tal, and Yakov Karasik. “Equidistribution of Primitive Lattices in ℝn.” Quarterly Journal of Mathematics, vol. 74, no. 4, Oxford University Press, 2023, pp. 1253–94, doi:10.1093/qmath/haad008.","ista":"Horesh T, Karasik Y. 2023. Equidistribution of primitive lattices in ℝn. Quarterly Journal of Mathematics. 74(4), 1253–1294.","ieee":"T. Horesh and Y. Karasik, “Equidistribution of primitive lattices in ℝn,” Quarterly Journal of Mathematics, vol. 74, no. 4. Oxford University Press, pp. 1253–1294, 2023.","ama":"Horesh T, Karasik Y. Equidistribution of primitive lattices in ℝn. Quarterly Journal of Mathematics. 2023;74(4):1253-1294. doi:10.1093/qmath/haad008"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Quarterly Journal of Mathematics","file":[{"date_created":"2024-01-02T07:37:09Z","file_name":"2023_QuarterlyJourMath_Horesh.pdf","date_updated":"2024-01-02T07:37:09Z","success":1,"access_level":"open_access","creator":"dernst","file_size":724748,"file_id":"14720","content_type":"application/pdf","relation":"main_file","checksum":"bf29baa9eae8500f3374dbcb80712687"}],"type":"journal_article","acknowledgement":"This work was done when both authors were visiting Institute of Science and Technology (IST) Austria. T.H. was being supported by Engineering and Physical Sciences Research Council grant EP/P026710/1. Y.K. had a great time there and is grateful for the hospitality. The appendix to this paper is largely based on a mini course T.H. had given at IST in February 2020."},{"oa":1,"month":"10","_id":"14718","ddc":["000"],"file_date_updated":"2024-01-02T08:14:23Z","status":"public","oa_version":"Published Version","doi":"10.34727/2023/isbn.978-3-85448-060-0_20","scopus_import":"1","author":[{"first_name":"Samuel","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","orcid":"0000-0003-1993-0331","last_name":"Pastva","full_name":"Pastva, Samuel"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"date_created":"2023-12-31T23:01:03Z","publisher":"TU Vienna Academic Press","day":"01","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"ToHe"}],"year":"2023","language":[{"iso":"eng"}],"page":"122-131","corr_author":"1","publication_identifier":{"isbn":["9783854480600"]},"ec_funded":1,"publication_status":"published","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"title":"Binary decision diagrams on modern hardware","date_updated":"2025-09-09T14:04:14Z","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":["001504402400020"]},"isi":1,"date_published":"2023-10-01T00:00:00Z","abstract":[{"text":"Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. ","lang":"eng"}],"quality_controlled":"1","file":[{"file_size":524321,"file_id":"14721","relation":"main_file","content_type":"application/pdf","checksum":"818d6e13dd508f3a04f0941081022e5d","file_name":"2023_FMCAD_Pastva.pdf","date_created":"2024-01-02T08:14:23Z","date_updated":"2024-01-02T08:14:23Z","success":1,"creator":"dernst","access_level":"open_access"}],"type":"conference","acknowledgement":"This work was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413 and the\r\n“VAMOS” grant ERC-2020-AdG 101020093.","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","end_date":"2023-10-27","start_date":"2023-10-25","location":"Ames, IA, United States"},"citation":{"ista":"Pastva S, Henzinger TA. 2023. Binary decision diagrams on modern hardware. Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 122–131.","mla":"Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern Hardware.” Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Vienna Academic Press, 2023, pp. 122–31, doi:10.34727/2023/isbn.978-3-85448-060-0_20.","ama":"Pastva S, Henzinger TA. Binary decision diagrams on modern hardware. In: Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design. TU Vienna Academic Press; 2023:122-131. doi:10.34727/2023/isbn.978-3-85448-060-0_20","ieee":"S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,” in Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, Ames, IA, United States, 2023, pp. 122–131.","short":"S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Vienna Academic Press, 2023, pp. 122–131.","chicago":"Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern Hardware.” In Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, 122–31. TU Vienna Academic Press, 2023. https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20.","apa":"Pastva, S., & Henzinger, T. A. (2023). Binary decision diagrams on modern hardware. In Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design (pp. 122–131). Ames, IA, United States: TU Vienna Academic Press. https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design"},{"type":"journal_article","acknowledgement":"The authors acknowledge the support from the 2BoSS project of the ERA-MIN3 program with the Spanish grant number PCI2022-132985/AEI/10.13039/501100011033 and the French grant number ANR-22-MIN3-0003-01. J.L. acknowledges the support from the Natural Science Foundation of Sichuan Province 2022NSFSC1229. The authors acknowledge the funding from Generalitat de Catalunya 2021 SGR 01581 and European Union NextGenerationEU/PRTR. This research was supported by the Scientific Service Units (SSU) of ISTA Austria through resources provided by Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NNF).","pmid":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Mollania, H., Zhang, C., Du, R., Qi, X., Li, J., Horta, S., … Cabot, A. (2023). Nanostructured Li₂S cathodes for silicon-sulfur batteries. ACS Applied Materials and Interfaces. American Chemical Society. https://doi.org/10.1021/acsami.3c14072","chicago":"Mollania, Hamid, Chaoqi Zhang, Ruifeng Du, Xueqiang Qi, Junshan Li, Sharona Horta, Maria Ibáñez, et al. “Nanostructured Li₂S Cathodes for Silicon-Sulfur Batteries.” ACS Applied Materials and Interfaces. American Chemical Society, 2023. https://doi.org/10.1021/acsami.3c14072.","short":"H. Mollania, C. Zhang, R. Du, X. Qi, J. Li, S. Horta, M. Ibáñez, C. Keller, P. Chenevier, M. Oloomi-Buygi, A. Cabot, ACS Applied Materials and Interfaces 15 (2023) 58462–58475.","ieee":"H. Mollania et al., “Nanostructured Li₂S cathodes for silicon-sulfur batteries,” ACS Applied Materials and Interfaces, vol. 15, no. 50. American Chemical Society, pp. 58462–58475, 2023.","ama":"Mollania H, Zhang C, Du R, et al. Nanostructured Li₂S cathodes for silicon-sulfur batteries. ACS Applied Materials and Interfaces. 2023;15(50):58462–58475. doi:10.1021/acsami.3c14072","ista":"Mollania H, Zhang C, Du R, Qi X, Li J, Horta S, Ibáñez M, Keller C, Chenevier P, Oloomi-Buygi M, Cabot A. 2023. Nanostructured Li₂S cathodes for silicon-sulfur batteries. ACS Applied Materials and Interfaces. 15(50), 58462–58475.","mla":"Mollania, Hamid, et al. “Nanostructured Li₂S Cathodes for Silicon-Sulfur Batteries.” ACS Applied Materials and Interfaces, vol. 15, no. 50, American Chemical Society, 2023, pp. 58462–58475, doi:10.1021/acsami.3c14072."},"publication":"ACS Applied Materials and Interfaces","publication_identifier":{"issn":["1944-8244"],"eissn":["1944-8252"]},"external_id":{"isi":["001143038500001"],"pmid":["38052030"]},"date_published":"2023-12-05T00:00:00Z","isi":1,"date_updated":"2025-09-09T14:04:51Z","title":"Nanostructured Li₂S cathodes for silicon-sulfur batteries","publication_status":"published","abstract":[{"text":"Lithium–sulfur batteries are regarded as an advantageous option for meeting the growing demand for high-energy-density storage, but their commercialization relies on solving the current limitations of both sulfur cathodes and lithium metal anodes. In this scenario, the implementation of lithium sulfide (Li2S) cathodes compatible with alternative anode materials such as silicon has the potential to alleviate the safety concerns associated with lithium metal. In this direction, here, we report a sulfur cathode based on Li2S nanocrystals grown on a catalytic host consisting of CoFeP nanoparticles supported on tubular carbon nitride. Nanosized Li2S is incorporated into the host by a scalable liquid infiltration–evaporation method. Theoretical calculations and experimental results demonstrate that the CoFeP–CN composite can boost the polysulfide adsorption/conversion reaction kinetics and strongly reduce the initial overpotential activation barrier by stretching the Li–S bonds of Li2S. Besides, the ultrasmall size of the Li2S particles in the Li2S–CoFeP–CN composite cathode facilitates the initial activation. Overall, the Li2S–CoFeP–CN electrodes exhibit a low activation barrier of 2.56 V, a high initial capacity of 991 mA h gLi2S–1, and outstanding cyclability with a small fading rate of 0.029% per cycle over 800 cycles. Moreover, Si/Li2S full cells are assembled using the nanostructured Li2S–CoFeP–CN cathode and a prelithiated anode based on graphite-supported silicon nanowires. These Si/Li2S cells demonstrate high initial discharge capacities above 900 mA h gLi2S–1 and good cyclability with a capacity fading rate of 0.28% per cycle over 150 cycles.","lang":"eng"}],"quality_controlled":"1","issue":"50","day":"05","article_type":"original","publisher":"American Chemical Society","department":[{"_id":"MaIb"}],"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2023","page":"58462–58475","month":"12","oa_version":"None","status":"public","_id":"14719","intvolume":" 15","scopus_import":"1","doi":"10.1021/acsami.3c14072","date_created":"2023-12-31T23:01:03Z","volume":15,"author":[{"first_name":"Hamid","last_name":"Mollania","full_name":"Mollania, Hamid"},{"last_name":"Zhang","full_name":"Zhang, Chaoqi","first_name":"Chaoqi"},{"first_name":"Ruifeng","full_name":"Du, Ruifeng","last_name":"Du"},{"last_name":"Qi","full_name":"Qi, Xueqiang","first_name":"Xueqiang"},{"first_name":"Junshan","last_name":"Li","full_name":"Li, Junshan"},{"id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","first_name":"Sharona","last_name":"Horta","full_name":"Horta, Sharona"},{"full_name":"Ibáñez, Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"first_name":"Caroline","full_name":"Keller, Caroline","last_name":"Keller"},{"first_name":"Pascale","last_name":"Chenevier","full_name":"Chenevier, Pascale"},{"first_name":"Majid","last_name":"Oloomi-Buygi","full_name":"Oloomi-Buygi, Majid"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}]},{"intvolume":" 13950","scopus_import":"1","doi":"10.1007/978-3-031-47754-6_1","date_created":"2024-01-08T09:17:38Z","volume":13950,"main_file_link":[{"url":"https://eprint.iacr.org/2022/1554","open_access":"1"}],"author":[{"last_name":"Stefo","full_name":"Stefo, Christos","first_name":"Christos","id":"a20e8902-32b0-11ee-9fa8-b23fa638b793"},{"full_name":"Xiang, Zhuolun","last_name":"Xiang","first_name":"Zhuolun"},{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"}],"month":"12","oa":1,"status":"public","oa_version":"Preprint","_id":"14735","language":[{"iso":"eng"}],"year":"2023","page":"3-20","day":"01","publisher":"Springer Nature","department":[{"_id":"ElKo"},{"_id":"GradSch"}],"article_processing_charge":"No","date_published":"2023-12-01T00:00:00Z","isi":1,"external_id":{"isi":["001150222600001"]},"date_updated":"2025-09-09T14:07:16Z","project":[{"_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","name":"Security and Privacy by Design for Complex Systems","grant_number":"F8512"}],"title":"Executing and proving over dirty ledgers","publication_status":"published","abstract":[{"lang":"eng","text":"Scaling blockchain protocols to perform on par with the expected needs of Web3.0 has been proven to be a challenging task with almost a decade of research. In the forefront of the current solution is the idea of separating the execution of the updates encoded in a block from the ordering of blocks. In order to achieve this, a new class of protocols called rollups has emerged. Rollups have as input a total ordering of valid and invalid transactions and as output a new valid state-transition.\r\nIf we study rollups from a distributed computing perspective, we uncover that rollups take as input the output of a Byzantine Atomic Broadcast (BAB) protocol and convert it to a State Machine Replication (SMR) protocol. BAB and SMR, however, are considered equivalent as far as distributed computing is concerned and a solution to one can easily be retrofitted to solve the other simply by adding/removing an execution step before the validation of the input.\r\nThis “easy” step of retrofitting an atomic broadcast solution to implement an SMR has, however, been overlooked in practice. In this paper, we formalize the problem and show that after BAB is solved, traditional impossibility results for consensus no longer apply towards an SMR. Leveraging this we propose a distributed execution protocol that allows reduced execution and storage cost per executor (O(log2n/n)) without relaxing the network assumptions of the underlying BAB protocol and providing censorship-resistance. Finally, we propose efficient non-interactive light client constructions that leverage our efficient execution protocols and do not require any synchrony assumptions or expensive ZK-proofs."}],"quality_controlled":"1","publication_identifier":{"eissn":["0302-9743"],"isbn":["9783031477539"],"issn":["1611-3349"],"eisbn":["9783031477546"]},"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ieee":"C. Stefo, Z. Xiang, and E. Kokoris Kogias, “Executing and proving over dirty ledgers,” in 27th International Conference on Financial Cryptography and Data Security, Bol, Brac, Croatia, 2023, vol. 13950, pp. 3–20.","ama":"Stefo C, Xiang Z, Kokoris Kogias E. Executing and proving over dirty ledgers. In: 27th International Conference on Financial Cryptography and Data Security. Vol 13950. Springer Nature; 2023:3-20. doi:10.1007/978-3-031-47754-6_1","mla":"Stefo, Christos, et al. “Executing and Proving over Dirty Ledgers.” 27th International Conference on Financial Cryptography and Data Security, vol. 13950, Springer Nature, 2023, pp. 3–20, doi:10.1007/978-3-031-47754-6_1.","ista":"Stefo C, Xiang Z, Kokoris Kogias E. 2023. Executing and proving over dirty ledgers. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 3–20.","chicago":"Stefo, Christos, Zhuolun Xiang, and Eleftherios Kokoris Kogias. “Executing and Proving over Dirty Ledgers.” In 27th International Conference on Financial Cryptography and Data Security, 13950:3–20. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-47754-6_1.","apa":"Stefo, C., Xiang, Z., & Kokoris Kogias, E. (2023). Executing and proving over dirty ledgers. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 3–20). Bol, Brac, Croatia: Springer Nature. https://doi.org/10.1007/978-3-031-47754-6_1","short":"C. Stefo, Z. Xiang, E. Kokoris Kogias, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 3–20."},"publication":"27th International Conference on Financial Cryptography and Data Security","alternative_title":["LNCS"],"conference":{"name":"FC: Financial Cryptography and Data Security","location":"Bol, Brac, Croatia","start_date":"2023-05-01","end_date":"2023-05-05"},"type":"conference","acknowledgement":"Eleftherios Kokoris-Kogias is partially supported by Austrian Science Fund (FWF) grant No: F8512-N."},{"OA_type":"green","year":"2023","language":[{"iso":"eng"}],"page":"309-325","publisher":"Springer Nature","day":"01","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"doi":"10.1007/978-3-031-47754-6_18","scopus_import":"1","intvolume":" 13950","author":[{"last_name":"Bastankhah","full_name":"Bastankhah, Mahsa","first_name":"Mahsa"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Maddah-Ali, Mohammad Ali","last_name":"Maddah-Ali","first_name":"Mohammad Ali"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809","last_name":"Yeo","full_name":"Yeo, Michelle X"}],"main_file_link":[{"url":"https://openreview.net/forum?id=Dg0qdd9uha","open_access":"1"}],"volume":13950,"date_created":"2024-01-08T09:30:22Z","oa":1,"month":"12","_id":"14736","oa_version":"Submitted Version","status":"public","citation":{"short":"M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.","chicago":"Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-47754-6_18.","apa":"Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., & Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. https://doi.org/10.1007/978-3-031-47754-6_18","ista":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.","mla":"Bastankhah, Mahsa, et al. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” 27th International Conference on Financial Cryptography and Data Security, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:10.1007/978-3-031-47754-6_18.","ama":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. R2: Boosting liquidity in payment channel networks with online admission control. In: 27th International Conference on Financial Cryptography and Data Security. Vol 13950. Springer Nature; 2023:309-325. doi:10.1007/978-3-031-47754-6_18","ieee":"M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in 27th International Conference on Financial Cryptography and Data Security, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"27th International Conference on Financial Cryptography and Data Security","alternative_title":["LNCS"],"OA_place":"repository","type":"conference","acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","conference":{"name":"FC: Financial Cryptography and Data Security","location":"Bol, Brac, Croatia","start_date":"2023-05-01","end_date":"2023-05-05"},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"publication_status":"published","title":"R2: Boosting liquidity in payment channel networks with online admission control","date_updated":"2025-11-05T07:37:31Z","external_id":{"isi":["001150222600018"]},"date_published":"2023-12-01T00:00:00Z","isi":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks."}],"publication_identifier":{"isbn":["9783031477539"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783031477546"]},"ec_funded":1},{"citation":{"mla":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” International Mathematics Research Notices, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:10.1093/imrn/rnad210.","ista":"Ivanov G, Naszódi M. 2023. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023(23), 20613–20669.","ieee":"G. Ivanov and M. Naszódi, “Functional John and Löwner conditions for pairs of log-concave functions,” International Mathematics Research Notices, vol. 2023, no. 23. Oxford University Press, pp. 20613–20669, 2023.","ama":"Ivanov G, Naszódi M. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023;2023(23):20613-20669. doi:10.1093/imrn/rnad210","short":"G. Ivanov, M. Naszódi, International Mathematics Research Notices 2023 (2023) 20613–20669.","apa":"Ivanov, G., & Naszódi, M. (2023). Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnad210","chicago":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” International Mathematics Research Notices. Oxford University Press, 2023. https://doi.org/10.1093/imrn/rnad210."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"International Mathematics Research Notices","file":[{"checksum":"353666cea80633beb0f1ffd342dff6d4","relation":"main_file","content_type":"application/pdf","file_size":815777,"file_id":"14738","creator":"dernst","access_level":"open_access","success":1,"date_updated":"2024-01-08T09:53:09Z","file_name":"2023_IMRN_Ivanov.pdf","date_created":"2024-01-08T09:53:09Z"}],"acknowledgement":"We thank Alexander Litvak for the many discussions on Theorem 1.1. Igor Tsiutsiurupa participated in the early stage of this project. To our deep regret, Igor chose another road for his life and stopped working with us.\r\nThis work was supported by the János Bolyai Scholarship of the Hungarian Academy of Sciences [to M.N.]; the National Research, Development, and Innovation Fund (NRDI) [K119670 and K131529 to M.N.]; and the ÚNKP-22-5 New National Excellence Program of the Ministry for Innovation and Technology from the source of the NRDI [to M.N.].","type":"journal_article","title":"Functional John and Löwner conditions for pairs of log-concave functions","publication_status":"published","date_updated":"2025-09-09T14:08:25Z","isi":1,"tmp":{"image":"/images/cc_by_nc_nd.png","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)","short":"CC BY-NC-ND (4.0)"},"date_published":"2023-12-01T00:00:00Z","external_id":{"arxiv":["2212.11781"],"isi":["001184146800001"]},"abstract":[{"lang":"eng","text":"John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies."}],"quality_controlled":"1","corr_author":"1","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"arxiv":1,"year":"2023","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","keyword":["General Mathematics"],"page":"20613-20669","article_type":"original","publisher":"Oxford University Press","day":"01","issue":"23","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"UlWa"}],"doi":"10.1093/imrn/rnad210","scopus_import":"1","intvolume":" 2023","author":[{"last_name":"Ivanov","full_name":"Ivanov, Grigory","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"},{"first_name":"Márton","full_name":"Naszódi, Márton","last_name":"Naszódi"}],"volume":2023,"date_created":"2024-01-08T09:48:56Z","oa":1,"month":"12","file_date_updated":"2024-01-08T09:53:09Z","_id":"14737","ddc":["510"],"status":"public","oa_version":"Published Version"},{"quality_controlled":"1","abstract":[{"text":"Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing an organizational framework for these methods, we comprehensively benchmark them against three well-known classification tasks. Surprisingly, we discover that the best-performing method is a simple vectorization, which consists only of a few elementary summary statistics. Finally, we provide a convenient web application which has been designed to facilitate exploration and experimentation with various vectorization methods.","lang":"eng"}],"title":"A survey of vectorization methods in topological data analysis","publication_status":"published","date_updated":"2025-09-09T14:08:56Z","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"},"isi":1,"date_published":"2023-12-01T00:00:00Z","external_id":{"isi":["001104973300002"]},"publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","citation":{"chicago":"Ali, Dashti, Aras Asaad, Maria-Jose Jimenez, Vidit Nanda, Eduardo Paluzo-Hidalgo, and Manuel Soriano Trigueros. “A Survey of Vectorization Methods in Topological Data Analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2023. https://doi.org/10.1109/tpami.2023.3308391.","apa":"Ali, D., Asaad, A., Jimenez, M.-J., Nanda, V., Paluzo-Hidalgo, E., & Soriano Trigueros, M. (2023). A survey of vectorization methods in topological data analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/tpami.2023.3308391","short":"D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, M. Soriano Trigueros, IEEE Transactions on Pattern Analysis and Machine Intelligence 45 (2023) 14069–14080.","ieee":"D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, and M. Soriano Trigueros, “A survey of vectorization methods in topological data analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 12. IEEE, pp. 14069–14080, 2023.","ama":"Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M. A survey of vectorization methods in topological data analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2023;45(12):14069-14080. doi:10.1109/tpami.2023.3308391","ista":"Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M. 2023. A survey of vectorization methods in topological data analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 45(12), 14069–14080.","mla":"Ali, Dashti, et al. “A Survey of Vectorization Methods in Topological Data Analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 12, IEEE, 2023, pp. 14069–80, doi:10.1109/tpami.2023.3308391."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","acknowledgement":"The work of Maria-Jose Jimenez, Eduardo Paluzo-Hidalgo and Manuel Soriano-Trigueros was supported in part by the Spanish grant Ministerio de Ciencia e Innovacion under Grants TED2021-129438B-I00 and PID2019-107339GB-I00, and in part by REXASI-PRO H-EU project, call HORIZON-CL4-2021-HUMAN-01-01 under Grant 101070028. The work of\r\nMaria-Jose Jimenez was supported by a grant of Convocatoria de la Universidad de Sevilla para la recualificacion del sistema universitario español, 2021-23, funded by the European Union, NextGenerationEU. The work of Vidit Nanda was supported in part by EPSRC under Grant EP/R018472/1 and in part by US AFOSR under Grant FA9550-22-1-0462. \r\nWe are grateful to the team of GUDHI and TEASPOON developers, for their work and their support. We are also grateful to Streamlit for providing extra resources to deploy the web app\r\nonline on Streamlit community cloud. We thank the anonymous referees for their helpful suggestions.","file":[{"file_size":2370988,"file_id":"14740","checksum":"465c28ef0b151b4b1fb47977ed5581ab","relation":"main_file","content_type":"application/pdf","file_name":"2023_IEEEToP_Ali.pdf","date_created":"2024-01-08T10:09:14Z","access_level":"open_access","creator":"dernst","success":1,"date_updated":"2024-01-08T10:09:14Z"}],"author":[{"first_name":"Dashti","last_name":"Ali","full_name":"Ali, Dashti"},{"first_name":"Aras","last_name":"Asaad","full_name":"Asaad, Aras"},{"first_name":"Maria-Jose","full_name":"Jimenez, Maria-Jose","last_name":"Jimenez"},{"first_name":"Vidit","full_name":"Nanda, Vidit","last_name":"Nanda"},{"full_name":"Paluzo-Hidalgo, Eduardo","last_name":"Paluzo-Hidalgo","first_name":"Eduardo"},{"orcid":"0000-0003-2449-1433","full_name":"Soriano Trigueros, Manuel","last_name":"Soriano Trigueros","first_name":"Manuel","id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8"}],"volume":45,"date_created":"2024-01-08T09:59:46Z","doi":"10.1109/tpami.2023.3308391","scopus_import":"1","intvolume":" 45","_id":"14739","file_date_updated":"2024-01-08T10:09:14Z","ddc":["000"],"oa_version":"Published Version","status":"public","oa":1,"month":"12","keyword":["Applied Mathematics","Artificial Intelligence","Computational Theory and Mathematics","Computer Vision and Pattern Recognition","Software"],"page":"14069-14080","year":"2023","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","department":[{"_id":"HeEd"}],"publisher":"IEEE","article_type":"original","day":"01","issue":"12"},{"year":"2023","language":[{"iso":"eng"}],"keyword":["General Biochemistry","Genetics and Molecular Biology"],"article_type":"original","publisher":"Cold Spring Harbor Laboratory Press","issue":"11","day":"01","article_processing_charge":"No","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"doi":"10.1101/cshperspect.a041447","scopus_import":"1","intvolume":" 15","author":[{"first_name":"Kay","full_name":"Lucek, Kay","last_name":"Lucek"},{"first_name":"Mabel D.","full_name":"Giménez, Mabel D.","last_name":"Giménez"},{"last_name":"Joron","full_name":"Joron, Mathieu","first_name":"Mathieu"},{"last_name":"Rafajlović","full_name":"Rafajlović, Marina","first_name":"Marina"},{"first_name":"Jeremy B.","full_name":"Searle, Jeremy B.","last_name":"Searle"},{"full_name":"Walden, Nora","last_name":"Walden","first_name":"Nora"},{"full_name":"Westram, Anja M","last_name":"Westram","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/cshperspect.a041447"}],"volume":15,"date_created":"2024-01-08T12:43:48Z","oa":1,"month":"11","_id":"14742","oa_version":"Published Version","status":"public","article_number":"a041447","citation":{"ieee":"K. Lucek et al., “The impact of chromosomal rearrangements in speciation: From micro- to macroevolution,” Cold Spring Harbor Perspectives in Biology, vol. 15, no. 11. Cold Spring Harbor Laboratory Press, 2023.","ama":"Lucek K, Giménez MD, Joron M, et al. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. Cold Spring Harbor Perspectives in Biology. 2023;15(11). doi:10.1101/cshperspect.a041447","mla":"Lucek, Kay, et al. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” Cold Spring Harbor Perspectives in Biology, vol. 15, no. 11, a041447, Cold Spring Harbor Laboratory Press, 2023, doi:10.1101/cshperspect.a041447.","ista":"Lucek K, Giménez MD, Joron M, Rafajlović M, Searle JB, Walden N, Westram AM, Faria R. 2023. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. Cold Spring Harbor Perspectives in Biology. 15(11), a041447.","chicago":"Lucek, Kay, Mabel D. Giménez, Mathieu Joron, Marina Rafajlović, Jeremy B. Searle, Nora Walden, Anja M Westram, and Rui Faria. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory Press, 2023. https://doi.org/10.1101/cshperspect.a041447.","apa":"Lucek, K., Giménez, M. D., Joron, M., Rafajlović, M., Searle, J. B., Walden, N., … Faria, R. (2023). The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/cshperspect.a041447","short":"K. Lucek, M.D. Giménez, M. Joron, M. Rafajlović, J.B. Searle, N. Walden, A.M. Westram, R. Faria, Cold Spring Harbor Perspectives in Biology 15 (2023)."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"publication":"Cold Spring Harbor Perspectives in Biology","type":"journal_article","acknowledgement":"K.L. was funded by a Swiss National Science Foundation Eccellenza project: The evolution of strong reproductive barriers towards the completion of speciation (PCEFP3_202869). R.F.\r\nwas funded by an FCT CEEC (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao\r\nEmprego Científico) contract (2020.00275. CEECIND) and by an FCT research project\r\n(PTDC/BIA-EVL/1614/2021). M.R. was funded by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243). A.M.W. was partly funded by the Norwegian Research Council RCN. We thank Luis Silva for his help preparing Figure 1. We are grateful to Maren Wellenreuther, Daniel Bolnick, and two anonymous reviewers for their constructive feedback on an earlier version of this paper.","publication_status":"published","title":"The impact of chromosomal rearrangements in speciation: From micro- to macroevolution","date_updated":"2025-09-09T14:09:32Z","external_id":{"pmid":["37604585"],"isi":["001096272600001"]},"date_published":"2023-11-01T00:00:00Z","isi":1,"quality_controlled":"1","abstract":[{"text":"Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics.\r\nWhile an important role for CRs in speciation has been suggested, evidence primarily stems\r\nfrom theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon\r\npairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at\r\na macroevolutionary level has been supported by associations between species diversity and\r\nrates of evolution of CRs across phylogenies, these findings are limited to a restricted range of\r\nCRs and taxa. Now that more broadly applicable and precise CR detection approaches have\r\nbecome available, we address the challenges in filling some of the conceptual and empirical\r\ngaps between micro- and macroevolutionary studies on the role of CRs in speciation. We\r\nsynthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life.","lang":"eng"}],"publication_identifier":{"issn":["1943-0264"]}},{"date_created":"2024-01-08T12:54:35Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3600006.3613150"}],"author":[{"full_name":"Tennage, Pasindu","last_name":"Tennage","first_name":"Pasindu"},{"full_name":"Basescu, Cristina","last_name":"Basescu","first_name":"Cristina"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"},{"first_name":"Ewa","last_name":"Syta","full_name":"Syta, Ewa"},{"full_name":"Jovanovic, Philipp","last_name":"Jovanovic","first_name":"Philipp"},{"first_name":"Vero","last_name":"Estrada-Galinanes","full_name":"Estrada-Galinanes, Vero"},{"last_name":"Ford","full_name":"Ford, Bryan","first_name":"Bryan"}],"scopus_import":"1","doi":"10.1145/3600006.3613150","oa_version":"Published Version","status":"public","_id":"14743","month":"10","oa":1,"page":"281-297","language":[{"iso":"eng"}],"year":"2023","department":[{"_id":"ElKo"}],"article_processing_charge":"No","day":"01","publisher":"Association for Computing Machinery","quality_controlled":"1","abstract":[{"text":"Leader-based consensus algorithms are fast and efficient under normal conditions, but lack robustness to adverse conditions due to their reliance on timeouts for liveness. We present QuePaxa, the first protocol offering state-of-the-art normal-case efficiency without depending on timeouts. QuePaxa uses a novel randomized asynchronous consensus core to tolerate adverse conditions such as denial-of-service (DoS) attacks, while a one-round-trip fast path preserves the normal-case efficiency of Multi-Paxos or Raft. By allowing simultaneous proposers without destructive interference, and using short hedging delays instead of conservative timeouts to limit redundant effort, QuePaxa permits rapid recovery after leader failure without risking costly view changes due to false timeouts. By treating leader choice and hedging delay as a multi-armed-bandit optimization, QuePaxa achieves responsiveness to prevalent conditions, and can choose the best leader even if the current one has not failed. Experiments with a prototype confirm that QuePaxa achieves normal-case LAN and WAN performance of 584k and 250k cmd/sec in throughput, respectively, comparable to Multi-Paxos. Under conditions such as DoS attacks, misconfigurations, or slow leaders that severely impact existing protocols, we find that QuePaxa remains live with median latency under 380ms in WAN experiments.","lang":"eng"}],"isi":1,"external_id":{"isi":["001135072900018"]},"date_published":"2023-10-01T00:00:00Z","date_updated":"2025-09-09T14:10:09Z","title":"QuePaxa: Escaping the tyranny of timeouts in consensus","publication_status":"published","publication_identifier":{"isbn":["9798400702297"]},"publication":"Proceedings of the 29th Symposium on Operating Systems Principles","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"chicago":"Tennage, Pasindu, Cristina Basescu, Eleftherios Kokoris Kogias, Ewa Syta, Philipp Jovanovic, Vero Estrada-Galinanes, and Bryan Ford. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” In Proceedings of the 29th Symposium on Operating Systems Principles, 281–97. Association for Computing Machinery, 2023. https://doi.org/10.1145/3600006.3613150.","apa":"Tennage, P., Basescu, C., Kokoris Kogias, E., Syta, E., Jovanovic, P., Estrada-Galinanes, V., & Ford, B. (2023). QuePaxa: Escaping the tyranny of timeouts in consensus. In Proceedings of the 29th Symposium on Operating Systems Principles (pp. 281–297). Koblenz, Germany: Association for Computing Machinery. https://doi.org/10.1145/3600006.3613150","short":"P. Tennage, C. Basescu, E. Kokoris Kogias, E. Syta, P. Jovanovic, V. Estrada-Galinanes, B. Ford, in:, Proceedings of the 29th Symposium on Operating Systems Principles, Association for Computing Machinery, 2023, pp. 281–297.","ama":"Tennage P, Basescu C, Kokoris Kogias E, et al. QuePaxa: Escaping the tyranny of timeouts in consensus. In: Proceedings of the 29th Symposium on Operating Systems Principles. Association for Computing Machinery; 2023:281-297. doi:10.1145/3600006.3613150","ieee":"P. Tennage et al., “QuePaxa: Escaping the tyranny of timeouts in consensus,” in Proceedings of the 29th Symposium on Operating Systems Principles, Koblenz, Germany, 2023, pp. 281–297.","mla":"Tennage, Pasindu, et al. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” Proceedings of the 29th Symposium on Operating Systems Principles, Association for Computing Machinery, 2023, pp. 281–97, doi:10.1145/3600006.3613150.","ista":"Tennage P, Basescu C, Kokoris Kogias E, Syta E, Jovanovic P, Estrada-Galinanes V, Ford B. 2023. QuePaxa: Escaping the tyranny of timeouts in consensus. Proceedings of the 29th Symposium on Operating Systems Principles. SOSP: Symposium on Operating Systems Principles, 281–297."},"conference":{"start_date":"2023-10-23","location":"Koblenz, Germany","end_date":"2023-10-26","name":"SOSP: Symposium on Operating Systems Principles"},"type":"conference","acknowledgement":"The authors would like to thank Marcos K. Aguilera, Pierluca Borsò, Aleksey Charapko, Rachid Guerraoui, Jovan Komatovic, Derek Leung, Louis-Henri Merino, Shailesh Mishra, Haochen Pan, Rodrigo Rodrigues, Lewis Tseng, and Haoqian Zhang for their helpful feedback on early drafts of this paper."},{"publication":"Publications mathématiques de Besançon - Algèbre et Théorie des nombres","citation":{"short":"A. Guilloux, T. Horesh, Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres 2023 (2023) 85–107.","chicago":"Guilloux, Antonin, and Tal Horesh. “P-Adic Directions of Primitive Vectors.” Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres. Presses Universitaires de Franche-Comté, 2023. https://doi.org/10.5802/pmb.50.","apa":"Guilloux, A., & Horesh, T. (2023). p-adic directions of primitive vectors. Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres. Presses Universitaires de Franche-Comté. https://doi.org/10.5802/pmb.50","ista":"Guilloux A, Horesh T. 2023. p-adic directions of primitive vectors. Publications mathématiques de Besançon - Algèbre et Théorie des nombres. 2023, 85–107.","mla":"Guilloux, Antonin, and Tal Horesh. “P-Adic Directions of Primitive Vectors.” Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres, vol. 2023, Presses Universitaires de Franche-Comté, 2023, pp. 85–107, doi:10.5802/pmb.50.","ieee":"A. Guilloux and T. Horesh, “p-adic directions of primitive vectors,” Publications mathématiques de Besançon - Algèbre et Théorie des nombres, vol. 2023. Presses Universitaires de Franche-Comté, pp. 85–107, 2023.","ama":"Guilloux A, Horesh T. p-adic directions of primitive vectors. Publications mathématiques de Besançon - Algèbre et Théorie des nombres. 2023;2023:85-107. doi:10.5802/pmb.50"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","acknowledgement":"The second author is supported by EPRSC grant EP/P026710/1.","file":[{"file_id":"18186","file_size":1399390,"checksum":"cefc47a2cf55a87f8e4960197f73353b","relation":"main_file","content_type":"application/pdf","file_name":"2023_MathBesancon_Guilloux.pdf","date_created":"2024-10-07T11:32:32Z","creator":"dernst","access_level":"open_access","date_updated":"2024-10-07T11:32:32Z","success":1}],"abstract":[{"text":"Linnik type problems concern the distribution of projections of integral points on the unit sphere as their norm increases, and different generalizations of this phenomenon. Our work addresses a question of this type: we prove the uniform distribution of the projections of primitive Z2 points in the p-adic unit sphere, as their (real) norm tends to infinity. The proof is via counting lattice points in semi-simple S-arithmetic groups.","lang":"eng"},{"lang":"fre","text":"Les problèmes de type Linnik concernent la distribution des projections des points entiers sur la sphère unitaire lorsque leur norme augmente et différentes généralisations de ce phénomène. Notre travail s’intéresse à une question de ce type : nous prouvons la distribution uniforme des projections des points primitifs de Z2 sur la sphère unitaire p-adique lorsque leur norme (réelle) tend vers l’infini. La preuve se fait en comptant les points d’un réseau dans des S-groupes arithmétiques semi-simples."}],"quality_controlled":"1","title":"p-adic directions of primitive vectors","project":[{"_id":"26A8D266-B435-11E9-9278-68D0E5697425","name":"Between rational and integral points","grant_number":"EP-P026710-2"}],"publication_status":"published","date_updated":"2025-04-14T09:25:44Z","external_id":{"arxiv":["2103.10889"]},"tmp":{"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","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png"},"date_published":"2023-06-15T00:00:00Z","arxiv":1,"corr_author":"1","publication_identifier":{"eissn":["2592-6616"],"issn":["2804-8504"]},"license":"https://creativecommons.org/licenses/by-nd/4.0/","page":"85-107","year":"2023","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","department":[{"_id":"TiBr"}],"publisher":"Presses Universitaires de Franche-Comté","article_type":"original","day":"15","author":[{"first_name":"Antonin","last_name":"Guilloux","full_name":"Guilloux, Antonin"},{"first_name":"Tal","id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","full_name":"Horesh, Tal","last_name":"Horesh"}],"volume":2023,"date_created":"2024-10-06T22:01:13Z","doi":"10.5802/pmb.50","scopus_import":"1","intvolume":" 2023","_id":"18179","file_date_updated":"2024-10-07T11:32:32Z","ddc":["510"],"status":"public","oa_version":"Published Version","oa":1,"month":"06"},{"status":"public","oa_version":"Published Version","ddc":["550"],"_id":"18634","oa":1,"corr_author":"1","month":"06","abstract":[{"text":"There are 4 tar.xz files with the result of the model for the paper: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. ","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8005258"}],"author":[{"full_name":"Muñoz Hermosilla, José M","last_name":"Muñoz Hermosilla","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e","first_name":"José M"}],"related_material":{"record":[{"id":"18628","relation":"research_data","status":"public"}]},"date_created":"2024-12-09T09:33:07Z","date_updated":"2024-12-09T09:43:47Z","doi":"10.5281/ZENODO.8005257","title":"A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen","date_published":"2023-06-05T00:00:00Z","type":"research_data_reference","OA_place":"repository","article_processing_charge":"No","department":[{"_id":"FrPe"}],"publisher":"Zenodo","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. M. Muñoz Hermosilla, “A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen.” Zenodo, 2023.","ama":"Muñoz Hermosilla JM. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen. 2023. doi:10.5281/ZENODO.8005257","ista":"Muñoz Hermosilla JM. 2023. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Zenodo, 10.5281/ZENODO.8005257.","mla":"Muñoz Hermosilla, José M. A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen. Zenodo, 2023, doi:10.5281/ZENODO.8005257.","chicago":"Muñoz Hermosilla, José M. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8005257.","apa":"Muñoz Hermosilla, J. M. (2023). A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen. Zenodo. https://doi.org/10.5281/ZENODO.8005257","short":"J.M. Muñoz Hermosilla, (2023)."},"year":"2023"},{"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"corr_author":"1","ec_funded":1,"date_updated":"2025-04-14T07:44:00Z","title":"Local criteria for triangulating general manifolds","publication_status":"published","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"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"},"date_published":"2023-01-01T00:00:00Z","isi":1,"external_id":{"isi":["000862193600001"]},"abstract":[{"text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.","lang":"eng"}],"quality_controlled":"1","file":[{"file_id":"12488","file_size":582850,"relation":"main_file","content_type":"application/pdf","checksum":"46352e0ee71e460848f88685ca852681","file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf","date_created":"2023-02-02T11:01:10Z","date_updated":"2023-02-02T11:01:10Z","success":1,"creator":"dernst","access_level":"open_access"}],"acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7.","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7"},"publication":"Discrete & Computational Geometry","oa":1,"month":"01","status":"public","oa_version":"Published Version","_id":"12287","ddc":["510"],"file_date_updated":"2023-02-02T11:01:10Z","scopus_import":"1","doi":"10.1007/s00454-022-00431-7","intvolume":" 69","author":[{"first_name":"Jean-Daniel","last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel"},{"first_name":"Ramsay","full_name":"Dyer, Ramsay","last_name":"Dyer"},{"first_name":"Arijit","last_name":"Ghosh","full_name":"Ghosh, Arijit"},{"last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"date_created":"2023-01-16T10:04:06Z","volume":69,"publisher":"Springer Nature","article_type":"original","day":"01","has_accepted_license":"1","article_processing_charge":"No","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"year":"2023","page":"156-191","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"]},{"author":[{"first_name":"Matteo","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306","full_name":"Verzobio, Matteo","last_name":"Verzobio"}],"volume":325,"date_created":"2023-01-16T11:46:19Z","doi":"10.2140/pjm.2023.325.331","scopus_import":"1","intvolume":" 325","ddc":["510"],"_id":"12313","file_date_updated":"2023-11-13T09:50:41Z","oa_version":"Published Version","status":"public","oa":1,"month":"11","page":"331-351","year":"2023","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","department":[{"_id":"TiBr"}],"article_type":"original","publisher":"Mathematical Sciences Publishers","issue":"2","day":"03","quality_controlled":"1","abstract":[{"lang":"eng","text":"Let P be a nontorsion point on an elliptic curve defined over a number field K and consider the sequence {Bn}n∈N of the denominators of x(nP). We prove that every term of the sequence of the Bn has a primitive divisor for n greater than an effectively computable constant that we will explicitly compute. This constant will depend only on the model defining the curve."}],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413"}],"publication_status":"published","title":"Some effectivity results for primitive divisors of elliptic divisibility sequences","date_updated":"2025-04-14T07:54:54Z","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"},"date_published":"2023-11-03T00:00:00Z","external_id":{"arxiv":["2001.02987"],"isi":["001104766900001"]},"isi":1,"ec_funded":1,"arxiv":1,"corr_author":"1","publication_identifier":{"eissn":["0030-8730"]},"publication":"Pacific Journal of Mathematics","citation":{"mla":"Verzobio, Matteo. “Some Effectivity Results for Primitive Divisors of Elliptic Divisibility Sequences.” Pacific Journal of Mathematics, vol. 325, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–51, doi:10.2140/pjm.2023.325.331.","ista":"Verzobio M. 2023. Some effectivity results for primitive divisors of elliptic divisibility sequences. Pacific Journal of Mathematics. 325(2), 331–351.","ama":"Verzobio M. Some effectivity results for primitive divisors of elliptic divisibility sequences. Pacific Journal of Mathematics. 2023;325(2):331-351. doi:10.2140/pjm.2023.325.331","ieee":"M. Verzobio, “Some effectivity results for primitive divisors of elliptic divisibility sequences,” Pacific Journal of Mathematics, vol. 325, no. 2. Mathematical Sciences Publishers, pp. 331–351, 2023.","short":"M. Verzobio, Pacific Journal of Mathematics 325 (2023) 331–351.","chicago":"Verzobio, Matteo. “Some Effectivity Results for Primitive Divisors of Elliptic Divisibility Sequences.” Pacific Journal of Mathematics. Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/pjm.2023.325.331.","apa":"Verzobio, M. (2023). Some effectivity results for primitive divisors of elliptic divisibility sequences. Pacific Journal of Mathematics. Mathematical Sciences Publishers. https://doi.org/10.2140/pjm.2023.325.331"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This paper is part of the author’s PhD thesis at Università of Pisa. Moreover, this\r\nproject has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement\r\nNo. 101034413. I thank the referee for many helpful comments.","type":"journal_article","file":[{"file_id":"14525","file_size":389897,"relation":"main_file","content_type":"application/pdf","checksum":"b6218d16a72742d8bb38d6fc3c9bb8c6","file_name":"2023_PacificJourMaths_Verzobio.pdf","date_created":"2023-11-13T09:50:41Z","success":1,"date_updated":"2023-11-13T09:50:41Z","creator":"dernst","access_level":"open_access"}]},{"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"},"date_published":"2023-01-10T00:00:00Z","isi":1,"title":"New approaches to epidemic modeling on networks","publication_status":"published","date_updated":"2024-10-09T21:03:29Z","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"}],"quality_controlled":"1","corr_author":"1","publication_identifier":{"eissn":["2045-2322"]},"citation":{"short":"A. Gómez, G. Oliveira, Scientific Reports 13 (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","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.","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.","ista":"Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks. Scientific Reports. 13, 468.","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."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication":"Scientific Reports","file":[{"date_created":"2023-01-23T07:53:23Z","file_name":"2023_ScientificReports_Gomez.pdf","access_level":"open_access","creator":"dernst","date_updated":"2023-01-23T07:53:23Z","success":1,"file_size":2167792,"file_id":"12336","checksum":"a8b83739f4a951e83e0b2a778f03b327","content_type":"application/pdf","relation":"main_file"}],"type":"journal_article","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.","intvolume":" 13","doi":"10.1038/s41598-022-19827-9","scopus_import":"1","volume":13,"date_created":"2023-01-22T23:00:55Z","author":[{"full_name":"Gómez, Arturo","last_name":"Gómez","first_name":"Arturo"},{"first_name":"Goncalo","id":"58abbde8-f455-11eb-a497-98c8fd71b905","full_name":"Oliveira, Goncalo","last_name":"Oliveira"}],"month":"01","oa":1,"article_number":"468","file_date_updated":"2023-01-23T07:53:23Z","_id":"12329","ddc":["510"],"status":"public","oa_version":"Published Version","year":"2023","language":[{"iso":"eng"}],"day":"10","article_type":"original","publisher":"Springer Nature","department":[{"_id":"TaHa"}],"article_processing_charge":"No","has_accepted_license":"1"},{"quality_controlled":"1","abstract":[{"lang":"eng","text":"The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads."}],"isi":1,"date_published":"2023-09-01T00:00:00Z","external_id":{"isi":["000913424000001"],"arxiv":["2008.01009"]},"date_updated":"2023-08-14T12:54:32Z","title":"The splay-list: A distribution-adaptive concurrent skip-list","publication_status":"published","arxiv":1,"publication_identifier":{"eissn":["1432-0452"],"issn":["0178-2770"]},"publication":"Distributed Computing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 395–418, doi:10.1007/s00446-022-00441-x.","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2023. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 36, 395–418.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” Distributed Computing, vol. 36. Springer Nature, pp. 395–418, 2023.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 2023;36:395-418. doi:10.1007/s00446-022-00441-x","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing 36 (2023) 395–418.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2023). The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-022-00441-x","chicago":"Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x."},"type":"journal_article","date_created":"2023-01-22T23:00:55Z","volume":36,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2008.01009","open_access":"1"}],"author":[{"last_name":"Aksenov","full_name":"Aksenov, Vitalii","first_name":"Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Drozdova, Alexandra","last_name":"Drozdova","first_name":"Alexandra"},{"first_name":"Amirkeivan","full_name":"Mohtashami, Amirkeivan","last_name":"Mohtashami"}],"intvolume":" 36","scopus_import":"1","doi":"10.1007/s00446-022-00441-x","status":"public","oa_version":"Preprint","_id":"12330","month":"09","oa":1,"page":"395-418","language":[{"iso":"eng"}],"year":"2023","department":[{"_id":"DaAl"}],"article_processing_charge":"No","day":"01","publisher":"Springer Nature","article_type":"original"},{"project":[{"_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications","grant_number":"M02889"}],"title":"Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe","publication_status":"published","date_updated":"2025-04-23T08:47:37Z","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"},"isi":1,"external_id":{"isi":["000914749700001"],"pmid":["36711054"]},"date_published":"2023-01-24T00:00:00Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance."}],"corr_author":"1","publication_identifier":{"eissn":["1520-5002"],"issn":["0897-4756"]},"citation":{"short":"S. Wang, C. Chang, S. Bai, B. Qin, Y. Zhu, S. Zhan, J. Zheng, S. Tang, L.D. Zhao, Chemistry of Materials 35 (2023) 755–763.","apa":"Wang, S., Chang, C., Bai, S., Qin, B., Zhu, Y., Zhan, S., … Zhao, L. D. (2023). Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/acs.chemmater.2c03542","chicago":"Wang, Siqi, Cheng Chang, Shulin Bai, Bingchao Qin, Yingcai Zhu, Shaoping Zhan, Junqing Zheng, Shuwei Tang, and Li Dong Zhao. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” Chemistry of Materials. American Chemical Society, 2023. https://doi.org/10.1021/acs.chemmater.2c03542.","mla":"Wang, Siqi, et al. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” Chemistry of Materials, vol. 35, no. 2, American Chemical Society, 2023, pp. 755–63, doi:10.1021/acs.chemmater.2c03542.","ista":"Wang S, Chang C, Bai S, Qin B, Zhu Y, Zhan S, Zheng J, Tang S, Zhao LD. 2023. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 35(2), 755–763.","ama":"Wang S, Chang C, Bai S, et al. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 2023;35(2):755-763. doi:10.1021/acs.chemmater.2c03542","ieee":"S. Wang et al., “Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe,” Chemistry of Materials, vol. 35, no. 2. American Chemical Society, pp. 755–763, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"publication":"Chemistry of Materials","file":[{"file_id":"14055","file_size":2961043,"content_type":"application/pdf","relation":"main_file","checksum":"b21dca2aa7a80c068bc256bdd1fea9df","date_created":"2023-08-14T12:57:25Z","file_name":"2023_ChemistryMaterials_Wang.pdf","success":1,"date_updated":"2023-08-14T12:57:25Z","access_level":"open_access","creator":"dernst"}],"type":"journal_article","acknowledgement":"The National Key Research and Development Program of China (2018YFA0702100), the Basic Science Center Project of the National Natural Science Foundation of China (51788104), the National Natural Science Foundation of China (51571007 and 51772012), the Beijing Natural Science Foundation (JQ18004), the 111 Project (B17002), the National Science Fund for Distinguished Young Scholars (51925101), and the FWF “Lise Meitner Fellowship” (grant agreement M2889-N). Open Access is funded by the Austrian Science Fund (FWF).","doi":"10.1021/acs.chemmater.2c03542","scopus_import":"1","intvolume":" 35","author":[{"full_name":"Wang, Siqi","last_name":"Wang","first_name":"Siqi"},{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","first_name":"Cheng","last_name":"Chang","full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277"},{"last_name":"Bai","full_name":"Bai, Shulin","first_name":"Shulin"},{"first_name":"Bingchao","last_name":"Qin","full_name":"Qin, Bingchao"},{"first_name":"Yingcai","last_name":"Zhu","full_name":"Zhu, Yingcai"},{"first_name":"Shaoping","last_name":"Zhan","full_name":"Zhan, Shaoping"},{"last_name":"Zheng","full_name":"Zheng, Junqing","first_name":"Junqing"},{"last_name":"Tang","full_name":"Tang, Shuwei","first_name":"Shuwei"},{"first_name":"Li Dong","last_name":"Zhao","full_name":"Zhao, Li Dong"}],"volume":35,"date_created":"2023-01-22T23:00:55Z","oa":1,"month":"01","ddc":["540"],"_id":"12331","file_date_updated":"2023-08-14T12:57:25Z","oa_version":"Published Version","status":"public","year":"2023","language":[{"iso":"eng"}],"page":"755-763","publisher":"American Chemical Society","article_type":"original","day":"24","issue":"2","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"MaIb"}]}]