[{"file_date_updated":"2021-06-02T10:22:33Z","_id":"9441","author":[{"full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel","last_name":"Boissonnat"},{"full_name":"Kachanovich, Siargey","first_name":"Siargey","last_name":"Kachanovich"},{"first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs"}],"citation":{"ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, Virtual, 2021, vol. 189, p. 17:1-17:16.","mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>.","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>. Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>","apa":"Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In <i>37th International Symposium on Computational Geometry (SoCG 2021)</i> (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>."},"scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       189","project":[{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"publication":"37th International Symposium on Computational Geometry (SoCG 2021)","year":"2021","place":"Dagstuhl, Germany","volume":189,"title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","related_material":{"record":[{"relation":"later_version","status":"public","id":"12960"}]},"page":"17:1-17:16","department":[{"_id":"HeEd"}],"conference":{"location":"Virtual","start_date":"2021-06-07","end_date":"2021-06-11","name":"SoCG: Symposium on Computational Geometry"},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-184-9"]},"article_processing_charge":"No","date_created":"2021-06-02T10:10:55Z","acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"date_updated":"2025-04-15T07:09:18Z","oa_version":"Published Version","alternative_title":["LIPIcs"],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-06-02T10:22:33Z","creator":"mwintrae","access_level":"open_access","success":1,"file_size":1972902,"file_name":"LIPIcs-SoCG-2021-17.pdf","date_created":"2021-06-02T10:22:33Z","file_id":"9442","checksum":"c322aa48d5d35a35877896cc565705b6"}],"license":"https://creativecommons.org/licenses/by/4.0/","day":"02","status":"public","date_published":"2021-06-02T00:00:00Z","ddc":["005","516","514"],"publication_status":"published","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. ","lang":"eng"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","doi":"10.4230/LIPIcs.SoCG.2021.17","month":"06","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"pmid":1,"doi":"10.1093/plcell/koab122","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"month":"07","status":"public","date_published":"2021-07-01T00:00:00Z","abstract":[{"lang":"eng","text":"Endoplasmic reticulum–plasma membrane contact sites (ER–PM CS) play fundamental roles in all eukaryotic cells. Arabidopsis thaliana mutants lacking the ER–PM protein tether synaptotagmin1 (SYT1) exhibit decreased PM integrity under multiple abiotic stresses, such as freezing, high salt, osmotic stress, and mechanical damage. Here, we show that, together with SYT1, the stress-induced SYT3 is an ER–PM tether that also functions in maintaining PM integrity. The ER–PM CS localization of SYT1 and SYT3 is dependent on PM phosphatidylinositol-4-phosphate and is regulated by abiotic stress. Lipidomic analysis revealed that cold stress increased the accumulation of diacylglycerol at the PM in a syt1/3 double mutant relative to wild-type while the levels of most glycerolipid species remain unchanged. In addition, the SYT1-green fluorescent protein fusion preferentially binds diacylglycerol in vivo with little affinity for polar glycerolipids. Our work uncovers a SYT-dependent mechanism of stress adaptation counteracting the detrimental accumulation of diacylglycerol at the PM produced during episodes of abiotic stress."}],"publication_status":"published","ddc":["580"],"file":[{"access_level":"open_access","creator":"cchlebak","date_updated":"2021-10-14T13:36:38Z","relation":"main_file","content_type":"application/pdf","checksum":"22d596678d00310d793611864a6d0fcd","file_id":"10141","date_created":"2021-10-14T13:36:38Z","file_size":2952028,"file_name":"2021_PlantCell_RuizLopez.pdf","success":1}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","day":"01","oa":1,"language":[{"iso":"eng"}],"ec_funded":1,"issue":"7","oa_version":"Published Version","date_updated":"2025-04-14T07:45:00Z","department":[{"_id":"JiFr"}],"publication_identifier":{"eissn":["1532-298x"],"issn":["1040-4651"]},"date_created":"2021-06-02T13:13:58Z","acknowledgement":"We would also like to thank Lothar Willmitzer for the lipidomic analysis at the Max Planck Institute of Molecular Plant Physiology (Potsdam, Germany). We thank Manuela Vega from SCI for her technical assistance in image analysis. We thank John R. Pearson and the Bionand Nanoimaging Unit, F. David Navas Fernández and the SCAI Imaging Facility and The Plant Cell Biology facility at the Shanghai Center for Plant Stress Biology for assistance with confocal microscopy. The FaFAH1 clone was a gift from Iraida Amaya Saavedra (IFAPA-Centro de Churriana, Málaga, Spain). The AHA3 antibody against the H+-ATPase was a gift from Ramón Serrano Salom (Instituto de Biología Molecular y Celular de Plantas, Valencia, Spain). The MAP-mTU2-SAC1 construct was provided by Yvon Jaillais (Laboratoire Reproduction et Développement des Plantes, Univ Lyon, France). The pGWB5 from the pGWB vector series, was provided by Tsuyoshi Nakagawa (Department of Molecular and Functional Genomics, Shimane University). We thank Plan Propio from the University of Málaga for financial support.\r\nFunding","article_processing_charge":"No","year":"2021","publication":"Plant Cell","project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985"}],"title":"Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress","article_type":"original","external_id":{"pmid":["33944955"],"isi":["000703938100026"]},"volume":33,"page":"2431-2453","type":"journal_article","isi":1,"publisher":"American Society of Plant Biologists","intvolume":"        33","author":[{"last_name":"Ruiz-Lopez","first_name":"N","full_name":"Ruiz-Lopez, N"},{"full_name":"Pérez-Sancho, J","first_name":"J","last_name":"Pérez-Sancho"},{"first_name":"A","last_name":"Esteban Del Valle","full_name":"Esteban Del Valle, A"},{"first_name":"RP","last_name":"Haslam","full_name":"Haslam, RP"},{"full_name":"Vanneste, S","first_name":"S","last_name":"Vanneste"},{"last_name":"Catalá","first_name":"R","full_name":"Catalá, R"},{"full_name":"Perea-Resa, C","first_name":"C","last_name":"Perea-Resa"},{"full_name":"Van Damme, D","first_name":"D","last_name":"Van Damme"},{"first_name":"S","last_name":"García-Hernández","full_name":"García-Hernández, S"},{"full_name":"Albert, A","last_name":"Albert","first_name":"A"},{"full_name":"Vallarino, J","last_name":"Vallarino","first_name":"J"},{"first_name":"J","last_name":"Lin","full_name":"Lin, J"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"},{"full_name":"Macho, AP","last_name":"Macho","first_name":"AP"},{"last_name":"Salinas","first_name":"J","full_name":"Salinas, J"},{"full_name":"Rosado, A","first_name":"A","last_name":"Rosado"},{"last_name":"Napier","first_name":"JA","full_name":"Napier, JA"},{"full_name":"Amorim-Silva, V","last_name":"Amorim-Silva","first_name":"V"},{"last_name":"Botella","first_name":"MA","full_name":"Botella, MA"}],"file_date_updated":"2021-10-14T13:36:38Z","_id":"9443","citation":{"ama":"Ruiz-Lopez N, Pérez-Sancho J, Esteban Del Valle A, et al. Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress. <i>Plant Cell</i>. 2021;33(7):2431-2453. doi:<a href=\"https://doi.org/10.1093/plcell/koab122\">10.1093/plcell/koab122</a>","ieee":"N. Ruiz-Lopez <i>et al.</i>, “Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress,” <i>Plant Cell</i>, vol. 33, no. 7. American Society of Plant Biologists, pp. 2431–2453, 2021.","ista":"Ruiz-Lopez N, Pérez-Sancho J, Esteban Del Valle A, Haslam R, Vanneste S, Catalá R, Perea-Resa C, Van Damme D, García-Hernández S, Albert A, Vallarino J, Lin J, Friml J, Macho A, Salinas J, Rosado A, Napier J, Amorim-Silva V, Botella M. 2021. Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress. Plant Cell. 33(7), 2431–2453.","mla":"Ruiz-Lopez, N., et al. “Synaptotagmins at the Endoplasmic Reticulum-Plasma Membrane Contact Sites Maintain Diacylglycerol Homeostasis during Abiotic Stress.” <i>Plant Cell</i>, vol. 33, no. 7, American Society of Plant Biologists, 2021, pp. 2431–53, doi:<a href=\"https://doi.org/10.1093/plcell/koab122\">10.1093/plcell/koab122</a>.","chicago":"Ruiz-Lopez, N, J Pérez-Sancho, A Esteban Del Valle, RP Haslam, S Vanneste, R Catalá, C Perea-Resa, et al. “Synaptotagmins at the Endoplasmic Reticulum-Plasma Membrane Contact Sites Maintain Diacylglycerol Homeostasis during Abiotic Stress.” <i>Plant Cell</i>. American Society of Plant Biologists, 2021. <a href=\"https://doi.org/10.1093/plcell/koab122\">https://doi.org/10.1093/plcell/koab122</a>.","short":"N. Ruiz-Lopez, J. Pérez-Sancho, A. Esteban Del Valle, R. Haslam, S. Vanneste, R. Catalá, C. Perea-Resa, D. Van Damme, S. García-Hernández, A. Albert, J. Vallarino, J. Lin, J. Friml, A. Macho, J. Salinas, A. Rosado, J. Napier, V. Amorim-Silva, M. Botella, Plant Cell 33 (2021) 2431–2453.","apa":"Ruiz-Lopez, N., Pérez-Sancho, J., Esteban Del Valle, A., Haslam, R., Vanneste, S., Catalá, R., … Botella, M. (2021). Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1093/plcell/koab122\">https://doi.org/10.1093/plcell/koab122</a>"},"has_accepted_license":"1","quality_controlled":"1","scopus_import":"1"},{"year":"2021","publication":"Journal of The Electrochemical Society","external_id":{"isi":["000657724200001"]},"title":"Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes","volume":168,"department":[{"_id":"StFr"}],"publication_identifier":{"eissn":["1945-7111"],"issn":["0013-4651"]},"date_created":"2021-06-03T09:58:38Z","article_processing_charge":"No","author":[{"full_name":"Maffre, Marion","first_name":"Marion","last_name":"Maffre"},{"last_name":"Bouchal","first_name":"Roza","full_name":"Bouchal, Roza"},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander"},{"full_name":"Lindahl, Niklas","first_name":"Niklas","last_name":"Lindahl"},{"first_name":"Patrik","last_name":"Johansson","full_name":"Johansson, Patrik"},{"full_name":"Favier, Frédéric","first_name":"Frédéric","last_name":"Favier"},{"full_name":"Fontaine, Olivier","last_name":"Fontaine","first_name":"Olivier"},{"first_name":"Daniel","last_name":"Bélanger","full_name":"Bélanger, Daniel"}],"_id":"9447","citation":{"ieee":"M. Maffre <i>et al.</i>, “Investigation of electrochemical and chemical processes occurring at positive potentials in ‘Water-in-Salt’ electrolytes,” <i>Journal of The Electrochemical Society</i>, vol. 168, no. 5. IOP Publishing, 2021.","mla":"Maffre, Marion, et al. “Investigation of Electrochemical and Chemical Processes Occurring at Positive Potentials in ‘Water-in-Salt’ Electrolytes.” <i>Journal of The Electrochemical Society</i>, vol. 168, no. 5, 050550, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1149/1945-7111/ac0300\">10.1149/1945-7111/ac0300</a>.","ista":"Maffre M, Bouchal R, Freunberger SA, Lindahl N, Johansson P, Favier F, Fontaine O, Bélanger D. 2021. Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes. Journal of The Electrochemical Society. 168(5), 050550.","ama":"Maffre M, Bouchal R, Freunberger SA, et al. Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes. <i>Journal of The Electrochemical Society</i>. 2021;168(5). doi:<a href=\"https://doi.org/10.1149/1945-7111/ac0300\">10.1149/1945-7111/ac0300</a>","short":"M. Maffre, R. Bouchal, S.A. Freunberger, N. Lindahl, P. Johansson, F. Favier, O. Fontaine, D. Bélanger, Journal of The Electrochemical Society 168 (2021).","apa":"Maffre, M., Bouchal, R., Freunberger, S. A., Lindahl, N., Johansson, P., Favier, F., … Bélanger, D. (2021). Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes. <i>Journal of The Electrochemical Society</i>. IOP Publishing. <a href=\"https://doi.org/10.1149/1945-7111/ac0300\">https://doi.org/10.1149/1945-7111/ac0300</a>","chicago":"Maffre, Marion, Roza Bouchal, Stefan Alexander Freunberger, Niklas Lindahl, Patrik Johansson, Frédéric Favier, Olivier Fontaine, and Daniel Bélanger. “Investigation of Electrochemical and Chemical Processes Occurring at Positive Potentials in ‘Water-in-Salt’ Electrolytes.” <i>Journal of The Electrochemical Society</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1149/1945-7111/ac0300\">https://doi.org/10.1149/1945-7111/ac0300</a>."},"keyword":["Renewable Energy","Sustainability and the Environment","Electrochemistry","Materials Chemistry","Electronic","Optical and Magnetic Materials","Surfaces","Coatings and Films","Condensed Matter Physics"],"quality_controlled":"1","scopus_import":"1","article_number":"050550","type":"journal_article","isi":1,"publisher":"IOP Publishing","intvolume":"       168","status":"public","date_published":"2021-05-01T00:00:00Z","abstract":[{"text":"Lithium bis(trifluoromethylsulfonyl)imide (LiTFSI) based water-in-salt electrolytes (WiSEs) has recently emerged as a new promising class of electrolytes, primarily owing to their wide electrochemical stability windows (~3–4 V), that by far exceed the thermodynamic stability window of water (1.23 V). Upon increasing the salt concentration towards superconcentration the onset of the oxygen evolution reaction (OER) shifts more significantly than the hydrogen evolution reaction (HER) does. The OER shift has been explained by the accumulation of hydrophobic anions blocking water access to the electrode surface, hence by double layer theory. Here we demonstrate that the processes during oxidation are much more complex, involving OER, carbon and salt decomposition by OER intermediates, and salt precipitation upon local oversaturation. The positive shift in the onset potential of oxidation currents was elucidated by combining several advanced analysis techniques: rotating ring-disk electrode voltammetry, online electrochemical mass spectrometry, and X-ray photoelectron spectroscopy, using both dilute and superconcentrated electrolytes. The results demonstrate the importance of reactive OER intermediates and surface films for electrolyte and electrode stability and motivate further studies of the nature of the electrode.","lang":"eng"}],"publication_status":"published","doi":"10.1149/1945-7111/ac0300","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"05","language":[{"iso":"eng"}],"issue":"5","date_updated":"2024-10-21T06:02:10Z","oa_version":"None","day":"01"},{"publication_status":"published","abstract":[{"text":"We consider a system of N trapped bosons with repulsive interactions in a combined semiclassical mean-field limit at positive temperature. We show that the free energy is well approximated by the minimum of the Hartree free energy functional – a natural extension of the Hartree energy functional to positive temperatures. The Hartree free energy functional converges in the same limit to a semiclassical free energy functional, and we show that the system displays Bose–Einstein condensation if and only if it occurs in the semiclassical free energy functional. This allows us to show that for weak coupling the critical temperature decreases due to the repulsive interactions.","lang":"eng"}],"status":"public","date_published":"2021-09-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.00992"}],"month":"09","doi":"10.1016/j.jfa.2021.109096","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"issue":"6","oa_version":"Preprint","date_updated":"2025-04-14T07:26:53Z","oa":1,"ec_funded":1,"language":[{"iso":"eng"}],"day":"15","year":"2021","publication":"Journal of Functional Analysis","project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020"}],"title":"Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons","article_type":"original","external_id":{"isi":["000656508600008"],"arxiv":["2009.00992"]},"volume":281,"publication_identifier":{"eissn":["1096-0783"],"issn":["0022-1236"]},"acknowledgement":"Funding from the European Union's Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 (R.S.) and under the Marie Sklodowska-Curie grant agreement No 836146 (A.D.) is gratefully acknowledged. A.D. acknowledges support of the Swiss National Science Foundation through the Ambizione grant PZ00P2 185851.","date_created":"2021-06-06T22:01:28Z","article_processing_charge":"No","department":[{"_id":"RoSe"}],"citation":{"chicago":"Deuchert, Andreas, and Robert Seiringer. “Semiclassical Approximation and Critical Temperature Shift for Weakly Interacting Trapped Bosons.” <i>Journal of Functional Analysis</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">https://doi.org/10.1016/j.jfa.2021.109096</a>.","short":"A. Deuchert, R. Seiringer, Journal of Functional Analysis 281 (2021).","apa":"Deuchert, A., &#38; Seiringer, R. (2021). Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">https://doi.org/10.1016/j.jfa.2021.109096</a>","ama":"Deuchert A, Seiringer R. Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. <i>Journal of Functional Analysis</i>. 2021;281(6). doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">10.1016/j.jfa.2021.109096</a>","mla":"Deuchert, Andreas, and Robert Seiringer. “Semiclassical Approximation and Critical Temperature Shift for Weakly Interacting Trapped Bosons.” <i>Journal of Functional Analysis</i>, vol. 281, no. 6, 109096, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">10.1016/j.jfa.2021.109096</a>.","ista":"Deuchert A, Seiringer R. 2021. Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. Journal of Functional Analysis. 281(6), 109096.","ieee":"A. Deuchert and R. Seiringer, “Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons,” <i>Journal of Functional Analysis</i>, vol. 281, no. 6. Elsevier, 2021."},"quality_controlled":"1","article_number":"109096","scopus_import":"1","author":[{"last_name":"Deuchert","first_name":"Andreas","full_name":"Deuchert, Andreas"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"_id":"9462","publisher":"Elsevier","intvolume":"       281","type":"journal_article","isi":1},{"article_processing_charge":"No","acknowledgement":"This work was supported by the National Key R&D Program of China (Grant No. 2016YFA0301700) and the ERC Starting Grant no. 335497.","date_created":"2021-06-06T22:01:29Z","publication_identifier":{"isbn":["9781728181769"]},"conference":{"name":"EDTM: IEEE Electron Devices Technology and Manufacturing Conference","location":"Virtual, Online","end_date":"2021-04-11","start_date":"2021-04-08"},"department":[{"_id":"GeKa"}],"title":"Ge/Si quantum wires for quantum computing","external_id":{"isi":["000675595800006"]},"project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","name":"Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires","grant_number":"335497","call_identifier":"FP7"}],"publication":"2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021","year":"2021","publisher":"IEEE","isi":1,"type":"conference","scopus_import":"1","article_number":"9420817","quality_controlled":"1","citation":{"mla":"Gao, Fei, et al. “Ge/Si Quantum Wires for Quantum Computing.” <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>, 9420817, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">10.1109/EDTM50988.2021.9420817</a>.","ieee":"F. Gao <i>et al.</i>, “Ge/Si quantum wires for quantum computing,” in <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>, Virtual, Online, 2021.","ista":"Gao F, Zhang JY, Wang JH, Ming M, Wang T, Zhang JJ, Watzinger H, Kukucka J, Vukušić L, Katsaros G, Wang K, Xu G, Li HO, Guo GP. 2021. Ge/Si quantum wires for quantum computing. 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. EDTM: IEEE Electron Devices Technology and Manufacturing Conference, 9420817.","ama":"Gao F, Zhang JY, Wang JH, et al. Ge/Si quantum wires for quantum computing. In: <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">10.1109/EDTM50988.2021.9420817</a>","apa":"Gao, F., Zhang, J. Y., Wang, J. H., Ming, M., Wang, T., Zhang, J. J., … Guo, G. P. (2021). Ge/Si quantum wires for quantum computing. In <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>. Virtual, Online: IEEE. <a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">https://doi.org/10.1109/EDTM50988.2021.9420817</a>","short":"F. Gao, J.Y. Zhang, J.H. Wang, M. Ming, T. Wang, J.J. Zhang, H. Watzinger, J. Kukucka, L. Vukušić, G. Katsaros, K. Wang, G. Xu, H.O. Li, G.P. Guo, in:, 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, IEEE, 2021.","chicago":"Gao, Fei, Jie Yin Zhang, Jian Huan Wang, Ming Ming, Tina Wang, Jian Jun Zhang, Hannes Watzinger, et al. “Ge/Si Quantum Wires for Quantum Computing.” In <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">https://doi.org/10.1109/EDTM50988.2021.9420817</a>."},"_id":"9464","author":[{"full_name":"Gao, Fei","last_name":"Gao","first_name":"Fei"},{"first_name":"Jie Yin","last_name":"Zhang","full_name":"Zhang, Jie Yin"},{"last_name":"Wang","first_name":"Jian Huan","full_name":"Wang, Jian Huan"},{"full_name":"Ming, Ming","last_name":"Ming","first_name":"Ming"},{"full_name":"Wang, Tina","first_name":"Tina","last_name":"Wang"},{"full_name":"Zhang, Jian Jun","last_name":"Zhang","first_name":"Jian Jun"},{"first_name":"Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes"},{"full_name":"Kukucka, Josip","first_name":"Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vukušić, Lada","first_name":"Lada","last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636"},{"full_name":"Katsaros, Georgios","first_name":"Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros"},{"full_name":"Wang, Ke","last_name":"Wang","first_name":"Ke"},{"full_name":"Xu, Gang","first_name":"Gang","last_name":"Xu"},{"full_name":"Li, Hai Ou","first_name":"Hai Ou","last_name":"Li"},{"full_name":"Guo, Guo Ping","last_name":"Guo","first_name":"Guo Ping"}],"month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/EDTM50988.2021.9420817","abstract":[{"text":"We firstly introduce the self-assembled growth of highly uniform Ge quantum wires with controllable position, distance and length on patterned Si (001) substrates. We then present the electrically tunable strong spin-orbit coupling, the first Ge hole spin qubit and ultrafast operation of hole spin qubit in the Ge/Si quantum wires.","lang":"eng"}],"publication_status":"published","date_published":"2021-04-08T00:00:00Z","status":"public","day":"08","date_updated":"2024-10-22T09:41:03Z","oa_version":"None","language":[{"iso":"eng"}],"ec_funded":1},{"type":"journal_article","intvolume":"       112","publisher":"Springer Nature","file_date_updated":"2021-06-11T13:16:26Z","_id":"9465","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Nikitenko, Anton","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","orcid":"0000-0002-0659-3201"},{"first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F"}],"quality_controlled":"1","article_number":"15","scopus_import":"1","has_accepted_license":"1","citation":{"apa":"Edelsbrunner, H., Nikitenko, A., &#38; Osang, G. F. (2021). A step in the Delaunay mosaic of order k. <i>Journal of Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00022-021-00577-4\">https://doi.org/10.1007/s00022-021-00577-4</a>","short":"H. Edelsbrunner, A. Nikitenko, G.F. Osang, Journal of Geometry 112 (2021).","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Georg F Osang. “A Step in the Delaunay Mosaic of Order K.” <i>Journal of Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00022-021-00577-4\">https://doi.org/10.1007/s00022-021-00577-4</a>.","ieee":"H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic of order k,” <i>Journal of Geometry</i>, vol. 112, no. 1. Springer Nature, 2021.","ista":"Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.","mla":"Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” <i>Journal of Geometry</i>, vol. 112, no. 1, 15, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s00022-021-00577-4\">10.1007/s00022-021-00577-4</a>.","ama":"Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order k. <i>Journal of Geometry</i>. 2021;112(1). doi:<a href=\"https://doi.org/10.1007/s00022-021-00577-4\">10.1007/s00022-021-00577-4</a>"},"department":[{"_id":"HeEd"}],"article_processing_charge":"Yes (via OA deal)","date_created":"2021-06-06T22:01:29Z","publication_identifier":{"eissn":["1420-8997"],"issn":["0047-2468"]},"volume":112,"article_type":"original","title":"A step in the Delaunay mosaic of order k","publication":"Journal of Geometry","year":"2021","corr_author":"1","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2021-06-11T13:16:26Z","access_level":"open_access","creator":"kschuh","file_size":694706,"file_name":"2021_Geometry_Edelsbrunner.pdf","success":1,"file_id":"9544","date_created":"2021-06-11T13:16:26Z","checksum":"e52a832f1def52a2b23d21bcc09e646f"}],"day":"01","oa":1,"language":[{"iso":"eng"}],"date_updated":"2025-07-10T12:01:46Z","oa_version":"Published Version","issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s00022-021-00577-4","month":"04","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2021-04-01T00:00:00Z","status":"public","ddc":["510"],"publication_status":"published","abstract":[{"lang":"eng","text":"Given a locally finite set 𝑋⊆ℝ𝑑 and an integer 𝑘≥0, we consider the function 𝐰𝑘:Del𝑘(𝑋)→ℝ on the dual of the order-k Voronoi tessellation, whose sublevel sets generalize the notion of alpha shapes from order-1 to order-k (Edelsbrunner et al. in IEEE Trans Inf Theory IT-29:551–559, 1983; Krasnoshchekov and Polishchuk in Inf Process Lett 114:76–83, 2014). While this function is not necessarily generalized discrete Morse, in the sense of Forman (Adv Math 134:90–145, 1998) and Freij (Discrete Math 309:3821–3829, 2009), we prove that it satisfies similar properties so that its increments can be meaningfully classified into critical and non-critical steps. This result extends to the case of weighted points and sheds light on k-fold covers with balls in Euclidean space."}]},{"status":"public","date_published":"2021-07-25T00:00:00Z","ddc":["530"],"publication_status":"published","abstract":[{"text":"Turbulence in the flow of fluid through a pipe can be suppressed by buoyancy forces. As the suppression of turbulence leads to severe heat transfer deterioration, this is an important and undesirable phenomenon in both heating and cooling applications. Vertical flow is often considered, as the axial buoyancy force can help drive the flow. With heating measured by the buoyancy parameter 𝐶, our direct numerical simulations show that shear-driven turbulence may either be completely laminarised or it transitions to a relatively quiescent convection-driven state. Buoyancy forces cause a flattening of the base flow profile, which in isothermal pipe flow has recently been linked to complete suppression of turbulence (Kühnen et al., Nat. Phys., vol. 14, 2018, pp. 386–390), and the flattened laminar base profile has enhanced nonlinear stability (Marensi et al., J. Fluid Mech., vol. 863, 2019, pp. 50–875). In agreement with these findings, the nonlinear lower-branch travelling-wave solution analysed here, which is believed to mediate transition to turbulence in isothermal pipe flow, is shown to be suppressed by buoyancy. A linear instability of the laminar base flow is responsible for the appearance of the relatively quiescent convection driven state for 𝐶≳4 across the range of Reynolds numbers considered. In the suppression of turbulence, however, i.e. in the transition from turbulence, we find clearer association with the analysis of He et al. (J. Fluid Mech., vol. 809, 2016, pp. 31–71) than with the above dynamical systems approach, which describes better the transition to turbulence. The laminarisation criterion He et al. propose, based on an apparent Reynolds number of the flow as measured by its driving pressure gradient, is found to capture the critical 𝐶=𝐶𝑐𝑟(𝑅𝑒) above which the flow will be laminarised or switch to the convection-driven type. Our analysis suggests that it is the weakened rolls, rather than the streaks, which appear to be critical for laminarisation.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1017/jfm.2021.371","month":"07","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"oa":1,"arxiv":1,"oa_version":"Published Version","date_updated":"2025-07-10T12:01:47Z","file":[{"file_id":"9766","date_created":"2021-08-03T09:53:28Z","checksum":"867ad077e45c181c2c5ec1311ba27c41","file_size":4087358,"file_name":"2021_JournalFluidMechanics_Marensi.pdf","success":1,"date_updated":"2021-08-03T09:53:28Z","access_level":"open_access","creator":"kschuh","relation":"main_file","content_type":"application/pdf"}],"corr_author":"1","day":"25","publication":"Journal of Fluid Mechanics","year":"2021","volume":919,"external_id":{"isi":["000653785000001"],"arxiv":["2008.13486"]},"article_type":"original","title":"Suppression of turbulence and travelling waves in a vertical heated pipe","department":[{"_id":"BjHo"}],"publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"article_processing_charge":"Yes (via OA deal)","date_created":"2021-06-06T22:01:30Z","acknowledgement":"The anonymous referees are kindly acknowledged for their useful suggestions andcomments.","_id":"9467","file_date_updated":"2021-08-03T09:53:28Z","author":[{"first_name":"Elena","last_name":"Marensi","id":"0BE7553A-1004-11EA-B805-18983DDC885E","orcid":"0000-0001-7173-4923","full_name":"Marensi, Elena"},{"last_name":"He","first_name":"Shuisheng","full_name":"He, Shuisheng"},{"first_name":"Ashley P.","last_name":"Willis","full_name":"Willis, Ashley P."}],"citation":{"ieee":"E. Marensi, S. He, and A. P. Willis, “Suppression of turbulence and travelling waves in a vertical heated pipe,” <i>Journal of Fluid Mechanics</i>, vol. 919. Cambridge University Press, 2021.","ista":"Marensi E, He S, Willis AP. 2021. Suppression of turbulence and travelling waves in a vertical heated pipe. Journal of Fluid Mechanics. 919, A17.","mla":"Marensi, Elena, et al. “Suppression of Turbulence and Travelling Waves in a Vertical Heated Pipe.” <i>Journal of Fluid Mechanics</i>, vol. 919, A17, Cambridge University Press, 2021, doi:<a href=\"https://doi.org/10.1017/jfm.2021.371\">10.1017/jfm.2021.371</a>.","ama":"Marensi E, He S, Willis AP. Suppression of turbulence and travelling waves in a vertical heated pipe. <i>Journal of Fluid Mechanics</i>. 2021;919. doi:<a href=\"https://doi.org/10.1017/jfm.2021.371\">10.1017/jfm.2021.371</a>","short":"E. Marensi, S. He, A.P. Willis, Journal of Fluid Mechanics 919 (2021).","apa":"Marensi, E., He, S., &#38; Willis, A. P. (2021). Suppression of turbulence and travelling waves in a vertical heated pipe. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2021.371\">https://doi.org/10.1017/jfm.2021.371</a>","chicago":"Marensi, Elena, Shuisheng He, and Ashley P. Willis. “Suppression of Turbulence and Travelling Waves in a Vertical Heated Pipe.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1017/jfm.2021.371\">https://doi.org/10.1017/jfm.2021.371</a>."},"article_number":"A17","quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","isi":1,"type":"journal_article","publisher":"Cambridge University Press","intvolume":"       919"},{"status":"public","date_published":"2021-05-20T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"Motivated by the successful application of geometry to proving the Harary--Hill conjecture for “pseudolinear” drawings of $K_n$, we introduce “pseudospherical” drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit sphere $\\mathbb{S}^2$ in which the vertices of $G$ are represented as points---no three on a great circle---and the edges of $G$ are shortest-arcs in $\\mathbb{S}^2$ connecting pairs of vertices. Such a drawing has three properties: (1) every edge $e$ is contained in a simple closed curve $\\gamma_e$ such that the only vertices in $\\gamma_e$ are the ends of $e$; (2) if $e\\ne f$, then $\\gamma_e\\cap\\gamma_f$ has precisely two crossings; and (3) if $e\\ne f$, then $e$ intersects $\\gamma_f$ at most once, in either a crossing or an end of $e$. We use properties (1)--(3) to define a pseudospherical drawing of $G$. Our main result is that for the complete graph, properties (1)--(3) are equivalent to the same three properties but with “precisely two crossings” in (2) replaced by “at most two crossings.” The proof requires a result in the geometric transversal theory of arrangements of pseudocircles. This is proved using the surprising result that the absence of special arcs (coherent spirals) in an arrangement of simple closed curves characterizes the fact that any two curves in the arrangement have at most two crossings. Our studies provide the necessary ideas for exhibiting a drawing of $K_{10}$ that has no extension to an arrangement of pseudocircles and a drawing of $K_9$ that does extend to an arrangement of pseudocircles, but no such extension has all pairs of pseudocircles crossing twice.\r\n"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1137/20M1313234","main_file_link":[{"url":"https://arxiv.org/abs/2001.06053","open_access":"1"}],"month":"05","oa":1,"ec_funded":1,"language":[{"iso":"eng"}],"arxiv":1,"date_updated":"2025-04-14T07:43:46Z","oa_version":"Preprint","issue":"2","day":"20","publication":"SIAM Journal on Discrete Mathematics","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"year":"2021","volume":35,"article_type":"original","title":"Extending drawings of complete graphs into arrangements of pseudocircles","external_id":{"isi":["000674142200022"],"arxiv":["2001.06053"]},"page":"1050-1076","department":[{"_id":"UlWa"}],"publication_identifier":{"issn":["0895-4801"]},"article_processing_charge":"No","date_created":"2021-06-06T22:01:30Z","_id":"9468","author":[{"full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","last_name":"Arroyo Guevara","first_name":"Alan M"},{"full_name":"Richter, R. Bruce","first_name":"R. Bruce","last_name":"Richter"},{"full_name":"Sunohara, Matthew","first_name":"Matthew","last_name":"Sunohara"}],"citation":{"mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 35, no. 2, Society for Industrial and Applied Mathematics, 2021, pp. 1050–76, doi:<a href=\"https://doi.org/10.1137/20M1313234\">10.1137/20M1313234</a>.","ieee":"A. M. Arroyo Guevara, R. B. Richter, and M. Sunohara, “Extending drawings of complete graphs into arrangements of pseudocircles,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 35, no. 2. Society for Industrial and Applied Mathematics, pp. 1050–1076, 2021.","ista":"Arroyo Guevara AM, Richter RB, Sunohara M. 2021. Extending drawings of complete graphs into arrangements of pseudocircles. SIAM Journal on Discrete Mathematics. 35(2), 1050–1076.","ama":"Arroyo Guevara AM, Richter RB, Sunohara M. Extending drawings of complete graphs into arrangements of pseudocircles. <i>SIAM Journal on Discrete Mathematics</i>. 2021;35(2):1050-1076. doi:<a href=\"https://doi.org/10.1137/20M1313234\">10.1137/20M1313234</a>","short":"A.M. Arroyo Guevara, R.B. Richter, M. Sunohara, SIAM Journal on Discrete Mathematics 35 (2021) 1050–1076.","apa":"Arroyo Guevara, A. M., Richter, R. B., &#38; Sunohara, M. (2021). Extending drawings of complete graphs into arrangements of pseudocircles. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/20M1313234\">https://doi.org/10.1137/20M1313234</a>","chicago":"Arroyo Guevara, Alan M, R. Bruce Richter, and Matthew Sunohara. “Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/20M1313234\">https://doi.org/10.1137/20M1313234</a>."},"scopus_import":"1","quality_controlled":"1","isi":1,"type":"journal_article","publisher":"Society for Industrial and Applied Mathematics","intvolume":"        35"},{"doi":"10.1145/3451992","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"date_published":"2021-06-01T00:00:00Z","status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"The Massively Parallel Computation (MPC) model is an emerging model that distills core aspects of distributed and parallel computation, developed as a tool to solve combinatorial (typically graph) problems in systems of many machines with limited space. Recent work has focused on the regime in which machines have sublinear (in n, the number of nodes in the input graph) space, with randomized algorithms presented for the fundamental problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms. A major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all edges incident to a single node. This poses a considerable obstacle compared to classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier, we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph, with the additional property that solving the problem on this subgraph provides significant progress towards solving the problem for the original input graph. Using this framework to derandomize the well-known algorithm of Luby [SICOMP’86], we obtain O(log Δ + log log n)-round deterministic MPC algorithms for solving the problems of Maximal Matching and Maximal Independent Set with O(nɛ) space on each machine for any constant ɛ > 0. These algorithms also run in O(log Δ) rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of O(log 2Δ) rounds by Censor-Hillel et al. [DISC’17]."}],"ddc":["000"],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"pdavies","access_level":"open_access","date_updated":"2021-06-10T19:33:56Z","success":1,"file_name":"MISMM-arxiv.pdf","file_size":587404,"checksum":"a21c627683890c309a68f6389302c408","date_created":"2021-06-10T19:33:56Z","file_id":"9542"}],"day":"01","ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"issue":"2","date_updated":"2025-04-15T06:54:47Z","oa_version":"Submitted Version","arxiv":1,"department":[{"_id":"DaAl"}],"date_created":"2021-06-10T19:31:05Z","acknowledgement":"Institute of Science and Technology Austria (IST Austria). Email: peter.davies@ist.ac.at. Work partially\r\ndone at the Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP),University of Warwick. Research partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411, the Centre for Discrete Mathematics and its Applications, a Weizmann-UK Making Connections Grant, and EPSRC award EP/N011163/1.","article_processing_charge":"No","publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"external_id":{"isi":["000661311300006"],"arxiv":["1912.05390"]},"title":"Graph sparsification for derandomizing massively parallel computation with low space","article_type":"original","volume":17,"year":"2021","publication":"ACM Transactions on Algorithms","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"id":"7802","status":"public","relation":"earlier_version"}]},"type":"journal_article","isi":1,"intvolume":"        17","publisher":"Association for Computing Machinery","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"first_name":"Peter","last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter"},{"last_name":"Parter","first_name":"Merav","full_name":"Parter, Merav"}],"_id":"9541","file_date_updated":"2021-06-10T19:33:56Z","has_accepted_license":"1","article_number":"16","quality_controlled":"1","scopus_import":"1","citation":{"mla":"Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” <i>ACM Transactions on Algorithms</i>, vol. 17, no. 2, 16, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3451992\">10.1145/3451992</a>.","ista":"Czumaj A, Davies P, Parter M. 2021. Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. 17(2), 16.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” <i>ACM Transactions on Algorithms</i>, vol. 17, no. 2. Association for Computing Machinery, 2021.","ama":"Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. <i>ACM Transactions on Algorithms</i>. 2021;17(2). doi:<a href=\"https://doi.org/10.1145/3451992\">10.1145/3451992</a>","short":"A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).","apa":"Czumaj, A., Davies, P., &#38; Parter, M. (2021). Graph sparsification for derandomizing massively parallel computation with low space. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3451992\">https://doi.org/10.1145/3451992</a>","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3451992\">https://doi.org/10.1145/3451992</a>."}},{"publication":"9th International Conference on Learning Representations","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"status":"public","year":"2021","date_published":"2021-05-01T00:00:00Z","title":"New bounds for distributed mean estimation and variance reduction","external_id":{"arxiv":["2002.09268"]},"abstract":[{"lang":"eng","text":"We consider the problem ofdistributed mean estimation (DME), in which n machines are each given a local d-dimensional vector xv∈Rd, and must cooperate to estimate the mean of their inputs μ=1n∑nv=1xv, while minimizing total communication cost. DME is a fundamental construct in distributed machine learning, and there has been considerable work on variants of this problem, especially in the context of distributed variance reduction for stochastic gradients in parallel SGD. Previous work typically assumes an upper bound on the norm of the input vectors, and achieves an error bound in terms of this norm. However, in many real applications, the input vectors are concentrated around the correct output μ, but μ itself has large norm. In such cases, previous output error bounds perform poorly. In this paper, we show that output error bounds need not depend on input norm. We provide a method of quantization which allows distributed mean estimation to be performed with solution quality dependent only on the distance between inputs, not on input norm, and show an analogous result for distributed variance reduction. The technique is based on a new connection with lattice theory. We also provide lower bounds showing that the communication to error trade-off of our algorithms is asymptotically optimal. As the lattices achieving optimal bounds under l2-norm can be computationally impractical, we also present an extension which leverages easy-to-use cubic lattices, and is loose only up to a logarithmic factor ind. We show experimentally that our method yields practical improvements for common applications, relative to prior approaches."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"conference":{"location":"Virtual","end_date":"2021-05-07","start_date":"2021-05-03","name":"ICLR: International Conference on Learning Representations"},"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=t86MwoUCCNe"}],"article_processing_charge":"No","month":"05","date_created":"2021-06-10T19:46:08Z","_id":"9543","language":[{"iso":"eng"}],"ec_funded":1,"oa":1,"author":[{"full_name":"Davies, Peter","first_name":"Peter","last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524"},{"full_name":"Gurunanthan, Vijaykrishna","last_name":"Gurunanthan","first_name":"Vijaykrishna"},{"last_name":"Moshrefi","id":"4db776ff-ce15-11eb-96e3-bc2b90b01c16","first_name":"Niusha ","full_name":"Moshrefi, Niusha "},{"full_name":"Ashkboos, Saleh","first_name":"Saleh","id":"0D0A9058-257B-11EA-A937-9341C3D8BC8A","last_name":"Ashkboos"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"arxiv":1,"citation":{"ama":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. New bounds for distributed mean estimation and variance reduction. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","ieee":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, and D.-A. Alistarh, “New bounds for distributed mean estimation and variance reduction,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","ista":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. 2021. New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","mla":"Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” <i>9th International Conference on Learning Representations</i>, 2021.","chicago":"Davies, Peter, Vijaykrishna Gurunanthan, Niusha  Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In <i>9th International Conference on Learning Representations</i>, 2021.","apa":"Davies, P., Gurunanthan, V., Moshrefi, N., Ashkboos, S., &#38; Alistarh, D.-A. (2021). New bounds for distributed mean estimation and variance reduction. In <i>9th International Conference on Learning Representations</i>. Virtual.","short":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021."},"oa_version":"Published Version","date_updated":"2025-07-10T12:01:50Z","quality_controlled":"1","type":"conference","corr_author":"1","day":"01"},{"day":"01","file":[{"checksum":"33271724215f54a75c39d2ed40f2c502","date_created":"2021-10-11T12:06:50Z","file_id":"10120","success":1,"file_size":26026501,"file_name":"ScatteringAwareColor3DPrinting_authorVersion.pdf","creator":"bbickel","access_level":"open_access","date_updated":"2021-10-11T12:06:50Z","content_type":"application/pdf","relation":"main_file"}],"oa_version":"Submitted Version","date_updated":"2025-03-31T15:58:16Z","issue":"2","language":[{"iso":"eng"}],"ec_funded":1,"oa":1,"month":"05","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1111/cgf.142626","ddc":["004"],"abstract":[{"lang":"eng","text":"With the wider availability of full-color 3D printers, color-accurate 3D-print preparation has received increased attention. A key challenge lies in the inherent translucency of commonly used print materials that blurs out details of the color texture. Previous work tries to compensate for these scattering effects through strategic assignment of colored primary materials to printer voxels. To date, the highest-quality approach uses iterative optimization that relies on computationally expensive Monte Carlo light transport simulation to predict the surface appearance from subsurface scattering within a given print material distribution; that optimization, however, takes in the order of days on a single machine. In our work, we dramatically speed up the process by replacing the light transport simulation with a data-driven approach. Leveraging a deep neural network to predict the scattering within a highly heterogeneous medium, our method performs around two orders of magnitude faster than Monte Carlo rendering while yielding optimization results of similar quality level. The network is based on an established method from atmospheric cloud rendering, adapted to our domain and extended by a physically motivated weight sharing scheme that substantially reduces the network size. We analyze its performance in an end-to-end print preparation pipeline and compare quality and runtime to alternative approaches, and demonstrate its generalization to unseen geometry and material values. This for the first time enables full heterogenous material optimization for 3D-print preparation within time frames in the order of the actual printing time."}],"publication_status":"published","date_published":"2021-05-01T00:00:00Z","status":"public","intvolume":"        40","publisher":"Wiley","isi":1,"type":"journal_article","quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","citation":{"chicago":"Rittig, Tobias, Denis Sumin, Vahid Babaei, Piotr Didyk, Alexey Voloboy, Alexander Wilkie, Bernd Bickel, Karol Myszkowski, Tim Weyrich, and Jaroslav Křivánek. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>.","apa":"Rittig, T., Sumin, D., Babaei, V., Didyk, P., Voloboy, A., Wilkie, A., … Křivánek, J. (2021). Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>","short":"T. Rittig, D. Sumin, V. Babaei, P. Didyk, A. Voloboy, A. Wilkie, B. Bickel, K. Myszkowski, T. Weyrich, J. Křivánek, Computer Graphics Forum 40 (2021) 205–219.","ama":"Rittig T, Sumin D, Babaei V, et al. Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. 2021;40(2):205-219. doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>","ista":"Rittig T, Sumin D, Babaei V, Didyk P, Voloboy A, Wilkie A, Bickel B, Myszkowski K, Weyrich T, Křivánek J. 2021. Neural acceleration of scattering-aware color 3D printing. Computer Graphics Forum. 40(2), 205–219.","ieee":"T. Rittig <i>et al.</i>, “Neural acceleration of scattering-aware color 3D printing,” <i>Computer Graphics Forum</i>, vol. 40, no. 2. Wiley, pp. 205–219, 2021.","mla":"Rittig, Tobias, et al. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 205–19, doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>."},"_id":"9547","file_date_updated":"2021-10-11T12:06:50Z","author":[{"first_name":"Tobias","last_name":"Rittig","full_name":"Rittig, Tobias"},{"full_name":"Sumin, Denis","first_name":"Denis","last_name":"Sumin"},{"full_name":"Babaei, Vahid","first_name":"Vahid","last_name":"Babaei"},{"full_name":"Didyk, Piotr","last_name":"Didyk","first_name":"Piotr"},{"last_name":"Voloboy","first_name":"Alexey","full_name":"Voloboy, Alexey"},{"first_name":"Alexander","last_name":"Wilkie","full_name":"Wilkie, Alexander"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd"},{"first_name":"Karol","last_name":"Myszkowski","full_name":"Myszkowski, Karol"},{"last_name":"Weyrich","first_name":"Tim","full_name":"Weyrich, Tim"},{"last_name":"Křivánek","first_name":"Jaroslav","full_name":"Křivánek, Jaroslav"}],"article_processing_charge":"No","acknowledgement":"We thank Sebastian Cucerca for processing and capturing the phys-cal printouts. This work was supported by the Charles University grant SVV-260588 and Czech Science Foundation grant 19-07626S. This project has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska Curie grant agreements No 642841 (DISTRO) and No765911 (RealVision), and under the European Research Council grant agreement No 715767 (MATERIALIZABLE).","date_created":"2021-06-13T22:01:32Z","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"department":[{"_id":"BeBi"}],"page":"205-219","volume":40,"external_id":{"isi":["000657959600017"]},"article_type":"original","title":"Neural acceleration of scattering-aware color 3D printing","publication":"Computer Graphics Forum","project":[{"call_identifier":"H2020","grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"}],"year":"2021"},{"doi":"10.1007/s12220-021-00691-4","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":"https://arxiv.org/abs/2008.09543","open_access":"1"}],"month":"05","status":"public","date_published":"2021-05-31T00:00:00Z","abstract":[{"lang":"eng","text":"We extend the notion of the minimal volume ellipsoid containing a convex body in Rd to the setting of logarithmically concave functions. We consider a vast class of logarithmically concave functions whose superlevel sets are concentric ellipsoids. For a fixed function from this class, we consider the set of all its “affine” positions. For any log-concave function f on Rd, we consider functions belonging to this set of “affine” positions, and find the one with the minimal integral under the condition that it is pointwise greater than or equal to f. We study the properties of existence and uniqueness of the solution to this problem. For any s∈[0,+∞), we consider the construction dual to the recently defined John s-function (Ivanov and Naszódi in Functional John ellipsoids. arXiv preprint: arXiv:2006.09934, 2020). We prove that such a construction determines a unique function and call it the Löwner s-function of f. We study the Löwner s-functions as s tends to zero and to infinity. Finally, extending the notion of the outer volume ratio, we define the outer integral ratio of a log-concave function and give an asymptotically tight bound on it."}],"publication_status":"published","day":"31","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"oa_version":"Preprint","date_updated":"2023-08-08T14:04:49Z","department":[{"_id":"UlWa"}],"publication_identifier":{"issn":["1050-6926"],"eissn":["1559-002X"]},"date_created":"2021-06-13T22:01:32Z","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-2019-1926.","article_processing_charge":"No","year":"2021","publication":"Journal of Geometric Analysis","article_type":"original","external_id":{"isi":["000656507500001"],"arxiv":["2008.09543"]},"title":"Functional Löwner ellipsoids","volume":31,"page":"11493-11528","type":"journal_article","isi":1,"publisher":"Springer","intvolume":"        31","author":[{"full_name":"Ivanov, Grigory","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov"},{"full_name":"Tsiutsiurupa, Igor","first_name":"Igor","last_name":"Tsiutsiurupa"}],"_id":"9548","citation":{"short":"G. Ivanov, I. Tsiutsiurupa, Journal of Geometric Analysis 31 (2021) 11493–11528.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). Functional Löwner ellipsoids. <i>Journal of Geometric Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s12220-021-00691-4\">https://doi.org/10.1007/s12220-021-00691-4</a>","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.” <i>Journal of Geometric Analysis</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s12220-021-00691-4\">https://doi.org/10.1007/s12220-021-00691-4</a>.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.” <i>Journal of Geometric Analysis</i>, vol. 31, Springer, 2021, pp. 11493–528, doi:<a href=\"https://doi.org/10.1007/s12220-021-00691-4\">10.1007/s12220-021-00691-4</a>.","ieee":"G. Ivanov and I. Tsiutsiurupa, “Functional Löwner ellipsoids,” <i>Journal of Geometric Analysis</i>, vol. 31. Springer, pp. 11493–11528, 2021.","ista":"Ivanov G, Tsiutsiurupa I. 2021. Functional Löwner ellipsoids. Journal of Geometric Analysis. 31, 11493–11528.","ama":"Ivanov G, Tsiutsiurupa I. Functional Löwner ellipsoids. <i>Journal of Geometric Analysis</i>. 2021;31:11493-11528. doi:<a href=\"https://doi.org/10.1007/s12220-021-00691-4\">10.1007/s12220-021-00691-4</a>"},"quality_controlled":"1","scopus_import":"1"},{"_id":"9549","author":[{"first_name":"Danyang","last_name":"Zhang","full_name":"Zhang, Danyang"},{"first_name":"Jake","last_name":"Watson","id":"63836096-4690-11EA-BD4E-32803DDC885E","orcid":"0000-0002-8698-3823","full_name":"Watson, Jake"},{"full_name":"Matthews, Peter M.","last_name":"Matthews","first_name":"Peter M."},{"full_name":"Cais, Ondrej","first_name":"Ondrej","last_name":"Cais"},{"first_name":"Ingo H.","last_name":"Greger","full_name":"Greger, Ingo H."}],"scopus_import":"1","quality_controlled":"1","citation":{"ista":"Zhang D, Watson J, Matthews PM, Cais O, Greger IH. 2021. Gating and modulation of a hetero-octameric AMPA glutamate receptor. Nature. 594, 454–458.","ieee":"D. Zhang, J. Watson, P. M. Matthews, O. Cais, and I. H. Greger, “Gating and modulation of a hetero-octameric AMPA glutamate receptor,” <i>Nature</i>, vol. 594. Springer Nature, pp. 454–458, 2021.","mla":"Zhang, Danyang, et al. “Gating and Modulation of a Hetero-Octameric AMPA Glutamate Receptor.” <i>Nature</i>, vol. 594, Springer Nature, 2021, pp. 454–58, doi:<a href=\"https://doi.org/10.1038/s41586-021-03613-0\">10.1038/s41586-021-03613-0</a>.","ama":"Zhang D, Watson J, Matthews PM, Cais O, Greger IH. Gating and modulation of a hetero-octameric AMPA glutamate receptor. <i>Nature</i>. 2021;594:454-458. doi:<a href=\"https://doi.org/10.1038/s41586-021-03613-0\">10.1038/s41586-021-03613-0</a>","short":"D. Zhang, J. Watson, P.M. Matthews, O. Cais, I.H. Greger, Nature 594 (2021) 454–458.","apa":"Zhang, D., Watson, J., Matthews, P. M., Cais, O., &#38; Greger, I. H. (2021). Gating and modulation of a hetero-octameric AMPA glutamate receptor. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-021-03613-0\">https://doi.org/10.1038/s41586-021-03613-0</a>","chicago":"Zhang, Danyang, Jake Watson, Peter M. Matthews, Ondrej Cais, and Ingo H. Greger. “Gating and Modulation of a Hetero-Octameric AMPA Glutamate Receptor.” <i>Nature</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41586-021-03613-0\">https://doi.org/10.1038/s41586-021-03613-0</a>."},"isi":1,"type":"journal_article","intvolume":"       594","publisher":"Springer Nature","volume":594,"article_type":"original","title":"Gating and modulation of a hetero-octameric AMPA glutamate receptor","external_id":{"isi":["000657238100003"],"pmid":["34079129"]},"publication":"Nature","year":"2021","page":"454-458","department":[{"_id":"PeJo"}],"article_processing_charge":"No","acknowledgement":"We thank members of the Greger laboratory, B. Herguedas, J. Krieger and J.-N. Dohrke for comments on the manuscript; J. Krieger and J.-N. Dohrke for discussion, J. Krieger for help with the normal mode analysis, B. Köhegyi for help with cryo-EM imaging, V. Chang and K. Suzuki for helping to generate the CNIH2-1D4-HA stable cell line, M. Carvalho for assistance at early stages of this project, the LMB scientific computing and the cryo-EM facility for support, P. Emsley for help with model building, T. Nakane for helpful comments with RELION 3.1 and R. Warshamanage for helping with EMDA cryo-EM-map processing. We acknowledge the Diamond Light Source for access and support of the Cryo-EM facilities at the UK national electron bio10 imaging centre (eBIC), proposal EM17434, funded by the Wellcome Trust, MRC and BBSRC. This work was supported by grants from the Medical Research Council, as part of United Kingdom Research and Innovation (also known as UK Research and Innovation) (MC_U105174197) and BBSRC (BB/N002113/1) to I.H.G.","date_created":"2021-06-13T22:01:33Z","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"oa":1,"language":[{"iso":"eng"}],"oa_version":"Published Version","date_updated":"2023-08-08T13:59:51Z","day":"02","date_published":"2021-06-02T00:00:00Z","status":"public","abstract":[{"text":"AMPA receptors (AMPARs) mediate the majority of excitatory transmission in the brain and enable the synaptic plasticity that underlies learning1. A diverse array of AMPAR signalling complexes are established by receptor auxiliary subunits, which associate with the AMPAR in various combinations to modulate trafficking, gating and synaptic strength2. However, their mechanisms of action are poorly understood. Here we determine cryo-electron microscopy structures of the heteromeric GluA1–GluA2 receptor assembled with both TARP-γ8 and CNIH2, the predominant AMPAR complex in the forebrain, in both resting and active states. Two TARP-γ8 and two CNIH2 subunits insert at distinct sites beneath the ligand-binding domains of the receptor, with site-specific lipids shaping each interaction and affecting the gating regulation of the AMPARs. Activation of the receptor leads to asymmetry between GluA1 and GluA2 along the ion conduction path and an outward expansion of the channel triggers counter-rotations of both auxiliary subunit pairs, promoting the active-state conformation. In addition, both TARP-γ8 and CNIH2 pivot towards the pore exit upon activation, extending their reach for cytoplasmic receptor elements. CNIH2 achieves this through its uniquely extended M2 helix, which has transformed this endoplasmic reticulum-export factor into a powerful AMPAR modulator that is capable of providing hippocampal pyramidal neurons with their integrative synaptic properties. ","lang":"eng"}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1038/s41586-021-03613-0","pmid":1,"month":"06","main_file_link":[{"url":"https://doi.org/10.1038/s41586-021-03613-0","open_access":"1"}]},{"month":"06","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1039/d1ra03428f","ddc":["540"],"publication_status":"published","abstract":[{"text":"We report the synthesis and characterization of graphene functionalized with iron (Fe3+) oxide (G-Fe3O4) nanohybrids for radio-frequency magnetic hyperthermia application. We adopted the wet chemical procedure, using various contents of Fe3O4 (magnetite) from 0–100% for making two-dimensional graphene–Fe3O4 nanohybrids. The homogeneous dispersal of Fe3O4 nanoparticles decorated on the graphene surface combined with their biocompatibility and high thermal conductivity make them an excellent material for magnetic hyperthermia. The morphological and magnetic properties of the nanohybrids were studied using scanning electron microscopy (SEM) and a vibrating sample magnetometer (VSM), respectively. The smart magnetic platforms were exposed to an alternating current (AC) magnetic field of 633 kHz and of strength 9.1 mT for studying their hyperthermic performance. The localized antitumor effects were investigated with artificial neural network modeling. A neural net time-series model was developed for the assessment of the best nanohybrid composition to serve the purpose with an accuracy close to 100%. Six Nonlinear Autoregressive with External Input (NARX) models were obtained, one for each of the components. The assessment of the accuracy of the predicted results has been done on the basis of Mean Squared Error (MSE). The highest Mean Squared Error value was obtained for the nanohybrid containing 45% magnetite and 55% graphene (F45G55) in the training phase i.e., 0.44703, which is where the model achieved optimal results after 71 epochs. The F45G55 nanohybrid was found to be the best for hyperthermia applications in low dosage with the highest specific absorption rate (SAR) and mean squared error values.","lang":"eng"}],"date_published":"2021-06-18T00:00:00Z","status":"public","day":"18","license":"https://creativecommons.org/licenses/by/3.0/","file":[{"access_level":"open_access","creator":"asandaue","date_updated":"2021-06-23T13:09:34Z","relation":"main_file","content_type":"application/pdf","checksum":"cd582d67ace7151078e46b3a896871a9","file_id":"9596","date_created":"2021-06-23T13:09:34Z","file_name":"2021_RSCAdvances_Dar.pdf","file_size":2114557,"success":1}],"date_updated":"2024-10-21T06:02:02Z","oa_version":"Published Version","issue":"35","language":[{"iso":"eng"}],"oa":1,"article_processing_charge":"No","date_created":"2021-06-19T07:27:45Z","acknowledgement":"The research is funded by Higher Education Commission (HEC) Pakistan under start-up research grant program (SRGP) Project no. 2454.","publication_identifier":{"eissn":["2046-2069"]},"department":[{"_id":"KiMo"}],"page":"21702-21715","volume":11,"title":"Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling","external_id":{"isi":["000665644000048"]},"article_type":"original","publication":"RSC Advances","year":"2021","intvolume":"        11","publisher":"Royal Society of Chemistry","isi":1,"type":"journal_article","quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","citation":{"ieee":"M. S. Dar <i>et al.</i>, “Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling,” <i>RSC Advances</i>, vol. 11, no. 35. Royal Society of Chemistry, pp. 21702–21715, 2021.","mla":"Dar, M. S., et al. “Heat Induction in Two-Dimensional Graphene–Fe3O4 Nanohybrids for Magnetic Hyperthermia Applications with Artificial Neural Network Modeling.” <i>RSC Advances</i>, vol. 11, no. 35, Royal Society of Chemistry, 2021, pp. 21702–15, doi:<a href=\"https://doi.org/10.1039/d1ra03428f\">10.1039/d1ra03428f</a>.","ista":"Dar MS, Akram KB, Sohail A, Arif F, Zabihi F, Yang S, Munir S, Zhu M, Abid M, Nauman M. 2021. Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling. RSC Advances. 11(35), 21702–21715.","ama":"Dar MS, Akram KB, Sohail A, et al. Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling. <i>RSC Advances</i>. 2021;11(35):21702-21715. doi:<a href=\"https://doi.org/10.1039/d1ra03428f\">10.1039/d1ra03428f</a>","short":"M.S. Dar, K.B. Akram, A. Sohail, F. Arif, F. Zabihi, S. Yang, S. Munir, M. Zhu, M. Abid, M. Nauman, RSC Advances 11 (2021) 21702–21715.","apa":"Dar, M. S., Akram, K. B., Sohail, A., Arif, F., Zabihi, F., Yang, S., … Nauman, M. (2021). Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling. <i>RSC Advances</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d1ra03428f\">https://doi.org/10.1039/d1ra03428f</a>","chicago":"Dar, M. S., Khush Bakhat Akram, Ayesha Sohail, Fatima Arif, Fatemeh Zabihi, Shengyuan Yang, Shamsa Munir, Meifang Zhu, M. Abid, and Muhammad Nauman. “Heat Induction in Two-Dimensional Graphene–Fe3O4 Nanohybrids for Magnetic Hyperthermia Applications with Artificial Neural Network Modeling.” <i>RSC Advances</i>. Royal Society of Chemistry, 2021. <a href=\"https://doi.org/10.1039/d1ra03428f\">https://doi.org/10.1039/d1ra03428f</a>."},"_id":"9569","file_date_updated":"2021-06-23T13:09:34Z","author":[{"first_name":"M. S.","last_name":"Dar","full_name":"Dar, M. S."},{"full_name":"Akram, Khush Bakhat","first_name":"Khush Bakhat","last_name":"Akram"},{"first_name":"Ayesha","last_name":"Sohail","full_name":"Sohail, Ayesha"},{"full_name":"Arif, Fatima","last_name":"Arif","first_name":"Fatima"},{"last_name":"Zabihi","first_name":"Fatemeh","full_name":"Zabihi, Fatemeh"},{"last_name":"Yang","first_name":"Shengyuan","full_name":"Yang, Shengyuan"},{"last_name":"Munir","first_name":"Shamsa","full_name":"Munir, Shamsa"},{"first_name":"Meifang","last_name":"Zhu","full_name":"Zhu, Meifang"},{"full_name":"Abid, M.","last_name":"Abid","first_name":"M."},{"first_name":"Muhammad","id":"32c21954-2022-11eb-9d5f-af9f93c24e71","last_name":"Nauman","orcid":"0000-0002-2111-4846","full_name":"Nauman, Muhammad"}]},{"related_material":{"record":[{"relation":"research_data","status":"public","id":"13080"}]},"publication":"Physical Review B","year":"2021","volume":103,"title":"Closing of the induced gap in a hybrid superconductor-semiconductor nanowire","external_id":{"arxiv":["2006.01275"],"isi":["000661512500002"]},"article_type":"original","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"article_processing_charge":"No","acknowledgement":"We acknowledge insightful discussions with K. Flensberg, E. B. Hansen, T. Karzig, R. Lutchyn, D. Pikulin, E. Prada, and R. Aguado. This work was supported by Microsoft Project Q and the Danmarks Grundforskningsfond. C.M.M. acknowledges support from the Villum Fonden. A.P.H. and L.C. contributed equally to this work.","date_created":"2021-06-20T22:01:33Z","department":[{"_id":"AnHi"}],"citation":{"ista":"Puglia D, Martinez EA, Ménard GC, Pöschl A, Gronin S, Gardner GC, Kallaher R, Manfra MJ, Marcus CM, Higginbotham AP, Casparis L. 2021. Closing of the induced gap in a hybrid superconductor-semiconductor nanowire. Physical Review B. 103(23), 235201.","ieee":"D. Puglia <i>et al.</i>, “Closing of the induced gap in a hybrid superconductor-semiconductor nanowire,” <i>Physical Review B</i>, vol. 103, no. 23. American Physical Society, 2021.","mla":"Puglia, Denise, et al. “Closing of the Induced Gap in a Hybrid Superconductor-Semiconductor Nanowire.” <i>Physical Review B</i>, vol. 103, no. 23, 235201, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">10.1103/PhysRevB.103.235201</a>.","ama":"Puglia D, Martinez EA, Ménard GC, et al. Closing of the induced gap in a hybrid superconductor-semiconductor nanowire. <i>Physical Review B</i>. 2021;103(23). doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">10.1103/PhysRevB.103.235201</a>","apa":"Puglia, D., Martinez, E. A., Ménard, G. C., Pöschl, A., Gronin, S., Gardner, G. C., … Casparis, L. (2021). Closing of the induced gap in a hybrid superconductor-semiconductor nanowire. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">https://doi.org/10.1103/PhysRevB.103.235201</a>","short":"D. Puglia, E.A. Martinez, G.C. Ménard, A. Pöschl, S. Gronin, G.C. Gardner, R. Kallaher, M.J. Manfra, C.M. Marcus, A.P. Higginbotham, L. Casparis, Physical Review B 103 (2021).","chicago":"Puglia, Denise, E. A. Martinez, G. C. Ménard, A. Pöschl, S. Gronin, G. C. Gardner, R. Kallaher, et al. “Closing of the Induced Gap in a Hybrid Superconductor-Semiconductor Nanowire.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevB.103.235201\">https://doi.org/10.1103/PhysRevB.103.235201</a>."},"article_number":"235201","quality_controlled":"1","scopus_import":"1","_id":"9570","author":[{"full_name":"Puglia, Denise","first_name":"Denise","last_name":"Puglia","id":"4D495994-AE37-11E9-AC72-31CAE5697425","orcid":"0000-0003-1144-2763"},{"full_name":"Martinez, E. A.","last_name":"Martinez","first_name":"E. A."},{"full_name":"Ménard, G. C.","last_name":"Ménard","first_name":"G. C."},{"last_name":"Pöschl","first_name":"A.","full_name":"Pöschl, A."},{"full_name":"Gronin, S.","first_name":"S.","last_name":"Gronin"},{"full_name":"Gardner, G. C.","last_name":"Gardner","first_name":"G. C."},{"first_name":"R.","last_name":"Kallaher","full_name":"Kallaher, R."},{"first_name":"M. J.","last_name":"Manfra","full_name":"Manfra, M. J."},{"last_name":"Marcus","first_name":"C. M.","full_name":"Marcus, C. M."},{"full_name":"Higginbotham, Andrew P","first_name":"Andrew P","last_name":"Higginbotham","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2607-2363"},{"last_name":"Casparis","first_name":"L.","full_name":"Casparis, L."}],"publisher":"American Physical Society","intvolume":"       103","isi":1,"type":"journal_article","publication_status":"published","abstract":[{"text":"We present conductance-matrix measurements in long, three-terminal hybrid superconductor-semiconductor nanowires, and compare with theoretical predictions of a magnetic-field-driven, topological quantum phase transition. By examining the nonlocal conductance, we identify the closure of the excitation gap in the bulk of the semiconductor before the emergence of zero-bias peaks, ruling out spurious gap-closure signatures from localized states. We observe that after the gap closes, nonlocal signals and zero-bias peaks fluctuate strongly at both ends, inconsistent with a simple picture of clean topological superconductivity.","lang":"eng"}],"status":"public","date_published":"2021-06-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.01275"}],"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/PhysRevB.103.235201","arxiv":1,"date_updated":"2025-07-10T12:01:53Z","oa_version":"Preprint","issue":"23","oa":1,"language":[{"iso":"eng"}],"day":"15"},{"file_date_updated":"2021-06-23T07:09:41Z","_id":"9571","author":[{"first_name":"Ali","last_name":"Ramezani-Kebrya","full_name":"Ramezani-Kebrya, Ali"},{"full_name":"Faghri, Fartash","last_name":"Faghri","first_name":"Fartash"},{"full_name":"Markov, Ilya","first_name":"Ilya","last_name":"Markov"},{"full_name":"Aksenov, Vitalii","first_name":"Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87","last_name":"Aksenov"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"full_name":"Roy, Daniel M.","last_name":"Roy","first_name":"Daniel M."}],"citation":{"short":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.","apa":"Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A., &#38; Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research.","chicago":"Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” <i>Journal of Machine Learning Research</i>. Journal of Machine Learning Research, 2021.","mla":"Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” <i>Journal of Machine Learning Research</i>, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43.","ista":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. 2021. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 22(114), 1−43.","ieee":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization,” <i>Journal of Machine Learning Research</i>, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 2021.","ama":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. <i>Journal of Machine Learning Research</i>. 2021;22(114):1−43."},"scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","type":"journal_article","publisher":"Journal of Machine Learning Research","intvolume":"        22","publication":"Journal of Machine Learning Research","year":"2021","volume":22,"article_type":"original","external_id":{"arxiv":["1908.06077"]},"title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","page":"1−43","department":[{"_id":"DaAl"}],"publication_identifier":{"issn":["1532-4435"],"eissn":["1533-7928"]},"article_processing_charge":"No","date_created":"2021-06-20T22:01:33Z","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_updated":"2025-07-10T12:01:54Z","oa_version":"Published Version","issue":"114","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-06-23T07:09:41Z","creator":"asandaue","access_level":"open_access","success":1,"file_name":"2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf","file_size":11237154,"date_created":"2021-06-23T07:09:41Z","file_id":"9595","checksum":"6428aa8bcb67768b6949c99b55d5281d"}],"corr_author":"1","day":"01","status":"public","date_published":"2021-04-01T00:00:00Z","ddc":["000"],"publication_status":"published","abstract":[{"text":"As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-parallel SGD is QSGD (Alistarh et al., 2017), which quantizes and encodes gradients to reduce communication costs. The baseline variant of QSGD provides strong theoretical guarantees, however, for practical purposes, the authors proposed a heuristic variant which we call QSGDinf, which demonstrated impressive empirical gains for distributed training of large neural networks. In this paper, we build on this work to propose a new gradient quantization scheme, and show that it has both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical performance of the QSGDinf heuristic and of other compression methods.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://www.jmlr.org/papers/v22/20-255.html","open_access":"1"}],"month":"04","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"year":"2021","publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry","external_id":{"arxiv":["2106.11247"]},"title":"Massively winning configurations in the convex grabbing game on the plane","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"conference":{"location":"Halifax, NS, Canada; Virtual","start_date":"2021-08-10","end_date":"2021-08-12","name":"CCCG: Canadian Conference on Computational Geometry"},"date_created":"2021-06-22T15:57:11Z","article_processing_charge":"No","author":[{"full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak","first_name":"Martin"},{"full_name":"Nicholson, Sara","first_name":"Sara","last_name":"Nicholson"}],"_id":"9592","file_date_updated":"2021-08-12T10:57:21Z","citation":{"ieee":"M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Halifax, NS, Canada; Virtual, 2021.","mla":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Canadian Conference on Computational Geometry, 2021.","ista":"Dvorak M, Nicholson S. 2021. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.","ama":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry; 2021.","short":"M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2021.","apa":"Dvorak, M., &#38; Nicholson, S. (2021). Massively winning configurations in the convex grabbing game on the plane. In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Halifax, NS, Canada; Virtual: Canadian Conference on Computational Geometry.","chicago":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry, 2021."},"keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"has_accepted_license":"1","quality_controlled":"1","type":"conference","publisher":"Canadian Conference on Computational Geometry","status":"public","date_published":"2021-06-29T00:00:00Z","abstract":[{"lang":"eng","text":"The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general."}],"publication_status":"published","ddc":["516"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"month":"06","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"date_updated":"2025-05-14T11:23:45Z","oa_version":"Published Version","file":[{"date_updated":"2021-06-28T20:23:13Z","access_level":"open_access","creator":"mdvorak","relation":"main_file","content_type":"application/pdf","file_id":"9616","date_created":"2021-06-28T20:23:13Z","checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","file_size":381306,"file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","success":1},{"date_updated":"2021-08-12T10:57:21Z","access_level":"open_access","creator":"kschuh","relation":"main_file","content_type":"application/pdf","file_id":"9902","date_created":"2021-08-12T10:57:21Z","checksum":"9199cf18c65658553487458cc24d0ab2","file_size":403645,"file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf","success":1}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","day":"29"},{"doi":"10.1016/j.jctb.2021.05.004","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"06","date_published":"2021-06-09T00:00:00Z","status":"public","abstract":[{"text":"An ordered graph is a graph with a linear ordering on its vertex set. We prove that for every positive integer k, there exists a constant ck > 0 such that any ordered graph G on n vertices with the property that neither G nor its complement contains an induced monotone path of size k, has either a clique or an independent set of size at least n^ck . This strengthens a result of Bousquet, Lagoutte, and Thomassé, who proved the analogous result for unordered graphs.\r\nA key idea of the above paper was to show that any unordered graph on n vertices that does not contain an induced path of size k, and whose maximum degree is at most c(k)n for some small c(k) > 0, contains two disjoint linear size subsets with no edge between them. This approach fails for ordered graphs, because the analogous statement is false for k ≥ 3, by a construction of Fox. We provide some further examples showing that this statement also fails for ordered graphs avoiding other ordered trees.","lang":"eng"}],"publication_status":"published","ddc":["510"],"corr_author":"1","file":[{"file_size":418168,"file_name":"2021_JournalOfCombinatorialTheory_Pach.pdf","success":1,"checksum":"15fbc9064cd9d1c777ac0043b78c8f12","file_id":"9612","date_created":"2021-06-28T13:33:23Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"asandaue","date_updated":"2021-06-28T13:33:23Z"}],"day":"09","oa":1,"language":[{"iso":"eng"}],"date_updated":"2025-04-15T07:16:52Z","oa_version":"Published Version","department":[{"_id":"HeEd"}],"acknowledgement":"We would like to thank the anonymous referees for their useful comments and suggestions. János Pach is partially supported by Austrian Science Fund (FWF) grant Z 342-N31 and by ERC Advanced grant “GeoScape.” István Tomon is partially supported by Swiss National Science Foundation grant no. 200021_196965, and thanks the support of MIPT Moscow. Both authors are partially supported by The Russian Government in the framework of MegaGrant no. 075-15-2019-1926.","date_created":"2021-06-27T22:01:47Z","article_processing_charge":"No","publication_identifier":{"issn":["0095-8956"]},"external_id":{"isi":["000702280800002"]},"article_type":"original","title":"Erdős-Hajnal-type results for monotone paths","volume":151,"year":"2021","publication":"Journal of Combinatorial Theory. Series B","project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF"}],"page":"21-37","type":"journal_article","isi":1,"intvolume":"       151","publisher":"Elsevier","author":[{"last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János","full_name":"Pach, János"},{"first_name":"István","last_name":"Tomon","full_name":"Tomon, István"}],"_id":"9602","file_date_updated":"2021-06-28T13:33:23Z","has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","citation":{"mla":"Pach, János, and István Tomon. “Erdős-Hajnal-Type Results for Monotone Paths.” <i>Journal of Combinatorial Theory. Series B</i>, vol. 151, Elsevier, 2021, pp. 21–37, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">10.1016/j.jctb.2021.05.004</a>.","ista":"Pach J, Tomon I. 2021. Erdős-Hajnal-type results for monotone paths. Journal of Combinatorial Theory. Series B. 151, 21–37.","ieee":"J. Pach and I. Tomon, “Erdős-Hajnal-type results for monotone paths,” <i>Journal of Combinatorial Theory. Series B</i>, vol. 151. Elsevier, pp. 21–37, 2021.","ama":"Pach J, Tomon I. Erdős-Hajnal-type results for monotone paths. <i>Journal of Combinatorial Theory Series B</i>. 2021;151:21-37. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">10.1016/j.jctb.2021.05.004</a>","short":"J. Pach, I. Tomon, Journal of Combinatorial Theory. Series B 151 (2021) 21–37.","apa":"Pach, J., &#38; Tomon, I. (2021). Erdős-Hajnal-type results for monotone paths. <i>Journal of Combinatorial Theory. Series B</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">https://doi.org/10.1016/j.jctb.2021.05.004</a>","chicago":"Pach, János, and István Tomon. “Erdős-Hajnal-Type Results for Monotone Paths.” <i>Journal of Combinatorial Theory. Series B</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jctb.2021.05.004\">https://doi.org/10.1016/j.jctb.2021.05.004</a>."}},{"title":"Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory","volume":189,"year":"2021","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","call_identifier":"FWF","grant_number":"Z00342"},{"_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry","grant_number":"I4887"}],"publication":"Leibniz International Proceedings in Informatics","date_created":"2021-06-27T22:01:48Z","article_processing_charge":"No","publication_identifier":{"isbn":["9783959771849"],"issn":["1868-8969"]},"conference":{"start_date":"2021-06-07","end_date":"2021-06-11","location":"Online","name":"SoCG: International Symposium on Computational Geometry"},"department":[{"_id":"HeEd"}],"has_accepted_license":"1","scopus_import":"1","quality_controlled":"1","article_number":"16","citation":{"ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory,” in <i>Leibniz International Proceedings in Informatics</i>, Online, 2021, vol. 189.","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.","mla":"Biswas, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in ℝ<sup>3</sup> with Morse Theory.” <i>Leibniz International Proceedings in Informatics</i>, vol. 189, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">10.4230/LIPIcs.SoCG.2021.16</a>.","ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">10.4230/LIPIcs.SoCG.2021.16</a>","apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &#38; Saghafian, M. (2021). Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">https://doi.org/10.4230/LIPIcs.SoCG.2021.16</a>","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Counting Cells of Order-k Voronoi Tessellations in ℝ<sup>3</sup> with Morse Theory.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.16\">https://doi.org/10.4230/LIPIcs.SoCG.2021.16</a>."},"author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas"},{"full_name":"Cultrera di Montesano, Sebastiano","orcid":"0000-0001-6249-0832","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera di Montesano","first_name":"Sebastiano"},{"first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Saghafian, Morteza","first_name":"Morteza","last_name":"Saghafian"}],"_id":"9604","file_date_updated":"2021-06-28T13:11:39Z","intvolume":"       189","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","publication_status":"published","abstract":[{"text":"Generalizing Lee’s inductive argument for counting the cells of higher order Voronoi tessellations in ℝ² to ℝ³, we get precise relations in terms of Morse theoretic quantities for piecewise constant functions on planar arrangements. Specifically, we prove that for a generic set of n ≥ 5 points in ℝ³, the number of regions in the order-k Voronoi tessellation is N_{k-1} - binom(k,2)n + n, for 1 ≤ k ≤ n-1, in which N_{k-1} is the sum of Euler characteristics of these function’s first k-1 sublevel sets. We get similar expressions for the vertices, edges, and polygons of the order-k Voronoi tessellation.","lang":"eng"}],"ddc":["516"],"date_published":"2021-06-02T00:00:00Z","status":"public","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"06","doi":"10.4230/LIPIcs.SoCG.2021.16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","alternative_title":["LIPIcs"],"date_updated":"2025-07-10T12:01:56Z","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"day":"02","file":[{"content_type":"application/pdf","relation":"main_file","creator":"asandaue","access_level":"open_access","date_updated":"2021-06-28T13:11:39Z","success":1,"file_size":727817,"file_name":"2021_LIPIcs_Biswas.pdf","checksum":"22b11a719018b22ecba2471b51f2eb40","date_created":"2021-06-28T13:11:39Z","file_id":"9611"}]},{"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771849"]},"acknowledgement":"The authors want to thank the reviewers for many helpful comments and suggestions.","date_created":"2021-06-27T22:01:49Z","article_processing_charge":"No","department":[{"_id":"HeEd"}],"conference":{"name":"SoCG: International Symposium on Computational Geometry","location":"Online","end_date":"2021-06-11","start_date":"2021-06-07"},"related_material":{"link":[{"relation":"extended_version","url":"https://arxiv.org/abs/2103.07823"}],"record":[{"relation":"later_version","status":"public","id":"12709"}]},"year":"2021","publication":"Leibniz International Proceedings in Informatics","external_id":{"arxiv":["2103.07823"]},"title":"Computing the multicover bifiltration","volume":189,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       189","type":"conference","citation":{"ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">10.4230/LIPIcs.SoCG.2021.27</a>","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in <i>Leibniz International Proceedings in Informatics</i>, Online, 2021, vol. 189.","ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 27.","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” <i>Leibniz International Proceedings in Informatics</i>, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">10.4230/LIPIcs.SoCG.2021.27</a>.","chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">https://doi.org/10.4230/LIPIcs.SoCG.2021.27</a>.","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","apa":"Corbet, R., Kerber, M., Lesnick, M., &#38; Osang, G. F. (2021). Computing the multicover bifiltration. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">https://doi.org/10.4230/LIPIcs.SoCG.2021.27</a>"},"has_accepted_license":"1","scopus_import":"1","quality_controlled":"1","article_number":"27","author":[{"last_name":"Corbet","first_name":"René","full_name":"Corbet, René"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"full_name":"Lesnick, Michael","last_name":"Lesnick","first_name":"Michael"},{"full_name":"Osang, Georg F","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","orcid":"0000-0002-8882-5116"}],"_id":"9605","file_date_updated":"2021-06-28T12:40:47Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"06","doi":"10.4230/LIPIcs.SoCG.2021.27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. ","lang":"eng"}],"ddc":["516"],"status":"public","date_published":"2021-06-02T00:00:00Z","day":"02","file":[{"date_updated":"2021-06-28T12:40:47Z","creator":"cziletti","access_level":"open_access","content_type":"application/pdf","relation":"main_file","date_created":"2021-06-28T12:40:47Z","file_id":"9610","checksum":"0de217501e7ba8b267d58deed0d51761","success":1,"file_name":"2021_LIPIcs_Corbet.pdf","file_size":"1367983"}],"arxiv":1,"date_updated":"2025-07-10T12:01:57Z","alternative_title":["LIPIcs"],"oa_version":"Published Version","language":[{"iso":"eng"}],"oa":1}]