[{"file_date_updated":"2024-08-12T08:51:44Z","conference":{"location":"Berlin/Potsdam, Germany","end_date":"2022-09-09","name":"ESA: European Symposium on Algorithms","start_date":"2022-09-05"},"doi":"10.4230/LIPIcs.ESA.2022.3","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"g Anna Lubiw: Supported by the Natural Sciences and Engineering Research Council of\r\nCanada (NSERC). Jayson Lynch: Supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). Zuzana Masárová: Supported by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Virginia Vassilevska Williams: Supported by an NSF CAREER Award, NSF Grants CCF-1528078, CCF-1514339 and CCF-1909429, a BSF Grant BSF:2012338, a Google Research Fellowship and a Sloan Research Fellowship.\r\nNicole Wein: Supported by a grant to DIMACS from the Simons Foundation (820931). This work was done while the author was at MIT.\r\nThis research was initiated at the 34th Bellairs Winter Workshop on Computational Geometry, co-organized by Erik Demaine and Godfried Toussaint, held on March 22–29,\r\n2019 in Holetown, Barbados. We thank the other participants of that workshop for providing a\r\nstimulating research environment.","license":"https://creativecommons.org/licenses/by/4.0/","article_number":"3","day":"01","citation":{"apa":"Aichholzer, O., Demaine, E. D., Korman, M., Lubiw, A., Lynch, J., Masárová, Z., … Wein, N. (2022). Hardness of token swapping on trees. In <i>30th Annual European Symposium on Algorithms</i> (Vol. 244). Berlin/Potsdam, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">https://doi.org/10.4230/LIPIcs.ESA.2022.3</a>","ama":"Aichholzer O, Demaine ED, Korman M, et al. Hardness of token swapping on trees. In: <i>30th Annual European Symposium on Algorithms</i>. Vol 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">10.4230/LIPIcs.ESA.2022.3</a>","ista":"Aichholzer O, Demaine ED, Korman M, Lubiw A, Lynch J, Masárová Z, Rudoy M, Vassilevska Williams V, Wein N. 2022. Hardness of token swapping on trees. 30th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 244, 3.","chicago":"Aichholzer, Oswin, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein. “Hardness of Token Swapping on Trees.” In <i>30th Annual European Symposium on Algorithms</i>, Vol. 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">https://doi.org/10.4230/LIPIcs.ESA.2022.3</a>.","mla":"Aichholzer, Oswin, et al. “Hardness of Token Swapping on Trees.” <i>30th Annual European Symposium on Algorithms</i>, vol. 244, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">10.4230/LIPIcs.ESA.2022.3</a>.","ieee":"O. Aichholzer <i>et al.</i>, “Hardness of token swapping on trees,” in <i>30th Annual European Symposium on Algorithms</i>, Berlin/Potsdam, Germany, 2022, vol. 244.","short":"O. Aichholzer, E.D. Demaine, M. Korman, A. Lubiw, J. Lynch, Z. Masárová, M. Rudoy, V. Vassilevska Williams, N. Wein, in:, 30th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"alternative_title":["LIPIcs"],"file":[{"creator":"dernst","checksum":"a1fbd3e7baad510fbcb998cf4a7d9f7f","access_level":"open_access","date_updated":"2024-08-12T08:51:44Z","file_name":"2022_LIPIcS_Aichholzer.pdf","date_created":"2024-08-12T08:51:44Z","relation":"main_file","content_type":"application/pdf","file_size":1406071,"success":1,"file_id":"17420"}],"corr_author":"1","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"quality_controlled":"1","publication_status":"published","type":"conference","publication":"30th Annual European Symposium on Algorithms","ddc":["510"],"has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"Yes","language":[{"iso":"eng"}],"status":"public","month":"09","scopus_import":"1","title":"Hardness of token swapping on trees","date_published":"2022-09-01T00:00:00Z","year":"2022","_id":"17084","intvolume":"       244","date_updated":"2025-04-15T07:16:56Z","date_created":"2024-05-29T06:27:16Z","author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"first_name":"Erik D.","last_name":"Demaine","full_name":"Demaine, Erik D."},{"last_name":"Korman","first_name":"Matias","full_name":"Korman, Matias"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"full_name":"Lynch, Jayson","first_name":"Jayson","last_name":"Lynch"},{"orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mikhail","last_name":"Rudoy","full_name":"Rudoy, Mikhail"},{"last_name":"Vassilevska Williams","first_name":"Virginia","full_name":"Vassilevska Williams, Virginia"},{"full_name":"Wein, Nicole","last_name":"Wein","first_name":"Nicole"}],"project":[{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Published Version","arxiv":1,"abstract":[{"lang":"eng","text":"Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which exchanges the tokens at the two endpoints of an edge of the graph. In parallel token swapping, the goal is to use the fewest rounds, each of which consists of one or more swaps on the edges of a matching. We prove that both of these problems remain NP-hard when the graph is restricted to be a tree. These token swapping problems have been studied by disparate groups of researchers in discrete mathematics, theoretical computer science, robot motion planning, game theory, and engineering. Previous work establishes NP-completeness on general graphs (for both problems), constant-factor approximation algorithms, and some poly-time exact algorithms for simple graph classes such as cliques, stars, paths, and cycles. Sequential and parallel token swapping on trees were first studied over thirty years ago (as \"sorting with a transposition tree\") and over twenty-five years ago (as \"routing permutations via matchings\"), yet their complexities were previously unknown. We also show limitations on approximation of sequential token swapping on trees: we identify a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is 2) and show that no such algorithm can achieve an approximation factor less than 2."}],"oa":1,"volume":244,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2103.06707"]}},{"project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"}],"publication_status":"published","editor":[{"first_name":"Ibrokhim Y.","last_name":"Abdurakhmonov","full_name":"Abdurakhmonov, Ibrokhim Y."}],"type":"book_chapter","date_created":"2024-05-29T06:35:13Z","quality_controlled":"1","author":[{"last_name":"Floriach-Clark","first_name":"Jordi","full_name":"Floriach-Clark, Jordi"},{"id":"19BDF720-25A0-11EA-AC6E-928F3DDC885E","first_name":"Han","last_name":"Tang","orcid":"0000-0001-6152-6637","full_name":"Tang, Han"},{"first_name":"Viola","last_name":"Willemsen","full_name":"Willemsen, Viola"}],"publication_identifier":{"isbn":["9781839697500"]},"department":[{"_id":"JiFr"}],"date_updated":"2025-05-14T11:20:40Z","publisher":"IntechOpen","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication":"Model Organisms in Plant Genetics","abstract":[{"text":"Mosses are a cosmopolitan group of land plants, sister to vascular plants, with a high potential for molecular and cell biological research. The species Physcomitrium patens has helped gaining better understanding of the biological processes of the plant cell, and it has become a central system to understand water-to-land plant transition through 2D-to-3D growth transition, regulation of asymmetric cell division, shoot apical cell establishment and maintenance, phyllotaxis and regeneration. P. patens was the first fully sequenced moss in 2008, with the latest annotated release in 2018. It has been shown that many gene functions and networks are conserved in mosses when compared to angiosperms. Importantly, this model organism has a simplified and accessible body structure that facilitates close tracking in time and space with the support of live cell imaging set-ups and multiple reporter lines. This has become possible thanks to its fully established molecular toolkit, with highly efficient PEG-assisted, CRISPR/Cas9 and RNAi transformation and silencing protocols, among others. Here we provide examples on how mosses exhibit advantages over vascular plants to study several processes and their future potential to answer some other outstanding questions in plant cell biology.","lang":"eng"}],"oa_version":"Published Version","status":"public","ec_funded":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","day":"23","_id":"17085","citation":{"short":"J. Floriach-Clark, H. Tang, V. Willemsen, in:, I.Y. Abdurakhmonov (Ed.), Model Organisms in Plant Genetics, IntechOpen, 2022.","ieee":"J. Floriach-Clark, H. Tang, and V. Willemsen, “Mosses: Accessible Systems for Plant Development Studies,” in <i>Model Organisms in Plant Genetics</i>, I. Y. Abdurakhmonov, Ed. IntechOpen, 2022.","mla":"Floriach-Clark, Jordi, et al. “Mosses: Accessible Systems for Plant Development Studies.” <i>Model Organisms in Plant Genetics</i>, edited by Ibrokhim Y. Abdurakhmonov, IntechOpen, 2022, doi:<a href=\"https://doi.org/10.5772/intechopen.100535\">10.5772/intechopen.100535</a>.","chicago":"Floriach-Clark, Jordi, Han Tang, and Viola Willemsen. “Mosses: Accessible Systems for Plant Development Studies.” In <i>Model Organisms in Plant Genetics</i>, edited by Ibrokhim Y. Abdurakhmonov. IntechOpen, 2022. <a href=\"https://doi.org/10.5772/intechopen.100535\">https://doi.org/10.5772/intechopen.100535</a>.","ista":"Floriach-Clark J, Tang H, Willemsen V. 2022.Mosses: Accessible Systems for Plant Development Studies. In: Model Organisms in Plant Genetics. .","apa":"Floriach-Clark, J., Tang, H., &#38; Willemsen, V. (2022). Mosses: Accessible Systems for Plant Development Studies. In I. Y. Abdurakhmonov (Ed.), <i>Model Organisms in Plant Genetics</i>. IntechOpen. <a href=\"https://doi.org/10.5772/intechopen.100535\">https://doi.org/10.5772/intechopen.100535</a>","ama":"Floriach-Clark J, Tang H, Willemsen V. Mosses: Accessible Systems for Plant Development Studies. In: Abdurakhmonov IY, ed. <i>Model Organisms in Plant Genetics</i>. IntechOpen; 2022. doi:<a href=\"https://doi.org/10.5772/intechopen.100535\">10.5772/intechopen.100535</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5772/intechopen.100535"}],"year":"2022","date_published":"2022-06-23T00:00:00Z","doi":"10.5772/intechopen.100535","month":"06","acknowledgement":"The authors would like to thank Dr. Jeroen de Keijzer and Dr. Tijs Ketelaar for their thoughtful and detailed review of the manuscript. Also, the funding agencies Technology, Knowledge and Innovation, division Horticulture and Propagating Material (TKI T&U) and the Dutch Research Council (NWO) (reference number: TKILWV20.390) for funding JFC and the ERC grant to Prof. J. Friml (reference number: PR1023ERC02) for funding HT. The authors would like to sincerely apologise for the literature not cited that may be relevant for this chapter and is not present due to space constraints.","title":"Mosses: Accessible Systems for Plant Development Studies"},{"status":"public","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"17086","year":"2022","intvolume":"        35","month":"12","scopus_import":"1","title":"Mean estimation in high-dimensional binary Markov Gaussian mixture models","date_published":"2022-12-01T00:00:00Z","date_created":"2024-05-29T06:37:16Z","author":[{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","first_name":"Yihan","full_name":"Zhang, Yihan","orcid":"0000-0002-6465-6258"},{"full_name":"Weinberger, Nir","first_name":"Nir","last_name":"Weinberger"}],"date_updated":"2024-08-05T09:48:58Z","publication_identifier":{"isbn":["9781713871088"]},"oa":1,"volume":35,"external_id":{"arxiv":["2206.02455"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","arxiv":1,"abstract":[{"text":"We consider a high-dimensional mean estimation problem over a binary hidden Markov model, which illuminates the interplay between memory in data, sample size, dimension, and signal strength in statistical inference. In this model, an estimator observes n samples of a d-dimensional parameter vector θ∗∈Rd, multiplied by a random sign Si (1≤i≤n), and corrupted by isotropic standard Gaussian noise. The sequence of signs {Si}i∈[n]∈{−1,1}n is drawn from a stationary homogeneous Markov chain with flip probability δ∈[0,1/2]. As δ varies, this model smoothly interpolates two well-studied models: the Gaussian Location Model for which δ=0 and the Gaussian Mixture Model for which δ=1/2. Assuming that the estimator knows δ, we establish a nearly minimax optimal (up to logarithmic factors) estimation error rate, as a function of ∥θ∗∥,δ,d,n. We then provide an upper bound to the case of estimating δ, assuming a (possibly inaccurate) knowledge of θ∗. The bound is proved to be tight when θ∗ is an accurately known constant. These results are then combined to an algorithm which estimates θ∗ with δ unknown a priori, and theoretical guarantees on its error are stated.","lang":"eng"}],"conference":{"start_date":"2022-11-28","end_date":"2022-12-09","name":"NeurIPS: Neural Information Processing Systems","location":"New Orleans, LA, United States"},"file_date_updated":"2024-08-05T09:44:49Z","day":"01","citation":{"apa":"Zhang, Y., &#38; Weinberger, N. (2022). Mean estimation in high-dimensional binary Markov Gaussian mixture models. In <i>36th Conference on Neural Information Processing Systems</i> (Vol. 35). New Orleans, LA, United States: ML Research Press.","ama":"Zhang Y, Weinberger N. Mean estimation in high-dimensional binary Markov Gaussian mixture models. In: <i>36th Conference on Neural Information Processing Systems</i>. Vol 35. ML Research Press; 2022.","ista":"Zhang Y, Weinberger N. 2022. Mean estimation in high-dimensional binary Markov Gaussian mixture models. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 35.","chicago":"Zhang, Yihan, and Nir Weinberger. “Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models.” In <i>36th Conference on Neural Information Processing Systems</i>, Vol. 35. ML Research Press, 2022.","mla":"Zhang, Yihan, and Nir Weinberger. “Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models.” <i>36th Conference on Neural Information Processing Systems</i>, vol. 35, ML Research Press, 2022.","ieee":"Y. Zhang and N. Weinberger, “Mean estimation in high-dimensional binary Markov Gaussian mixture models,” in <i>36th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2022, vol. 35.","short":"Y. Zhang, N. Weinberger, in:, 36th Conference on Neural Information Processing Systems, ML Research Press, 2022."},"acknowledgement":"Part of this work was done when YZ was a postdoc at Technion where he received funding from\r\nthe European Union’s Horizon 2020 research and innovation programme under grant agreement No 682203-ERC-[Inf-Speed-Tradeoff]. The work of of NW was supported in part by the Israel Science Foundation (ISF) under Grant 1782/22. NW is grateful to Guy Bresler for introducing him to this problem, for the initial ideas that led to this research, and for many helpful discussions on the topic.","quality_controlled":"1","publication_status":"published","type":"conference","alternative_title":["NeurIPS"],"file":[{"file_size":476307,"content_type":"application/pdf","success":1,"file_id":"17392","file_name":"2022_NeurIPS_Zhang.pdf","date_updated":"2024-08-05T09:44:49Z","checksum":"05f6f9f8fc34e224e0cad045b9489030","creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2024-08-05T09:44:49Z"}],"corr_author":"1","department":[{"_id":"MaMo"}],"has_accepted_license":"1","publisher":"ML Research Press","publication":"36th Conference on Neural Information Processing Systems","ddc":["000"]},{"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.18653/v1/2022.emnlp-main.279","citation":{"ieee":"E. Kurtic <i>et al.</i>, “The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models,” in <i>Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</i>, Abu Dhabi, United Arab Emirates, 2022, pp. 4163–4181.","short":"E. Kurtic, D. Campos, T. Nguyen, E. Frantar, M. Kurtz, B. Fineran, M. Goin, D.-A. Alistarh, in:, Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, 2022, pp. 4163–4181.","mla":"Kurtic, Eldar, et al. “The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models.” <i>Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</i>, Association for Computational Linguistics, 2022, pp. 4163–81, doi:<a href=\"https://doi.org/10.18653/v1/2022.emnlp-main.279\">10.18653/v1/2022.emnlp-main.279</a>.","apa":"Kurtic, E., Campos, D., Nguyen, T., Frantar, E., Kurtz, M., Fineran, B., … Alistarh, D.-A. (2022). The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models. In <i>Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</i> (pp. 4163–4181). Abu Dhabi, United Arab Emirates: Association for Computational Linguistics. <a href=\"https://doi.org/10.18653/v1/2022.emnlp-main.279\">https://doi.org/10.18653/v1/2022.emnlp-main.279</a>","ama":"Kurtic E, Campos D, Nguyen T, et al. The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models. In: <i>Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</i>. Association for Computational Linguistics; 2022:4163-4181. doi:<a href=\"https://doi.org/10.18653/v1/2022.emnlp-main.279\">10.18653/v1/2022.emnlp-main.279</a>","chicago":"Kurtic, Eldar, Daniel Campos, Tuan Nguyen, Elias Frantar, Mark Kurtz, Benjamin Fineran, Michael Goin, and Dan-Adrian Alistarh. “The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models.” In <i>Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing</i>, 4163–81. Association for Computational Linguistics, 2022. <a href=\"https://doi.org/10.18653/v1/2022.emnlp-main.279\">https://doi.org/10.18653/v1/2022.emnlp-main.279</a>.","ista":"Kurtic E, Campos D, Nguyen T, Frantar E, Kurtz M, Fineran B, Goin M, Alistarh D-A. 2022. The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models. Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing. EMNLP: Conference on Empirical Methods in Natural Language Processing, 4163–4181."},"day":"01","file_date_updated":"2024-07-31T11:03:34Z","conference":{"start_date":"2022-12-07","location":"Abu Dhabi, United Arab Emirates","end_date":"2022-12-11","name":"EMNLP: Conference on Empirical Methods in Natural Language Processing"},"page":"4163-4181","publication":"Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing","ddc":["000"],"has_accepted_license":"1","related_material":{"link":[{"url":"https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT","relation":"software"}]},"publisher":"Association for Computational Linguistics","file":[{"relation":"main_file","date_created":"2024-07-31T11:03:34Z","date_updated":"2024-07-31T11:03:34Z","file_name":"2022_EMNLP_Kurtic.pdf","creator":"dernst","checksum":"c47b9edd8a9f743ac77a593de6d2e84a","access_level":"open_access","success":1,"file_id":"17354","file_size":522563,"content_type":"application/pdf"}],"corr_author":"1","department":[{"_id":"DaAl"}],"quality_controlled":"1","type":"conference","publication_status":"published","title":"The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models","month":"12","scopus_import":"1","date_published":"2022-12-01T00:00:00Z","year":"2022","_id":"17088","article_processing_charge":"Yes","language":[{"iso":"eng"}],"status":"public","arxiv":1,"oa_version":"Published Version","abstract":[{"text":"In this paper, we consider the problem of sparsifying BERT models, which are a key building block for natural language processing, in order to reduce their storage and computational cost. We introduce the Optimal BERT Surgeon (oBERT), an efficient and accurate pruning method based on approximate second-order information, which we show to yield state-of-the-art results in both stages of language tasks: pre-training and fine-tuning. Specifically, oBERT extends existing work on second-order pruning by allowing for pruning weight blocks, and is the first such method that is applicable at BERT scale. Second, we investigate compounding compression approaches to obtain highly compressed but accurate models for deployment on edge devices. These models significantly push boundaries of the current state-of-the-art sparse BERT models with respect to all metrics: model size, inference speed and task accuracy. For example, relative to the dense BERT-base, we obtain 10x model size compression with < 1% accuracy drop, 10x CPU-inference speedup with < 2% accuracy drop, and 29x CPU-inference speedup with < 7.5% accuracy drop. Our code, fully integrated with Transformers and SparseML, is available at https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT.","lang":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2203.07259"]},"date_updated":"2024-07-31T11:05:32Z","author":[{"full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","last_name":"Kurtic","first_name":"Eldar"},{"first_name":"Daniel","last_name":"Campos","full_name":"Campos, Daniel"},{"last_name":"Nguyen","first_name":"Tuan","full_name":"Nguyen, Tuan"},{"full_name":"Frantar, Elias","first_name":"Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"first_name":"Mark","last_name":"Kurtz","full_name":"Kurtz, Mark"},{"full_name":"Fineran, Benjamin","last_name":"Fineran","first_name":"Benjamin"},{"full_name":"Goin, Michael","last_name":"Goin","first_name":"Michael"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"}],"date_created":"2024-05-29T06:40:55Z"},{"ec_funded":1,"status":"public","article_type":"original","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"year":"2022","_id":"7791","intvolume":"         8","title":"When different norms lead to same billiard trajectories?","month":"12","scopus_import":"1","date_published":"2022-12-01T00:00:00Z","author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"date_created":"2020-05-03T22:00:48Z","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"date_updated":"2025-04-14T07:48:36Z","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"oa":1,"volume":8,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1912.12685"]},"arxiv":1,"oa_version":"Published Version","abstract":[{"text":"Extending a result of Milena Radnovic and Serge Tabachnikov, we establish conditionsfor two different non-symmetric norms to define the same billiard reflection law.","lang":"eng"}],"page":"1309 - 1312","file_date_updated":"2020-07-14T12:48:03Z","citation":{"mla":"Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard Trajectories?” <i>European Journal of Mathematics</i>, vol. 8, no. 4, Springer Nature, 2022, pp. 1309–12, doi:<a href=\"https://doi.org/10.1007/s40879-020-00405-0\">10.1007/s40879-020-00405-0</a>.","ama":"Akopyan A, Karasev R. When different norms lead to same billiard trajectories? <i>European Journal of Mathematics</i>. 2022;8(4):1309-1312. doi:<a href=\"https://doi.org/10.1007/s40879-020-00405-0\">10.1007/s40879-020-00405-0</a>","apa":"Akopyan, A., &#38; Karasev, R. (2022). When different norms lead to same billiard trajectories? <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00405-0\">https://doi.org/10.1007/s40879-020-00405-0</a>","ista":"Akopyan A, Karasev R. 2022. When different norms lead to same billiard trajectories? European Journal of Mathematics. 8(4), 1309–1312.","chicago":"Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard Trajectories?” <i>European Journal of Mathematics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s40879-020-00405-0\">https://doi.org/10.1007/s40879-020-00405-0</a>.","ieee":"A. Akopyan and R. Karasev, “When different norms lead to same billiard trajectories?,” <i>European Journal of Mathematics</i>, vol. 8, no. 4. Springer Nature, pp. 1309–1312, 2022.","short":"A. Akopyan, R. Karasev, European Journal of Mathematics 8 (2022) 1309–1312."},"day":"01","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha). RK was supported by the Federal professorship program Grant 1.456.2016/1.4 and the Russian Foundation for Basic Research Grants 18-01-00036 and 19-01-00169. Open access funding provided by Institute of Science and Technology (IST Austria). The authors thank Alexey Balitskiy, Milena Radnović, and Serge Tabachnikov for useful discussions.","issue":"4","doi":"10.1007/s40879-020-00405-0","quality_controlled":"1","type":"journal_article","publication_status":"published","corr_author":"1","file":[{"file_id":"7796","file_size":263926,"content_type":"application/pdf","date_created":"2020-05-04T10:33:42Z","relation":"main_file","creator":"dernst","access_level":"open_access","checksum":"f53e71fd03744075adcd0b8fc1b8423d","date_updated":"2020-07-14T12:48:03Z","file_name":"2020_EuropMathematics_Akopyan.pdf"}],"department":[{"_id":"HeEd"}],"has_accepted_license":"1","publisher":"Springer Nature","ddc":["510"],"publication":"European Journal of Mathematics"},{"language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","article_type":"original","status":"public","ec_funded":1,"date_published":"2022-04-01T00:00:00Z","scopus_import":"1","month":"04","title":"Dynamic averaging load balancing on cycles","intvolume":"        84","_id":"8286","year":"2022","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"date_updated":"2025-07-10T11:55:11Z","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"date_created":"2020-08-24T06:24:04Z","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","full_name":"Nadiradze, Giorgi"},{"last_name":"Sabour","first_name":"Amirmojtaba","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba"}],"abstract":[{"text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. ","lang":"eng"}],"oa_version":"Published Version","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000734004600001"],"arxiv":["2003.09297"]},"volume":84,"oa":1,"file_date_updated":"2021-12-27T10:36:40Z","conference":{"location":"Virtual, Online; Germany","name":"ICALP: Automata, Languages and Programming","end_date":"2020-07-11","start_date":"2020-07-08"},"page":"1007-1029","doi":"10.1007/s00453-021-00905-9","issue":"4","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier versions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments. Open access funding provided by Institute of Science and Technology (IST Austria). Funding was provided by European Research Council (Grant No. PR1042ERC01).","isi":1,"day":"01","citation":{"apa":"Alistarh, D.-A., Nadiradze, G., &#38; Sabour, A. (2022). Dynamic averaging load balancing on cycles. <i>Algorithmica</i>. Virtual, Online; Germany: Springer Nature. <a href=\"https://doi.org/10.1007/s00453-021-00905-9\">https://doi.org/10.1007/s00453-021-00905-9</a>","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. <i>Algorithmica</i>. 2022;84(4):1007-1029. doi:<a href=\"https://doi.org/10.1007/s00453-021-00905-9\">10.1007/s00453-021-00905-9</a>","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2022. Dynamic averaging load balancing on cycles. Algorithmica. 84(4), 1007–1029.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” <i>Algorithmica</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00453-021-00905-9\">https://doi.org/10.1007/s00453-021-00905-9</a>.","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” <i>Algorithmica</i>, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:<a href=\"https://doi.org/10.1007/s00453-021-00905-9\">10.1007/s00453-021-00905-9</a>.","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” <i>Algorithmica</i>, vol. 84, no. 4. Springer Nature, pp. 1007–1029, 2022.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica 84 (2022) 1007–1029."},"department":[{"_id":"DaAl"}],"file":[{"date_created":"2021-12-27T10:36:40Z","relation":"main_file","creator":"cchlebak","access_level":"open_access","checksum":"21169b25b0c8e17b21e12af22bff9870","date_updated":"2021-12-27T10:36:40Z","file_name":"2021_Algorithmica_Alistarh.pdf","file_id":"10577","success":1,"file_size":525950,"content_type":"application/pdf"}],"publication_status":"published","type":"journal_article","quality_controlled":"1","ddc":["000"],"publication":"Algorithmica","publisher":"Springer Nature","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"15077"}],"link":[{"url":"https://doi.org/10.4230/LIPIcs.ICALP.2020.7","relation":"earlier_version"}]},"has_accepted_license":"1"},{"publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"date_updated":"2025-04-14T07:48:34Z","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"last_name":"Schwartz","first_name":"Richard","full_name":"Schwartz, Richard"},{"full_name":"Tabachnikov, Serge","first_name":"Serge","last_name":"Tabachnikov"}],"date_created":"2020-09-20T22:01:38Z","abstract":[{"lang":"eng","text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods."}],"oa_version":"Preprint","arxiv":1,"external_id":{"arxiv":["2001.02934"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":8,"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","ec_funded":1,"status":"public","date_published":"2022-12-01T00:00:00Z","title":"Billiards in ellipses revisited","scopus_import":"1","month":"12","intvolume":"         8","_id":"8538","year":"2022","department":[{"_id":"HeEd"}],"type":"journal_article","publication_status":"published","quality_controlled":"1","publication":"European Journal of Mathematics","publisher":"Springer Nature","page":"1313-1327","acknowledgement":" This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191.","issue":"4","doi":"10.1007/s40879-020-00426-9","citation":{"short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics 8 (2022) 1313–1327.","ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” <i>European Journal of Mathematics</i>, vol. 8, no. 4. Springer Nature, pp. 1313–1327, 2022.","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2022. Billiards in ellipses revisited. European Journal of Mathematics. 8(4), 1313–1327.","chicago":"Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>.","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. 2022;8(4):1313-1327. doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>","apa":"Akopyan, A., Schwartz, R., &#38; Tabachnikov, S. (2022). Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>","mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>, vol. 8, no. 4, Springer Nature, 2022, pp. 1313–27, doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"day":"01"},{"year":"2022","_id":"9199","intvolume":"        16","month":"12","scopus_import":"1","title":"Equidistribution and freeness on Grassmannians","date_published":"2022-12-01T00:00:00Z","status":"public","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"volume":16,"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000961514100004"],"arxiv":["2102.11552"]},"oa_version":"Preprint","arxiv":1,"abstract":[{"text":"We associate a certain tensor product lattice to any primitive integer lattice and ask about its typical shape. These lattices are related to the tangent bundle of Grassmannians and their study is motivated by Peyre's programme on \"freeness\" for rational points of bounded height on Fano\r\nvarieties.","lang":"eng"}],"date_created":"2021-02-25T09:56:57Z","author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","last_name":"Browning"},{"id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","last_name":"Horesh","first_name":"Tal","full_name":"Horesh, Tal"},{"orcid":"0000-0001-7302-8256","full_name":"Wilsch, Florian Alexander","first_name":"Florian Alexander","last_name":"Wilsch","id":"560601DA-8D36-11E9-A136-7AC1E5697425"}],"project":[{"_id":"26A8D266-B435-11E9-9278-68D0E5697425","grant_number":"EP-P026710-2","name":"Between rational and integral points"},{"_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P32428","name":"New frontiers of the Manin conjecture"}],"date_updated":"2025-04-14T09:25:44Z","publication_identifier":{"eissn":["1944-7833"],"issn":["1937-0652"]},"isi":1,"day":"01","citation":{"chicago":"Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution and Freeness on Grassmannians.” <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers, 2022. <a href=\"https://doi.org/10.2140/ant.2022.16.2385\">https://doi.org/10.2140/ant.2022.16.2385</a>.","ista":"Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians. Algebra &#38; Number Theory. 16(10), 2385–2407.","apa":"Browning, T. D., Horesh, T., &#38; Wilsch, F. A. (2022). Equidistribution and freeness on Grassmannians. <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/ant.2022.16.2385\">https://doi.org/10.2140/ant.2022.16.2385</a>","ama":"Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians. <i>Algebra &#38; Number Theory</i>. 2022;16(10):2385-2407. doi:<a href=\"https://doi.org/10.2140/ant.2022.16.2385\">10.2140/ant.2022.16.2385</a>","mla":"Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.” <i>Algebra &#38; Number Theory</i>, vol. 16, no. 10, Mathematical Sciences Publishers, 2022, pp. 2385–407, doi:<a href=\"https://doi.org/10.2140/ant.2022.16.2385\">10.2140/ant.2022.16.2385</a>.","short":"T.D. Browning, T. Horesh, F.A. Wilsch, Algebra &#38; Number Theory 16 (2022) 2385–2407.","ieee":"T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness on Grassmannians,” <i>Algebra &#38; Number Theory</i>, vol. 16, no. 10. Mathematical Sciences Publishers, pp. 2385–2407, 2022."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.11552"}],"doi":"10.2140/ant.2022.16.2385","issue":"10","acknowledgement":"The authors are very grateful to Will Sawin for useful remarks about this topic. While working on this paper the first two authors were supported by EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35.","page":"2385-2407","publisher":"Mathematical Sciences Publishers","publication":"Algebra & Number Theory","quality_controlled":"1","publication_status":"published","type":"journal_article","corr_author":"1","department":[{"_id":"TiBr"}]},{"publisher":"Wiley","publication":"FEBS Journal","type":"journal_article","publication_status":"published","quality_controlled":"1","department":[{"_id":"CaHe"}],"alternative_title":["Words of Advice"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/febs.15823"}],"citation":{"mla":"Sarabipour, Sarvenaz, et al. “Building and Sustaining Mentor Interactions as a Mentee.” <i>FEBS Journal</i>, vol. 289, no. 6, Wiley, 2022, pp. 1374–84, doi:<a href=\"https://doi.org/10.1111/febs.15823\">10.1111/febs.15823</a>.","chicago":"Sarabipour, Sarvenaz, Sarah J. Hainer, Feyza N Arslan, Charlotte M. De Winde, Emily Furlong, Natalia Bielczyk, Nafisa M. Jadavji, Aparna P. Shah, and Sejal Davla. “Building and Sustaining Mentor Interactions as a Mentee.” <i>FEBS Journal</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/febs.15823\">https://doi.org/10.1111/febs.15823</a>.","ista":"Sarabipour S, Hainer SJ, Arslan FN, De Winde CM, Furlong E, Bielczyk N, Jadavji NM, Shah AP, Davla S. 2022. Building and sustaining mentor interactions as a mentee. FEBS Journal. 289(6), 1374–1384.","ama":"Sarabipour S, Hainer SJ, Arslan FN, et al. Building and sustaining mentor interactions as a mentee. <i>FEBS Journal</i>. 2022;289(6):1374-1384. doi:<a href=\"https://doi.org/10.1111/febs.15823\">10.1111/febs.15823</a>","apa":"Sarabipour, S., Hainer, S. J., Arslan, F. N., De Winde, C. M., Furlong, E., Bielczyk, N., … Davla, S. (2022). Building and sustaining mentor interactions as a mentee. <i>FEBS Journal</i>. Wiley. <a href=\"https://doi.org/10.1111/febs.15823\">https://doi.org/10.1111/febs.15823</a>","short":"S. Sarabipour, S.J. Hainer, F.N. Arslan, C.M. De Winde, E. Furlong, N. Bielczyk, N.M. Jadavji, A.P. Shah, S. Davla, FEBS Journal 289 (2022) 1374–1384.","ieee":"S. Sarabipour <i>et al.</i>, “Building and sustaining mentor interactions as a mentee,” <i>FEBS Journal</i>, vol. 289, no. 6. Wiley, pp. 1374–1384, 2022."},"isi":1,"day":"01","acknowledgement":"The authors thank Nicholas Asby of the University of Chicago for valuable comments on an earlier version of this work. A.P.S. was partially supported by the NARSAD Young Investigator Grant 27705. S.J.H was supported by the National Institutes of Health grant R35GM133732.","issue":"6","doi":"10.1111/febs.15823","page":"1374-1384","pmid":1,"external_id":{"isi":["000636678800001"],"pmid":["33818917"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":289,"abstract":[{"text":"Mentorship is experience and/or knowledge‐based guidance. Mentors support, sponsor and advocate for mentees. Having one or more mentors when you seek advice can significantly influence and improve your research endeavours, well‐being and career development. Positive mentee–mentor relationships are vital for maintaining work–life balance and success in careers. Early‐career researchers (ECRs), in particular, can benefit from mentorship to navigate challenges in academic and nonacademic life and careers. Yet, strategies for selecting mentors and maintaining interactions with them are often underdiscussed within research environments. In this Words of Advice, we provide recommendations for ECRs to seek and manage mentorship interactions. Our article draws from our experiences as ECRs and published work, to provide suggestions for mentees to proactively promote beneficial mentorship interactions. The recommended practices highlight the importance of identifying mentorship needs, planning and selecting multiple and diverse mentors, setting goals, and maintaining constructive, and mutually beneficial working relationships with mentors.","lang":"eng"}],"oa_version":"Published Version","author":[{"last_name":"Sarabipour","first_name":"Sarvenaz","full_name":"Sarabipour, Sarvenaz"},{"last_name":"Hainer","first_name":"Sarah J.","full_name":"Hainer, Sarah J."},{"orcid":"0000-0001-5809-9566","full_name":"Arslan, Feyza N","id":"49DA7910-F248-11E8-B48F-1D18A9856A87","first_name":"Feyza N","last_name":"Arslan"},{"full_name":"De Winde, Charlotte M.","last_name":"De Winde","first_name":"Charlotte M."},{"last_name":"Furlong","first_name":"Emily","full_name":"Furlong, Emily"},{"first_name":"Natalia","last_name":"Bielczyk","full_name":"Bielczyk, Natalia"},{"full_name":"Jadavji, Nafisa M.","first_name":"Nafisa M.","last_name":"Jadavji"},{"full_name":"Shah, Aparna P.","first_name":"Aparna P.","last_name":"Shah"},{"full_name":"Davla, Sejal","last_name":"Davla","first_name":"Sejal"}],"date_created":"2021-04-18T22:01:43Z","publication_identifier":{"issn":["1742-464X"],"eissn":["1742-4658"]},"date_updated":"2024-05-22T11:17:55Z","intvolume":"       289","year":"2022","_id":"9336","date_published":"2022-03-01T00:00:00Z","title":"Building and sustaining mentor interactions as a mentee","month":"03","scopus_import":"1","status":"public","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No"},{"publication_identifier":{"issn":["0305-0041"],"eissn":["1469-8064"]},"date_updated":"2023-08-02T06:47:48Z","author":[{"full_name":"Bonolis, Dante","first_name":"Dante","last_name":"Bonolis","id":"6A459894-5FDD-11E9-AF35-BB24E6697425"}],"date_created":"2021-05-02T22:01:29Z","abstract":[{"lang":"eng","text":"Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H<p ∣ 1/√p ∑ 0≤n<H t (n) ∣ of the absolute value of the incomplete sums(1/√p)∑0≤n<H t (n). In this very general context one of the most important results is the Pólya–Vinogradov bound M(t)≤IIˆtII∞ log 3p, where ˆt : Fp → C is the normalized Fourier transform of t. In this paper we provide a lower bound for certain incomplete Kloosterman sums, namely we prove that for any ε > 0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary)."}],"arxiv":1,"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000784421500001"],"arxiv":["1811.10563"]},"oa":1,"volume":172,"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (via OA deal)","status":"public","date_published":"2022-05-01T00:00:00Z","title":"On the size of the maximum of incomplete Kloosterman sums","scopus_import":"1","month":"05","intvolume":"       172","year":"2022","_id":"9364","department":[{"_id":"TiBr"}],"file":[{"file_name":"2021_MathProcCamPhilSoc_Bonolis.pdf","date_updated":"2021-12-01T14:01:54Z","checksum":"614d2e9b83a78100408e4ee7752a80a8","creator":"cchlebak","access_level":"open_access","relation":"main_file","date_created":"2021-12-01T14:01:54Z","content_type":"application/pdf","file_size":334064,"file_id":"10395","success":1}],"type":"journal_article","publication_status":"published","quality_controlled":"1","ddc":["510"],"publication":"Mathematical Proceedings of the Cambridge Philosophical Society","publisher":"Cambridge University Press","has_accepted_license":"1","file_date_updated":"2021-12-01T14:01:54Z","page":"563 - 590","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"I am most thankful to my advisor, Emmanuel Kowalski, for suggesting this problem and for his guidance during these years. I also would like to thank Youness Lamzouri for informing me about his work on sum of incomplete Birch sums and Tal Horesh for her suggestions on a previous version of the paper. Finally, I am very grateful to the anonymous referee for their careful reading of the manuscript and their valuable comments.","doi":"10.1017/S030500412100030X","issue":"3","citation":{"ama":"Bonolis D. On the size of the maximum of incomplete Kloosterman sums. <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. 2022;172(3):563-590. doi:<a href=\"https://doi.org/10.1017/S030500412100030X\">10.1017/S030500412100030X</a>","apa":"Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums. <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S030500412100030X\">https://doi.org/10.1017/S030500412100030X</a>","chicago":"Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge University Press, 2022. <a href=\"https://doi.org/10.1017/S030500412100030X\">https://doi.org/10.1017/S030500412100030X</a>.","ista":"Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590.","mla":"Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 172, no. 3, Cambridge University Press, 2022, pp. 563–90, doi:<a href=\"https://doi.org/10.1017/S030500412100030X\">10.1017/S030500412100030X</a>.","ieee":"D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 172, no. 3. Cambridge University Press, pp. 563–590, 2022.","short":"D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society 172 (2022) 563–590."},"day":"01","isi":1},{"department":[{"_id":"VlKo"}],"quality_controlled":"1","publication_status":"published","type":"journal_article","publication":"Optimization","publisher":"Taylor and Francis","page":"3767-3795","issue":"13","doi":"10.1080/02331934.2021.1914035","acknowledgement":"The second author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","isi":1,"day":"01","citation":{"mla":"Ogbuisi, Ferdinard U., et al. “Convergence Analysis of New Inertial Method for the Split Common Null Point Problem.” <i>Optimization</i>, vol. 71, no. 13, Taylor and Francis, 2022, pp. 3767–95, doi:<a href=\"https://doi.org/10.1080/02331934.2021.1914035\">10.1080/02331934.2021.1914035</a>.","apa":"Ogbuisi, F. U., Shehu, Y., &#38; Yao, J. C. (2022). Convergence analysis of new inertial method for the split common null point problem. <i>Optimization</i>. Taylor and Francis. <a href=\"https://doi.org/10.1080/02331934.2021.1914035\">https://doi.org/10.1080/02331934.2021.1914035</a>","ama":"Ogbuisi FU, Shehu Y, Yao JC. Convergence analysis of new inertial method for the split common null point problem. <i>Optimization</i>. 2022;71(13):3767-3795. doi:<a href=\"https://doi.org/10.1080/02331934.2021.1914035\">10.1080/02331934.2021.1914035</a>","chicago":"Ogbuisi, Ferdinard U., Yekini Shehu, and Jen Chih Yao. “Convergence Analysis of New Inertial Method for the Split Common Null Point Problem.” <i>Optimization</i>. Taylor and Francis, 2022. <a href=\"https://doi.org/10.1080/02331934.2021.1914035\">https://doi.org/10.1080/02331934.2021.1914035</a>.","ista":"Ogbuisi FU, Shehu Y, Yao JC. 2022. Convergence analysis of new inertial method for the split common null point problem. Optimization. 71(13), 3767–3795.","ieee":"F. U. Ogbuisi, Y. Shehu, and J. C. Yao, “Convergence analysis of new inertial method for the split common null point problem,” <i>Optimization</i>, vol. 71, no. 13. Taylor and Francis, pp. 3767–3795, 2022.","short":"F.U. Ogbuisi, Y. Shehu, J.C. Yao, Optimization 71 (2022) 3767–3795."},"date_updated":"2024-11-04T13:52:36Z","publication_identifier":{"issn":["0233-1934"],"eissn":["1029-4945"]},"date_created":"2021-05-02T22:01:29Z","author":[{"full_name":"Ogbuisi, Ferdinard U.","first_name":"Ferdinard U.","last_name":"Ogbuisi"},{"last_name":"Shehu","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139"},{"full_name":"Yao, Jen Chih","first_name":"Jen Chih","last_name":"Yao"}],"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","abstract":[{"text":"In this paper, we propose a new iterative method with alternated inertial step for solving split common null point problem in real Hilbert spaces. We obtain weak convergence of the proposed iterative algorithm. Furthermore, we introduce the notion of bounded linear regularity property for the split common null point problem and obtain the linear convergence property for the new algorithm under some mild assumptions. Finally, we provide some numerical examples to demonstrate the performance and efficiency of the proposed method.","lang":"eng"}],"volume":71,"external_id":{"isi":["000640109300001"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"status":"public","ec_funded":1,"month":"11","scopus_import":"1","title":"Convergence analysis of new inertial method for the split common null point problem","date_published":"2022-11-01T00:00:00Z","_id":"9365","year":"2022","intvolume":"        71"},{"page":"1527-1565","citation":{"short":"O.S. Iyiola, C.D. Enyi, Y. Shehu, Optimization Methods and Software 37 (2022) 1527–1565.","ieee":"O. S. Iyiola, C. D. Enyi, and Y. Shehu, “Reflected three-operator splitting method for monotone inclusion problem,” <i>Optimization Methods and Software</i>, vol. 37, no. 4. Taylor and Francis, pp. 1527–1565, 2022.","mla":"Iyiola, Olaniyi S., et al. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.” <i>Optimization Methods and Software</i>, vol. 37, no. 4, Taylor and Francis, 2022, pp. 1527–65, doi:<a href=\"https://doi.org/10.1080/10556788.2021.1924715\">10.1080/10556788.2021.1924715</a>.","ista":"Iyiola OS, Enyi CD, Shehu Y. 2022. Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software. 37(4), 1527–1565.","chicago":"Iyiola, Olaniyi S., Cyril D. Enyi, and Yekini Shehu. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.” <i>Optimization Methods and Software</i>. Taylor and Francis, 2022. <a href=\"https://doi.org/10.1080/10556788.2021.1924715\">https://doi.org/10.1080/10556788.2021.1924715</a>.","ama":"Iyiola OS, Enyi CD, Shehu Y. Reflected three-operator splitting method for monotone inclusion problem. <i>Optimization Methods and Software</i>. 2022;37(4):1527-1565. doi:<a href=\"https://doi.org/10.1080/10556788.2021.1924715\">10.1080/10556788.2021.1924715</a>","apa":"Iyiola, O. S., Enyi, C. D., &#38; Shehu, Y. (2022). Reflected three-operator splitting method for monotone inclusion problem. <i>Optimization Methods and Software</i>. Taylor and Francis. <a href=\"https://doi.org/10.1080/10556788.2021.1924715\">https://doi.org/10.1080/10556788.2021.1924715</a>"},"isi":1,"day":"01","acknowledgement":"The authors are grateful to the anonymous referees and the handling Editor for their insightful comments which have improved the earlier version of the manuscript greatly. The second author is grateful to the University of Hafr Al Batin. The last author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","issue":"4","doi":"10.1080/10556788.2021.1924715","quality_controlled":"1","type":"journal_article","publication_status":"published","corr_author":"1","department":[{"_id":"VlKo"}],"publisher":"Taylor and Francis","publication":"Optimization Methods and Software","ec_funded":1,"status":"public","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"9469","year":"2022","intvolume":"        37","title":"Reflected three-operator splitting method for monotone inclusion problem","scopus_import":"1","month":"07","date_published":"2022-07-01T00:00:00Z","author":[{"first_name":"Olaniyi S.","last_name":"Iyiola","full_name":"Iyiola, Olaniyi S."},{"full_name":"Enyi, Cyril D.","last_name":"Enyi","first_name":"Cyril D."},{"last_name":"Shehu","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139"}],"date_created":"2021-06-06T22:01:30Z","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"date_updated":"2024-11-04T13:52:36Z","publication_identifier":{"eissn":["1029-4937"],"issn":["1055-6788"]},"volume":37,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000650507600001"]},"oa_version":"None","abstract":[{"text":"In this paper, we consider reflected three-operator splitting methods for monotone inclusion problems in real Hilbert spaces. To do this, we first obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of the reflected Krasnosel'skiĭ-Mann iteration for finding a fixed point of nonexpansive mapping in real Hilbert spaces under some seemingly easy to implement conditions on the iterative parameters. We then apply our results to three-operator splitting for the monotone inclusion problem and consequently obtain the corresponding convergence analysis. Furthermore, we derive reflected primal-dual algorithms for highly structured monotone inclusion problems. Some numerical implementations are drawn from splitting methods to support the theoretical analysis.","lang":"eng"}]},{"oa_version":"Published Version","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently\r\nfine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary.","lang":"eng"}],"oa":1,"volume":22,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000673039600001"]},"date_updated":"2025-04-22T13:45:18Z","publication_identifier":{"eissn":["1615-3383"]},"date_created":"2021-07-14T06:44:53Z","author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"last_name":"Wintraecken","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"scopus_import":"1","month":"01","title":"The topological correctness of PL approximations of isomanifolds","date_published":"2022-01-01T00:00:00Z","year":"2022","_id":"9649","intvolume":"        22","article_processing_charge":"Yes (via OA deal)","article_type":"original","language":[{"iso":"eng"}],"status":"public","ec_funded":1,"ddc":["516"],"publication":"Foundations of Computational Mathematics ","related_material":{"record":[{"relation":"earlier_version","id":"7952","status":"public"}]},"has_accepted_license":"1","publisher":"Springer Nature","corr_author":"1","file":[{"creator":"mwintrae","access_level":"open_access","checksum":"f1d372ec3c08ec22e84f8e93e1126b8c","date_updated":"2021-07-14T06:44:36Z","file_name":"Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf","date_created":"2021-07-14T06:44:36Z","relation":"main_file","file_size":1455699,"content_type":"application/pdf","file_id":"9650"}],"department":[{"_id":"HeEd"}],"quality_controlled":"1","publication_status":"published","type":"journal_article","doi":"10.1007/s10208-021-09520-0","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"First and foremost, we acknowledge Siargey Kachanovich for discussions. We thank Herbert Edelsbrunner and all members of his group, all former and current members of the Datashape team (formerly known as Geometrica), and André Lieutier for encouragement. We further thank the reviewers of Foundations of Computational Mathematics and the reviewers and program committee of the Symposium on Computational Geometry for their feedback, which improved the exposition.\r\nThis work was 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). This work was also supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. 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.","day":"01","isi":1,"citation":{"ieee":"J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations of isomanifolds,” <i>Foundations of Computational Mathematics </i>, vol. 22. Springer Nature, pp. 967–1012, 2022.","short":"J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics  22 (2022) 967–1012.","mla":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” <i>Foundations of Computational Mathematics </i>, vol. 22, Springer Nature, 2022, pp. 967–1012, doi:<a href=\"https://doi.org/10.1007/s10208-021-09520-0\">10.1007/s10208-021-09520-0</a>.","apa":"Boissonnat, J.-D., &#38; Wintraecken, M. (2022). The topological correctness of PL approximations of isomanifolds. <i>Foundations of Computational Mathematics </i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10208-021-09520-0\">https://doi.org/10.1007/s10208-021-09520-0</a>","ama":"Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations of isomanifolds. <i>Foundations of Computational Mathematics </i>. 2022;22:967-1012. doi:<a href=\"https://doi.org/10.1007/s10208-021-09520-0\">10.1007/s10208-021-09520-0</a>","chicago":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” <i>Foundations of Computational Mathematics </i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10208-021-09520-0\">https://doi.org/10.1007/s10208-021-09520-0</a>.","ista":"Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012."},"file_date_updated":"2021-07-14T06:44:36Z","page":"967-1012"},{"publication_identifier":{"eissn":["2752-6542"]},"date_updated":"2025-06-12T06:23:20Z","date_created":"2021-07-20T06:31:53Z","author":[{"first_name":"Aldo","last_name":"Glielmo","full_name":"Glielmo, Aldo"},{"first_name":"Claudio","last_name":"Zeni","full_name":"Zeni, Claudio"},{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","first_name":"Bingqing","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632"},{"full_name":"Csanyi, Gabor","first_name":"Gabor","last_name":"Csanyi"},{"full_name":"Laio, Alessandro","last_name":"Laio","first_name":"Alessandro"}],"abstract":[{"lang":"eng","text":"Real-world data typically contain a large number of features that are often heterogeneous in nature, relevance, and also units of measure. When assessing the similarity between data points, one can build various distance measures using subsets of these features. Using the fewest features but still retaining sufficient information about the system is crucial in many statistical learning approaches, particularly when data are sparse. We introduce a statistical test that can assess the relative information retained when using two different distance measures, and determine if they are equivalent, independent, or if one is more informative than the other. This in turn allows finding the most informative distance measure out of a pool of candidates. The approach is applied to find the most relevant policy variables for controlling the Covid-19 epidemic and to find compact yet informative representations of atomic structures, but its potential applications are wide ranging in many branches of science."}],"oa_version":"Published Version","arxiv":1,"pmid":1,"external_id":{"arxiv":["2104.15079"],"pmid":["36713323"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":1,"language":[{"iso":"eng"}],"article_processing_charge":"Yes","article_type":"original","status":"public","date_published":"2022-05-01T00:00:00Z","scopus_import":"1","month":"05","title":"Ranking the information content of distance measures","intvolume":"         1","_id":"9695","year":"2022","department":[{"_id":"BiCh"}],"file":[{"file_id":"17080","success":1,"file_size":2005167,"content_type":"application/pdf","relation":"main_file","date_created":"2024-05-29T06:21:33Z","file_name":"2022_PNASNexus_Glielmo.pdf","date_updated":"2024-05-29T06:21:33Z","access_level":"open_access","creator":"dernst","checksum":"f6552854d760eb574ce97abce2c8ef89"}],"publication_status":"published","type":"journal_article","quality_controlled":"1","ddc":["000"],"publication":"PNAS Nexus","publisher":"Oxford University Press","has_accepted_license":"1","file_date_updated":"2024-05-29T06:21:33Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_number":"pgac039","doi":"10.1093/pnasnexus/pgac039","issue":"2","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"acknowledgement":"A.G., C.Z., and A.L. gratefully acknowledge support from the European Union’s Horizon 2020 research and innovation program (grant number 824143, MaX ’Materials design at the eXascale’ Centre of Excellence). The authors would like to thank M. Carli, D. Doimo, and I. Macocco (SISSA) for the discussions, M. Caro (Aalto University) for the precious help in using the TurboGap code, and D. Frenkel (University of Cambridge) and N. Bernstein (US Naval Research Laboratory) for useful feedback on the manuscript.\r\nThis work is supported in part by funds from the European Union’s Horizon 2020 research and innovation program (grant number 824143, MaX ’Materials design at the eXascale’ Centre of Excellence).","day":"01","citation":{"mla":"Glielmo, Aldo, et al. “Ranking the Information Content of Distance Measures.” <i>PNAS Nexus</i>, vol. 1, no. 2, pgac039, Oxford University Press, 2022, doi:<a href=\"https://doi.org/10.1093/pnasnexus/pgac039\">10.1093/pnasnexus/pgac039</a>.","ama":"Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. Ranking the information content of distance measures. <i>PNAS Nexus</i>. 2022;1(2). doi:<a href=\"https://doi.org/10.1093/pnasnexus/pgac039\">10.1093/pnasnexus/pgac039</a>","apa":"Glielmo, A., Zeni, C., Cheng, B., Csanyi, G., &#38; Laio, A. (2022). Ranking the information content of distance measures. <i>PNAS Nexus</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/pnasnexus/pgac039\">https://doi.org/10.1093/pnasnexus/pgac039</a>","chicago":"Glielmo, Aldo, Claudio Zeni, Bingqing Cheng, Gabor Csanyi, and Alessandro Laio. “Ranking the Information Content of Distance Measures.” <i>PNAS Nexus</i>. Oxford University Press, 2022. <a href=\"https://doi.org/10.1093/pnasnexus/pgac039\">https://doi.org/10.1093/pnasnexus/pgac039</a>.","ista":"Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. 2022. Ranking the information content of distance measures. PNAS Nexus. 1(2), pgac039.","ieee":"A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, and A. Laio, “Ranking the information content of distance measures,” <i>PNAS Nexus</i>, vol. 1, no. 2. Oxford University Press, 2022.","short":"A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, A. Laio, PNAS Nexus 1 (2022)."}},{"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"status":"public","ec_funded":1,"scopus_import":"1","month":"07","title":"Multitier mechanics control stromal adaptations in swelling lymph nodes","date_published":"2022-07-11T00:00:00Z","year":"2022","_id":"9794","intvolume":"        23","date_updated":"2025-06-11T13:52:43Z","publication_identifier":{"issn":["1529-2908"],"eissn":["1529-2916"]},"date_created":"2021-08-06T09:09:11Z","author":[{"id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","first_name":"Frank P","last_name":"Assen","orcid":"0000-0003-3470-6119","full_name":"Assen, Frank P"},{"full_name":"Abe, Jun","last_name":"Abe","first_name":"Jun"},{"last_name":"Hons","first_name":"Miroslav","id":"4167FE56-F248-11E8-B48F-1D18A9856A87","full_name":"Hons, Miroslav","orcid":"0000-0002-6625-3348"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","first_name":"Robert"},{"first_name":"Shayan","last_name":"Shamipour","id":"40B34FE2-F248-11E8-B48F-1D18A9856A87","full_name":"Shamipour, Shayan"},{"full_name":"Kaufmann, Walter","orcid":"0000-0001-9735-5315","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","last_name":"Kaufmann","first_name":"Walter"},{"full_name":"Costanzo, Tommaso","orcid":"0000-0001-9732-3815","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","first_name":"Tommaso"},{"full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996","id":"2B819732-F248-11E8-B48F-1D18A9856A87","last_name":"Krens","first_name":"Gabriel"},{"full_name":"Brown, Markus","first_name":"Markus","last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ludewig, Burkhard","first_name":"Burkhard","last_name":"Ludewig"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"},{"full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Weninger, Wolfgang","first_name":"Wolfgang","last_name":"Weninger"},{"last_name":"Hannezo","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561"},{"full_name":"Luther, Sanjiv A.","last_name":"Luther","first_name":"Sanjiv A."},{"first_name":"Jens V.","last_name":"Stein","full_name":"Stein, Jens V."},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-4561-241X"}],"project":[{"call_identifier":"H2020","_id":"25FE9508-B435-11E9-9278-68D0E5697425","grant_number":"724373","name":"Cellular Navigation Along Spatial Gradients"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular cells that form dedicated niches for immune cell interaction and capsular fibroblasts that build a shell around the organ. Immunological challenge causes LNs to increase more than tenfold in size within a few days. Here, we characterized the biomechanics of LN swelling on the cellular and organ scale. We identified lymphocyte trapping by influx and proliferation as drivers of an outward pressure force, causing fibroblastic reticular cells of the T-zone (TRCs) and their associated conduits to stretch. After an initial phase of relaxation, TRCs sensed the resulting strain through cell matrix adhesions, which coordinated local growth and remodeling of the stromal network. While the expanded TRC network readopted its typical configuration, a massive fibrotic reaction of the organ capsule set in and countered further organ expansion. Thus, different fibroblast populations mechanically control LN swelling in a multitier fashion."}],"volume":23,"oa":1,"external_id":{"pmid":["35817845"],"isi":["000822975900002"]},"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2022-07-25T07:11:32Z","page":"1246-1255","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"PreCl"},{"_id":"LifeSc"}],"doi":"10.1038/s41590-022-01257-4","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"This research was supported by the Scientific Service Units of IST Austria through resources provided by the Imaging and Optics, Electron Microscopy, Preclinical and Life Science Facilities. We thank C. Moussion for providing anti-PNAd antibody and D. Critchley for Talin1-floxed mice, and E. Papusheva for providing a custom 3D channel alignment script. This work was supported by a European Research Council grant ERC-CoG-72437 to M.S. M.H. was supported by Czech Sciencundation GACR 20-24603Y and Charles University PRIMUS/20/MED/013.","day":"11","isi":1,"citation":{"apa":"Assen, F. P., Abe, J., Hons, M., Hauschild, R., Shamipour, S., Kaufmann, W., … Sixt, M. K. (2022). Multitier mechanics control stromal adaptations in swelling lymph nodes. <i>Nature Immunology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41590-022-01257-4\">https://doi.org/10.1038/s41590-022-01257-4</a>","ama":"Assen FP, Abe J, Hons M, et al. Multitier mechanics control stromal adaptations in swelling lymph nodes. <i>Nature Immunology</i>. 2022;23:1246-1255. doi:<a href=\"https://doi.org/10.1038/s41590-022-01257-4\">10.1038/s41590-022-01257-4</a>","ista":"Assen FP, Abe J, Hons M, Hauschild R, Shamipour S, Kaufmann W, Costanzo T, Krens G, Brown M, Ludewig B, Hippenmeyer S, Heisenberg C-PJ, Weninger W, Hannezo EB, Luther SA, Stein JV, Sixt MK. 2022. Multitier mechanics control stromal adaptations in swelling lymph nodes. Nature Immunology. 23, 1246–1255.","chicago":"Assen, Frank P, Jun Abe, Miroslav Hons, Robert Hauschild, Shayan Shamipour, Walter Kaufmann, Tommaso Costanzo, et al. “Multitier Mechanics Control Stromal Adaptations in Swelling Lymph Nodes.” <i>Nature Immunology</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41590-022-01257-4\">https://doi.org/10.1038/s41590-022-01257-4</a>.","mla":"Assen, Frank P., et al. “Multitier Mechanics Control Stromal Adaptations in Swelling Lymph Nodes.” <i>Nature Immunology</i>, vol. 23, Springer Nature, 2022, pp. 1246–55, doi:<a href=\"https://doi.org/10.1038/s41590-022-01257-4\">10.1038/s41590-022-01257-4</a>.","ieee":"F. P. Assen <i>et al.</i>, “Multitier mechanics control stromal adaptations in swelling lymph nodes,” <i>Nature Immunology</i>, vol. 23. Springer Nature, pp. 1246–1255, 2022.","short":"F.P. Assen, J. Abe, M. Hons, R. Hauschild, S. Shamipour, W. Kaufmann, T. Costanzo, G. Krens, M. Brown, B. Ludewig, S. Hippenmeyer, C.-P.J. Heisenberg, W. Weninger, E.B. Hannezo, S.A. Luther, J.V. Stein, M.K. Sixt, Nature Immunology 23 (2022) 1246–1255."},"corr_author":"1","file":[{"success":1,"file_id":"11642","content_type":"application/pdf","file_size":11475325,"date_created":"2022-07-25T07:11:32Z","relation":"main_file","creator":"dernst","checksum":"628e7b49809f22c75b428842efe70c68","access_level":"open_access","file_name":"2022_NatureImmunology_Assen.pdf","date_updated":"2022-07-25T07:11:32Z"}],"department":[{"_id":"SiHi"},{"_id":"CaHe"},{"_id":"EdHa"},{"_id":"EM-Fac"},{"_id":"Bio"},{"_id":"MiSi"}],"quality_controlled":"1","publication_status":"published","type":"journal_article","publication":"Nature Immunology","ddc":["570"],"has_accepted_license":"1","publisher":"Springer Nature"},{"page":"553-573","acknowledgement":"This work was supported by FONDECYT grants 1151432 and 1210169 to Gonzalo J. Marín. FONDECYT grant 1210069 to Jorge Mpodozis. Spanish Ministry of Science, Innovation and Universities (MCIU), State Research Agency (AEI) and European Regional Development Fund (FEDER), PGC2018-098229-B-100 to José L Ferrán. Spanish Ministry of Economy and Competitiveness Excellency Grant BFU2014-57516P (with European Community FEDER support), and a Seneca Foundation (Autonomous Community of Murcia) Excellency Research contract, ref: 19904/ GERM/15; project name: Genoarchitectonic Brain Development and Applications to Neurodegenerative Diseases and Cancer (5672 Fundación Séneca) to Luis Puelles. The authors gratefully acknowledge the valuable editorial help provided by Sara Fernández-Collemann. The authors also thank Elisa Sentis and Solano Henríquez for expert technical help.","doi":"10.1002/cne.25229","issue":"2","citation":{"ieee":"R. Reyes‐Pinto <i>et al.</i>, “Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum,” <i>Journal of Comparative Neurology</i>, vol. 530, no. 2. Wiley, pp. 553–573, 2022.","short":"R. Reyes‐Pinto, J.L. Ferrán, T.A. Vega Zuniga, C. González‐Cabrera, H. Luksch, J. Mpodozis, L. Puelles, G.J. Marín, Journal of Comparative Neurology 530 (2022) 553–573.","apa":"Reyes‐Pinto, R., Ferrán, J. L., Vega Zuniga, T. A., González‐Cabrera, C., Luksch, H., Mpodozis, J., … Marín, G. J. (2022). Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum. <i>Journal of Comparative Neurology</i>. Wiley. <a href=\"https://doi.org/10.1002/cne.25229\">https://doi.org/10.1002/cne.25229</a>","ama":"Reyes‐Pinto R, Ferrán JL, Vega Zuniga TA, et al. Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum. <i>Journal of Comparative Neurology</i>. 2022;530(2):553-573. doi:<a href=\"https://doi.org/10.1002/cne.25229\">10.1002/cne.25229</a>","chicago":"Reyes‐Pinto, Rosana, José L. Ferrán, Tomas A Vega Zuniga, Cristian González‐Cabrera, Harald Luksch, Jorge Mpodozis, Luis Puelles, and Gonzalo J. Marín. “Change in the Neurochemical Signature and Morphological Development of the Parvocellular Isthmic Projection to the Avian Tectum.” <i>Journal of Comparative Neurology</i>. Wiley, 2022. <a href=\"https://doi.org/10.1002/cne.25229\">https://doi.org/10.1002/cne.25229</a>.","ista":"Reyes‐Pinto R, Ferrán JL, Vega Zuniga TA, González‐Cabrera C, Luksch H, Mpodozis J, Puelles L, Marín GJ. 2022. Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum. Journal of Comparative Neurology. 530(2), 553–573.","mla":"Reyes‐Pinto, Rosana, et al. “Change in the Neurochemical Signature and Morphological Development of the Parvocellular Isthmic Projection to the Avian Tectum.” <i>Journal of Comparative Neurology</i>, vol. 530, no. 2, Wiley, 2022, pp. 553–73, doi:<a href=\"https://doi.org/10.1002/cne.25229\">10.1002/cne.25229</a>."},"isi":1,"day":"01","department":[{"_id":"MaJö"}],"type":"journal_article","publication_status":"published","quality_controlled":"1","publication":"Journal of Comparative Neurology","publisher":"Wiley","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","status":"public","date_published":"2022-02-01T00:00:00Z","title":"Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum","scopus_import":"1","month":"02","intvolume":"       530","_id":"9955","year":"2022","publication_identifier":{"eissn":["1096-9861"],"issn":["0021-9967"]},"date_updated":"2023-08-11T10:58:17Z","author":[{"full_name":"Reyes‐Pinto, Rosana","last_name":"Reyes‐Pinto","first_name":"Rosana"},{"full_name":"Ferrán, José L.","first_name":"José L.","last_name":"Ferrán"},{"full_name":"Vega Zuniga, Tomas A","last_name":"Vega Zuniga","first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87"},{"last_name":"González‐Cabrera","first_name":"Cristian","full_name":"González‐Cabrera, Cristian"},{"last_name":"Luksch","first_name":"Harald","full_name":"Luksch, Harald"},{"full_name":"Mpodozis, Jorge","last_name":"Mpodozis","first_name":"Jorge"},{"first_name":"Luis","last_name":"Puelles","full_name":"Puelles, Luis"},{"full_name":"Marín, Gonzalo J.","last_name":"Marín","first_name":"Gonzalo J."}],"date_created":"2021-08-23T08:40:59Z","abstract":[{"lang":"eng","text":"Neurons can change their classical neurotransmitters during ontogeny, sometimes going through stages of dual release. Here, we explored the development of the neurotransmitter identity of neurons of the avian nucleus isthmi parvocellularis (Ipc), whose axon terminals are retinotopically arranged in the optic tectum (TeO) and exert a focal gating effect upon the ascending transmission of retinal inputs. Although cholinergic and glutamatergic markers are both found in Ipc neurons and terminals of adult pigeons and chicks, the mRNA expression of the vesicular acetylcholine transporter, VAChT, is weak or absent. To explore how the Ipc neurotransmitter identity is established during ontogeny, we analyzed the expression of mRNAs coding for cholinergic (ChAT, VAChT, and CHT) and glutamatergic (VGluT2 and VGluT3) markers in chick embryos at different developmental stages. We found that between E12 and E18, Ipc neurons expressed all cholinergic mRNAs and also VGluT2 mRNA; however, from E16 through posthatch stages, VAChT mRNA expression was specifically diminished. Our ex vivo deposits of tracer crystals and intracellular filling experiments revealed that Ipc axons exhibit a mature paintbrush morphology late in development, experiencing marked morphological transformations during the period of presumptive dual vesicular transmitter release. Additionally, although ChAT protein immunoassays increasingly label the growing Ipc axon, this labeling was consistently restricted to sparse portions of the terminal branches. Combined, these results suggest that the synthesis of glutamate and acetylcholine, and their vesicular release, is complexly linked to the developmental processes of branching, growing and remodeling of these unique axons."}],"oa_version":"None","pmid":1,"external_id":{"pmid":["34363623"],"isi":["000686420000001"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":530},{"date_published":"2022-03-01T00:00:00Z","scopus_import":"1","month":"03","title":"Resurgence analysis of quantum invariants of Seifert fibered homology spheres","intvolume":"       105","_id":"9977","year":"2022","language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","article_type":"original","status":"public","ec_funded":1,"abstract":[{"lang":"eng","text":"For a Seifert fibered homology sphere X we show that the q-series invariant Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki series Z0(X). We show that for every even k ∈ N there exists a full asymptotic expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit Zˆ0(X; e 2πi/k) exists and is equal to the\r\nWRT quantum invariant τk(X). We show that the poles of the Borel transform of Z0(X) coincide with the classical complex Chern-Simons values, which we further show classifies the corresponding components of the moduli space of flat SL(2, C)-connections."}],"oa_version":"Published Version","arxiv":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000755205700001"],"arxiv":["1811.05376"]},"oa":1,"volume":105,"publication_identifier":{"eissn":["1469-7750"]},"date_updated":"2025-04-14T07:43:49Z","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"date_created":"2021-08-31T12:51:40Z","author":[{"full_name":"Mistegaard, William","id":"41B03CD0-62AE-11E9-84EF-0718E6697425","first_name":"William","last_name":"Mistegaard"},{"full_name":"Andersen, Jørgen Ellegaard","last_name":"Andersen","first_name":"Jørgen Ellegaard"}],"issue":"2","doi":"10.1112/jlms.12506","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"We warmly thank S. Gukov for valuable discussions on the GPPV invariant ̂Z𝑎(𝑀3; 𝑞). The first\r\nauthor was supported in part by the center of excellence grant ‘Center for Quantum Geometry\r\nof Moduli Spaces’ from the Danish National Research Foundation (DNRF95) and by the ERCSynergy\r\ngrant ‘ReNewQuantum’. The second author received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement no. 754411.","isi":1,"day":"01","citation":{"mla":"Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of Quantum Invariants of Seifert Fibered Homology Spheres.” <i>Journal of the London Mathematical Society</i>, vol. 105, no. 2, Wiley, 2022, pp. 709–64, doi:<a href=\"https://doi.org/10.1112/jlms.12506\">10.1112/jlms.12506</a>.","chicago":"Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of Quantum Invariants of Seifert Fibered Homology Spheres.” <i>Journal of the London Mathematical Society</i>. Wiley, 2022. <a href=\"https://doi.org/10.1112/jlms.12506\">https://doi.org/10.1112/jlms.12506</a>.","ista":"Mistegaard W, Andersen JE. 2022. Resurgence analysis of quantum invariants of Seifert fibered homology spheres. Journal of the London Mathematical Society. 105(2), 709–764.","ama":"Mistegaard W, Andersen JE. Resurgence analysis of quantum invariants of Seifert fibered homology spheres. <i>Journal of the London Mathematical Society</i>. 2022;105(2):709-764. doi:<a href=\"https://doi.org/10.1112/jlms.12506\">10.1112/jlms.12506</a>","apa":"Mistegaard, W., &#38; Andersen, J. E. (2022). Resurgence analysis of quantum invariants of Seifert fibered homology spheres. <i>Journal of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/jlms.12506\">https://doi.org/10.1112/jlms.12506</a>","short":"W. Mistegaard, J.E. Andersen, Journal of the London Mathematical Society 105 (2022) 709–764.","ieee":"W. Mistegaard and J. E. Andersen, “Resurgence analysis of quantum invariants of Seifert fibered homology spheres,” <i>Journal of the London Mathematical Society</i>, vol. 105, no. 2. Wiley, pp. 709–764, 2022."},"file_date_updated":"2022-03-24T11:42:25Z","page":"709-764","ddc":["510"],"publication":"Journal of the London Mathematical Society","publisher":"Wiley","has_accepted_license":"1","department":[{"_id":"TaHa"}],"file":[{"checksum":"9c72327d39f34f1a6eaa98fa4b8493f2","creator":"dernst","access_level":"open_access","date_updated":"2022-03-24T11:42:25Z","file_name":"2022_JourLondonMathSoc_Andersen.pdf","date_created":"2022-03-24T11:42:25Z","relation":"main_file","content_type":"application/pdf","file_size":649130,"success":1,"file_id":"10917"}],"corr_author":"1","publication_status":"published","type":"journal_article","quality_controlled":"1"},{"quality_controlled":"1","type":"journal_article","publication_status":"published","file":[{"creator":"dernst","access_level":"open_access","checksum":"51d580aff2327dd957946208a9749e1a","date_updated":"2022-02-21T07:51:33Z","file_name":"2022_NatureCommunications_Cheung.pdf","date_created":"2022-02-21T07:51:33Z","relation":"main_file","file_size":7910519,"content_type":"application/pdf","success":1,"file_id":"10777"}],"department":[{"_id":"SiHi"}],"has_accepted_license":"1","publisher":"Springer Nature","ddc":["570"],"publication":"Nature Communications","file_date_updated":"2022-02-21T07:51:33Z","citation":{"mla":"Cheung, Giselle T., et al. “Physiological Synaptic Activity and Recognition Memory Require Astroglial Glutamine.” <i>Nature Communications</i>, vol. 13, 753, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-28331-7\">10.1038/s41467-022-28331-7</a>.","chicago":"Cheung, Giselle T, Danijela Bataveljic, Josien Visser, Naresh Kumar, Julien Moulard, Glenn Dallérac, Daria Mozheiko, et al. “Physiological Synaptic Activity and Recognition Memory Require Astroglial Glutamine.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-28331-7\">https://doi.org/10.1038/s41467-022-28331-7</a>.","ista":"Cheung GT, Bataveljic D, Visser J, Kumar N, Moulard J, Dallérac G, Mozheiko D, Rollenhagen A, Ezan P, Mongin C, Chever O, Bemelmans AP, Lübke J, Leray I, Rouach N. 2022. Physiological synaptic activity and recognition memory require astroglial glutamine. Nature Communications. 13, 753.","apa":"Cheung, G. T., Bataveljic, D., Visser, J., Kumar, N., Moulard, J., Dallérac, G., … Rouach, N. (2022). Physiological synaptic activity and recognition memory require astroglial glutamine. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-28331-7\">https://doi.org/10.1038/s41467-022-28331-7</a>","ama":"Cheung GT, Bataveljic D, Visser J, et al. Physiological synaptic activity and recognition memory require astroglial glutamine. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-28331-7\">10.1038/s41467-022-28331-7</a>","short":"G.T. Cheung, D. Bataveljic, J. Visser, N. Kumar, J. Moulard, G. Dallérac, D. Mozheiko, A. Rollenhagen, P. Ezan, C. Mongin, O. Chever, A.P. Bemelmans, J. Lübke, I. Leray, N. Rouach, Nature Communications 13 (2022).","ieee":"G. T. Cheung <i>et al.</i>, “Physiological synaptic activity and recognition memory require astroglial glutamine,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022."},"isi":1,"day":"08","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"We thank D. Mazaud and. J. Cazères for technical assistance. This work was supported by grants from the European Research Council (Consolidator grant #683154) and European Union’s Horizon 2020 research and innovation program (Marie Sklodowska-Curie Innovative Training Networks, grant #722053, EU-GliaPhD) to N.R. and from FP7-PEOPLE Marie Curie Intra-European Fellowship for career development (grant #622289) to G.C.","doi":"10.1038/s41467-022-28331-7","article_number":"753","author":[{"full_name":"Cheung, Giselle T","orcid":"0000-0001-8457-2572","last_name":"Cheung","first_name":"Giselle T","id":"471195F6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bataveljic, Danijela","first_name":"Danijela","last_name":"Bataveljic"},{"first_name":"Josien","last_name":"Visser","full_name":"Visser, Josien"},{"full_name":"Kumar, Naresh","first_name":"Naresh","last_name":"Kumar"},{"full_name":"Moulard, Julien","last_name":"Moulard","first_name":"Julien"},{"first_name":"Glenn","last_name":"Dallérac","full_name":"Dallérac, Glenn"},{"first_name":"Daria","last_name":"Mozheiko","full_name":"Mozheiko, Daria"},{"last_name":"Rollenhagen","first_name":"Astrid","full_name":"Rollenhagen, Astrid"},{"full_name":"Ezan, Pascal","first_name":"Pascal","last_name":"Ezan"},{"full_name":"Mongin, Cédric","last_name":"Mongin","first_name":"Cédric"},{"last_name":"Chever","first_name":"Oana","full_name":"Chever, Oana"},{"last_name":"Bemelmans","first_name":"Alexis Pierre","full_name":"Bemelmans, Alexis Pierre"},{"first_name":"Joachim","last_name":"Lübke","full_name":"Lübke, Joachim"},{"full_name":"Leray, Isabelle","last_name":"Leray","first_name":"Isabelle"},{"full_name":"Rouach, Nathalie","first_name":"Nathalie","last_name":"Rouach"}],"date_created":"2022-02-20T23:01:30Z","date_updated":"2026-04-02T12:22:38Z","publication_identifier":{"eissn":["2041-1723"]},"volume":13,"oa":1,"external_id":{"pmid":["35136061"],"isi":["000757297200017"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Presynaptic glutamate replenishment is fundamental to brain function. In high activity regimes, such as epileptic episodes, this process is thought to rely on the glutamate-glutamine cycle between neurons and astrocytes. However the presence of an astroglial glutamine supply, as well as its functional relevance in vivo in the healthy brain remain controversial, partly due to a lack of tools that can directly examine glutamine transfer. Here, we generated a fluorescent probe that tracks glutamine in live cells, which provides direct visual evidence of an activity-dependent glutamine supply from astroglial networks to presynaptic structures under physiological conditions. This mobilization is mediated by connexin43, an astroglial protein with both gap-junction and hemichannel functions, and is essential for synaptic transmission and object recognition memory. Our findings uncover an indispensable recruitment of astroglial glutamine in physiological synaptic activity and memory via an unconventional pathway, thus providing an astrocyte basis for cognitive processes."}],"status":"public","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2022","_id":"10764","intvolume":"        13","title":"Physiological synaptic activity and recognition memory require astroglial glutamine","month":"02","scopus_import":"1","date_published":"2022-02-08T00:00:00Z"},{"date_updated":"2026-04-02T12:14:43Z","publication_identifier":{"eissn":["2041-1723"]},"date_created":"2022-02-20T23:01:30Z","author":[{"full_name":"Herguedas, Beatriz","first_name":"Beatriz","last_name":"Herguedas"},{"full_name":"Kohegyi, Bianka K.","last_name":"Kohegyi","first_name":"Bianka K."},{"full_name":"Dohrke, Jan Niklas","last_name":"Dohrke","first_name":"Jan Niklas"},{"id":"63836096-4690-11EA-BD4E-32803DDC885E","last_name":"Watson","first_name":"Jake","full_name":"Watson, Jake","orcid":"0000-0002-8698-3823"},{"first_name":"Danyang","last_name":"Zhang","full_name":"Zhang, Danyang"},{"full_name":"Ho, Hinze","first_name":"Hinze","last_name":"Ho"},{"full_name":"Shaikh, Saher A.","first_name":"Saher A.","last_name":"Shaikh"},{"full_name":"Lape, Remigijus","first_name":"Remigijus","last_name":"Lape"},{"full_name":"Krieger, James M.","first_name":"James M.","last_name":"Krieger"},{"full_name":"Greger, Ingo H.","last_name":"Greger","first_name":"Ingo H."}],"oa_version":"Published Version","abstract":[{"text":"AMPA-type glutamate receptors (AMPARs) mediate rapid signal transmission at excitatory\r\nsynapses in the brain. Glutamate binding to the receptor’s ligand-binding domains (LBDs)\r\nleads to ion channel activation and desensitization. Gating kinetics shape synaptic transmission\r\nand are strongly modulated by transmembrane AMPAR regulatory proteins (TARPs)\r\nthrough currently incompletely resolved mechanisms. Here, electron cryo-microscopy\r\nstructures of the GluA1/2 TARP-γ8 complex, in both open and desensitized states\r\n(at 3.5 Å), reveal state-selective engagement of the LBDs by the large TARP-γ8 loop (‘β1’),\r\nelucidating how this TARP stabilizes specific gating states. We further show how TARPs alter\r\nchannel rectification, by interacting with the pore helix of the selectivity filter. Lastly, we\r\nreveal that the Q/R-editing site couples the channel constriction at the filter entrance to the\r\ngate, and forms the major cation binding site in the conduction path. Our results provide a\r\nmechanistic framework of how TARPs modulate AMPAR gating and conductance.","lang":"eng"}],"volume":13,"oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","pmid":1,"external_id":{"pmid":["35136046"],"isi":["000757297200008"]},"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"status":"public","scopus_import":"1","month":"02","title":"Mechanisms underlying TARP modulation of the GluA1/2-γ8 AMPA receptor","date_published":"2022-02-08T00:00:00Z","_id":"10763","year":"2022","intvolume":"        13","file":[{"content_type":"application/pdf","file_size":2625540,"success":1,"file_id":"10778","file_name":"2022_NatureCommunications_Herguedas.pdf","date_updated":"2022-02-21T07:59:32Z","creator":"dernst","access_level":"open_access","checksum":"d86ee8eabe8b794730729ffbb1a8832e","relation":"main_file","date_created":"2022-02-21T07:59:32Z"}],"department":[{"_id":"PeJo"}],"quality_controlled":"1","publication_status":"published","type":"journal_article","publication":"Nature Communications","ddc":["570"],"has_accepted_license":"1","publisher":"Springer Nature","file_date_updated":"2022-02-21T07:59:32Z","doi":"10.1038/s41467-022-28404-7","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"We thank Ondrej Cais for critical reading of the manuscript. We are grateful to LMB\r\nscientific computing and the EM facility for support, Paul Emsley for help with model\r\nbuilding and Takanori Nakane for helpful comments with Relion 3.1. This work was\r\nsupported by grants from the Medical Research Council (MC_U105174197) and BBSRC\r\n(BB/N002113/1) to I.H.G, and grants from the MCIN/AEI/ 10.13039/501100011033 and\r\n“ESF Investing in your future” to B.H (PID2019-106284GA-I00 and RYC2018-025720-I).","article_number":"734","day":"08","isi":1,"citation":{"ieee":"B. Herguedas <i>et al.</i>, “Mechanisms underlying TARP modulation of the GluA1/2-γ8 AMPA receptor,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","short":"B. Herguedas, B.K. Kohegyi, J.N. Dohrke, J. Watson, D. Zhang, H. Ho, S.A. Shaikh, R. Lape, J.M. Krieger, I.H. Greger, Nature Communications 13 (2022).","mla":"Herguedas, Beatriz, et al. “Mechanisms Underlying TARP Modulation of the GluA1/2-Γ8 AMPA Receptor.” <i>Nature Communications</i>, vol. 13, 734, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-28404-7\">10.1038/s41467-022-28404-7</a>.","ama":"Herguedas B, Kohegyi BK, Dohrke JN, et al. Mechanisms underlying TARP modulation of the GluA1/2-γ8 AMPA receptor. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-28404-7\">10.1038/s41467-022-28404-7</a>","apa":"Herguedas, B., Kohegyi, B. K., Dohrke, J. N., Watson, J., Zhang, D., Ho, H., … Greger, I. H. (2022). Mechanisms underlying TARP modulation of the GluA1/2-γ8 AMPA receptor. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-28404-7\">https://doi.org/10.1038/s41467-022-28404-7</a>","ista":"Herguedas B, Kohegyi BK, Dohrke JN, Watson J, Zhang D, Ho H, Shaikh SA, Lape R, Krieger JM, Greger IH. 2022. Mechanisms underlying TARP modulation of the GluA1/2-γ8 AMPA receptor. Nature Communications. 13, 734.","chicago":"Herguedas, Beatriz, Bianka K. Kohegyi, Jan Niklas Dohrke, Jake Watson, Danyang Zhang, Hinze Ho, Saher A. Shaikh, Remigijus Lape, James M. Krieger, and Ingo H. Greger. “Mechanisms Underlying TARP Modulation of the GluA1/2-Γ8 AMPA Receptor.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-28404-7\">https://doi.org/10.1038/s41467-022-28404-7</a>."}},{"abstract":[{"text":"studiamos aspectos de Teoría Cuántica de Campos a densidad finita usando técnicas y conceptos de información cuántica. Nos enfocamos en fermiones de Dirac masivos con potencial químico en 1+1 dimensiones espacio-temporales. Usando la entropía de entrelazamiento en un intervalo, construimos la función c entrópica que es finita. Esta función c no es monótona, e incorpora el entrelazamiento de largo alcance proveniente de la superficie de Fermi. Motivados por trabajos previos de modelos en la red, calculamos numéricamente las entropías de Renyi y encontramos oscilaciones de Friedel. Seguidamente, analizamos la información mutua como una medida de correlación entre diferentes regiones. Usando una expansión de distancia grande desarrollada por Cardy, argumentamos que la información mutua detecta las correlaciones inducidas por la superficie de Fermi todavía al orden dominante en la expansión. Finalmente, analizamos la entropía relativa y sus generalizaciones de Renyi para distinguir estados con diferente carga. Encontramos que estados en diferentes sectores de superselección dan origen a un comportamiento super-extensivo en la entropía relativa.","lang":"eng"}],"oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","volume":32,"oa":1,"OA_type":"gold","publication_identifier":{"eissn":["1850-1168"]},"date_updated":"2026-04-02T12:30:12Z","date_created":"2022-02-20T23:01:32Z","author":[{"first_name":"L.","last_name":"Daguerre","full_name":"Daguerre, L."},{"first_name":"G.","last_name":"Torroba","full_name":"Torroba, G."},{"orcid":"0000-0002-5383-2869","full_name":"Medina Ramos, Raimel A","first_name":"Raimel A","last_name":"Medina Ramos","id":"CE680B90-D85A-11E9-B684-C920E6697425"},{"full_name":"Solís, M.","last_name":"Solís","first_name":"M."}],"date_published":"2022-01-13T00:00:00Z","month":"01","scopus_import":"1","title":"Non relativistic quantum field theory: Dynamics and irreversibility","intvolume":"        32","year":"2022","_id":"10769","language":[{"iso":"spa"}],"article_processing_charge":"No","article_type":"original","status":"public","DOAJ_listed":"1","ddc":["530"],"publication":"Anales de la Asociacion Fisica Argentina","publisher":"Asociación Física Argentina","has_accepted_license":"1","OA_place":"publisher","department":[{"_id":"MaSe"}],"file":[{"file_id":"10782","success":1,"content_type":"application/pdf","file_size":4505751,"date_created":"2022-02-21T09:32:44Z","relation":"main_file","creator":"dernst","access_level":"open_access","checksum":"ca66a3017205677c5b4d22b3bb74fb0b","date_updated":"2022-02-21T09:32:44Z","file_name":"2022_AnalesAFA_Daguerre.pdf"}],"publication_status":"published","type":"journal_article","quality_controlled":"1","doi":"10.31527/analesafa.2021.32.4.93","issue":"4","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"Se agradece a Horacio Casini por distintas discusiones y comentarios a lo largo del trabajo. LD cuenta con el apoyo de CNEA y UNCuyo, Inst. GT cuenta con el apoyo de CONICET,\r\nANPCyT, CNEA, y UNCuyo, Inst. Balseiro. RM cuenta con el apoyo de IST Austria. MS cuenta con el apoyode CONICET y UNCuyo, Inst. Balseiro. También se agradece a la Asociación Argentina de Física por la posibilidad de presentar este artículo en el marco de una Mención Especial por el Premio Luis Másperi 2020.","day":"13","citation":{"mla":"Daguerre, L., et al. “Non relativistic quantum field theory: Dynamics and irreversibility.” <i>Anales de la Asociacion Fisica Argentina</i>, vol. 32, no. 4, Asociación Física Argentina, 2022, pp. 93–98, doi:<a href=\"https://doi.org/10.31527/analesafa.2021.32.4.93\">10.31527/analesafa.2021.32.4.93</a>.","ama":"Daguerre L, Torroba G, Medina Ramos RA, Solís M. Non relativistic quantum field theory: Dynamics and irreversibility. <i>Anales de la Asociacion Fisica Argentina</i>. 2022;32(4):93-98. doi:<a href=\"https://doi.org/10.31527/analesafa.2021.32.4.93\">10.31527/analesafa.2021.32.4.93</a>","apa":"Daguerre, L., Torroba, G., Medina Ramos, R. A., &#38; Solís, M. (2022). Non relativistic quantum field theory: Dynamics and irreversibility. <i>Anales de la Asociacion Fisica Argentina</i>. Asociación Física Argentina. <a href=\"https://doi.org/10.31527/analesafa.2021.32.4.93\">https://doi.org/10.31527/analesafa.2021.32.4.93</a>","chicago":"Daguerre, L., G. Torroba, Raimel A Medina Ramos, and M. Solís. “Non relativistic quantum field theory: Dynamics and irreversibility.” <i>Anales de la Asociacion Fisica Argentina</i>. Asociación Física Argentina, 2022. <a href=\"https://doi.org/10.31527/analesafa.2021.32.4.93\">https://doi.org/10.31527/analesafa.2021.32.4.93</a>.","ista":"Daguerre L, Torroba G, Medina Ramos RA, Solís M. 2022. Non relativistic quantum field theory: Dynamics and irreversibility. Anales de la Asociacion Fisica Argentina. 32(4), 93–98.","ieee":"L. Daguerre, G. Torroba, R. A. Medina Ramos, and M. Solís, “Non relativistic quantum field theory: Dynamics and irreversibility,” <i>Anales de la Asociacion Fisica Argentina</i>, vol. 32, no. 4. Asociación Física Argentina, pp. 93–98, 2022.","short":"L. Daguerre, G. Torroba, R.A. Medina Ramos, M. Solís, Anales de la Asociacion Fisica Argentina 32 (2022) 93–98."},"file_date_updated":"2022-02-21T09:32:44Z","page":"93-98"}]
