[{"extern":"1","language":[{"iso":"eng"}],"status":"public","date_updated":"2020-04-06T10:36:21Z","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ChemRxiv","author":[{"first_name":"Christian","last_name":"Prehal","full_name":"Prehal, Christian"},{"first_name":"Aleksej","last_name":"Samojlov","full_name":"Samojlov, Aleksej"},{"first_name":"Manfred","last_name":"Nachtnebel","full_name":"Nachtnebel, Manfred"},{"full_name":"Kriechbaum, Manfred","first_name":"Manfred","last_name":"Kriechbaum"},{"first_name":"Heinz","last_name":"Amenitsch","full_name":"Amenitsch, Heinz"},{"orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","last_name":"Freunberger"}],"oa":1,"date_published":"2019-12-26T00:00:00Z","type":"preprint","abstract":[{"lang":"eng","text":"Electrodepositing  insulating  and  insoluble  Li2O2  is  the  key  process  during  discharge  of  aprotic  Li-O2 batteries  and  determines  rate,  capacity,  and  reversibility.  Current  understanding  states  that  the partition  between  surface  adsorbed  and  solvated  LiO2  governs  whether  Li2O2  grows  as  surface  film, leading to low capacity even at low rates, or in solution, leading to particles and high capacities. Here we show that Li2O2 forms to the widest extent as particles via solution mediated LiO2 disproportionation. We  describe  a  unified  Li2O2  growth  model  that  conclusively  explains  capacity  limitations  across  the whole range of electrolytes. Deciding for particle morphology, achievable rate and capacities are species mobilities,   electrode   specific   surface   area   (determining  true   areal   rate)   and   the  concentration distribution of associated LiO2 in solution. Provided that species mobilities and surface are high, high, capacities are possible even with low-donor-number electrolytes, previously considered prototypical for low   capacity   via   surface   growth.   The   tools   for   these   insights   are   microscopy,   hydrodynamic voltammetry, a numerical reaction model, and in situ small/wide angle X-ray scattering (SAXS/WAXS). Combined with sophisticated data analysis, SAXS allows retrieving rich quantitative information from complex multi-phase systems. On a wider perspective, this SAXS method is a powerful in situ metrology with  atomic  to  sub-micron  resolution  to  study  mechanisms  in  complex  electrochemical  systems  and beyond. "}],"year":"2019","citation":{"ista":"Prehal C, Samojlov A, Nachtnebel M, Kriechbaum M, Amenitsch H, Freunberger SA. A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering.","ieee":"C. Prehal, A. Samojlov, M. Nachtnebel, M. Kriechbaum, H. Amenitsch, and S. A. Freunberger, “A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering.” ChemRxiv.","ama":"Prehal C, Samojlov A, Nachtnebel M, Kriechbaum M, Amenitsch H, Freunberger SA. A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering.","mla":"Prehal, Christian, et al. <i>A Revised O2 Reduction Model in Li-O2 Batteries as Revealed by in Situ Small Angle X-Ray Scattering</i>. ChemRxiv.","short":"C. Prehal, A. Samojlov, M. Nachtnebel, M. Kriechbaum, H. Amenitsch, S.A. Freunberger, (n.d.).","chicago":"Prehal, Christian, Aleksej Samojlov, Manfred Nachtnebel, Manfred Kriechbaum, Heinz Amenitsch, and Stefan Alexander Freunberger. “A Revised O2 Reduction Model in Li-O2 Batteries as Revealed by in Situ Small Angle X-Ray Scattering.” ChemRxiv, n.d.","apa":"Prehal, C., Samojlov, A., Nachtnebel, M., Kriechbaum, M., Amenitsch, H., &#38; Freunberger, S. A. (n.d.). A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering. ChemRxiv."},"_id":"7627","date_created":"2020-04-01T10:10:21Z","day":"26","main_file_link":[{"open_access":"1","url":"https://doi.org/10.26434/chemrxiv.11447775.v1"}],"page":"50","oa_version":"Preprint","article_processing_charge":"No","title":"A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering","publication_status":"submitted"},{"language":[{"iso":"eng"}],"month":"10","isi":1,"department":[{"_id":"VlKo"}],"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","status":"public","date_updated":"2023-09-08T11:19:12Z","publisher":"IEEE","author":[{"last_name":"Rannen-Triki","first_name":"Amal","full_name":"Rannen-Triki, Amal"},{"full_name":"Berman, Maxim","last_name":"Berman","first_name":"Maxim"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"full_name":"Blaschko, Matthew B.","first_name":"Matthew B.","last_name":"Blaschko"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2019-10-01T00:00:00Z","external_id":{"isi":["000554591600090"]},"type":"conference","article_number":"748-752","year":"2019","citation":{"apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., &#38; Blaschko, M. B. (2019). Function norms for neural networks. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 748–752, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>.","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019.","ista":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752."},"abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) have become increasingly important due to their excellent empirical performance on a wide range of problems. However, regularization is generally achieved by indirect means, largely due to the complex set of functions defined by a network and the difficulty in measuring function complexity. There exists no method in the literature for additive regularization based on a norm of the function, as is classically considered in statistical learning theory. In this work, we study the tractability of function norms for deep neural networks with ReLU activations. We provide, to the best of our knowledge, the first proof in the literature of the NP-hardness of computing function norms of DNNs of 3 or more layers. We also highlight a fundamental difference between shallow and deep networks. In the light on these results, we propose a new regularization strategy based on approximate function norms, and show its efficiency on a segmentation task with a DNN."}],"conference":{"location":"Seoul, South Korea","name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28","start_date":"2019-10-27"},"_id":"7639","date_created":"2020-04-05T22:00:50Z","doi":"10.1109/ICCVW.2019.00097","scopus_import":"1","day":"01","publication_identifier":{"isbn":["9781728150239"]},"title":"Function norms for neural networks","quality_controlled":"1","publication_status":"published","oa_version":"None","article_processing_charge":"No"},{"publisher":"IEEE","date_published":"2019-10-01T00:00:00Z","external_id":{"isi":["000554591601098"],"arxiv":["1807.02136"]},"type":"conference","language":[{"iso":"eng"}],"status":"public","month":"10","isi":1,"day":"01","quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","call_identifier":"FP7"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander","first_name":"Alexander","last_name":"Kolesnikov"},{"last_name":"Kuznetsova","first_name":"Alina","full_name":"Kuznetsova, Alina"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"},{"last_name":"Ferrari","first_name":"Vittorio","full_name":"Ferrari, Vittorio"}],"oa":1,"arxiv":1,"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","ec_funded":1,"date_updated":"2023-09-08T11:18:37Z","department":[{"_id":"ChLa"}],"publication_identifier":{"isbn":["9781728150239"]},"doi":"10.1109/ICCVW.2019.00217","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.02136"}],"scopus_import":"1","oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","title":"Detecting visual relationships using box attention","abstract":[{"lang":"eng","text":"We propose a new model for detecting visual relationships, such as \"person riding motorcycle\" or \"bottle on table\". This task is an important step towards comprehensive structured mage understanding, going beyond detecting individual objects. Our main novelty is a Box Attention mechanism that allows to model pairwise interactions between objects using standard object detection pipelines. The resulting model is conceptually clean, expressive and relies on well-justified training and prediction procedures. Moreover, unlike previously proposed approaches, our model does not introduce any additional complex components or hyperparameters on top of those already required by the underlying detection model. We conduct an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating strong quantitative and qualitative results."}],"year":"2019","article_number":"1749-1753","citation":{"short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., &#38; Ferrari, V. (2019). Detecting visual relationships using box attention. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>.","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 1749–1753, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>.","ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>","ista":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual relationships using box attention. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 1749–1753.","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019."},"_id":"7640","date_created":"2020-04-05T22:00:51Z","conference":{"location":"Seoul, South Korea","name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28","start_date":"2019-10-27"}},{"language":[{"iso":"eng"}],"extern":"1","intvolume":"        10","month":"11","date_updated":"2021-01-12T08:15:01Z","publication":"Nature Communications","status":"public","author":[{"full_name":"Delaneau, Olivier","first_name":"Olivier","last_name":"Delaneau"},{"first_name":"Jean-François","last_name":"Zagury","full_name":"Zagury, Jean-François"},{"full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","last_name":"Robinson","first_name":"Matthew Richard"},{"full_name":"Marchini, Jonathan L.","first_name":"Jonathan L.","last_name":"Marchini"},{"first_name":"Emmanouil T.","last_name":"Dermitzakis","full_name":"Dermitzakis, Emmanouil T."}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_published":"2019-11-28T00:00:00Z","volume":10,"oa":1,"citation":{"mla":"Delaneau, Olivier, et al. “Accurate, Scalable and Integrative Haplotype Estimation.” <i>Nature Communications</i>, vol. 10, 5436, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s41467-019-13225-y\">10.1038/s41467-019-13225-y</a>.","apa":"Delaneau, O., Zagury, J.-F., Robinson, M. R., Marchini, J. L., &#38; Dermitzakis, E. T. (2019). Accurate, scalable and integrative haplotype estimation. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-019-13225-y\">https://doi.org/10.1038/s41467-019-13225-y</a>","chicago":"Delaneau, Olivier, Jean-François Zagury, Matthew Richard Robinson, Jonathan L. Marchini, and Emmanouil T. Dermitzakis. “Accurate, Scalable and Integrative Haplotype Estimation.” <i>Nature Communications</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41467-019-13225-y\">https://doi.org/10.1038/s41467-019-13225-y</a>.","short":"O. Delaneau, J.-F. Zagury, M.R. Robinson, J.L. Marchini, E.T. Dermitzakis, Nature Communications 10 (2019).","ista":"Delaneau O, Zagury J-F, Robinson MR, Marchini JL, Dermitzakis ET. 2019. Accurate, scalable and integrative haplotype estimation. Nature Communications. 10, 5436.","ieee":"O. Delaneau, J.-F. Zagury, M. R. Robinson, J. L. Marchini, and E. T. Dermitzakis, “Accurate, scalable and integrative haplotype estimation,” <i>Nature Communications</i>, vol. 10. Springer Nature, 2019.","ama":"Delaneau O, Zagury J-F, Robinson MR, Marchini JL, Dermitzakis ET. Accurate, scalable and integrative haplotype estimation. <i>Nature Communications</i>. 2019;10. doi:<a href=\"https://doi.org/10.1038/s41467-019-13225-y\">10.1038/s41467-019-13225-y</a>"},"article_number":"5436","year":"2019","abstract":[{"text":"The number of human genomes being genotyped or sequenced increases exponentially and efficient haplotype estimation methods able to handle this amount of data are now required. Here we present a method, SHAPEIT4, which substantially improves upon other methods to process large genotype and high coverage sequencing datasets. It notably exhibits sub-linear running times with sample size, provides highly accurate haplotypes and allows integrating external phasing information such as large reference panels of haplotypes, collections of pre-phased variants and long sequencing reads. We provide SHAPEIT4 in an open source format and demonstrate its performance in terms of accuracy and running times on two gold standard datasets: the UK Biobank data and the Genome In A Bottle.","lang":"eng"}],"date_created":"2020-04-30T10:40:32Z","_id":"7710","main_file_link":[{"url":"https://doi.org/10.1038/s41467-019-13225-y","open_access":"1"}],"doi":"10.1038/s41467-019-13225-y","publication_identifier":{"issn":["2041-1723"]},"day":"28","article_type":"original","publication_status":"published","title":"Accurate, scalable and integrative haplotype estimation","quality_controlled":"1","article_processing_charge":"No","oa_version":"Published Version"},{"abstract":[{"lang":"eng","text":"The nature and extent of mitochondrial DNA variation in a population and how it affects traits is poorly understood. Here we resequence the mitochondrial genomes of 169 Drosophila Genetic Reference Panel lines, identifying 231 variants that stratify along 12 mitochondrial haplotypes. We identify 1,845 cases of mitonuclear allelic imbalances, thus implying that mitochondrial haplotypes are reflected in the nuclear genome. However, no major fitness effects are associated with mitonuclear imbalance, suggesting that such imbalances reflect population structure at the mitochondrial level rather than genomic incompatibilities. Although mitochondrial haplotypes have no direct impact on mitochondrial respiration, some haplotypes are associated with stress- and metabolism-related phenotypes, including food intake in males. Finally, through reciprocal swapping of mitochondrial genomes, we demonstrate that a mitochondrial haplotype associated with high food intake can rescue a low food intake phenotype. Together, our findings provide new insight into population structure at the mitochondrial level and point to the importance of incorporating mitochondrial haplotypes in genotype–phenotype relationship studies."}],"year":"2019","citation":{"ieee":"R. P. J. Bevers <i>et al.</i>, “Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel,” <i>Nature Metabolism</i>, vol. 1, no. 12. Springer Nature, pp. 1226–1242, 2019.","ista":"Bevers RPJ, Litovchenko M, Kapopoulou A, Braman VS, Robinson MR, Auwerx J, Hollis B, Deplancke B. 2019. Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel. Nature Metabolism. 1(12), 1226–1242.","ama":"Bevers RPJ, Litovchenko M, Kapopoulou A, et al. Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel. <i>Nature Metabolism</i>. 2019;1(12):1226-1242. doi:<a href=\"https://doi.org/10.1038/s42255-019-0147-3\">10.1038/s42255-019-0147-3</a>","apa":"Bevers, R. P. J., Litovchenko, M., Kapopoulou, A., Braman, V. S., Robinson, M. R., Auwerx, J., … Deplancke, B. (2019). Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel. <i>Nature Metabolism</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42255-019-0147-3\">https://doi.org/10.1038/s42255-019-0147-3</a>","short":"R.P.J. Bevers, M. Litovchenko, A. Kapopoulou, V.S. Braman, M.R. Robinson, J. Auwerx, B. Hollis, B. Deplancke, Nature Metabolism 1 (2019) 1226–1242.","chicago":"Bevers, Roel P. J., Maria Litovchenko, Adamandia Kapopoulou, Virginie S. Braman, Matthew Richard Robinson, Johan Auwerx, Brian Hollis, and Bart Deplancke. “Mitochondrial Haplotypes Affect Metabolic Phenotypes in the Drosophila Genetic Reference Panel.” <i>Nature Metabolism</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s42255-019-0147-3\">https://doi.org/10.1038/s42255-019-0147-3</a>.","mla":"Bevers, Roel P. J., et al. “Mitochondrial Haplotypes Affect Metabolic Phenotypes in the Drosophila Genetic Reference Panel.” <i>Nature Metabolism</i>, vol. 1, no. 12, Springer Nature, 2019, pp. 1226–42, doi:<a href=\"https://doi.org/10.1038/s42255-019-0147-3\">10.1038/s42255-019-0147-3</a>."},"_id":"7711","date_created":"2020-04-30T10:40:56Z","issue":"12","article_type":"original","publication_identifier":{"issn":["2522-5812"]},"day":"09","page":"1226-1242","doi":"10.1038/s42255-019-0147-3","article_processing_charge":"No","oa_version":"None","quality_controlled":"1","publication_status":"published","title":"Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel","intvolume":"         1","extern":"1","language":[{"iso":"eng"}],"status":"public","publication":"Nature Metabolism","date_updated":"2021-01-12T08:15:01Z","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","author":[{"last_name":"Bevers","first_name":"Roel P. J.","full_name":"Bevers, Roel P. J."},{"last_name":"Litovchenko","first_name":"Maria","full_name":"Litovchenko, Maria"},{"full_name":"Kapopoulou, Adamandia","first_name":"Adamandia","last_name":"Kapopoulou"},{"full_name":"Braman, Virginie S.","first_name":"Virginie S.","last_name":"Braman"},{"last_name":"Robinson","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813"},{"full_name":"Auwerx, Johan","last_name":"Auwerx","first_name":"Johan"},{"last_name":"Hollis","first_name":"Brian","full_name":"Hollis, Brian"},{"last_name":"Deplancke","first_name":"Bart","full_name":"Deplancke, Bart"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/s42255-020-0202-0","relation":"erratum"}]},"volume":1,"date_published":"2019-12-09T00:00:00Z","type":"journal_article"},{"day":"14","page":"20","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/632380 "}],"oa_version":"Preprint","article_processing_charge":"No","title":"Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank","publication_status":"published","abstract":[{"text":"As genome-wide association studies (GWAS) increased in size, numerous gene-environment interactions (GxE) have been discovered, many of which however explore only one environment at a time and may suffer from statistical artefacts leading to biased interaction estimates. Here we propose a maximum likelihood method to estimate the contribution of GxE to complex traits taking into account all interacting environmental variables at the same time, without the need to measure any. This is possible because GxE induces fluctuations in the conditional trait variance, the extent of which depends on the strength of GxE. The approach can be applied to continuous outcomes and for single SNPs or genetic risk scores (GRS). Extensive simulations demonstrated that our method yields unbiased interaction estimates and excellent confidence interval coverage. We also offer a strategy to distinguish specific GxE from general heteroscedasticity (scale effects). Applying our method to 32 complex traits in the UK Biobank reveals that for body mass index (BMI) the GRSxE explains an additional 1.9% variance on top of the 5.2% GRS contribution. However, this interaction is not specific to the GRS and holds for any variable similarly correlated with BMI. On the contrary, the GRSxE interaction effect for leg impedance Embedded Image is significantly (P < 10−56) larger than it would be expected for a similarly correlated variable Embedded Image. We showed that our method could robustly detect the global contribution of GxE to complex traits, which turned out to be substantial for certain obesity measures.","lang":"eng"}],"citation":{"ista":"Sulc J, Mounier N, Günther F, Winkler T, Wood AR, Frayling TM, Heid IM, Robinson MR, Kutalik Z. 2019. Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank. bioRxiv, .","ieee":"J. Sulc <i>et al.</i>, “Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory, 2019.","ama":"Sulc J, Mounier N, Günther F, et al. Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank. <i>bioRxiv</i>. 2019.","apa":"Sulc, J., Mounier, N., Günther, F., Winkler, T., Wood, A. R., Frayling, T. M., … Kutalik, Z. (2019). Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank. <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","short":"J. Sulc, N. Mounier, F. Günther, T. Winkler, A.R. Wood, T.M. Frayling, I.M. Heid, M.R. Robinson, Z. Kutalik, BioRxiv (2019).","chicago":"Sulc, Jonathan, Ninon Mounier, Felix Günther, Thomas Winkler, Andrew R. Wood, Timothy M. Frayling, Iris M. Heid, Matthew Richard Robinson, and Zoltán Kutalik. “Maximum Likelihood Method Quantifies the Overall Contribution of Gene-Environment Interaction to Continuous Traits: An Application to Complex Traits in the UK Biobank.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, 2019.","mla":"Sulc, Jonathan, et al. “Maximum Likelihood Method Quantifies the Overall Contribution of Gene-Environment Interaction to Continuous Traits: An Application to Complex Traits in the UK Biobank.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, 2019."},"year":"2019","date_created":"2020-04-30T13:04:26Z","_id":"7782","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Sulc, Jonathan","last_name":"Sulc","first_name":"Jonathan"},{"full_name":"Mounier, Ninon","last_name":"Mounier","first_name":"Ninon"},{"full_name":"Günther, Felix","last_name":"Günther","first_name":"Felix"},{"first_name":"Thomas","last_name":"Winkler","full_name":"Winkler, Thomas"},{"full_name":"Wood, Andrew R.","first_name":"Andrew R.","last_name":"Wood"},{"last_name":"Frayling","first_name":"Timothy M.","full_name":"Frayling, Timothy M."},{"first_name":"Iris M.","last_name":"Heid","full_name":"Heid, Iris M."},{"full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","first_name":"Matthew Richard"},{"full_name":"Kutalik, Zoltán","last_name":"Kutalik","first_name":"Zoltán"}],"publisher":"Cold Spring Harbor Laboratory","oa":1,"type":"preprint","date_published":"2019-06-14T00:00:00Z","extern":"1","language":[{"iso":"eng"}],"date_updated":"2021-01-12T08:15:30Z","publication":"bioRxiv","status":"public","month":"06"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Biniaz, Ahmad","last_name":"Biniaz","first_name":"Ahmad"},{"full_name":"Jain, Kshitij","last_name":"Jain","first_name":"Kshitij"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"last_name":"Masárová","first_name":"Zuzana","full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322"},{"full_name":"Miltzow, Tillmann","first_name":"Tillmann","last_name":"Miltzow"},{"first_name":"Debajyoti","last_name":"Mondal","full_name":"Mondal, Debajyoti"},{"last_name":"Naredla","first_name":"Anurag Murty","full_name":"Naredla, Anurag Murty"},{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef"},{"first_name":"Alexi","last_name":"Turcotte","full_name":"Turcotte, Alexi"}],"oa":1,"related_material":{"record":[{"id":"7944","relation":"dissertation_contains","status":"public"},{"id":"12833","relation":"later_version","status":"public"}]},"type":"preprint","date_published":"2019-03-16T00:00:00Z","external_id":{"arxiv":["1903.06981"]},"arxiv":1,"language":[{"iso":"eng"}],"date_updated":"2024-01-04T12:42:08Z","status":"public","publication":"arXiv","department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"month":"03","day":"16","main_file_link":[{"url":"https://arxiv.org/abs/1903.06981","open_access":"1"}],"oa_version":"Preprint","article_processing_charge":"No","publication_status":"submitted","title":"Token swapping on trees","abstract":[{"lang":"eng","text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex.  The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete.  We present some partial results:\r\n1.  An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2.  Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3.  Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2.\r\n3.  A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars.  In this version, tokens and  vertices  have  colours,  and  colours  have  weights.   The  goal  is  to  get  every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved."}],"citation":{"ieee":"A. Biniaz <i>et al.</i>, “Token swapping on trees,” <i>arXiv</i>. .","ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. <i>arXiv</i>.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.).","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. <i>arXiv</i>.","chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” <i>ArXiv</i>, n.d.","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” <i>ArXiv</i>, 1903.06981."},"article_number":"1903.06981","year":"2019","date_created":"2020-06-08T12:25:25Z","_id":"7950"},{"issue":"2","has_accepted_license":"1","project":[{"grant_number":"334077","call_identifier":"FP7","_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions"}],"page":"238-255","day":"09","quality_controlled":"1","ddc":["570"],"language":[{"iso":"eng"}],"isi":1,"month":"01","publist_id":"8048","status":"public","pmid":1,"publisher":"Society for Neuroscience","type":"journal_article","external_id":{"isi":["000455189900006"],"pmid":["30504274"]},"date_published":"2019-01-09T00:00:00Z","citation":{"mla":"Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” <i>Journal of Neuroscience</i>, vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">10.1523/JNEUROSCI.1059-18.2018</a>.","short":"G. Trébuchet, P.B. Cattenoz, J. Zsámboki, D. Mazaud, D.E. Siekhaus, M. Fanto, A. Giangrande, Journal of Neuroscience 39 (2019) 238–255.","apa":"Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E., Fanto, M., &#38; Giangrande, A. (2019). The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">https://doi.org/10.1523/JNEUROSCI.1059-18.2018</a>","chicago":"Trébuchet, Guillaume, Pierre B Cattenoz, János Zsámboki, David Mazaud, Daria E Siekhaus, Manolis Fanto, and Angela Giangrande. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2019. <a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">https://doi.org/10.1523/JNEUROSCI.1059-18.2018</a>.","ieee":"G. Trébuchet <i>et al.</i>, “The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate,” <i>Journal of Neuroscience</i>, vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019.","ista":"Trébuchet G, Cattenoz PB, Zsámboki J, Mazaud D, Siekhaus DE, Fanto M, Giangrande A. 2019. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. 39(2), 238–255.","ama":"Trébuchet G, Cattenoz PB, Zsámboki J, et al. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. <i>Journal of Neuroscience</i>. 2019;39(2):238-255. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">10.1523/JNEUROSCI.1059-18.2018</a>"},"year":"2019","abstract":[{"lang":"eng","text":"Despite their different origins, Drosophila glia and hemocytes are related cell populations that provide an immune function. Drosophila hemocytes patrol the body cavity and act as macrophages outside the nervous system whereas glia originate from the neuroepithelium and provide the scavenger population of the nervous system. Drosophila glia are hence the functional orthologs of vertebrate microglia, even though the latter are cells of immune origin that subsequently move into the brain during development. Interestingly, the Drosophila immune cells within (glia) and outside the nervous system (hemocytes) require the same transcription factor Glide/Gcm for their development. This raises the issue of how do glia specifically differentiate in the nervous system and hemocytes in the procephalic mesoderm. The Repo homeodomain transcription factor and pan-glial direct target of Glide/Gcm is known to ensure glial terminal differentiation. Here we show that Repo also takes center stage in the process that discriminates between glia and hemocytes. First, Repo expression is repressed in the hemocyte anlagen by mesoderm-specific factors. Second, Repo ectopic activation in the procephalic mesoderm is sufficient to repress the expression of hemocyte-specific genes. Third, the lack of Repo triggers the expression of hemocyte markers in glia. Thus, a complex network of tissue-specific cues biases the potential of Glide/Gcm. These data allow us to revise the concept of fate determinants and help us understand the bases of cell specification. Both sexes were analyzed.SIGNIFICANCE STATEMENTDistinct cell types often require the same pioneer transcription factor, raising the issue of how does one factor trigger different fates. In Drosophila, glia and hemocytes provide a scavenger activity within and outside the nervous system, respectively. While they both require the Glide/Gcm transcription factor, glia originate from the ectoderm, hemocytes from the mesoderm. Here we show that tissue-specific factors inhibit the gliogenic potential of Glide/Gcm in the mesoderm by repressing the expression of the homeodomain protein Repo, a major glial-specific target of Glide/Gcm. Repo expression in turn inhibits the expression of hemocyte-specific genes in the nervous system. These cell-specific networks secure the establishment of the glial fate only in the nervous system and allow cell diversification."}],"file":[{"checksum":"8f6925eb4cd1e8747d8ea25929c68de6","content_type":"application/pdf","file_id":"8596","creator":"dernst","relation":"main_file","date_updated":"2020-10-02T09:33:28Z","date_created":"2020-10-02T09:33:28Z","file_size":9455414,"access_level":"open_access","success":1,"file_name":"2019_JournNeuroscience_Trebuchet.pdf"}],"date_created":"2018-12-11T11:44:07Z","_id":"8","scopus_import":"1","doi":"10.1523/JNEUROSCI.1059-18.2018","acknowledgement":"This work was supported by INSERM, CNRS, UDS, Ligue Régionale contre le Cancer, Hôpital de Strasbourg, Association pour la Recherche sur le Cancer (ARC) and Agence Nationale de la Recherche (ANR) grants. P.B.C. was funded by the ANR and by the ARSEP (Fondation pour l'Aide à la Recherche sur la Sclérose en Plaques), and G.T. by governmental and ARC fellowships. This work was also supported by grants from the Ataxia UK (2491) and the NC3R (NC/L000199/1) awarded to M.F. The Institut de Génétique et de Biologie Moléculaire et Cellulaire was also supported by a French state fund through the ANR labex. D.E.S. was funded by Marie Curie Grant CIG 334077/IRTIM. We thank B. Altenhein, K. Brückner, M. Crozatier, L. Waltzer, M. Logan, E. Kurant, R. Reuter, E. Kurucz, J.L Dimarcq, J. Hoffmann, C. Goodman, the DHSB, and the BDSC for reagents and flies. We also thank all of the laboratory members for comments on the manuscript; C. Diebold, C. Delaporte, M. Pezze, the fly, and imaging and antibody facilities for technical assistance; and D. Dembele for help with statistics. In addition, we thank Alison Brewer for help with Luciferase assays.","article_type":"original","title":"The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate","publication_status":"published","oa_version":"Published Version","article_processing_charge":"No","file_date_updated":"2020-10-02T09:33:28Z","intvolume":"        39","department":[{"_id":"DaSi"}],"date_updated":"2023-09-19T10:10:55Z","ec_funded":1,"publication":"Journal of Neuroscience","author":[{"first_name":"Guillaume","last_name":"Trébuchet","full_name":"Trébuchet, Guillaume"},{"last_name":"Cattenoz","first_name":"Pierre B","full_name":"Cattenoz, Pierre B"},{"first_name":"János","last_name":"Zsámboki","full_name":"Zsámboki, János"},{"full_name":"Mazaud, David","last_name":"Mazaud","first_name":"David"},{"last_name":"Siekhaus","first_name":"Daria E","full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353"},{"full_name":"Fanto, Manolis","first_name":"Manolis","last_name":"Fanto"},{"full_name":"Giangrande, Angela","first_name":"Angela","last_name":"Giangrande"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":39,"oa":1},{"quality_controlled":"1","day":"01","page":"723-776","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"has_accepted_license":"1","issue":"2","external_id":{"isi":["000467796800007"]},"date_published":"2019-06-01T00:00:00Z","type":"journal_article","publisher":"Springer","status":"public","publist_id":"7974","month":"06","isi":1,"language":[{"iso":"eng"}],"ddc":["530"],"file_date_updated":"2020-07-14T12:48:07Z","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","publication_status":"published","article_type":"original","doi":"10.1007/s00220-018-3239-0","scopus_import":"1","_id":"80","file":[{"checksum":"c7e9880b43ac726712c1365e9f2f73a6","content_type":"application/pdf","creator":"dernst","file_id":"5688","relation":"main_file","date_updated":"2020-07-14T12:48:07Z","file_size":893902,"date_created":"2018-12-17T10:34:06Z","file_name":"2018_CommunMathPhys_Deuchert.pdf","access_level":"open_access"}],"date_created":"2018-12-11T11:44:31Z","abstract":[{"text":"We consider an interacting, dilute Bose gas trapped in a harmonic potential at a positive temperature. The system is analyzed in a combination of a thermodynamic and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap. We prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the GP energy functional. We also prove Bose–Einstein condensation in the following sense: The one-particle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the GP minimizer.","lang":"eng"}],"year":"2019","citation":{"mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” <i>Communications in Mathematical Physics</i>, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:<a href=\"https://doi.org/10.1007/s00220-018-3239-0\">10.1007/s00220-018-3239-0</a>.","short":"A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 368 (2019) 723–776.","apa":"Deuchert, A., Seiringer, R., &#38; Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-018-3239-0\">https://doi.org/10.1007/s00220-018-3239-0</a>","chicago":"Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” <i>Communications in Mathematical Physics</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00220-018-3239-0\">https://doi.org/10.1007/s00220-018-3239-0</a>.","ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. <i>Communications in Mathematical Physics</i>. 2019;368(2):723-776. doi:<a href=\"https://doi.org/10.1007/s00220-018-3239-0\">10.1007/s00220-018-3239-0</a>","ista":"Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 368(2), 723–776.","ieee":"A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in a dilute, trapped gas at positive temperature,” <i>Communications in Mathematical Physics</i>, vol. 368, no. 2. Springer, pp. 723–776, 2019."},"oa":1,"volume":368,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Andreas","last_name":"Deuchert","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas"},{"last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"}],"publication":"Communications in Mathematical Physics","ec_funded":1,"date_updated":"2023-08-24T14:27:51Z","department":[{"_id":"RoSe"}],"intvolume":"       368"},{"volume":15,"oa":1,"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","author":[{"full_name":"Currin, Christopher B.","first_name":"Christopher B.","last_name":"Currin"},{"last_name":"Khoza","first_name":"Phumlani N.","full_name":"Khoza, Phumlani N."},{"full_name":"Antrobus, Alexander D.","last_name":"Antrobus","first_name":"Alexander D."},{"last_name":"Latham","first_name":"Peter E.","full_name":"Latham, Peter E."},{"full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","first_name":"Tim P"},{"first_name":"Joseph V.","last_name":"Raimondo","full_name":"Raimondo, Joseph V."}],"date_updated":"2021-01-12T08:16:31Z","publication":"PLOS Computational Biology","intvolume":"        15","oa_version":"Published Version","article_processing_charge":"No","file_date_updated":"2020-07-14T12:48:08Z","publication_status":"published","title":"Think: Theory for Africa","publication_identifier":{"issn":["1553-7358"]},"article_type":"original","doi":"10.1371/journal.pcbi.1007049","file":[{"checksum":"723bdfb6ee5c747cbbb32baf01d17fad","creator":"cziletti","file_id":"8079","content_type":"application/pdf","date_updated":"2020-07-14T12:48:08Z","relation":"main_file","date_created":"2020-07-02T12:22:57Z","file_size":773969,"access_level":"open_access","file_name":"2019_PlosCompBio_Currin.pdf"}],"date_created":"2020-06-25T12:50:39Z","_id":"8013","citation":{"ama":"Currin CB, Khoza PN, Antrobus AD, Latham PE, Vogels TP, Raimondo JV. Think: Theory for Africa. <i>PLOS Computational Biology</i>. 2019;15(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007049\">10.1371/journal.pcbi.1007049</a>","ieee":"C. B. Currin, P. N. Khoza, A. D. Antrobus, P. E. Latham, T. P. Vogels, and J. V. Raimondo, “Think: Theory for Africa,” <i>PLOS Computational Biology</i>, vol. 15, no. 7. Public Library of Science, 2019.","ista":"Currin CB, Khoza PN, Antrobus AD, Latham PE, Vogels TP, Raimondo JV. 2019. Think: Theory for Africa. PLOS Computational Biology. 15(7), e1007049.","short":"C.B. Currin, P.N. Khoza, A.D. Antrobus, P.E. Latham, T.P. Vogels, J.V. Raimondo, PLOS Computational Biology 15 (2019).","chicago":"Currin, Christopher B., Phumlani N. Khoza, Alexander D. Antrobus, Peter E. Latham, Tim P Vogels, and Joseph V. Raimondo. “Think: Theory for Africa.” <i>PLOS Computational Biology</i>. Public Library of Science, 2019. <a href=\"https://doi.org/10.1371/journal.pcbi.1007049\">https://doi.org/10.1371/journal.pcbi.1007049</a>.","apa":"Currin, C. B., Khoza, P. N., Antrobus, A. D., Latham, P. E., Vogels, T. P., &#38; Raimondo, J. V. (2019). Think: Theory for Africa. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007049\">https://doi.org/10.1371/journal.pcbi.1007049</a>","mla":"Currin, Christopher B., et al. “Think: Theory for Africa.” <i>PLOS Computational Biology</i>, vol. 15, no. 7, e1007049, Public Library of Science, 2019, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007049\">10.1371/journal.pcbi.1007049</a>."},"year":"2019","article_number":"e1007049","type":"journal_article","date_published":"2019-07-11T00:00:00Z","external_id":{"pmid":["31295253"]},"pmid":1,"publisher":"Public Library of Science","status":"public","month":"07","extern":"1","ddc":["570"],"language":[{"iso":"eng"}],"quality_controlled":"1","day":"11","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"issue":"7"},{"_id":"8014","file":[{"access_level":"open_access","file_name":"2019_NeurosBiobehavRev_Manohar.pdf","date_created":"2020-07-02T13:17:52Z","date_updated":"2020-07-14T12:48:08Z","file_size":1754418,"relation":"main_file","file_id":"8080","creator":"cziletti","content_type":"application/pdf","checksum":"7b972e3d6f7bb3122c8c5648f44e60ca"}],"date_created":"2020-06-25T12:52:13Z","abstract":[{"text":"Working memory, the ability to keep recently accessed information available for immediate manipulation, has been proposed to rely on two mechanisms that appear difficult to reconcile: self-sustained neural firing, or the opposite—activity-silent synaptic traces. Here we review and contrast models of these two mechanisms, and then show that both phenomena can co-exist within a unified system in which neurons hold information in both activity and synapses. Rapid plasticity in flexibly-coding neurons allows features to be bound together into objects, with an important emergent property being the focus of attention. One memory item is held by persistent activity in an attended or “focused” state, and is thus remembered better than other items. Other, previously attended items can remain in memory but in the background, encoded in activity-silent synaptic traces. This dual functional architecture provides a unified common mechanism accounting for a diversity of perplexing attention and memory effects that have been hitherto difficult to explain in a single theoretical framework.","lang":"eng"}],"year":"2019","citation":{"chicago":"Manohar, Sanjay G., Nahid Zokaei, Sean J. Fallon, Tim P Vogels, and Masud Husain. “Neural Mechanisms of Attending to Items in Working Memory.” <i>Neuroscience and Biobehavioral Reviews</i>. Elsevier , 2019. <a href=\"https://doi.org/10.1016/j.neubiorev.2019.03.017\">https://doi.org/10.1016/j.neubiorev.2019.03.017</a>.","short":"S.G. Manohar, N. Zokaei, S.J. Fallon, T.P. Vogels, M. Husain, Neuroscience and Biobehavioral Reviews 101 (2019) 1–12.","apa":"Manohar, S. G., Zokaei, N., Fallon, S. J., Vogels, T. P., &#38; Husain, M. (2019). Neural mechanisms of attending to items in working memory. <i>Neuroscience and Biobehavioral Reviews</i>. Elsevier . <a href=\"https://doi.org/10.1016/j.neubiorev.2019.03.017\">https://doi.org/10.1016/j.neubiorev.2019.03.017</a>","mla":"Manohar, Sanjay G., et al. “Neural Mechanisms of Attending to Items in Working Memory.” <i>Neuroscience and Biobehavioral Reviews</i>, vol. 101, Elsevier , 2019, pp. 1–12, doi:<a href=\"https://doi.org/10.1016/j.neubiorev.2019.03.017\">10.1016/j.neubiorev.2019.03.017</a>.","ista":"Manohar SG, Zokaei N, Fallon SJ, Vogels TP, Husain M. 2019. Neural mechanisms of attending to items in working memory. Neuroscience and Biobehavioral Reviews. 101, 1–12.","ieee":"S. G. Manohar, N. Zokaei, S. J. Fallon, T. P. Vogels, and M. Husain, “Neural mechanisms of attending to items in working memory,” <i>Neuroscience and Biobehavioral Reviews</i>, vol. 101. Elsevier , pp. 1–12, 2019.","ama":"Manohar SG, Zokaei N, Fallon SJ, Vogels TP, Husain M. Neural mechanisms of attending to items in working memory. <i>Neuroscience and Biobehavioral Reviews</i>. 2019;101:1-12. doi:<a href=\"https://doi.org/10.1016/j.neubiorev.2019.03.017\">10.1016/j.neubiorev.2019.03.017</a>"},"file_date_updated":"2020-07-14T12:48:08Z","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"Neural mechanisms of attending to items in working memory","article_type":"original","publication_identifier":{"issn":["0149-7634"]},"doi":"10.1016/j.neubiorev.2019.03.017","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/233007 "}],"publication":"Neuroscience and Biobehavioral Reviews","date_updated":"2021-01-12T08:16:31Z","intvolume":"       101","oa":1,"volume":101,"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","author":[{"full_name":"Manohar, Sanjay G.","last_name":"Manohar","first_name":"Sanjay G."},{"full_name":"Zokaei, Nahid","first_name":"Nahid","last_name":"Zokaei"},{"first_name":"Sean J.","last_name":"Fallon","full_name":"Fallon, Sean J."},{"last_name":"Vogels","first_name":"Tim P","full_name":"Vogels, Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","orcid":"0000-0003-3295-6181"},{"full_name":"Husain, Masud","last_name":"Husain","first_name":"Masud"}],"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","day":"01","page":"1-12","status":"public","month":"06","extern":"1","language":[{"iso":"eng"}],"ddc":["570"],"date_published":"2019-06-01T00:00:00Z","external_id":{"pmid":["30922977"]},"type":"journal_article","publisher":"Elsevier ","pmid":1},{"status":"public","month":"07","language":[{"iso":"eng"}],"external_id":{"arxiv":["1902.08750"]},"date_published":"2019-07-01T00:00:00Z","type":"conference","publisher":"Formal Power Series and Algebraic Combinatorics","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804"},{"call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"}],"quality_controlled":"1","day":"01","publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","date_updated":"2021-01-12T08:17:18Z","ec_funded":1,"department":[{"_id":"LaEr"}],"arxiv":1,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Betea, Dan","last_name":"Betea","first_name":"Dan"},{"full_name":"Bouttier, Jérémie","last_name":"Bouttier","first_name":"Jérémie"},{"first_name":"Peter","last_name":"Nejjar","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter"},{"full_name":"Vuletíc, Mirjana","first_name":"Mirjana","last_name":"Vuletíc"}],"_id":"8175","date_created":"2020-07-26T22:01:04Z","conference":{"name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics","location":"Ljubljana, Slovenia","end_date":"2019-07-05","start_date":"2019-07-01"},"abstract":[{"lang":"eng","text":"We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices."}],"article_number":"34","year":"2019","citation":{"ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and Algebraic Combinatorics; 2019.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>, Ljubljana, Slovenia, 2019.","ista":"Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew Young diagrams via free boundaries. Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics, 34.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>, 34, Formal Power Series and Algebraic Combinatorics, 2019.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and Algebraic Combinatorics, 2019.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Formal Power Series and Algebraic Combinatorics, 2019.","apa":"Betea, D., Bouttier, J., Nejjar, P., &#38; Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics."},"article_processing_charge":"No","oa_version":"Preprint","title":"New edge asymptotics of skew Young diagrams via free boundaries","publication_status":"published","acknowledgement":"D.B. is especially grateful to Patrik Ferrari for suggesting simplifications in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models of Section 2.\r\n","main_file_link":[{"url":"https://arxiv.org/abs/1902.08750","open_access":"1"}],"scopus_import":"1"},{"language":[{"iso":"eng"}],"arxiv":1,"department":[{"_id":"UlWa"}],"month":"10","date_updated":"2023-09-07T13:12:17Z","status":"public","publication":"arXiv","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","first_name":"Sergey","last_name":"Avvakumov"},{"first_name":"Sergey","last_name":"Kudrya","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67","full_name":"Kudrya, Sergey"}],"publisher":"arXiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","external_id":{"arxiv":["1910.12628"]},"date_published":"2019-10-28T00:00:00Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"11446"},{"id":"8156","status":"public","relation":"dissertation_contains"}]},"oa":1,"citation":{"ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. <i>arXiv</i>.","ista":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv, 1910.12628.","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” <i>arXiv</i>. arXiv.","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>ArXiv</i>, 1910.12628, arXiv.","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>ArXiv</i>. arXiv, n.d.","apa":"Avvakumov, S., &#38; Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. <i>arXiv</i>. arXiv.","short":"S. Avvakumov, S. Kudrya, ArXiv (n.d.)."},"year":"2019","article_number":"1910.12628","abstract":[{"text":"Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in {\\mathbb R}\\}$.\r\n  Previously, the special cases of this statement for certain $X$ were usually proved using the equivartiant obstruction theory. Such calculations are difficult and may become infeasible past the first (primary) obstruction. We\r\ntake a different approach which allows us to prove the vanishing of all obstructions simultaneously. The essential step in the proof is classifying the possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$ of $(n-1)$-simplex to itself.  Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result  applying it to one such question, a specific instance of envy-free division problem.","lang":"eng"}],"project":[{"grant_number":"P31312","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-07-30T10:45:08Z","_id":"8182","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.12628"}],"day":"28","title":"Vanishing of all equivariant obstructions and the mapping degree","publication_status":"submitted","article_processing_charge":"No","oa_version":"Preprint"},{"isi":1,"department":[{"_id":"UlWa"}],"month":"08","date_updated":"2023-09-08T11:20:02Z","publication":"arXiv","status":"public","language":[{"iso":"eng"}],"arxiv":1,"type":"preprint","date_published":"2019-08-23T00:00:00Z","external_id":{"isi":["000986519600004"],"arxiv":["1908.08731"]},"related_material":{"record":[{"id":"8156","status":"public","relation":"dissertation_contains"}]},"oa":1,"author":[{"last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Karasev","first_name":"R.","full_name":"Karasev, R."},{"full_name":"Skopenkov, A.","first_name":"A.","last_name":"Skopenkov"}],"publisher":"arXiv","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2020-07-30T10:45:34Z","project":[{"call_identifier":"FWF","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"_id":"8184","citation":{"ista":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731.","ieee":"S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” <i>arXiv</i>. arXiv.","ama":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. <i>arXiv</i>.","chicago":"Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” <i>ArXiv</i>. arXiv, n.d.","short":"S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).","apa":"Avvakumov, S., Karasev, R., &#38; Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. <i>arXiv</i>. arXiv.","mla":"Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” <i>ArXiv</i>, 1908.08731, arXiv."},"article_number":"1908.08731","year":"2019","abstract":[{"text":"Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample to the topological Tverberg conjecture asserts that if r is not a prime power and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional counterexamples by taking k-fold join power of lower-dimensional ones. We improve this further (for d large compared to r): If r is not a prime power and N := (d+ 1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the r-fold van Kampen–Flores conjecture we also produce counterexamples which are stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the Ozaydin theorem on existence of equivariant maps. ","lang":"eng"}],"publication_status":"submitted","title":"Stronger counterexamples to the topological Tverberg conjecture","article_processing_charge":"No","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.08731"}],"acknowledgement":"We would like to thank F. Frick for helpful discussions","day":"23"},{"project":[{"grant_number":"P31312","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory"}],"date_created":"2020-07-30T10:45:51Z","_id":"8185","abstract":[{"text":"In this paper we study envy-free division problems. The classical approach to some of such problems, used by David Gale, reduces to considering continuous maps of a simplex to itself and finding sufficient conditions when this map hits the center of the simplex. The mere continuity is not sufficient for such a conclusion, the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and the Gale theorem) is a certain boundary condition.\r\n  We follow Erel Segal-Halevi, Fr\\'ed\\'eric Meunier, and Shira Zerbib, and replace the boundary condition by another assumption, which has the economic meaning of possibility for a player to prefer an empty part in the segment\r\npartition problem. We solve the problem positively when $n$, the number of players that divide the segment, is a prime power, and we provide counterexamples for every $n$ which is not a prime power. We also provide counterexamples relevant to a wider class of fair or envy-free partition problems when $n$ is odd and not a prime power.","lang":"eng"}],"citation":{"ama":"Avvakumov S, Karasev R. Envy-free division using mapping degree. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1907.11183\">10.48550/arXiv.1907.11183</a>","ista":"Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183.","ieee":"S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” <i>arXiv</i>. .","apa":"Avvakumov, S., &#38; Karasev, R. (n.d.). Envy-free division using mapping degree. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1907.11183\">https://doi.org/10.48550/arXiv.1907.11183</a>","short":"S. Avvakumov, R. Karasev, ArXiv (n.d.).","chicago":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1907.11183\">https://doi.org/10.48550/arXiv.1907.11183</a>.","mla":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” <i>ArXiv</i>, 1907.11183, doi:<a href=\"https://doi.org/10.48550/arXiv.1907.11183\">10.48550/arXiv.1907.11183</a>."},"year":"2019","article_number":"1907.11183","article_processing_charge":"No","oa_version":"Preprint","publication_status":"submitted","title":"Envy-free division using mapping degree","day":"25","doi":"10.48550/arXiv.1907.11183","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1907.11183"}],"date_updated":"2023-09-07T13:12:17Z","publication":"arXiv","status":"public","department":[{"_id":"UlWa"}],"month":"07","language":[{"iso":"eng"}],"arxiv":1,"oa":1,"related_material":{"link":[{"relation":"later_version","url":"https://doi.org/10.1112/mtk.12059"}],"record":[{"id":"8156","relation":"dissertation_contains","status":"public"}]},"type":"preprint","external_id":{"arxiv":["1907.11183"]},"date_published":"2019-07-25T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}]},{"publication_status":"published","title":"Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity","oa_version":"Preprint","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1408.1587","open_access":"1"}],"doi":"10.1016/j.jde.2018.07.045","scopus_import":"1","_id":"151","date_created":"2018-12-11T11:44:54Z","year":"2019","citation":{"ama":"Fischer JL, Kneuss O. Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity. <i>Journal of Differential Equations</i>. 2019;266(1):257-311. doi:<a href=\"https://doi.org/10.1016/j.jde.2018.07.045\">10.1016/j.jde.2018.07.045</a>","ieee":"J. L. Fischer and O. Kneuss, “Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity,” <i>Journal of Differential Equations</i>, vol. 266, no. 1. Elsevier, pp. 257–311, 2019.","ista":"Fischer JL, Kneuss O. 2019. Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity. Journal of Differential Equations. 266(1), 257–311.","apa":"Fischer, J. L., &#38; Kneuss, O. (2019). Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity. <i>Journal of Differential Equations</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jde.2018.07.045\">https://doi.org/10.1016/j.jde.2018.07.045</a>","chicago":"Fischer, Julian L, and Olivier Kneuss. “Bi-Sobolev Solutions to the Prescribed Jacobian Inequality in the Plane with L p Data and Applications to Nonlinear Elasticity.” <i>Journal of Differential Equations</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.jde.2018.07.045\">https://doi.org/10.1016/j.jde.2018.07.045</a>.","short":"J.L. Fischer, O. Kneuss, Journal of Differential Equations 266 (2019) 257–311.","mla":"Fischer, Julian L., and Olivier Kneuss. “Bi-Sobolev Solutions to the Prescribed Jacobian Inequality in the Plane with L p Data and Applications to Nonlinear Elasticity.” <i>Journal of Differential Equations</i>, vol. 266, no. 1, Elsevier, 2019, pp. 257–311, doi:<a href=\"https://doi.org/10.1016/j.jde.2018.07.045\">10.1016/j.jde.2018.07.045</a>."},"abstract":[{"lang":"eng","text":"We construct planar bi-Sobolev mappings whose local volume distortion is bounded from below by a given function f∈Lp with p&gt;1. More precisely, for any 1&lt;q&lt;(p+1)/2 we construct W1,q-bi-Sobolev maps with identity boundary conditions; for f∈L∞, we provide bi-Lipschitz maps. The basic building block of our construction are bi-Lipschitz maps which stretch a given compact subset of the unit square by a given factor while preserving the boundary. The construction of these stretching maps relies on a slight strengthening of the celebrated covering result of Alberti, Csörnyei, and Preiss for measurable planar sets in the case of compact sets. We apply our result to a model functional in nonlinear elasticity, the integrand of which features fast blowup as the Jacobian determinant of the deformation becomes small. For such functionals, the derivation of the equilibrium equations for minimizers requires an additional regularization of test functions, which our maps provide."}],"oa":1,"volume":266,"author":[{"first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L"},{"first_name":"Olivier","last_name":"Kneuss","full_name":"Kneuss, Olivier"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"JuFi"}],"publication":"Journal of Differential Equations","date_updated":"2023-09-08T13:25:35Z","arxiv":1,"intvolume":"       266","quality_controlled":"1","page":"257 - 311","day":"05","issue":"1","date_published":"2019-01-05T00:00:00Z","external_id":{"isi":["000449108500010"],"arxiv":["1408.1587"]},"type":"journal_article","publisher":"Elsevier","month":"01","isi":1,"status":"public","publist_id":"7770","language":[{"iso":"eng"}]},{"oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:12Z","publication_status":"published","title":"Counting rational points on quartic del Pezzo surfaces with a rational conic","doi":"10.1007/s00208-018-1716-6","file":[{"access_level":"open_access","file_name":"2019_MathAnnalen_Browning.pdf","relation":"main_file","date_created":"2019-05-23T07:53:27Z","date_updated":"2020-07-14T12:45:12Z","file_size":712847,"creator":"dernst","file_id":"6479","content_type":"application/pdf","checksum":"4061dc2fe99bee25d9adf2d2018cf608"}],"date_created":"2018-12-11T11:44:59Z","_id":"170","abstract":[{"text":"Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over   ℚ  that contains a conic defined over   ℚ .","lang":"eng"}],"citation":{"ieee":"T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” <i>Mathematische Annalen</i>, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019.","ista":"Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016.","ama":"Browning TD, Sofos E. Counting rational points on quartic del Pezzo surfaces with a rational conic. <i>Mathematische Annalen</i>. 2019;373(3-4):977-1016. doi:<a href=\"https://doi.org/10.1007/s00208-018-1716-6\">10.1007/s00208-018-1716-6</a>","mla":"Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” <i>Mathematische Annalen</i>, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:<a href=\"https://doi.org/10.1007/s00208-018-1716-6\">10.1007/s00208-018-1716-6</a>.","apa":"Browning, T. D., &#38; Sofos, E. (2019). Counting rational points on quartic del Pezzo surfaces with a rational conic. <i>Mathematische Annalen</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00208-018-1716-6\">https://doi.org/10.1007/s00208-018-1716-6</a>","chicago":"Browning, Timothy D, and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” <i>Mathematische Annalen</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s00208-018-1716-6\">https://doi.org/10.1007/s00208-018-1716-6</a>.","short":"T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016."},"year":"2019","volume":373,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"},{"full_name":"Sofos, Efthymios","last_name":"Sofos","first_name":"Efthymios"}],"date_updated":"2021-01-12T06:52:37Z","publication":"Mathematische Annalen","intvolume":"       373","arxiv":1,"quality_controlled":"1","day":"01","page":"977-1016","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","issue":"3-4","type":"journal_article","date_published":"2019-04-01T00:00:00Z","external_id":{"arxiv":["1609.09057"]},"publisher":"Springer Nature","status":"public","month":"04","extern":"1","ddc":["510"],"language":[{"iso":"eng"}]},{"issue":"8","page":"5757-5785","day":"15","quality_controlled":"1","language":[{"iso":"eng"}],"month":"04","isi":1,"status":"public","publist_id":"7746","publisher":"American Mathematical Society","date_published":"2019-04-15T00:00:00Z","external_id":{"isi":["000464034200019"],"arxiv":["1705.01999"]},"type":"journal_article","year":"2019","citation":{"short":"T.D. Browning, D. Loughran, Transactions of the American Mathematical Society 371 (2019) 5757–5785.","apa":"Browning, T. D., &#38; Loughran, D. (2019). Sieving rational points on varieties. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/tran/7514\">https://doi.org/10.1090/tran/7514</a>","chicago":"Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2019. <a href=\"https://doi.org/10.1090/tran/7514\">https://doi.org/10.1090/tran/7514</a>.","mla":"Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.” <i>Transactions of the American Mathematical Society</i>, vol. 371, no. 8, American Mathematical Society, 2019, pp. 5757–85, doi:<a href=\"https://doi.org/10.1090/tran/7514\">10.1090/tran/7514</a>.","ama":"Browning TD, Loughran D. Sieving rational points on varieties. <i>Transactions of the American Mathematical Society</i>. 2019;371(8):5757-5785. doi:<a href=\"https://doi.org/10.1090/tran/7514\">10.1090/tran/7514</a>","ieee":"T. D. Browning and D. Loughran, “Sieving rational points on varieties,” <i>Transactions of the American Mathematical Society</i>, vol. 371, no. 8. American Mathematical Society, pp. 5757–5785, 2019.","ista":"Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions of the American Mathematical Society. 371(8), 5757–5785."},"abstract":[{"lang":"eng","text":"An upper bound sieve for rational points on suitable varieties isdeveloped, together with applications tocounting rational points in thin sets,to local solubility in families, and to the notion of “friable” rational pointswith respect to divisors. In the special case of quadrics, sharper estimates areobtained by developing a version of the Selberg sieve for rational points."}],"_id":"175","date_created":"2018-12-11T11:45:01Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.01999"}],"doi":"10.1090/tran/7514","scopus_import":"1","publication_identifier":{"issn":["00029947"],"eissn":["10886850"]},"publication_status":"published","title":"Sieving rational points on varieties","oa_version":"Preprint","article_processing_charge":"No","arxiv":1,"intvolume":"       371","department":[{"_id":"TiBr"}],"publication":"Transactions of the American Mathematical Society","date_updated":"2023-08-24T14:34:56Z","author":[{"last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"full_name":"Loughran, Daniel","last_name":"Loughran","first_name":"Daniel"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"volume":371},{"pmid":1,"publisher":"National Academy of Sciences","type":"journal_article","date_published":"2019-02-19T00:00:00Z","external_id":{"pmid":[" 30728300"],"arxiv":["1806.10823"],"isi":["000459074400013"]},"language":[{"iso":"eng"}],"status":"public","isi":1,"month":"02","day":"19","page":"2821-2830","quality_controlled":"1","issue":"8","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Lang, Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","last_name":"Lang","first_name":"Moritz"},{"full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87","last_name":"Shkolnikov","first_name":"Mikhail"}],"volume":116,"oa":1,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/famous-sandpile-model-shown-to-move-like-a-traveling-sand-dune/","description":"News on IST Webpage","relation":"press_release"}]},"intvolume":"       116","arxiv":1,"date_updated":"2023-09-11T14:09:34Z","publication":"Proceedings of the National Academy of Sciences","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"TaHa"}],"acknowledgement":"M.L. is grateful to the members of the C Guet and G Tkacik groups for valuable comments and support. M.S. is grateful to Nikita Kalinin for inspiring communications.\r\n","publication_identifier":{"eissn":["1091-6490"]},"article_type":"original","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1812015116","open_access":"1"}],"doi":"10.1073/pnas.1812015116","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"Harmonic dynamics of the Abelian sandpile","abstract":[{"lang":"eng","text":"The abelian sandpile serves as a model to study self-organized criticality, a phenomenon occurring in biological, physical and social processes. The identity of the abelian group is a fractal composed of self-similar patches, and its limit is subject of extensive collaborative research. Here, we analyze the evolution of the sandpile identity under harmonic fields of different orders. We show that this evolution corresponds to periodic cycles through the abelian group characterized by the smooth transformation and apparent conservation of the patches constituting the identity. The dynamics induced by second and third order harmonics resemble smooth stretchings, respectively translations, of the identity, while the ones induced by fourth order harmonics resemble magnifications and rotations. Starting with order three, the dynamics pass through extended regions of seemingly random configurations which spontaneously reassemble into accentuated patterns. We show that the space of harmonic functions projects to the extended analogue of the sandpile group, thus providing a set of universal coordinates identifying configurations between different domains. Since the original sandpile group is a subgroup of the extended one, this directly implies that it admits a natural renormalization. Furthermore, we show that the harmonic fields can be induced by simple Markov processes, and that the corresponding stochastic dynamics show remarkable robustness over hundreds of periods. Finally, we encode information into seemingly random configurations, and decode this information with an algorithm requiring minimal prior knowledge. Our results suggest that harmonic fields might split the sandpile group into sub-sets showing different critical coefficients, and that it might be possible to extend the fractal structure of the identity beyond the boundaries of its domain. "}],"citation":{"ieee":"M. Lang and M. Shkolnikov, “Harmonic dynamics of the Abelian sandpile,” <i>Proceedings of the National Academy of Sciences</i>, vol. 116, no. 8. National Academy of Sciences, pp. 2821–2830, 2019.","ista":"Lang M, Shkolnikov M. 2019. Harmonic dynamics of the Abelian sandpile. Proceedings of the National Academy of Sciences. 116(8), 2821–2830.","ama":"Lang M, Shkolnikov M. Harmonic dynamics of the Abelian sandpile. <i>Proceedings of the National Academy of Sciences</i>. 2019;116(8):2821-2830. doi:<a href=\"https://doi.org/10.1073/pnas.1812015116\">10.1073/pnas.1812015116</a>","chicago":"Lang, Moritz, and Mikhail Shkolnikov. “Harmonic Dynamics of the Abelian Sandpile.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2019. <a href=\"https://doi.org/10.1073/pnas.1812015116\">https://doi.org/10.1073/pnas.1812015116</a>.","short":"M. Lang, M. Shkolnikov, Proceedings of the National Academy of Sciences 116 (2019) 2821–2830.","apa":"Lang, M., &#38; Shkolnikov, M. (2019). Harmonic dynamics of the Abelian sandpile. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1812015116\">https://doi.org/10.1073/pnas.1812015116</a>","mla":"Lang, Moritz, and Mikhail Shkolnikov. “Harmonic Dynamics of the Abelian Sandpile.” <i>Proceedings of the National Academy of Sciences</i>, vol. 116, no. 8, National Academy of Sciences, 2019, pp. 2821–30, doi:<a href=\"https://doi.org/10.1073/pnas.1812015116\">10.1073/pnas.1812015116</a>."},"year":"2019","date_created":"2018-12-11T11:45:08Z","_id":"196"},{"intvolume":"        32","publication":"Advanced Materials","date_updated":"2023-08-07T10:23:41Z","author":[{"first_name":"Tong","last_name":"Bian","full_name":"Bian, Tong"},{"first_name":"Zonglin","last_name":"Chu","full_name":"Chu, Zonglin"},{"first_name":"Rafal","last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":32,"article_number":"1905866","year":"2019","citation":{"short":"T. Bian, Z. Chu, R. Klajn, Advanced Materials 32 (2019).","chicago":"Bian, Tong, Zonglin Chu, and Rafal Klajn. “The Many Ways to Assemble Nanoparticles Using Light.” <i>Advanced Materials</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/adma.201905866\">https://doi.org/10.1002/adma.201905866</a>.","apa":"Bian, T., Chu, Z., &#38; Klajn, R. (2019). The many ways to assemble nanoparticles using light. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201905866\">https://doi.org/10.1002/adma.201905866</a>","mla":"Bian, Tong, et al. “The Many Ways to Assemble Nanoparticles Using Light.” <i>Advanced Materials</i>, vol. 32, no. 20, 1905866, Wiley, 2019, doi:<a href=\"https://doi.org/10.1002/adma.201905866\">10.1002/adma.201905866</a>.","ista":"Bian T, Chu Z, Klajn R. 2019. The many ways to assemble nanoparticles using light. Advanced Materials. 32(20), 1905866.","ieee":"T. Bian, Z. Chu, and R. Klajn, “The many ways to assemble nanoparticles using light,” <i>Advanced Materials</i>, vol. 32, no. 20. Wiley, 2019.","ama":"Bian T, Chu Z, Klajn R. The many ways to assemble nanoparticles using light. <i>Advanced Materials</i>. 2019;32(20). doi:<a href=\"https://doi.org/10.1002/adma.201905866\">10.1002/adma.201905866</a>"},"abstract":[{"text":"The ability to reversibly assemble nanoparticles using light is both fundamentally interesting and important for applications ranging from reversible data storage to controlled drug delivery. Here, the diverse approaches that have so far been developed to control the self-assembly of nanoparticles using light are reviewed and compared. These approaches include functionalizing nanoparticles with monolayers of photoresponsive molecules, placing them in photoresponsive media capable of reversibly protonating the particles under light, and decorating plasmonic nanoparticles with thermoresponsive polymers, to name just a few. The applicability of these methods to larger, micrometer-sized particles is also discussed. Finally, several perspectives on further developments in the field are offered.","lang":"eng"}],"_id":"13366","date_created":"2023-08-01T09:37:26Z","doi":"10.1002/adma.201905866","scopus_import":"1","article_type":"original","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"publication_status":"published","title":"The many ways to assemble nanoparticles using light","article_processing_charge":"No","oa_version":"None","language":[{"iso":"eng"}],"keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"extern":"1","month":"11","status":"public","publisher":"Wiley","pmid":1,"external_id":{"pmid":["31709655"]},"date_published":"2019-11-19T00:00:00Z","type":"journal_article","issue":"20","day":"19","quality_controlled":"1"}]