[{"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_identifier":{"eissn":["2475-1421"]},"license":"https://creativecommons.org/licenses/by/4.0/","OA_place":"publisher","intvolume":" 3","date_published":"2019-10-10T00:00:00Z","article_number":"124","arxiv":1,"type":"conference","year":"2019","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications","corr_author":"1","title":"Value-centric dynamic partial order reduction","file":[{"date_created":"2021-11-12T11:41:56Z","date_updated":"2021-11-12T11:41:56Z","content_type":"application/pdf","relation":"main_file","file_size":570829,"file_name":"2019_ACM_Chatterjee.pdf","checksum":"2149979c46964c4d117af06ccb6c0834","creator":"cchlebak","file_id":"10278","access_level":"open_access","success":1}],"language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10199"}]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2021-10-27T14:57:06Z","status":"public","volume":3,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.","ama":"Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550","ista":"Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.","short":"K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.","apa":"Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360550","ieee":"K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file_date_updated":"2021-11-12T11:41:56Z","keyword":["safety","risk","reliability and quality","software"],"oa_version":"Published Version","month":"10","has_accepted_license":"1","date_updated":"2026-04-08T07:00:31Z","acknowledgement":"The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n","OA_type":"hybrid","ddc":["000"],"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"}],"conference":{"end_date":"2019-10-25","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","location":"Athens, Greece","start_date":"2019-10-23"},"day":"10","_id":"10190","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","first_name":"Viktor"}],"external_id":{"arxiv":["1909.00989"]},"publisher":"ACM","publication_status":"published","doi":"10.1145/3360550","abstract":[{"text":"The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.","lang":"eng"}],"article_processing_charge":"No"},{"day":"01","_id":"105","author":[{"last_name":"Marsh","full_name":"Marsh, Ashley","first_name":"Ashley"},{"full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino"},{"last_name":"Lockhart","first_name":"Paul","full_name":"Lockhart, Paul"},{"last_name":"Leventer","full_name":"Leventer, Richard","first_name":"Richard"}],"publication_status":"published","external_id":{"pmid":["30089829"],"isi":["000454111500019"]},"publisher":"Springer Nature","doi":"10.1038/s41431-018-0231-2","article_processing_charge":"No","abstract":[{"text":"Clinical Utility Gene Card. 1. Name of Disease (Synonyms): Pontocerebellar hypoplasia type 9 (PCH9) and spastic paraplegia-63 (SPG63). 2. OMIM# of the Disease: 615809 and 615686. 3. Name of the Analysed Genes or DNA/Chromosome Segments: AMPD2 at 1p13.3. 4. OMIM# of the Gene(s): 102771.","lang":"eng"}],"ddc":["570"],"month":"01","date_updated":"2026-06-18T08:42:55Z","acknowledgement":"This work was supported by EuroGentest2 (Unit 2: “Genetic testing as part of health care”), a Coordination Action under FP7 (Grant Agreement Number 261469) and the European Society of Human Genetics. We acknowledge the participation of the patients and their families in these studies, as well as the generous financial support of the Lefroy and Handbury families. APLM was supported by an Australian Postgraduate Award. PJL is supported by an NHMRC Career Development Fellowship (GNT1032364). RJL is supported by a Melbourne Children’s Clinician Scientist Fellowship.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41431-018-0231-2"}],"oa":1,"article_type":"original","oa_version":"Published Version","quality_controlled":"1","scopus_import":"1","date_created":"2018-12-11T11:44:39Z","status":"public","volume":27,"citation":{"ieee":"A. Marsh, G. Novarino, P. Lockhart, and R. Leventer, “CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63,” European Journal of Human Genetics, vol. 27. Springer Nature, pp. 161–166, 2019.","apa":"Marsh, A., Novarino, G., Lockhart, P., & Leventer, R. (2019). CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. Springer Nature. https://doi.org/10.1038/s41431-018-0231-2","chicago":"Marsh, Ashley, Gaia Novarino, Paul Lockhart, and Richard Leventer. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” European Journal of Human Genetics. Springer Nature, 2019. https://doi.org/10.1038/s41431-018-0231-2.","short":"A. Marsh, G. Novarino, P. Lockhart, R. Leventer, European Journal of Human Genetics 27 (2019) 161–166.","ista":"Marsh A, Novarino G, Lockhart P, Leventer R. 2019. CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. 27, 161–166.","ama":"Marsh A, Novarino G, Lockhart P, Leventer R. CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. 2019;27:161-166. doi:10.1038/s41431-018-0231-2","mla":"Marsh, Ashley, et al. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” European Journal of Human Genetics, vol. 27, Springer Nature, 2019, pp. 161–66, doi:10.1038/s41431-018-0231-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"type":"journal_article","year":"2019","publication":"European Journal of Human Genetics","title":"CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63","language":[{"iso":"eng"}],"intvolume":" 27","publist_id":"7949","date_published":"2019-01-01T00:00:00Z","page":"161-166","isi":1,"department":[{"_id":"GaNo"}]},{"isi":1,"department":[{"_id":"JaMa"}],"publication_identifier":{"issn":["0178-8051"],"eissn":["1432-2064"]},"date_published":"2019-04-01T00:00:00Z","page":"697–758","intvolume":" 173","publist_id":"7546","corr_author":"1","publication":"Probability Theory and Related Fields","title":"Singular SPDEs in domains with boundaries","file":[{"date_created":"2018-12-17T16:25:24Z","date_updated":"2020-07-14T12:46:03Z","content_type":"application/pdf","file_size":893182,"relation":"main_file","file_name":"2018_ProbTheory_Gerencser.pdf","checksum":"288d16ef7291242f485a9660979486e3","creator":"dernst","file_id":"5722","access_level":"open_access"}],"language":[{"iso":"eng"}],"issue":"3-4","type":"journal_article","year":"2019","status":"public","volume":173,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"ista":"Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 173(3–4), 697–758.","short":"M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019) 697–758.","mla":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields, vol. 173, no. 3–4, Springer, 2019, pp. 697–758, doi:10.1007/s00440-018-0841-1.","ama":"Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 2019;173(3-4):697–758. doi:10.1007/s00440-018-0841-1","apa":"Gerencser, M., & Hairer, M. (2019). Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0841-1","ieee":"M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” Probability Theory and Related Fields, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.","chicago":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0841-1."},"quality_controlled":"1","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2018-12-11T11:45:48Z","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:03Z","oa":1,"article_type":"original","acknowledgement":"MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n","month":"04","has_accepted_license":"1","date_updated":"2026-04-03T09:45:34Z","ddc":["510"],"doi":"10.1007/s00440-018-0841-1","article_processing_charge":"Yes (via OA deal)","abstract":[{"lang":"eng","text":"We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition."}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"day":"01","author":[{"full_name":"Gerencser, Mate","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser"},{"last_name":"Hairer","first_name":"Martin","full_name":"Hairer, Martin"}],"_id":"319","external_id":{"isi":["000463613800001"]},"publisher":"Springer","publication_status":"published"},{"doi":"10.1016/j.laa.2018.03.002","abstract":[{"text":"We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which has been introduced by Chen and Tropp quite recently.","lang":"eng"}],"article_processing_charge":"No","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"day":"01","_id":"405","external_id":{"isi":["000470955300005"],"arxiv":["1712.05324"]},"publisher":"Elsevier","author":[{"orcid":"0000-0003-1109-5511","full_name":"Virosztek, Daniel","first_name":"Daniel","last_name":"Virosztek","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","ec_funded":1,"acknowledgement":"The author was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office – NKFIH (grant no. K124152)","main_file_link":[{"url":"https://arxiv.org/abs/1712.05324","open_access":"1"}],"month":"09","date_updated":"2025-04-15T06:50:00Z","oa_version":"Preprint","article_type":"original","oa":1,"status":"public","volume":576,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra and Its Applications, vol. 576, Elsevier, 2019, pp. 67–78, doi:10.1016/j.laa.2018.03.002.","ama":"Virosztek D. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 2019;576:67-78. doi:10.1016/j.laa.2018.03.002","ista":"Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 576, 67–78.","short":"D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78.","chicago":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra and Its Applications. Elsevier, 2019. https://doi.org/10.1016/j.laa.2018.03.002.","apa":"Virosztek, D. (2019). Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. Elsevier. https://doi.org/10.1016/j.laa.2018.03.002","ieee":"D. Virosztek, “Jointly convex quantum Jensen divergences,” Linear Algebra and Its Applications, vol. 576. Elsevier, pp. 67–78, 2019."},"quality_controlled":"1","scopus_import":"1","date_created":"2018-12-11T11:46:17Z","publication":"Linear Algebra and Its Applications","corr_author":"1","title":"Jointly convex quantum Jensen divergences","language":[{"iso":"eng"}],"year":"2019","type":"journal_article","date_published":"2019-09-01T00:00:00Z","arxiv":1,"page":"67-78","intvolume":" 576","publist_id":"7424","isi":1,"department":[{"_id":"LaEr"}]},{"has_accepted_license":"1","date_updated":"2026-04-03T09:46:51Z","month":"02","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).\r\n","article_type":"original","oa":1,"file_date_updated":"2020-07-14T12:46:26Z","oa_version":"Published Version","_id":"429","external_id":{"isi":["000459396500007"]},"author":[{"first_name":"Oskari H","full_name":"Ajanki, Oskari H","last_name":"Ajanki","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","first_name":"Torben H","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297"}],"publication_status":"published","publisher":"Springer","project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"day":"01","doi":"10.1007/s00440-018-0835-z","abstract":[{"text":"We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay but are otherwise of general form. The key novelty is the detailed stability analysis of the corresponding matrix valued Dyson equation whose solution is the deterministic limit of the resolvent.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","ddc":["510"],"ec_funded":1,"publist_id":"7394","intvolume":" 173","page":"293–373","date_published":"2019-02-01T00:00:00Z","isi":1,"department":[{"_id":"LaEr"}],"publication_identifier":{"eissn":["1432-2064"],"issn":["0178-8051"]},"date_created":"2018-12-11T11:46:25Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","scopus_import":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"mla":"Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory and Related Fields, vol. 173, no. 1–2, Springer, 2019, pp. 293–373, doi:10.1007/s00440-018-0835-z.","ama":"Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 2019;173(1-2):293–373. doi:10.1007/s00440-018-0835-z","ista":"Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 173(1–2), 293–373.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 173 (2019) 293–373.","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0835-z.","apa":"Ajanki, O. H., Erdös, L., & Krüger, T. H. (2019). Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0835-z","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation and random matrices with correlations,” Probability Theory and Related Fields, vol. 173, no. 1–2. Springer, pp. 293–373, 2019."},"status":"public","volume":173,"issue":"1-2","year":"2019","type":"journal_article","file":[{"creator":"dernst","access_level":"open_access","file_id":"5720","content_type":"application/pdf","date_created":"2018-12-17T16:12:08Z","date_updated":"2020-07-14T12:46:26Z","file_name":"2018_ProbTheory_Ajanki.pdf","checksum":"f9354fa5c71f9edd17132588f0dc7d01","relation":"main_file","file_size":1201840}],"language":[{"iso":"eng"}],"corr_author":"1","publication":"Probability Theory and Related Fields","title":"Stability of the matrix Dyson equation and random matrices with correlations"},{"isi":1,"department":[{"_id":"TiBr"}],"publication_identifier":{"eissn":["1088-6850"],"issn":["0002-9947"]},"date_published":"2019-04-15T00:00:00Z","page":"5757-5785","arxiv":1,"intvolume":" 371","publist_id":"7746","publication":"Transactions of the American Mathematical Society","title":"Sieving rational points on varieties","language":[{"iso":"eng"}],"year":"2019","issue":"8","type":"journal_article","status":"public","volume":371,"citation":{"ista":"Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions of the American Mathematical Society. 371(8), 5757–5785.","short":"T.D. Browning, D. Loughran, Transactions of the American Mathematical Society 371 (2019) 5757–5785.","ama":"Browning TD, Loughran D. Sieving rational points on varieties. Transactions of the American Mathematical Society. 2019;371(8):5757-5785. doi:10.1090/tran/7514","mla":"Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.” Transactions of the American Mathematical Society, vol. 371, no. 8, American Mathematical Society, 2019, pp. 5757–85, doi:10.1090/tran/7514.","ieee":"T. D. Browning and D. Loughran, “Sieving rational points on varieties,” Transactions of the American Mathematical Society, vol. 371, no. 8. American Mathematical Society, pp. 5757–5785, 2019.","apa":"Browning, T. D., & Loughran, D. (2019). Sieving rational points on varieties. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7514","chicago":"Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.” Transactions of the American Mathematical Society. American Mathematical Society, 2019. https://doi.org/10.1090/tran/7514."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","scopus_import":"1","date_created":"2018-12-11T11:45:01Z","oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.01999"}],"month":"04","date_updated":"2025-07-10T11:51:20Z","doi":"10.1090/tran/7514","abstract":[{"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.","lang":"eng"}],"article_processing_charge":"No","day":"15","publisher":"American Mathematical Society","_id":"175","external_id":{"arxiv":["1705.01999"],"isi":["000464034200019"]},"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D"},{"first_name":"Daniel","full_name":"Loughran, Daniel","last_name":"Loughran"}],"publication_status":"published"},{"intvolume":" 61","page":"41-61","date_published":"2019-05-25T00:00:00Z","department":[{"_id":"ToHe"}],"publication_identifier":{"eissn":["2398-7340"]},"date_created":"2020-03-08T23:00:49Z","quality_controlled":"1","scopus_import":"1","citation":{"mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 41–61, doi:10.29007/m75b.","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 61. EasyChair; 2019:41-61. doi:10.29007/m75b","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2019, pp. 41–61.","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair, 2019. https://doi.org/10.29007/m75b.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair. https://doi.org/10.29007/m75b","ieee":"F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 41–61."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","volume":61,"type":"conference","year":"2019","file":[{"file_size":1934830,"relation":"main_file","checksum":"9138977a06fcd6a95976eb4bca875f0c","file_name":"2019_ARCH19_Immler.pdf","date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-24T07:36:36Z","content_type":"application/pdf","file_id":"7617","access_level":"open_access","creator":"dernst"}],"language":[{"iso":"eng"}],"publication":"EPiC Series in Computing","corr_author":"1","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","has_accepted_license":"1","date_updated":"2026-04-03T09:51:13Z","month":"05","oa":1,"oa_version":"Published Version","file_date_updated":"2020-07-14T12:48:00Z","publication_status":"published","_id":"7576","publisher":"EasyChair","author":[{"last_name":"Immler","first_name":"Fabian","full_name":"Immler, Fabian"},{"last_name":"Althoff","full_name":"Althoff, Matthias","first_name":"Matthias"},{"full_name":"Benet, Luis","first_name":"Luis","last_name":"Benet"},{"full_name":"Chapoutot, Alexandre","first_name":"Alexandre","last_name":"Chapoutot"},{"last_name":"Chen","full_name":"Chen, Xin","first_name":"Xin"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"last_name":"Geretti","first_name":"Luca","full_name":"Geretti, Luca"},{"last_name":"Kochdumper","full_name":"Kochdumper, Niklas","first_name":"Niklas"},{"full_name":"Sanders, David P.","first_name":"David P.","last_name":"Sanders"},{"last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian"}],"day":"25","conference":{"end_date":"2019-04-15","location":"Montreal, Canada","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"doi":"10.29007/m75b","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"ddc":["000"]},{"ec_funded":1,"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"day":"01","conference":{"start_date":"2019-08-25","location":"Visby, Sweden","name":"Information Theory Workshop","end_date":"2019-08-28"},"external_id":{"isi":["000540384500015"],"arxiv":["1812.01475"]},"_id":"7606","publication_status":"published","author":[{"id":"4171253A-F248-11E8-B48F-1D18A9856A87","last_name":"Hledik","full_name":"Hledik, Michal","first_name":"Michal"},{"first_name":"Thomas R","full_name":"Sokolowski, Thomas R","orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski"},{"last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper"}],"publisher":"IEEE","doi":"10.1109/ITW44776.2019.8989292","abstract":[{"lang":"eng","text":"We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound."}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","month":"08","date_updated":"2026-04-07T12:59:24Z","main_file_link":[{"url":"https://arxiv.org/abs/1812.01475","open_access":"1"}],"year":"2019","type":"conference","publication":"IEEE Information Theory Workshop, ITW 2019","title":"A tight upper bound on mutual information","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","related_material":{"record":[{"status":"public","id":"15020","relation":"dissertation_contains"}]},"date_created":"2020-03-22T23:00:47Z","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: IEEE Information Theory Workshop, ITW 2019. IEEE; 2019. doi:10.1109/ITW44776.2019.8989292","mla":"Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” IEEE Information Theory Workshop, ITW 2019, 8989292, IEEE, 2019, doi:10.1109/ITW44776.2019.8989292.","ista":"Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information. IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.","short":"M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019.","chicago":"Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In IEEE Information Theory Workshop, ITW 2019. IEEE, 2019. https://doi.org/10.1109/ITW44776.2019.8989292.","ieee":"M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in IEEE Information Theory Workshop, ITW 2019, Visby, Sweden, 2019.","apa":"Hledik, M., Sokolowski, T. R., & Tkačik, G. (2019). A tight upper bound on mutual information. In IEEE Information Theory Workshop, ITW 2019. Visby, Sweden: IEEE. https://doi.org/10.1109/ITW44776.2019.8989292"},"isi":1,"department":[{"_id":"GaTk"}],"publication_identifier":{"isbn":["9781538669006"]},"date_published":"2019-08-01T00:00:00Z","article_number":"8989292","arxiv":1},{"language":[{"iso":"eng"}],"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","title":"Function norms for neural networks","year":"2019","type":"conference","citation":{"chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00097.","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., & Blaschko, M. B. (2019). Function norms for neural networks. In Proceedings of the 2019 International Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00097","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00097","mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” Proceedings of the 2019 International Conference on Computer Vision Workshop, 748–752, IEEE, 2019, doi:10.1109/ICCVW.2019.00097.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","doi":"10.1109/ICCVW.2019.00097","article_processing_charge":"No","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."}],"_id":"7639","external_id":{"isi":["000554591600090"]},"date_created":"2020-04-05T22:00:50Z","publisher":"IEEE","publication_status":"published","author":[{"full_name":"Rannen-Triki, Amal","first_name":"Amal","last_name":"Rannen-Triki"},{"last_name":"Berman","full_name":"Berman, Maxim","first_name":"Maxim"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"last_name":"Blaschko","full_name":"Blaschko, Matthew B.","first_name":"Matthew B."}],"quality_controlled":"1","scopus_import":"1","conference":{"end_date":"2019-10-28","start_date":"2019-10-27","location":"Seoul, South Korea","name":"ICCVW: International Conference on Computer Vision Workshop"},"day":"01","oa_version":"None","isi":1,"publication_identifier":{"isbn":["9781728150239"]},"department":[{"_id":"VlKo"}],"date_published":"2019-10-01T00:00:00Z","article_number":"748-752","date_updated":"2023-09-08T11:19:12Z","month":"10"},{"arxiv":1,"article_number":"1749-1753","date_published":"2019-10-01T00:00:00Z","isi":1,"department":[{"_id":"ChLa"}],"publication_identifier":{"isbn":["9781728150239"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00217","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” Proceedings of the 2019 International Conference on Computer Vision Workshop, 1749–1753, IEEE, 2019, doi:10.1109/ICCVW.2019.00217.","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., & Ferrari, V. (2019). Detecting visual relationships using box attention. In Proceedings of the 2019 International Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00217","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00217."},"status":"public","date_created":"2020-04-05T22:00:51Z","scopus_import":"1","quality_controlled":"1","language":[{"iso":"eng"}],"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","title":"Detecting visual relationships using box attention","year":"2019","type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1807.02136","open_access":"1"}],"date_updated":"2025-04-15T07:10:23Z","month":"10","oa_version":"Preprint","oa":1,"doi":"10.1109/ICCVW.2019.00217","abstract":[{"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.","lang":"eng"}],"article_processing_charge":"No","external_id":{"isi":["000554591601098"],"arxiv":["1807.02136"]},"_id":"7640","author":[{"full_name":"Kolesnikov, Alexander","first_name":"Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alina","full_name":"Kuznetsova, Alina","last_name":"Kuznetsova"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph"},{"last_name":"Ferrari","first_name":"Vittorio","full_name":"Ferrari, Vittorio"}],"publication_status":"published","publisher":"IEEE","project":[{"grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"day":"01","conference":{"end_date":"2019-10-28","name":"ICCVW: International Conference on Computer Vision Workshop","start_date":"2019-10-27","location":"Seoul, South Korea"},"ec_funded":1},{"oa":1,"department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"oa_version":"Preprint","date_updated":"2026-04-08T07:23:00Z","month":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.06981"}],"arxiv":1,"date_published":"2019-03-16T00:00:00Z","article_number":"1903.06981","year":"2019","type":"preprint","language":[{"iso":"eng"}],"publication":"arXiv","title":"Token swapping on trees","author":[{"full_name":"Biniaz, Ahmad","first_name":"Ahmad","last_name":"Biniaz"},{"first_name":"Kshitij","full_name":"Jain, Kshitij","last_name":"Jain"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tillmann","full_name":"Miltzow, Tillmann","last_name":"Miltzow"},{"first_name":"Debajyoti","full_name":"Mondal, Debajyoti","last_name":"Mondal"},{"first_name":"Anurag Murty","full_name":"Naredla, Anurag Murty","last_name":"Naredla"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"first_name":"Alexi","full_name":"Turcotte, Alexi","last_name":"Turcotte"}],"_id":"7950","publication_status":"draft","date_created":"2020-06-08T12:25:25Z","external_id":{"arxiv":["1903.06981"]},"related_material":{"record":[{"status":"public","id":"12833","relation":"later_version"},{"status":"public","id":"7944","relation":"dissertation_contains"}]},"day":"16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.).","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981, doi:10.48550/arXiv.1903.06981.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv. doi:10.48550/arXiv.1903.06981","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. arXiv. https://doi.org/10.48550/arXiv.1903.06981","ieee":"A. Biniaz et al., “Token swapping on trees,” arXiv. .","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.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1903.06981."},"status":"public","doi":"10.48550/arXiv.1903.06981","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}]},{"oa":1,"article_type":"original","file_date_updated":"2020-10-02T09:33:28Z","oa_version":"Published Version","month":"01","date_updated":"2025-04-15T06:52:10Z","has_accepted_license":"1","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.","ddc":["570"],"ec_funded":1,"day":"09","project":[{"name":"Investigating the role of transporters in invasive migration through junctions","_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077","call_identifier":"FP7"}],"publication_status":"published","_id":"8","external_id":{"isi":["000455189900006"],"pmid":["30504274"]},"author":[{"last_name":"Trébuchet","full_name":"Trébuchet, Guillaume","first_name":"Guillaume"},{"first_name":"Pierre B","full_name":"Cattenoz, Pierre B","last_name":"Cattenoz"},{"first_name":"János","full_name":"Zsámboki, János","last_name":"Zsámboki"},{"last_name":"Mazaud","first_name":"David","full_name":"Mazaud, David"},{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","first_name":"Daria E"},{"first_name":"Manolis","full_name":"Fanto, Manolis","last_name":"Fanto"},{"first_name":"Angela","full_name":"Giangrande, Angela","last_name":"Giangrande"}],"publisher":"Society for Neuroscience","abstract":[{"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.","lang":"eng"}],"article_processing_charge":"No","doi":"10.1523/JNEUROSCI.1059-18.2018","department":[{"_id":"DaSi"}],"isi":1,"intvolume":" 39","publist_id":"8048","date_published":"2019-01-09T00:00:00Z","page":"238-255","pmid":1,"issue":"2","type":"journal_article","year":"2019","title":"The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate","publication":"Journal of Neuroscience","language":[{"iso":"eng"}],"file":[{"file_size":9455414,"relation":"main_file","checksum":"8f6925eb4cd1e8747d8ea25929c68de6","file_name":"2019_JournNeuroscience_Trebuchet.pdf","date_updated":"2020-10-02T09:33:28Z","date_created":"2020-10-02T09:33:28Z","content_type":"application/pdf","file_id":"8596","access_level":"open_access","success":1,"creator":"dernst"}],"scopus_import":"1","quality_controlled":"1","date_created":"2018-12-11T11:44:07Z","volume":39,"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"G. Trébuchet et al., “The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate,” Journal of Neuroscience, vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019.","apa":"Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E., Fanto, M., & Giangrande, A. (2019). The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1059-18.2018","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.” Journal of Neuroscience. Society for Neuroscience, 2019. https://doi.org/10.1523/JNEUROSCI.1059-18.2018.","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.","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.","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. Journal of Neuroscience. 2019;39(2):238-255. doi:10.1523/JNEUROSCI.1059-18.2018","mla":"Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” Journal of Neuroscience, vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:10.1523/JNEUROSCI.1059-18.2018."}},{"doi":"10.1007/s00220-018-3239-0","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"}],"article_processing_charge":"Yes (via OA deal)","publication_status":"published","_id":"80","publisher":"Springer","author":[{"last_name":"Deuchert","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas","first_name":"Andreas"},{"first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"},{"full_name":"Yngvason, Jakob","first_name":"Jakob","last_name":"Yngvason"}],"external_id":{"isi":["000467796800007"]},"project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","grant_number":"P27533_N27"}],"day":"01","ec_funded":1,"ddc":["530"],"has_accepted_license":"1","date_updated":"2025-04-14T07:27:00Z","month":"06","oa_version":"Published Version","file_date_updated":"2020-07-14T12:48:07Z","article_type":"original","oa":1,"citation":{"chicago":"Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics. Springer, 2019. https://doi.org/10.1007/s00220-018-3239-0.","apa":"Deuchert, A., Seiringer, R., & Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-018-3239-0","ieee":"A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in a dilute, trapped gas at positive temperature,” Communications in Mathematical Physics, vol. 368, no. 2. Springer, pp. 723–776, 2019.","mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:10.1007/s00220-018-3239-0.","ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 2019;368(2):723-776. doi:10.1007/s00220-018-3239-0","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.","short":"A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 368 (2019) 723–776."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","volume":368,"date_created":"2018-12-11T11:44:31Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","scopus_import":"1","file":[{"content_type":"application/pdf","date_created":"2018-12-17T10:34:06Z","date_updated":"2020-07-14T12:48:07Z","file_name":"2018_CommunMathPhys_Deuchert.pdf","checksum":"c7e9880b43ac726712c1365e9f2f73a6","file_size":893902,"relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"5688"}],"language":[{"iso":"eng"}],"publication":"Communications in Mathematical Physics","title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","year":"2019","type":"journal_article","issue":"2","page":"723-776","date_published":"2019-06-01T00:00:00Z","publist_id":"7974","intvolume":" 368","isi":1,"department":[{"_id":"RoSe"}]},{"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.08750"}],"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","date_updated":"2021-01-12T08:17:18Z","month":"07","ec_funded":1,"article_processing_charge":"No","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."}],"publisher":"Formal Power Series and Algebraic Combinatorics","_id":"8175","external_id":{"arxiv":["1902.08750"]},"publication_status":"published","author":[{"last_name":"Betea","first_name":"Dan","full_name":"Betea, Dan"},{"first_name":"Jérémie","full_name":"Bouttier, Jérémie","last_name":"Bouttier"},{"first_name":"Peter","full_name":"Nejjar, Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","last_name":"Nejjar"},{"full_name":"Vuletíc, Mirjana","first_name":"Mirjana","last_name":"Vuletíc"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117"}],"conference":{"location":"Ljubljana, Slovenia","start_date":"2019-07-01","name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics","end_date":"2019-07-05"},"day":"01","department":[{"_id":"LaEr"}],"arxiv":1,"date_published":"2019-07-01T00:00:00Z","article_number":"34","language":[{"iso":"eng"}],"publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","title":"New edge asymptotics of skew Young diagrams via free boundaries","year":"2019","type":"conference","citation":{"ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana, Slovenia, 2019.","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics, 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.","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.","ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics; 2019.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, 34, Formal Power Series and Algebraic Combinatorics, 2019."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_created":"2020-07-26T22:01:04Z","quality_controlled":"1","scopus_import":"1"},{"day":"28","related_material":{"record":[{"relation":"later_version","status":"public","id":"11446"},{"status":"public","id":"8156","relation":"dissertation_contains"}]},"project":[{"name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31312"}],"author":[{"full_name":"Avvakumov, Sergey","orcid":"0000-0002-7840-5062","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov"},{"full_name":"Kudrya, Sergey","first_name":"Sergey","last_name":"Kudrya","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67"}],"_id":"8182","external_id":{"arxiv":["1910.12628"]},"publication_status":"draft","date_created":"2020-07-30T10:45:08Z","abstract":[{"lang":"eng","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."}],"article_processing_charge":"No","status":"public","doi":"10.48550/arXiv.1910.12628","citation":{"chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.12628.","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” arXiv. .","apa":"Avvakumov, S., & Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. arXiv. https://doi.org/10.48550/arXiv.1910.12628","ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv. doi:10.48550/arXiv.1910.12628","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, 1910.12628, doi:10.48550/arXiv.1910.12628.","short":"S. Avvakumov, S. Kudrya, ArXiv (n.d.).","ista":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv, 1910.12628."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","year":"2019","title":"Vanishing of all equivariant obstructions and the mapping degree","corr_author":"1","publication":"arXiv","language":[{"iso":"eng"}],"month":"10","date_updated":"2026-04-08T07:25:54Z","article_number":"1910.12628","date_published":"2019-10-28T00:00:00Z","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.12628"}],"oa":1,"department":[{"_id":"UlWa"}],"oa_version":"Preprint"},{"type":"preprint","year":"2019","language":[{"iso":"eng"}],"title":"Stronger counterexamples to the topological Tverberg conjecture","publication":"arXiv","_id":"8184","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey","orcid":"0000-0002-7840-5062"},{"full_name":"Karasev, R.","first_name":"R.","last_name":"Karasev"},{"last_name":"Skopenkov","first_name":"A.","full_name":"Skopenkov, A."}],"publication_status":"draft","date_created":"2020-07-30T10:45:34Z","external_id":{"arxiv":["1908.08731"],"isi":["000986519600004"]},"related_material":{"record":[{"id":"8156","status":"public","relation":"dissertation_contains"}]},"day":"23","project":[{"name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Avvakumov, S., Karasev, R., & Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. https://doi.org/10.48550/arXiv.1908.08731","ieee":"S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” arXiv. .","chicago":"Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1908.08731.","short":"S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).","ista":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731.","mla":"Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, doi:10.48550/arXiv.1908.08731.","ama":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv. doi:10.48550/arXiv.1908.08731"},"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"}],"article_processing_charge":"No","doi":"10.48550/arXiv.1908.08731","status":"public","department":[{"_id":"UlWa"}],"oa":1,"isi":1,"oa_version":"Preprint","date_updated":"2026-04-08T07:25:54Z","month":"08","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1908.08731","open_access":"1"}],"acknowledgement":"We would like to thank F. Frick for helpful discussions","date_published":"2019-08-23T00:00:00Z","article_number":"1908.08731"},{"year":"2019","type":"preprint","publication":"arXiv","corr_author":"1","title":"Envy-free division using mapping degree","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"day":"25","related_material":{"link":[{"relation":"later_version","url":"https://doi.org/10.1112/mtk.12059"}],"record":[{"relation":"dissertation_contains","id":"8156","status":"public"}]},"author":[{"full_name":"Avvakumov, Sergey","orcid":"0000-0002-7840-5062","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov"},{"first_name":"Roman","full_name":"Karasev, Roman","last_name":"Karasev"}],"_id":"8185","external_id":{"arxiv":["1907.11183"]},"date_created":"2020-07-30T10:45:51Z","publication_status":"draft","doi":"10.48550/arXiv.1907.11183","status":"public","article_processing_charge":"No","abstract":[{"lang":"eng","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."}],"citation":{"ieee":"S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” arXiv. .","apa":"Avvakumov, S., & Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv. https://doi.org/10.48550/arXiv.1907.11183","chicago":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1907.11183.","ista":"Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183.","short":"S. Avvakumov, R. Karasev, ArXiv (n.d.).","ama":"Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv. doi:10.48550/arXiv.1907.11183","mla":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, 1907.11183, doi:10.48550/arXiv.1907.11183."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"UlWa"}],"oa":1,"oa_version":"Preprint","month":"07","date_updated":"2026-04-08T07:25:54Z","date_published":"2019-07-25T00:00:00Z","article_number":"1907.11183","main_file_link":[{"url":"https://arxiv.org/abs/1907.11183","open_access":"1"}],"arxiv":1},{"type":"book_chapter","year":"2019","title":"Mathematical models in population genetics","publication":"Handbook of statistical genomics","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","date_created":"2020-08-21T04:25:39Z","status":"public","citation":{"apa":"Barton, N. H., & Etheridge, A. (2019). Mathematical models in population genetics. In D. Balding, I. Moltke, & J. Marioni (Eds.), Handbook of statistical genomics (4th ed., pp. 115–144). Wiley. https://doi.org/10.1002/9781119487845.ch4","ieee":"N. H. Barton and A. Etheridge, “Mathematical models in population genetics,” in Handbook of statistical genomics, 4th ed., D. Balding, I. Moltke, and J. Marioni, Eds. Wiley, 2019, pp. 115–144.","chicago":"Barton, Nicholas H, and Alison Etheridge. “Mathematical Models in Population Genetics.” In Handbook of Statistical Genomics, edited by David Balding, Ida Moltke, and John Marioni, 4th ed., 115–44. Wiley, 2019. https://doi.org/10.1002/9781119487845.ch4.","ista":"Barton NH, Etheridge A. 2019.Mathematical models in population genetics. In: Handbook of statistical genomics. , 115–144.","short":"N.H. Barton, A. Etheridge, in:, D. Balding, I. Moltke, J. Marioni (Eds.), Handbook of Statistical Genomics, 4th ed., Wiley, 2019, pp. 115–144.","mla":"Barton, Nicholas H., and Alison Etheridge. “Mathematical Models in Population Genetics.” Handbook of Statistical Genomics, edited by David Balding et al., 4th ed., Wiley, 2019, pp. 115–44, doi:10.1002/9781119487845.ch4.","ama":"Barton NH, Etheridge A. Mathematical models in population genetics. In: Balding D, Moltke I, Marioni J, eds. Handbook of Statistical Genomics. 4th ed. Wiley; 2019:115-144. doi:10.1002/9781119487845.ch4"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"isbn":["9781119429142"]},"department":[{"_id":"NiBa"}],"isi":1,"date_published":"2019-07-29T00:00:00Z","page":"115-144","ddc":["576"],"edition":"4","day":"29","_id":"8281","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"last_name":"Etheridge","full_name":"Etheridge, Alison","first_name":"Alison"}],"external_id":{"isi":["000261343000003"]},"publication_status":"published","publisher":"Wiley","article_processing_charge":"No","abstract":[{"text":"We review the history of population genetics, starting with its origins a century ago from the synthesis between Mendel and Darwin's ideas, through to the recent development of sophisticated schemes of inference from sequence data, based on the coalescent. We explain the close relation between the coalescent and a diffusion process, which we illustrate by their application to understand spatial structure. We summarise the powerful methods available for analysis of multiple loci, when linkage equilibrium can be assumed, and then discuss approaches to the more challenging case, where associations between alleles require that we follow genotype, rather than allele, frequencies. Though we can hardly cover the whole of population genetics, we give an overview of the current state of the subject, and future challenges to it.","lang":"eng"}],"doi":"10.1002/9781119487845.ch4","editor":[{"last_name":"Balding","full_name":"Balding, David","first_name":"David"},{"full_name":"Moltke, Ida","first_name":"Ida","last_name":"Moltke"},{"last_name":"Marioni","first_name":"John","full_name":"Marioni, John"}],"oa_version":"None","month":"07","date_updated":"2024-10-21T06:02:39Z"},{"oa_version":"Preprint","department":[{"_id":"ElKo"}],"oa":1,"article_number":"2019/1015","date_published":"2019-09-10T00:00:00Z","main_file_link":[{"url":"https://eprint.iacr.org/2019/1015","open_access":"1"}],"month":"09","date_updated":"2025-01-20T14:08:03Z","title":"Bootstrapping consensus without trusted setup: Fully asynchronous distributed key generation","publication":"Cryptology ePrint Archive","language":[{"iso":"eng"}],"year":"2019","type":"preprint","abstract":[{"text":"In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)−threshold that are necessary for scalable consensus (which so far needs a trusted dealer assumption). In order to create a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds f+1