[{"isi":1,"date_created":"2021-06-13T22:01:32Z","author":[{"first_name":"Tobias","last_name":"Rittig","full_name":"Rittig, Tobias"},{"last_name":"Sumin","first_name":"Denis","full_name":"Sumin, Denis"},{"first_name":"Vahid","last_name":"Babaei","full_name":"Babaei, Vahid"},{"last_name":"Didyk","first_name":"Piotr","full_name":"Didyk, Piotr"},{"first_name":"Alexey","last_name":"Voloboy","full_name":"Voloboy, Alexey"},{"first_name":"Alexander","last_name":"Wilkie","full_name":"Wilkie, Alexander"},{"first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Myszkowski, Karol","last_name":"Myszkowski","first_name":"Karol"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"full_name":"Křivánek, Jaroslav","first_name":"Jaroslav","last_name":"Křivánek"}],"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"intvolume":"        40","year":"2021","status":"public","month":"05","ec_funded":1,"date_published":"2021-05-01T00:00:00Z","publication_status":"published","department":[{"_id":"BeBi"}],"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).","publication":"Computer Graphics Forum","article_processing_charge":"No","scopus_import":"1","title":"Neural acceleration of scattering-aware color 3D printing","quality_controlled":"1","file":[{"access_level":"open_access","file_name":"ScatteringAwareColor3DPrinting_authorVersion.pdf","date_updated":"2021-10-11T12:06:50Z","date_created":"2021-10-11T12:06:50Z","file_id":"10120","creator":"bbickel","content_type":"application/pdf","checksum":"33271724215f54a75c39d2ed40f2c502","success":1,"file_size":26026501,"relation":"main_file"}],"external_id":{"isi":["000657959600017"]},"doi":"10.1111/cgf.142626","oa_version":"Submitted Version","file_date_updated":"2021-10-11T12:06:50Z","ddc":["004"],"publisher":"Wiley","day":"01","article_type":"original","_id":"9547","page":"205-219","date_updated":"2025-03-31T15:58:16Z","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841","call_identifier":"H2020","name":"Distributed 3D Object Design"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"volume":40,"type":"journal_article","issue":"2","has_accepted_license":"1","citation":{"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.","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>","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.","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>.","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>","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>."}},{"month":"05","status":"public","year":"2021","publication_identifier":{"eissn":["1559-002X"],"issn":["1050-6926"]},"intvolume":"        31","author":[{"first_name":"Grigory","last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","full_name":"Ivanov, Grigory"},{"first_name":"Igor","last_name":"Tsiutsiurupa","full_name":"Tsiutsiurupa, Igor"}],"arxiv":1,"date_created":"2021-06-13T22:01:32Z","isi":1,"department":[{"_id":"UlWa"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.09543"}],"date_published":"2021-05-31T00:00:00Z","article_processing_charge":"No","publication":"Journal of Geometric Analysis","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-2019-1926.","external_id":{"isi":["000656507500001"],"arxiv":["2008.09543"]},"doi":"10.1007/s12220-021-00691-4","oa_version":"Preprint","quality_controlled":"1","title":"Functional Löwner ellipsoids","scopus_import":"1","article_type":"original","_id":"9548","publisher":"Springer","day":"31","page":"11493-11528","type":"journal_article","volume":31,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"language":[{"iso":"eng"}],"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."}],"date_updated":"2023-08-08T14:04:49Z","citation":{"ieee":"G. Ivanov and I. Tsiutsiurupa, “Functional Löwner ellipsoids,” <i>Journal of Geometric Analysis</i>, vol. 31. Springer, pp. 11493–11528, 2021.","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>.","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>","ista":"Ivanov G, Tsiutsiurupa I. 2021. Functional Löwner ellipsoids. Journal of Geometric Analysis. 31, 11493–11528.","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>.","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>","short":"G. Ivanov, I. Tsiutsiurupa, Journal of Geometric Analysis 31 (2021) 11493–11528."}},{"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":594,"type":"journal_article","date_updated":"2023-08-08T13:59:51Z","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"}],"language":[{"iso":"eng"}],"citation":{"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>.","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.","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.","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>.","short":"D. Zhang, J. Watson, P.M. Matthews, O. Cais, I.H. Greger, Nature 594 (2021) 454–458.","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>"},"_id":"9549","article_type":"original","day":"02","publisher":"Springer Nature","page":"454-458","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.","publication":"Nature","pmid":1,"doi":"10.1038/s41586-021-03613-0","oa_version":"Published Version","external_id":{"isi":["000657238100003"],"pmid":["34079129"]},"scopus_import":"1","title":"Gating and modulation of a hetero-octameric AMPA glutamate receptor","quality_controlled":"1","year":"2021","status":"public","month":"06","date_created":"2021-06-13T22:01:33Z","isi":1,"author":[{"first_name":"Danyang","last_name":"Zhang","full_name":"Zhang, Danyang"},{"full_name":"Watson, Jake","id":"63836096-4690-11EA-BD4E-32803DDC885E","orcid":"0000-0002-8698-3823","last_name":"Watson","first_name":"Jake"},{"full_name":"Matthews, Peter M.","first_name":"Peter M.","last_name":"Matthews"},{"first_name":"Ondrej","last_name":"Cais","full_name":"Cais, Ondrej"},{"last_name":"Greger","first_name":"Ingo H.","full_name":"Greger, Ingo H."}],"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"intvolume":"       594","publication_status":"published","department":[{"_id":"PeJo"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41586-021-03613-0"}],"date_published":"2021-06-02T00:00:00Z"},{"article_processing_charge":"No","acknowledgement":"The research is funded by Higher Education Commission (HEC) Pakistan under start-up research grant program (SRGP) Project no. 2454.","publication":"RSC Advances","file":[{"relation":"main_file","file_size":2114557,"checksum":"cd582d67ace7151078e46b3a896871a9","success":1,"creator":"asandaue","file_id":"9596","content_type":"application/pdf","date_updated":"2021-06-23T13:09:34Z","date_created":"2021-06-23T13:09:34Z","file_name":"2021_RSCAdvances_Dar.pdf","access_level":"open_access"}],"ddc":["540"],"oa_version":"Published Version","doi":"10.1039/d1ra03428f","external_id":{"isi":["000665644000048"]},"file_date_updated":"2021-06-23T13:09:34Z","scopus_import":"1","quality_controlled":"1","title":"Heat induction in two-dimensional graphene–Fe3O4 nanohybrids for magnetic hyperthermia applications with artificial neural network modeling","year":"2021","month":"06","status":"public","date_created":"2021-06-19T07:27:45Z","isi":1,"intvolume":"        11","publication_identifier":{"eissn":["2046-2069"]},"author":[{"last_name":"Dar","first_name":"M. S.","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"},{"last_name":"Arif","first_name":"Fatima","full_name":"Arif, Fatima"},{"last_name":"Zabihi","first_name":"Fatemeh","full_name":"Zabihi, Fatemeh"},{"full_name":"Yang, Shengyuan","last_name":"Yang","first_name":"Shengyuan"},{"first_name":"Shamsa","last_name":"Munir","full_name":"Munir, Shamsa"},{"last_name":"Zhu","first_name":"Meifang","full_name":"Zhu, Meifang"},{"last_name":"Abid","first_name":"M.","full_name":"Abid, M."},{"first_name":"Muhammad","last_name":"Nauman","orcid":"0000-0002-2111-4846","full_name":"Nauman, Muhammad","id":"32c21954-2022-11eb-9d5f-af9f93c24e71"}],"publication_status":"published","department":[{"_id":"KiMo"}],"date_published":"2021-06-18T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"type":"journal_article","volume":11,"date_updated":"2024-10-21T06:02:02Z","language":[{"iso":"eng"}],"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"}],"citation":{"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>.","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.","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.","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>.","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.","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>"},"issue":"35","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"has_accepted_license":"1","article_type":"original","_id":"9569","publisher":"Royal Society of Chemistry","day":"18","page":"21702-21715"},{"oa_version":"Preprint","external_id":{"arxiv":["2006.01275"],"isi":["000661512500002"]},"doi":"10.1103/PhysRevB.103.235201","scopus_import":"1","quality_controlled":"1","title":"Closing of the induced gap in a hybrid superconductor-semiconductor nanowire","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.","publication":"Physical Review B","publication_status":"published","department":[{"_id":"AnHi"}],"date_published":"2021-06-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.01275"}],"year":"2021","month":"06","status":"public","arxiv":1,"date_created":"2021-06-20T22:01:33Z","isi":1,"intvolume":"       103","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"author":[{"last_name":"Puglia","first_name":"Denise","full_name":"Puglia, Denise","id":"4D495994-AE37-11E9-AC72-31CAE5697425","orcid":"0000-0003-1144-2763"},{"last_name":"Martinez","first_name":"E. A.","full_name":"Martinez, 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."},{"first_name":"S.","last_name":"Gronin","full_name":"Gronin, S."},{"full_name":"Gardner, G. C.","last_name":"Gardner","first_name":"G. C."},{"last_name":"Kallaher","first_name":"R.","full_name":"Kallaher, R."},{"first_name":"M. J.","last_name":"Manfra","full_name":"Manfra, M. J."},{"first_name":"C. M.","last_name":"Marcus","full_name":"Marcus, C. M."},{"first_name":"Andrew P","last_name":"Higginbotham","orcid":"0000-0003-2607-2363","full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Casparis","first_name":"L.","full_name":"Casparis, L."}],"citation":{"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>","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>.","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.","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.","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>.","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).","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>"},"article_number":"235201","issue":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":103,"type":"journal_article","date_updated":"2025-07-10T12:01:53Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"_id":"9570","article_type":"original","publisher":"American Physical Society","day":"15","related_material":{"record":[{"id":"13080","status":"public","relation":"research_data"}]}},{"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":22,"date_updated":"2025-07-10T12:01:54Z","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"}],"language":[{"iso":"eng"}],"citation":{"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.","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.","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.","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.","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."},"issue":"114","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"9571","article_type":"original","publisher":"Journal of Machine Learning Research","day":"01","page":"1−43","article_processing_charge":"No","publication":"Journal of Machine Learning Research","file":[{"file_size":11237154,"success":1,"checksum":"6428aa8bcb67768b6949c99b55d5281d","creator":"asandaue","content_type":"application/pdf","file_id":"9595","date_updated":"2021-06-23T07:09:41Z","date_created":"2021-06-23T07:09:41Z","file_name":"2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf","access_level":"open_access","relation":"main_file"}],"file_date_updated":"2021-06-23T07:09:41Z","external_id":{"arxiv":["1908.06077"]},"oa_version":"Published Version","ddc":["000"],"scopus_import":"1","title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","quality_controlled":"1","year":"2021","status":"public","month":"04","date_created":"2021-06-20T22:01:33Z","arxiv":1,"author":[{"full_name":"Ramezani-Kebrya, Ali","first_name":"Ali","last_name":"Ramezani-Kebrya"},{"full_name":"Faghri, Fartash","first_name":"Fartash","last_name":"Faghri"},{"first_name":"Ilya","last_name":"Markov","full_name":"Markov, Ilya"},{"full_name":"Aksenov, Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87","last_name":"Aksenov","first_name":"Vitalii"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Roy, Daniel M.","last_name":"Roy","first_name":"Daniel M."}],"publication_identifier":{"eissn":["1533-7928"],"issn":["1532-4435"]},"intvolume":"        22","publication_status":"published","department":[{"_id":"DaAl"}],"corr_author":"1","date_published":"2021-04-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://www.jmlr.org/papers/v22/20-255.html"}]},{"year":"2021","month":"04","status":"public","arxiv":1,"date_created":"2021-06-21T06:11:56Z","intvolume":"        53","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"author":[{"last_name":"Fox","first_name":"Jacob","full_name":"Fox, Jacob"},{"full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.07722"}],"date_published":"2021-04-03T00:00:00Z","article_processing_charge":"No","publication":"Bulletin of the London Mathematical Society","oa_version":"Preprint","doi":"10.1112/blms.12446","external_id":{"arxiv":["1912.07722"]},"scopus_import":"1","quality_controlled":"1","title":"Acyclic subgraphs of tournaments with high chromatic number","_id":"9572","article_type":"original","publisher":"Wiley","day":"03","extern":"1","page":"619-630","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"type":"journal_article","volume":53,"date_updated":"2023-02-23T14:01:21Z","language":[{"iso":"eng"}],"abstract":[{"text":"We prove that every n-vertex tournament G has an acyclic subgraph with chromatic number at least n5/9−o(1), while there exists an n-vertex tournament G whose every acyclic subgraph has chromatic number at most n3/4+o(1). This establishes in a strong form a conjecture of Nassar and Yuster and improves on another result of theirs. Our proof combines probabilistic and spectral techniques together with some additional ideas. In particular, we prove a lemma showing that every tournament with many transitive subtournaments has a large subtournament that is almost transitive. This may be of independent interest.","lang":"eng"}],"citation":{"ista":"Fox J, Kwan MA, Sudakov B. 2021. Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. 53(2), 619–630.","ieee":"J. Fox, M. A. Kwan, and B. Sudakov, “Acyclic subgraphs of tournaments with high chromatic number,” <i>Bulletin of the London Mathematical Society</i>, vol. 53, no. 2. Wiley, pp. 619–630, 2021.","chicago":"Fox, Jacob, Matthew Alan Kwan, and Benny Sudakov. “Acyclic Subgraphs of Tournaments with High Chromatic Number.” <i>Bulletin of the London Mathematical Society</i>. Wiley, 2021. <a href=\"https://doi.org/10.1112/blms.12446\">https://doi.org/10.1112/blms.12446</a>.","apa":"Fox, J., Kwan, M. A., &#38; Sudakov, B. (2021). Acyclic subgraphs of tournaments with high chromatic number. <i>Bulletin of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/blms.12446\">https://doi.org/10.1112/blms.12446</a>","ama":"Fox J, Kwan MA, Sudakov B. Acyclic subgraphs of tournaments with high chromatic number. <i>Bulletin of the London Mathematical Society</i>. 2021;53(2):619-630. doi:<a href=\"https://doi.org/10.1112/blms.12446\">10.1112/blms.12446</a>","short":"J. Fox, M.A. Kwan, B. Sudakov, Bulletin of the London Mathematical Society 53 (2021) 619–630.","mla":"Fox, Jacob, et al. “Acyclic Subgraphs of Tournaments with High Chromatic Number.” <i>Bulletin of the London Mathematical Society</i>, vol. 53, no. 2, Wiley, 2021, pp. 619–30, doi:<a href=\"https://doi.org/10.1112/blms.12446\">10.1112/blms.12446</a>."},"issue":"2"},{"title":"Massively winning configurations in the convex grabbing game on the plane","quality_controlled":"1","file":[{"file_size":381306,"checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","success":1,"file_id":"9616","content_type":"application/pdf","creator":"mdvorak","date_updated":"2021-06-28T20:23:13Z","date_created":"2021-06-28T20:23:13Z","file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","access_level":"open_access","relation":"main_file"},{"success":1,"checksum":"9199cf18c65658553487458cc24d0ab2","file_size":403645,"content_type":"application/pdf","creator":"kschuh","file_id":"9902","date_created":"2021-08-12T10:57:21Z","date_updated":"2021-08-12T10:57:21Z","access_level":"open_access","file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf","relation":"main_file"}],"file_date_updated":"2021-08-12T10:57:21Z","oa_version":"Published Version","external_id":{"arxiv":["2106.11247"]},"ddc":["516"],"publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry","article_processing_charge":"No","date_published":"2021-06-29T00:00:00Z","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"date_created":"2021-06-22T15:57:11Z","arxiv":1,"author":[{"first_name":"Martin","last_name":"Dvorak","orcid":"0000-0001-5293-214X","full_name":"Dvorak, Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425"},{"last_name":"Nicholson","first_name":"Sara","full_name":"Nicholson, Sara"}],"year":"2021","status":"public","month":"06","conference":{"location":"Halifax, NS, Canada; Virtual","name":"CCCG: Canadian Conference on Computational Geometry","end_date":"2021-08-12","start_date":"2021-08-10"},"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"citation":{"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.","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.","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.","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.","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.","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."},"date_updated":"2025-05-14T11:23:45Z","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"type":"conference","day":"29","publisher":"Canadian Conference on Computational Geometry","_id":"9592"},{"article_processing_charge":"No","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.","publication":"Journal of Combinatorial Theory. Series B","file":[{"file_id":"9612","content_type":"application/pdf","creator":"asandaue","success":1,"checksum":"15fbc9064cd9d1c777ac0043b78c8f12","file_size":418168,"access_level":"open_access","file_name":"2021_JournalOfCombinatorialTheory_Pach.pdf","date_created":"2021-06-28T13:33:23Z","date_updated":"2021-06-28T13:33:23Z","relation":"main_file"}],"external_id":{"isi":["000702280800002"]},"file_date_updated":"2021-06-28T13:33:23Z","doi":"10.1016/j.jctb.2021.05.004","oa_version":"Published Version","ddc":["510"],"scopus_import":"1","title":"Erdős-Hajnal-type results for monotone paths","quality_controlled":"1","year":"2021","status":"public","month":"06","isi":1,"date_created":"2021-06-27T22:01:47Z","author":[{"first_name":"János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"},{"first_name":"István","last_name":"Tomon","full_name":"Tomon, István"}],"intvolume":"       151","publication_identifier":{"issn":["0095-8956"]},"publication_status":"published","department":[{"_id":"HeEd"}],"corr_author":"1","date_published":"2021-06-09T00:00:00Z","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"}],"volume":151,"type":"journal_article","date_updated":"2025-04-15T07:16:52Z","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"citation":{"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>.","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.","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>","ista":"Pach J, Tomon I. 2021. Erdős-Hajnal-type results for monotone paths. Journal of Combinatorial Theory. Series B. 151, 21–37.","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>.","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."},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","article_type":"original","_id":"9602","day":"09","publisher":"Elsevier","page":"21-37"},{"publication_status":"published","department":[{"_id":"HeEd"}],"ec_funded":1,"date_published":"2021-06-02T00:00:00Z","year":"2021","status":"public","month":"06","date_created":"2021-06-27T22:01:48Z","author":[{"last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890"},{"orcid":"0000-0001-6249-0832","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","full_name":"Cultrera di Montesano, Sebastiano","first_name":"Sebastiano","last_name":"Cultrera di Montesano"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Saghafian","first_name":"Morteza","full_name":"Saghafian, Morteza"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771849"]},"intvolume":"       189","file":[{"relation":"main_file","success":1,"checksum":"22b11a719018b22ecba2471b51f2eb40","file_size":727817,"creator":"asandaue","file_id":"9611","content_type":"application/pdf","date_created":"2021-06-28T13:11:39Z","date_updated":"2021-06-28T13:11:39Z","access_level":"open_access","file_name":"2021_LIPIcs_Biswas.pdf"}],"file_date_updated":"2021-06-28T13:11:39Z","doi":"10.4230/LIPIcs.SoCG.2021.16","oa_version":"Published Version","ddc":["516"],"scopus_import":"1","alternative_title":["LIPIcs"],"title":"Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory","quality_controlled":"1","article_processing_charge":"No","publication":"Leibniz International Proceedings in Informatics","_id":"9604","day":"02","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"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>.","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.","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>","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.","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>.","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."},"article_number":"16","conference":{"location":"Online","name":"SoCG: International Symposium on Computational Geometry","end_date":"2021-06-11","start_date":"2021-06-07"},"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"},{"grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry"}],"volume":189,"type":"conference","date_updated":"2025-07-10T12:01:56Z","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}]},{"year":"2021","status":"public","month":"06","date_created":"2021-06-27T22:01:49Z","arxiv":1,"author":[{"last_name":"Corbet","first_name":"René","full_name":"Corbet, René"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"last_name":"Lesnick","first_name":"Michael","full_name":"Lesnick, Michael"},{"orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","last_name":"Osang"}],"intvolume":"       189","publication_identifier":{"isbn":["9783959771849"],"issn":["1868-8969"]},"publication_status":"published","department":[{"_id":"HeEd"}],"date_published":"2021-06-02T00:00:00Z","article_processing_charge":"No","acknowledgement":"The authors want to thank the reviewers for many helpful comments and suggestions.","publication":"Leibniz International Proceedings in Informatics","file":[{"relation":"main_file","access_level":"open_access","file_name":"2021_LIPIcs_Corbet.pdf","date_updated":"2021-06-28T12:40:47Z","date_created":"2021-06-28T12:40:47Z","content_type":"application/pdf","creator":"cziletti","file_id":"9610","checksum":"0de217501e7ba8b267d58deed0d51761","success":1,"file_size":"1367983"}],"external_id":{"arxiv":["2103.07823"]},"oa_version":"Published Version","file_date_updated":"2021-06-28T12:40:47Z","doi":"10.4230/LIPIcs.SoCG.2021.27","ddc":["516"],"scopus_import":"1","alternative_title":["LIPIcs"],"title":"Computing the multicover bifiltration","quality_controlled":"1","_id":"9605","day":"02","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","related_material":{"link":[{"relation":"extended_version","url":"https://arxiv.org/abs/2103.07823"}],"record":[{"status":"public","id":"12709","relation":"later_version"}]},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":189,"date_updated":"2025-07-10T12:01:57Z","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"}],"language":[{"iso":"eng"}],"citation":{"short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","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>","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>.","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.","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>","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>.","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."},"conference":{"start_date":"2021-06-07","location":"Online","end_date":"2021-06-11","name":"SoCG: International Symposium on Computational Geometry"},"article_number":"27","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1"},{"isi":1,"date_created":"2021-06-27T22:01:49Z","arxiv":1,"author":[{"full_name":"Tononi, A.","first_name":"A.","last_name":"Tononi"},{"id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","full_name":"Cappellaro, Alberto","orcid":"0000-0001-6110-2359","last_name":"Cappellaro","first_name":"Alberto"},{"orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","first_name":"Giacomo","last_name":"Bighin"},{"full_name":"Salasnich, L.","first_name":"L.","last_name":"Salasnich"}],"intvolume":"       103","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"year":"2021","status":"public","month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.06491"}],"date_published":"2021-06-01T00:00:00Z","publication_status":"published","department":[{"_id":"MiLe"}],"acknowledgement":"G.B. acknowledges support from the Austrian Science Fund (FWF), under Project No. M2641-N27. This work was\r\npartially supported by the University of Padua, BIRD project “Superfluid properties of Fermi gases in optical potentials.”\r\nThe authors thank Miki Ota, Tomoki Ozawa, Sandro Stringari, Tilman Enss, Hauke Biss, Henning Moritz, and Nicolò Defenu for fruitful discussions. The authors thank Henning Moritz and Markus Bohlen for providing their experimental\r\ndata.","publication":"Physical Review A","article_processing_charge":"No","scopus_import":"1","title":"Propagation of first and second sound in a two-dimensional Fermi superfluid","quality_controlled":"1","oa_version":"Preprint","external_id":{"isi":["000662296700014"],"arxiv":["2009.06491"]},"doi":"10.1103/PhysRevA.103.L061303","day":"01","publisher":"American Physical Society","article_type":"letter_note","_id":"9606","date_updated":"2025-07-10T12:01:58Z","abstract":[{"lang":"eng","text":"Sound propagation is a macroscopic manifestation of the interplay between the equilibrium thermodynamics and the dynamical transport properties of fluids. Here, for a two-dimensional system of ultracold fermions, we calculate the first and second sound velocities across the whole BCS-BEC crossover, and we analyze the system response to an external perturbation. In the low-temperature regime we reproduce the recent measurements [Phys. Rev. Lett. 124, 240403 (2020)] of the first sound velocity, which, due to the decoupling of density and entropy fluctuations, is the sole mode excited by a density probe. Conversely, a heat perturbation excites only the second sound, which, being sensitive to the superfluid depletion, vanishes in the deep BCS regime and jumps discontinuously to zero at the Berezinskii-Kosterlitz-Thouless superfluid transition. A mixing between the modes occurs only in the finite-temperature BEC regime, where our theory converges to the purely bosonic results."}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":103,"issue":"6","article_number":"L061303","citation":{"short":"A. Tononi, A. Cappellaro, G. Bighin, L. Salasnich, Physical Review A 103 (2021).","ama":"Tononi A, Cappellaro A, Bighin G, Salasnich L. Propagation of first and second sound in a two-dimensional Fermi superfluid. <i>Physical Review A</i>. 2021;103(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">10.1103/PhysRevA.103.L061303</a>","mla":"Tononi, A., et al. “Propagation of First and Second Sound in a Two-Dimensional Fermi Superfluid.” <i>Physical Review A</i>, vol. 103, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">10.1103/PhysRevA.103.L061303</a>.","ista":"Tononi A, Cappellaro A, Bighin G, Salasnich L. 2021. Propagation of first and second sound in a two-dimensional Fermi superfluid. Physical Review A. 103(6), L061303.","apa":"Tononi, A., Cappellaro, A., Bighin, G., &#38; Salasnich, L. (2021). Propagation of first and second sound in a two-dimensional Fermi superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">https://doi.org/10.1103/PhysRevA.103.L061303</a>","chicago":"Tononi, A., Alberto Cappellaro, Giacomo Bighin, and L. Salasnich. “Propagation of First and Second Sound in a Two-Dimensional Fermi Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.103.L061303\">https://doi.org/10.1103/PhysRevA.103.L061303</a>.","ieee":"A. Tononi, A. Cappellaro, G. Bighin, and L. Salasnich, “Propagation of first and second sound in a two-dimensional Fermi superfluid,” <i>Physical Review A</i>, vol. 103, no. 6. American Physical Society, 2021."}},{"article_processing_charge":"No","pmid":1,"publication":"Science","acknowledgement":"We thank many members of the Harvard AMO community, particularly E. Urbach, S. Dakoulas, and J. Doyle for their efforts enabling safe and productive operation of our laboratories during 2020. We thank D. Abanin, I. Cong, F. Machado, H. Pichler, N. Yao, B. Ye, and H. Zhou for stimulating discussions. Funding: We acknowledge financial support from the Center for Ultracold Atoms, the National Science Foundation, the Vannevar Bush Faculty Fellowship, the U.S. Department of Energy (LBNL QSA Center and grant no. DE-SC0021013), the Office of Naval Research, the Army Research Office MURI, the DARPA DRINQS program (grant no. D18AC00033), and the DARPA ONISQ program (grant no. W911NF2010021). The authors acknowledge support from the NSF Graduate Research Fellowship Program (grant DGE1745303) and The Fannie and John Hertz Foundation (D.B.); a National Defense Science and Engineering Graduate (NDSEG) fellowship (H.L.); a fellowship from the Max Planck/Harvard Research Center for Quantum Optics (G.S.); Gordon College (T.T.W.); the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 850899) (A.A.M. and M.S.); a Department of Energy Computational Science Graduate Fellowship under award number DE-SC0021110 (N.M.); the Moore Foundation’s EPiQS Initiative grant no. GBMF4306, the NUS Development grant AY2019/2020, and the Stanford Institute of Theoretical Physics (W.W.H.); and the Miller Institute for Basic Research in Science (S.C.). Author contributions: D.B., A.O., H.L., A.K., G.S., S.E., and T.T.W. contributed to the building of the experimental setup, performed the measurements, and analyzed the data. A.A.M., N.M., W.W.H., S.C., and M.S. performed theoretical analysis. All work was supervised by M.G., V.V., and M.D.L. All authors discussed the results and contributed to the manuscript. Competing interests: M.G., V.V., and M.D.L. are co-founders and shareholders of QuEra Computing. A.O. is a shareholder of QuEra Computing. Data and materials availability: All data needed to evaluate the conclusions in the paper are present in the paper and the supplementary materials.","external_id":{"pmid":["33632894"],"isi":["000636043400048"],"arxiv":["2012.12276"]},"oa_version":"Preprint","doi":"10.1126/science.abg2530","file_date_updated":"2021-09-23T14:00:05Z","ddc":["539"],"file":[{"relation":"main_file","file_size":3671159,"checksum":"0b356fd10ab9bb95177d4c047d4e9c1a","success":1,"creator":"patrickd","file_id":"10040","content_type":"application/pdf","date_created":"2021-09-23T14:00:05Z","date_updated":"2021-09-23T14:00:05Z","file_name":"scars_subharmonic_combined_manuscript_2_11_2021 (2)-1.pdf","access_level":"open_access"}],"title":"Controlling quantum many-body dynamics in driven Rydberg atom arrays","quality_controlled":"1","scopus_import":"1","status":"public","month":"03","year":"2021","author":[{"full_name":"Bluvstein, D.","first_name":"D.","last_name":"Bluvstein"},{"last_name":"Omran","first_name":"A.","full_name":"Omran, A."},{"full_name":"Levine, H.","first_name":"H.","last_name":"Levine"},{"full_name":"Keesling, A.","first_name":"A.","last_name":"Keesling"},{"full_name":"Semeghini, G.","first_name":"G.","last_name":"Semeghini"},{"first_name":"S.","last_name":"Ebadi","full_name":"Ebadi, S."},{"first_name":"T. T.","last_name":"Wang","full_name":"Wang, T. T."},{"last_name":"Michailidis","first_name":"Alexios","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","full_name":"Michailidis, Alexios","orcid":"0000-0002-8443-1064"},{"first_name":"N.","last_name":"Maskara","full_name":"Maskara, N."},{"full_name":"Ho, W. W.","last_name":"Ho","first_name":"W. W."},{"last_name":"Choi","first_name":"S.","full_name":"Choi, S."},{"orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","last_name":"Serbyn"},{"full_name":"Greiner, M.","last_name":"Greiner","first_name":"M."},{"full_name":"Vuletić, V.","last_name":"Vuletić","first_name":"V."},{"full_name":"Lukin, M. D.","last_name":"Lukin","first_name":"M. D."}],"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"intvolume":"       371","isi":1,"date_created":"2021-06-29T12:04:05Z","arxiv":1,"department":[{"_id":"MaSe"}],"publication_status":"published","ec_funded":1,"date_published":"2021-03-26T00:00:00Z","keyword":["Multidisciplinary"],"type":"journal_article","volume":371,"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899"}],"abstract":[{"lang":"eng","text":"The control of nonequilibrium quantum dynamics in many-body systems is challenging because interactions typically lead to thermalization and a chaotic spreading throughout Hilbert space. We investigate nonequilibrium dynamics after rapid quenches in a many-body system composed of 3 to 200 strongly interacting qubits in one and two spatial dimensions. Using a programmable quantum simulator based on Rydberg atom arrays, we show that coherent revivals associated with so-called quantum many-body scars can be stabilized by periodic driving, which generates a robust subharmonic response akin to discrete time-crystalline order. We map Hilbert space dynamics, geometry dependence, phase diagrams, and system-size dependence of this emergent phenomenon, demonstrating new ways to steer complex dynamics in many-body systems and enabling potential applications in quantum information science."}],"language":[{"iso":"eng"}],"date_updated":"2025-04-14T07:52:05Z","citation":{"short":"D. Bluvstein, A. Omran, H. Levine, A. Keesling, G. Semeghini, S. Ebadi, T.T. Wang, A. Michailidis, N. Maskara, W.W. Ho, S. Choi, M. Serbyn, M. Greiner, V. Vuletić, M.D. Lukin, Science 371 (2021) 1355–1359.","ama":"Bluvstein D, Omran A, Levine H, et al. Controlling quantum many-body dynamics in driven Rydberg atom arrays. <i>Science</i>. 2021;371(6536):1355-1359. doi:<a href=\"https://doi.org/10.1126/science.abg2530\">10.1126/science.abg2530</a>","mla":"Bluvstein, D., et al. “Controlling Quantum Many-Body Dynamics in Driven Rydberg Atom Arrays.” <i>Science</i>, vol. 371, no. 6536, AAAS, 2021, pp. 1355–59, doi:<a href=\"https://doi.org/10.1126/science.abg2530\">10.1126/science.abg2530</a>.","ista":"Bluvstein D, Omran A, Levine H, Keesling A, Semeghini G, Ebadi S, Wang TT, Michailidis A, Maskara N, Ho WW, Choi S, Serbyn M, Greiner M, Vuletić V, Lukin MD. 2021. Controlling quantum many-body dynamics in driven Rydberg atom arrays. Science. 371(6536), 1355–1359.","apa":"Bluvstein, D., Omran, A., Levine, H., Keesling, A., Semeghini, G., Ebadi, S., … Lukin, M. D. (2021). Controlling quantum many-body dynamics in driven Rydberg atom arrays. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.abg2530\">https://doi.org/10.1126/science.abg2530</a>","chicago":"Bluvstein, D., A. Omran, H. Levine, A. Keesling, G. Semeghini, S. Ebadi, T. T. Wang, et al. “Controlling Quantum Many-Body Dynamics in Driven Rydberg Atom Arrays.” <i>Science</i>. AAAS, 2021. <a href=\"https://doi.org/10.1126/science.abg2530\">https://doi.org/10.1126/science.abg2530</a>.","ieee":"D. Bluvstein <i>et al.</i>, “Controlling quantum many-body dynamics in driven Rydberg atom arrays,” <i>Science</i>, vol. 371, no. 6536. AAAS, pp. 1355–1359, 2021."},"has_accepted_license":"1","issue":"6536","article_type":"original","_id":"9618","day":"26","publisher":"AAAS","page":"1355-1359"},{"ec_funded":1,"date_published":"2021-06-20T00:00:00Z","department":[{"_id":"DaAl"}],"publication_status":"published","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-5646-9524","id":"11396234-BB50-11E9-B24C-90FCE5697425","full_name":"Davies, Peter","first_name":"Peter","last_name":"Davies"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030795269"],"eisbn":["9783030795276"]},"intvolume":"     12810","date_created":"2021-07-01T11:04:43Z","isi":1,"status":"public","month":"06","year":"2021","title":"Collecting coupons is faster with friends","quality_controlled":"1","scopus_import":"1","alternative_title":["LNCS"],"external_id":{"isi":["001292788400001"]},"doi":"10.1007/978-3-030-79527-6_1","oa_version":"Preprint","file_date_updated":"2021-07-01T11:21:40Z","ddc":["000"],"file":[{"relation":"main_file","checksum":"fe37fb9af3f5016c1084af9d6e7109bd","file_size":319728,"creator":"pdavies","file_id":"9621","content_type":"application/pdf","date_updated":"2021-07-01T11:21:40Z","date_created":"2021-07-01T11:21:40Z","access_level":"open_access","file_name":"Population_Coupon_Collector.pdf"}],"publication":"Structural Information and Communication Complexity","acknowledgement":"Peter Davies is supported by the European Union’s Horizon2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","article_processing_charge":"No","page":"3-12","publisher":"Springer Nature","day":"20","_id":"9620","has_accepted_license":"1","conference":{"start_date":"2021-06-28","location":"Wrocław, Poland","end_date":"2021-07-01","name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity"},"citation":{"ista":"Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.","apa":"Alistarh, D.-A., &#38; Davies, P. (2021). Collecting coupons is faster with friends. In <i>Structural Information and Communication Complexity</i> (Vol. 12810, pp. 3–12). Wrocław, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">https://doi.org/10.1007/978-3-030-79527-6_1</a>","chicago":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In <i>Structural Information and Communication Complexity</i>, 12810:3–12. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">https://doi.org/10.1007/978-3-030-79527-6_1</a>.","ieee":"D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in <i>Structural Information and Communication Complexity</i>, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.","short":"D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.","ama":"Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: <i>Structural Information and Communication Complexity</i>. Vol 12810. Springer Nature; 2021:3-12. doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">10.1007/978-3-030-79527-6_1</a>","mla":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” <i>Structural Information and Communication Complexity</i>, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_1\">10.1007/978-3-030-79527-6_1</a>."},"abstract":[{"text":"In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons; for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically (Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019).\r\n\r\nWe provide the first theoretical analysis for such a scenario. We find that “coupon collecting with friends” can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both “coupon collecting with friends,” and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-09-10T10:04:46Z","volume":12810,"type":"conference","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}]},{"abstract":[{"lang":"eng","text":"SnSe, a wide-bandgap semiconductor, has attracted significant attention from the thermoelectric (TE) community due to its outstanding TE performance deriving from the ultralow thermal conductivity and advantageous electronic structures. Here, we promoted the TE performance of n-type SnSe polycrystals through bandgap engineering and vacancy compensation. We found that PbTe can significantly reduce the wide bandgap of SnSe to reduce the impurity transition energy, largely enhancing the carrier concentration. Also, PbTe-induced crystal symmetry promotion increases the carrier mobility, preserving large Seebeck coefficient. Consequently, a maximum ZT of ∼1.4 at 793 K is obtained in Br doped SnSe–13%PbTe. Furthermore, we found that extra Sn in n-type SnSe can compensate for the intrinsic Sn vacancies and form electron donor-like metallic Sn nanophases. The Sn nanophases near the grain boundary could also reduce the intergrain energy barrier which largely enhances the carrier mobility. As a result, a maximum ZT value of ∼1.7 at 793 K and an average ZT (ZTave) of ∼0.58 in 300–793 K are achieved in Br doped Sn1.08Se–13%PbTe. Our findings provide a novel strategy to promote the TE performance in wide-bandgap semiconductors."}],"language":[{"iso":"eng"}],"date_updated":"2024-10-09T21:00:40Z","volume":20,"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"100452","citation":{"ista":"Su L, Hong T, Wang D, Wang S, Qin B, Zhang M, Gao X, Chang C, Zhao LD. 2021. Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation. Materials Today Physics. 20, 100452.","apa":"Su, L., Hong, T., Wang, D., Wang, S., Qin, B., Zhang, M., … Zhao, L. D. (2021). Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation. <i>Materials Today Physics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">https://doi.org/10.1016/j.mtphys.2021.100452</a>","ieee":"L. Su <i>et al.</i>, “Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation,” <i>Materials Today Physics</i>, vol. 20. Elsevier, 2021.","chicago":"Su, Lizhong, Tao Hong, Dongyang Wang, Sining Wang, Bingchao Qin, Mengmeng Zhang, Xiang Gao, Cheng Chang, and Li Dong Zhao. “Realizing High Doping Efficiency and Thermoelectric Performance in N-Type SnSe Polycrystals via Bandgap Engineering and Vacancy Compensation.” <i>Materials Today Physics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">https://doi.org/10.1016/j.mtphys.2021.100452</a>.","short":"L. Su, T. Hong, D. Wang, S. Wang, B. Qin, M. Zhang, X. Gao, C. Chang, L.D. Zhao, Materials Today Physics 20 (2021).","ama":"Su L, Hong T, Wang D, et al. Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation. <i>Materials Today Physics</i>. 2021;20. doi:<a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">10.1016/j.mtphys.2021.100452</a>","mla":"Su, Lizhong, et al. “Realizing High Doping Efficiency and Thermoelectric Performance in N-Type SnSe Polycrystals via Bandgap Engineering and Vacancy Compensation.” <i>Materials Today Physics</i>, vol. 20, 100452, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.mtphys.2021.100452\">10.1016/j.mtphys.2021.100452</a>."},"day":"03","publisher":"Elsevier","article_type":"original","_id":"9626","publication":"Materials Today Physics","acknowledgement":"This work was supported by National Natural Science Foundation of China (51772012), National Key Research and Development Program of China (2018YFA0702100 and 2018YFB0703600), the Beijing Natural Science Foundation (JQ18004). This work was also supported by Lise Meitner Project (M2889-N) and the National Postdoctoral Program for Innovative Talents (BX20200028). L.D.Z. appreciates the support of the High Performance Computing (HPC) resources at Beihang University, the National Science Fund for Distinguished Young Scholars (51925101), and center for High Pressure Science and Technology Advanced Research (HPSTAR) for SEM measurements.","article_processing_charge":"No","title":"Realizing high doping efficiency and thermoelectric performance in n-type SnSe polycrystals via bandgap engineering and vacancy compensation","quality_controlled":"1","scopus_import":"1","external_id":{"isi":["000703159600010"]},"oa_version":"None","doi":"10.1016/j.mtphys.2021.100452","author":[{"first_name":"Lizhong","last_name":"Su","full_name":"Su, Lizhong"},{"first_name":"Tao","last_name":"Hong","full_name":"Hong, Tao"},{"full_name":"Wang, Dongyang","first_name":"Dongyang","last_name":"Wang"},{"first_name":"Sining","last_name":"Wang","full_name":"Wang, Sining"},{"last_name":"Qin","first_name":"Bingchao","full_name":"Qin, Bingchao"},{"full_name":"Zhang, Mengmeng","last_name":"Zhang","first_name":"Mengmeng"},{"full_name":"Gao, Xiang","first_name":"Xiang","last_name":"Gao"},{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277","last_name":"Chang","first_name":"Cheng"},{"full_name":"Zhao, Li Dong","first_name":"Li Dong","last_name":"Zhao"}],"publication_identifier":{"eissn":["2542-5293"]},"intvolume":"        20","isi":1,"date_created":"2021-07-04T22:01:24Z","status":"public","month":"06","year":"2021","date_published":"2021-06-03T00:00:00Z","corr_author":"1","department":[{"_id":"MaIb"}],"publication_status":"published"},{"issue":"3","citation":{"ieee":"D. Lenz, T. Weinmann, and M. Wirth, “Self-adjoint extensions of bipartite Hamiltonians,” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 64, no. 3. Cambridge University Press, pp. 443–447, 2021.","chicago":"Lenz, Daniel, Timon Weinmann, and Melchior Wirth. “Self-Adjoint Extensions of Bipartite Hamiltonians.” <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1017/S0013091521000080\">https://doi.org/10.1017/S0013091521000080</a>.","apa":"Lenz, D., Weinmann, T., &#38; Wirth, M. (2021). Self-adjoint extensions of bipartite Hamiltonians. <i>Proceedings of the Edinburgh Mathematical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0013091521000080\">https://doi.org/10.1017/S0013091521000080</a>","ista":"Lenz D, Weinmann T, Wirth M. 2021. Self-adjoint extensions of bipartite Hamiltonians. Proceedings of the Edinburgh Mathematical Society. 64(3), 443–447.","mla":"Lenz, Daniel, et al. “Self-Adjoint Extensions of Bipartite Hamiltonians.” <i>Proceedings of the Edinburgh Mathematical Society</i>, vol. 64, no. 3, Cambridge University Press, 2021, pp. 443–47, doi:<a href=\"https://doi.org/10.1017/S0013091521000080\">10.1017/S0013091521000080</a>.","ama":"Lenz D, Weinmann T, Wirth M. Self-adjoint extensions of bipartite Hamiltonians. <i>Proceedings of the Edinburgh Mathematical Society</i>. 2021;64(3):443-447. doi:<a href=\"https://doi.org/10.1017/S0013091521000080\">10.1017/S0013091521000080</a>","short":"D. Lenz, T. Weinmann, M. Wirth, Proceedings of the Edinburgh Mathematical Society 64 (2021) 443–447."},"date_updated":"2024-10-09T21:05:06Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We compute the deficiency spaces of operators of the form 𝐻𝐴⊗̂ 𝐼+𝐼⊗̂ 𝐻𝐵, for symmetric 𝐻𝐴 and self-adjoint 𝐻𝐵. This enables us to construct self-adjoint extensions (if they exist) by means of von Neumann's theory. The structure of the deficiency spaces for this case was asserted already in Ibort et al. [Boundary dynamics driven entanglement, J. Phys. A: Math. Theor. 47(38) (2014) 385301], but only proven under the restriction of 𝐻𝐵 having discrete, non-degenerate spectrum."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"volume":64,"type":"journal_article","page":"443-447","day":"01","publisher":"Cambridge University Press","_id":"9627","article_type":"original","scopus_import":"1","quality_controlled":"1","title":"Self-adjoint extensions of bipartite Hamiltonians","oa_version":"Published Version","external_id":{"isi":["000721363700003"],"arxiv":["1912.03670"]},"doi":"10.1017/S0013091521000080","acknowledgement":"M. W. gratefully acknowledges financial support by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes). T.W. thanks PAO Gazprom Neft, the Euler International Mathematical Institute in Saint Petersburg and ORISA GmbH for their financial support in the form of scholarships during his Master's and Bachelor's studies respectively. The authors want to thank Mark Malamud for pointing out the reference [1] to them. This work was supported by the Ministry of Science and Higher Education of the Russian Federation, agreement No 075-15-2019-1619.","publication":"Proceedings of the Edinburgh Mathematical Society","article_processing_charge":"No","corr_author":"1","date_published":"2021-08-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1017/S0013091521000080","open_access":"1"}],"publication_status":"published","department":[{"_id":"JaMa"}],"arxiv":1,"date_created":"2021-07-04T22:01:24Z","isi":1,"intvolume":"        64","publication_identifier":{"eissn":["1464-3839"],"issn":["0013-0915"]},"author":[{"last_name":"Lenz","first_name":"Daniel","full_name":"Lenz, Daniel"},{"first_name":"Timon","last_name":"Weinmann","full_name":"Weinmann, Timon"},{"last_name":"Wirth","first_name":"Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","full_name":"Wirth, Melchior","orcid":"0000-0002-0519-4241"}],"year":"2021","month":"08","status":"public"},{"article_processing_charge":"No","acknowledgement":"We acknowledge the members of the Lennon-Duménil laboratory for sharing the mouse line of Myh9-GFP. We are grateful to the members of the Liberali laboratory and the FMI facilities for their support. We thank E. Tagliavini for IT support; L. Gelman for assistance and training; S. Bichet and A. Bogucki for helping with histology of mouse tissues; H. Kohler for fluorescence-activated cell sorting; G. Q. G. de Medeiros for maintenance of light-sheet microscopy; M. G. Stadler for scRNA-seq analysis; G. Gay for discussions on the 3D vertex model; the members of the Liberali laboratory, C. P. Heisenberg and C. Tsiairis for reading and providing feedback on the manuscript. Funding: Q.Y. is supported by a Postdoc fellowship from Peter und Taul Engelhorn Stiftung (PTES). This work received funding from the European Research Council (ERC) under the EU Horizon 2020 research and Innovation Programme Grant Agreement no. 758617 (to P.L.), the Swiss National Foundation (SNF) (POOP3_157531, to P.L.) and from the ERC under the EU Horizon 2020 Research and Innovation Program Grant Agreements 851288 (to E.H.) and the Austrian Science Fund (FWF) (P31639, to E.H.).","publication":"Nature Cell Biology","pmid":1,"external_id":{"isi":["000664016300003"],"pmid":["34155381"]},"doi":"10.1038/s41556-021-00700-2","oa_version":"Preprint","scopus_import":"1","title":"Cell fate coordinates mechano-osmotic forces in intestinal crypt formation","quality_controlled":"1","year":"2021","status":"public","month":"06","date_created":"2021-07-04T22:01:25Z","isi":1,"author":[{"first_name":"Qiutan","last_name":"Yang","full_name":"Yang, Qiutan"},{"first_name":"Shi-lei","last_name":"Xue","full_name":"Xue, Shi-lei","id":"31D2C804-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chan, Chii Jou","last_name":"Chan","first_name":"Chii Jou"},{"full_name":"Rempfler, Markus","last_name":"Rempfler","first_name":"Markus"},{"full_name":"Vischi, Dario","last_name":"Vischi","first_name":"Dario"},{"first_name":"Francisca","last_name":"Maurer-Gutierrez","full_name":"Maurer-Gutierrez, Francisca"},{"full_name":"Hiiragi, Takashi","last_name":"Hiiragi","first_name":"Takashi"},{"orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B","first_name":"Edouard B","last_name":"Hannezo"},{"full_name":"Liberali, Prisca","first_name":"Prisca","last_name":"Liberali"}],"publication_identifier":{"issn":["1465-7392"],"eissn":["1476-4679"]},"intvolume":"        23","publication_status":"published","department":[{"_id":"EdHa"}],"corr_author":"1","ec_funded":1,"main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/2020.05.13.094359","open_access":"1"}],"date_published":"2021-06-21T00:00:00Z","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"grant_number":"851288","_id":"05943252-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Design Principles of Branching Morphogenesis"},{"name":"Active mechano-chemical description of the cell cytoskeleton","call_identifier":"FWF","_id":"268294B6-B435-11E9-9278-68D0E5697425","grant_number":"P31639"}],"type":"journal_article","volume":23,"date_updated":"2025-04-14T07:52:26Z","abstract":[{"lang":"eng","text":"Intestinal organoids derived from single cells undergo complex crypt–villus patterning and morphogenesis. However, the nature and coordination of the underlying forces remains poorly characterized. Here, using light-sheet microscopy and large-scale imaging quantification, we demonstrate that crypt formation coincides with a stark reduction in lumen volume. We develop a 3D biophysical model to computationally screen different mechanical scenarios of crypt morphogenesis. Combining this with live-imaging data and multiple mechanical perturbations, we show that actomyosin-driven crypt apical contraction and villus basal tension work synergistically with lumen volume reduction to drive crypt morphogenesis, and demonstrate the existence of a critical point in differential tensions above which crypt morphology becomes robust to volume changes. Finally, we identified a sodium/glucose cotransporter that is specific to differentiated enterocytes that modulates lumen volume reduction through cell swelling in the villus region. Together, our study uncovers the cellular basis of how cell fate modulates osmotic and actomyosin forces to coordinate robust morphogenesis."}],"language":[{"iso":"eng"}],"citation":{"mla":"Yang, Qiutan, et al. “Cell Fate Coordinates Mechano-Osmotic Forces in Intestinal Crypt Formation.” <i>Nature Cell Biology</i>, vol. 23, Springer Nature, 2021, pp. 733–744, doi:<a href=\"https://doi.org/10.1038/s41556-021-00700-2\">10.1038/s41556-021-00700-2</a>.","short":"Q. Yang, S. Xue, C.J. Chan, M. Rempfler, D. Vischi, F. Maurer-Gutierrez, T. Hiiragi, E.B. Hannezo, P. Liberali, Nature Cell Biology 23 (2021) 733–744.","ama":"Yang Q, Xue S, Chan CJ, et al. Cell fate coordinates mechano-osmotic forces in intestinal crypt formation. <i>Nature Cell Biology</i>. 2021;23:733–744. doi:<a href=\"https://doi.org/10.1038/s41556-021-00700-2\">10.1038/s41556-021-00700-2</a>","apa":"Yang, Q., Xue, S., Chan, C. J., Rempfler, M., Vischi, D., Maurer-Gutierrez, F., … Liberali, P. (2021). Cell fate coordinates mechano-osmotic forces in intestinal crypt formation. <i>Nature Cell Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41556-021-00700-2\">https://doi.org/10.1038/s41556-021-00700-2</a>","ieee":"Q. Yang <i>et al.</i>, “Cell fate coordinates mechano-osmotic forces in intestinal crypt formation,” <i>Nature Cell Biology</i>, vol. 23. Springer Nature, pp. 733–744, 2021.","chicago":"Yang, Qiutan, Shi-lei Xue, Chii Jou Chan, Markus Rempfler, Dario Vischi, Francisca Maurer-Gutierrez, Takashi Hiiragi, Edouard B Hannezo, and Prisca Liberali. “Cell Fate Coordinates Mechano-Osmotic Forces in Intestinal Crypt Formation.” <i>Nature Cell Biology</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41556-021-00700-2\">https://doi.org/10.1038/s41556-021-00700-2</a>.","ista":"Yang Q, Xue S, Chan CJ, Rempfler M, Vischi D, Maurer-Gutierrez F, Hiiragi T, Hannezo EB, Liberali P. 2021. Cell fate coordinates mechano-osmotic forces in intestinal crypt formation. Nature Cell Biology. 23, 733–744."},"article_type":"original","_id":"9629","publisher":"Springer Nature","day":"21","page":"733–744"},{"related_material":{"record":[{"status":"public","id":"10029","relation":"used_in_publication"}]},"author":[{"id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P","orcid":"0000-0003-2607-2363","last_name":"Higginbotham","first_name":"Andrew P"}],"publisher":"Institute of Science and Technology Austria","date_created":"2021-07-07T20:43:10Z","_id":"9636","status":"public","year":"2021","date_published":"2021-01-01T00:00:00Z","department":[{"_id":"AnHi"}],"date_updated":"2025-04-15T06:54:43Z","article_processing_charge":"No","type":"research_data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"has_accepted_license":"1","title":"Data for \"Breakdown of induced p ± ip pairing in a superconductor-semiconductor hybrid\"","citation":{"ista":"Higginbotham AP. 2021. Data for ‘Breakdown of induced p ± ip pairing in a superconductor-semiconductor hybrid’, Institute of Science and Technology Austria.","chicago":"Higginbotham, Andrew P. “Data for ‘Breakdown of Induced p ± Ip Pairing in a Superconductor-Semiconductor Hybrid.’” Institute of Science and Technology Austria, 2021.","ieee":"A. P. Higginbotham, “Data for ‘Breakdown of induced p ± ip pairing in a superconductor-semiconductor hybrid.’” Institute of Science and Technology Austria, 2021.","apa":"Higginbotham, A. P. (2021). Data for “Breakdown of induced p ± ip pairing in a superconductor-semiconductor hybrid.” Institute of Science and Technology Austria.","ama":"Higginbotham AP. Data for “Breakdown of induced p ± ip pairing in a superconductor-semiconductor hybrid.” 2021.","short":"A.P. Higginbotham, (2021).","mla":"Higginbotham, Andrew P. <i>Data for “Breakdown of Induced p ± Ip Pairing in a Superconductor-Semiconductor Hybrid.”</i> Institute of Science and Technology Austria, 2021."},"oa_version":"Submitted Version","file_date_updated":"2021-07-07T20:37:28Z","file":[{"relation":"main_file","file_size":3345244,"checksum":"18e90687ec7bbd75f8bfea4d8293fb30","success":1,"creator":"ahigginb","content_type":"application/zip","file_id":"9637","date_updated":"2021-07-07T20:37:28Z","date_created":"2021-07-07T20:37:28Z","file_name":"figures_data.zip","access_level":"open_access"}]},{"oa":1,"project":[{"call_identifier":"H2020","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","grant_number":"694539","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":183,"type":"journal_article","date_updated":"2025-07-10T12:02:00Z","abstract":[{"lang":"eng","text":"At the encounter with a novel environment, contextual memory formation is greatly enhanced, accompanied with increased arousal and active exploration. Although this phenomenon has been widely observed in animal and human daily life, how the novelty in the environment is detected and contributes to contextual memory formation has lately started to be unveiled. The hippocampus has been studied for many decades for its largely known roles in encoding spatial memory, and a growing body of evidence indicates a differential involvement of dorsal and ventral hippocampal divisions in novelty detection. In this brief review article, we discuss the recent findings of the role of mossy cells in the ventral hippocampal moiety in novelty detection and put them in perspective with other novelty-related pathways in the hippocampus. We propose a mechanism for novelty-driven memory acquisition in the dentate gyrus by the direct projection of ventral mossy cells to dorsal dentate granule cells. By this projection, the ventral hippocampus sends novelty signals to the dorsal hippocampus, opening a gate for memory encoding in dentate granule cells based on information coming from the entorhinal cortex. We conclude that, contrary to the presently accepted functional independence, the dorsal and ventral hippocampi cooperate to link the novelty and contextual information, and this dorso-ventral interaction is crucial for the novelty-dependent memory formation."}],"language":[{"iso":"eng"}],"citation":{"ama":"Fredes F, Shigemoto R. The role of hippocampal mossy cells in novelty detection. <i>Neurobiology of Learning and Memory</i>. 2021;183. doi:<a href=\"https://doi.org/10.1016/j.nlm.2021.107486\">10.1016/j.nlm.2021.107486</a>","short":"F. Fredes, R. Shigemoto, Neurobiology of Learning and Memory 183 (2021).","mla":"Fredes, Felipe, and Ryuichi Shigemoto. “The Role of Hippocampal Mossy Cells in Novelty Detection.” <i>Neurobiology of Learning and Memory</i>, vol. 183, 107486, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.nlm.2021.107486\">10.1016/j.nlm.2021.107486</a>.","ista":"Fredes F, Shigemoto R. 2021. The role of hippocampal mossy cells in novelty detection. Neurobiology of Learning and Memory. 183, 107486.","chicago":"Fredes, Felipe, and Ryuichi Shigemoto. “The Role of Hippocampal Mossy Cells in Novelty Detection.” <i>Neurobiology of Learning and Memory</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.nlm.2021.107486\">https://doi.org/10.1016/j.nlm.2021.107486</a>.","ieee":"F. Fredes and R. Shigemoto, “The role of hippocampal mossy cells in novelty detection,” <i>Neurobiology of Learning and Memory</i>, vol. 183. Elsevier, 2021.","apa":"Fredes, F., &#38; Shigemoto, R. (2021). The role of hippocampal mossy cells in novelty detection. <i>Neurobiology of Learning and Memory</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nlm.2021.107486\">https://doi.org/10.1016/j.nlm.2021.107486</a>"},"article_number":"107486","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"article_type":"original","_id":"9641","publisher":"Elsevier","day":"30","article_processing_charge":"No","acknowledgement":"This work was supported by a European Research Council Advanced Grant 694539 to Ryuichi Shigemoto.","pmid":1,"publication":"Neurobiology of Learning and Memory","file":[{"relation":"main_file","file_name":"2021_NeurobLearnMemory_Fredes.pdf","access_level":"open_access","date_updated":"2021-07-19T13:46:06Z","date_created":"2021-07-19T13:46:06Z","content_type":"application/pdf","file_id":"9694","creator":"cziletti","file_size":1994793,"checksum":"8e8298a9e8c7df146ad23f32c2a63929","success":1}],"file_date_updated":"2021-07-19T13:46:06Z","external_id":{"isi":["000677694900004"],"pmid":["34214666"]},"oa_version":"Published Version","doi":"10.1016/j.nlm.2021.107486","ddc":["610"],"scopus_import":"1","title":"The role of hippocampal mossy cells in novelty detection","quality_controlled":"1","year":"2021","status":"public","month":"06","date_created":"2021-07-11T22:01:16Z","isi":1,"author":[{"full_name":"Fredes, Felipe","first_name":"Felipe","last_name":"Fredes"},{"first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       183","publication_identifier":{"eissn":["1095-9564"],"issn":["1074-7427"]},"publication_status":"published","department":[{"_id":"RySh"}],"ec_funded":1,"date_published":"2021-06-30T00:00:00Z"},{"page":"772-787","day":"01","publisher":"Association for Computing Machinery","_id":"9645","conference":{"start_date":"2021-06-20","name":"PLDI: Programming Language Design and Implementation","end_date":"2021-06-26","location":"Online"},"citation":{"ista":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. 2021. Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 772–787.","apa":"Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., &#38; Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 772–787). Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454076\">https://doi.org/10.1145/3453483.3454076</a>","ieee":"A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Online, 2021, pp. 772–787.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 772–87. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454076\">https://doi.org/10.1145/3453483.3454076</a>.","short":"A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–787.","ama":"Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. Polynomial reachability witnesses via Stellensätze. In: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:772-787. doi:<a href=\"https://doi.org/10.1145/3453483.3454076\">10.1145/3453483.3454076</a>","mla":"Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 772–87, doi:<a href=\"https://doi.org/10.1145/3453483.3454076\">10.1145/3453483.3454076</a>."},"abstract":[{"text":"We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis.\r\n\r\nWe first show that our IRW-based approach is sound and complete for reachability analysis of imperative programs. Then, we focus on linear and polynomial programs and develop automated methods for synthesizing linear and polynomial IRWs. In the linear case, we follow the well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial case, where we present a push-button semi-complete algorithm. We achieve this using a novel combination of classical theorems in real algebraic geometry, such as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally, our experimental results show we can prove complex reachability objectives over various benchmarks that were beyond the reach of previous methods.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-07-10T12:02:00Z","type":"conference","oa":1,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"date_published":"2021-06-01T00:00:00Z","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-03183862/","open_access":"1"}],"department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Asadi, Ali","first_name":"Ali","last_name":"Asadi"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"full_name":"Mahdavi, Mohammad","last_name":"Mahdavi","first_name":"Mohammad"}],"publication_identifier":{"isbn":["9781450383912"]},"isi":1,"date_created":"2021-07-11T22:01:17Z","status":"public","month":"06","year":"2021","title":"Polynomial reachability witnesses via Stellensätze","quality_controlled":"1","scopus_import":"1","doi":"10.1145/3453483.3454076","external_id":{"isi":["000723661700050"]},"oa_version":"Submitted Version","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the National Natural Science Foundation of China (NSFC) Grant No. 61802254, the Huawei Innovation Research Program, the Facebook PhD Fellowship Program, and DOC Fellowship No. 24956 of the Austrian Academy of Sciences (ÖAW).","article_processing_charge":"No"}]