[{"intvolume":" 28","month":"04","oa_version":"None","pmid":1,"abstract":[{"text":"X and Y chromosomes can diverge when rearrangements block recombination between them. Here we present the first genomic view of a reciprocal translocation that causes two physically unconnected pairs of chromosomes to be coinherited as sex chromosomes. In a population of the common frog (Rana temporaria), both pairs of X and Y chromosomes show extensive sequence differentiation, but not degeneration of the Y chromosomes. A new method based on gene trees shows both chromosomes are sex‐linked. Furthermore, the gene trees from the two Y chromosomes have identical topologies, showing they have been coinherited since the reciprocal translocation occurred. Reciprocal translocations can thus reshape sex linkage on a much greater scale compared with inversions, the type of rearrangement that is much better known in sex chromosome evolution, and they can greatly amplify the power of sexually antagonistic selection to drive genomic rearrangement. Two more populations show evidence of other rearrangements, suggesting that this species has unprecedented structural polymorphism in its sex chromosomes.","lang":"eng"}],"volume":28,"issue":"8","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"status":"public","article_type":"original","type":"journal_article","_id":"7421","department":[{"_id":"BeVi"}],"date_updated":"2023-09-06T15:00:13Z","publisher":"Wiley","quality_controlled":"1","date_created":"2020-01-30T10:33:05Z","date_published":"2019-04-01T00:00:00Z","doi":"10.1111/mec.14990","page":"1877-1889","publication":"Molecular Ecology","day":"01","year":"2019","isi":1,"title":"A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog","article_processing_charge":"No","external_id":{"isi":["000468200800004"],"pmid":["30576024"]},"author":[{"last_name":"Toups","full_name":"Toups, Melissa A","orcid":"0000-0002-9752-7380","first_name":"Melissa A","id":"4E099E4E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicolas","full_name":"Rodrigues, Nicolas","last_name":"Rodrigues"},{"full_name":"Perrin, Nicolas","last_name":"Perrin","first_name":"Nicolas"},{"last_name":"Kirkpatrick","full_name":"Kirkpatrick, Mark","first_name":"Mark"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. 2019. A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. 28(8), 1877–1889.","chicago":"Toups, Melissa A, Nicolas Rodrigues, Nicolas Perrin, and Mark Kirkpatrick. “A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common Frog.” Molecular Ecology. Wiley, 2019. https://doi.org/10.1111/mec.14990.","ama":"Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. 2019;28(8):1877-1889. doi:10.1111/mec.14990","apa":"Toups, M. A., Rodrigues, N., Perrin, N., & Kirkpatrick, M. (2019). A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.14990","short":"M.A. Toups, N. Rodrigues, N. Perrin, M. Kirkpatrick, Molecular Ecology 28 (2019) 1877–1889.","ieee":"M. A. Toups, N. Rodrigues, N. Perrin, and M. Kirkpatrick, “A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog,” Molecular Ecology, vol. 28, no. 8. Wiley, pp. 1877–1889, 2019.","mla":"Toups, Melissa A., et al. “A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common Frog.” Molecular Ecology, vol. 28, no. 8, Wiley, 2019, pp. 1877–89, doi:10.1111/mec.14990."}},{"date_updated":"2023-09-06T15:26:06Z","department":[{"_id":"KrPi"}],"_id":"7411","type":"conference","conference":{"end_date":"2019-05-23","location":"Darmstadt, Germany","start_date":"2019-05-19","name":"International Conference on the Theory and Applications of Cryptographic Techniques"},"status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030176556","9783030176563"],"eissn":["1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":11477,"ec_funded":1,"abstract":[{"lang":"eng","text":"Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving a statement χ and a time parameter T computes a proof ϕ(χ,T) which is efficiently and publicly verifiable. The proof can be computed in T sequential steps, but not much less, even by a malicious party having large parallelism. A PoSW thus serves as a proof that T units of time have passed since χ\r\n\r\nwas received.\r\n\r\nPoSW were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical construction was only recently proposed by Cohen and Pietrzak [CP18].\r\n\r\nIn this work we construct a new simple PoSW in the random permutation model which is almost as simple and efficient as [CP18] but conceptually very different. Whereas the structure underlying [CP18] is a hash tree, our construction is based on skip lists and has the interesting property that computing the PoSW is a reversible computation.\r\nThe fact that the construction is reversible can potentially be used for new applications like constructing proofs of replication. We also show how to “embed” the sloth function of Lenstra and Weselowski [LW17] into our PoSW to get a PoSW where one additionally can verify correctness of the output much more efficiently than recomputing it (though recent constructions of “verifiable delay functions” subsume most of the applications this construction was aiming at)."}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2019/252","open_access":"1"}],"month":"04","intvolume":" 11477","citation":{"ama":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019. Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10","apa":"Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2019). Reversible proofs of sequential work. In Advances in Cryptology – EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing. https://doi.org/10.1007/978-3-030-17656-3_10","ieee":"H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT 2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.","short":"H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.","mla":"Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.","ista":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477, 277–291.","chicago":"Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.” In Advances in Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17656-3_10."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","last_name":"Abusalah","full_name":"Abusalah, Hamza M"},{"full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen","last_name":"Klein"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Walter","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael"}],"external_id":{"isi":["000483516200010"]},"article_processing_charge":"No","title":"Reversible proofs of sequential work","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"isi":1,"year":"2019","day":"24","publication":"Advances in Cryptology – EUROCRYPT 2019","page":"277-291","date_published":"2019-04-24T00:00:00Z","doi":"10.1007/978-3-030-17656-3_10","date_created":"2020-01-30T09:26:14Z","publisher":"Springer International Publishing","quality_controlled":"1","oa":1},{"project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants","call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425"},{"grant_number":"W1232-B24","name":"Molecular Drug Targets","_id":"2548AE96-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"chicago":"Mckenzie, Catherine, Miroslava Spanova, Alexander J Johnson, Stephanie Kainrath, Vanessa Zheden, Harald H. Sitte, and Harald L Janovjak. “Isolation of Synaptic Vesicles from Genetically Engineered Cultured Neurons.” Journal of Neuroscience Methods. Elsevier, 2019. https://doi.org/10.1016/j.jneumeth.2018.11.018.","ista":"Mckenzie C, Spanova M, Johnson AJ, Kainrath S, Zheden V, Sitte HH, Janovjak HL. 2019. Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. 312, 114–121.","mla":"Mckenzie, Catherine, et al. “Isolation of Synaptic Vesicles from Genetically Engineered Cultured Neurons.” Journal of Neuroscience Methods, vol. 312, Elsevier, 2019, pp. 114–21, doi:10.1016/j.jneumeth.2018.11.018.","ieee":"C. Mckenzie et al., “Isolation of synaptic vesicles from genetically engineered cultured neurons,” Journal of Neuroscience Methods, vol. 312. Elsevier, pp. 114–121, 2019.","short":"C. Mckenzie, M. Spanova, A.J. Johnson, S. Kainrath, V. Zheden, H.H. Sitte, H.L. Janovjak, Journal of Neuroscience Methods 312 (2019) 114–121.","apa":"Mckenzie, C., Spanova, M., Johnson, A. J., Kainrath, S., Zheden, V., Sitte, H. H., & Janovjak, H. L. (2019). Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. Elsevier. https://doi.org/10.1016/j.jneumeth.2018.11.018","ama":"Mckenzie C, Spanova M, Johnson AJ, et al. Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. 2019;312:114-121. doi:10.1016/j.jneumeth.2018.11.018"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"pmid":["30496761"],"isi":["000456220900013"]},"article_processing_charge":"No","author":[{"full_name":"Mckenzie, Catherine","last_name":"Mckenzie","first_name":"Catherine","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87"},{"id":"44A924DC-F248-11E8-B48F-1D18A9856A87","first_name":"Miroslava","full_name":"Spanova, Miroslava","last_name":"Spanova"},{"first_name":"Alexander J","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2739-8843","full_name":"Johnson, Alexander J","last_name":"Johnson"},{"full_name":"Kainrath, Stephanie","last_name":"Kainrath","first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"id":"39C5A68A-F248-11E8-B48F-1D18A9856A87","first_name":"Vanessa","last_name":"Zheden","full_name":"Zheden, Vanessa","orcid":"0000-0002-9438-4783"},{"full_name":"Sitte, Harald H.","last_name":"Sitte","first_name":"Harald H."},{"last_name":"Janovjak","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L"}],"title":"Isolation of synaptic vesicles from genetically engineered cultured neurons","publisher":"Elsevier","quality_controlled":"1","year":"2019","isi":1,"publication":"Journal of Neuroscience Methods","day":"15","page":"114-121","date_created":"2020-01-30T09:12:19Z","date_published":"2019-01-15T00:00:00Z","doi":"10.1016/j.jneumeth.2018.11.018","_id":"7406","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-09-06T15:27:29Z","department":[{"_id":"HaJa"},{"_id":"Bio"}],"abstract":[{"text":"Background\r\nSynaptic vesicles (SVs) are an integral part of the neurotransmission machinery, and isolation of SVs from their host neuron is necessary to reveal their most fundamental biochemical and functional properties in in vitro assays. Isolated SVs from neurons that have been genetically engineered, e.g. to introduce genetically encoded indicators, are not readily available but would permit new insights into SV structure and function. Furthermore, it is unclear if cultured neurons can provide sufficient starting material for SV isolation procedures.\r\n\r\nNew method\r\nHere, we demonstrate an efficient ex vivo procedure to obtain functional SVs from cultured rat cortical neurons after genetic engineering with a lentivirus.\r\n\r\nResults\r\nWe show that ∼108 plated cortical neurons allow isolation of suitable SV amounts for functional analysis and imaging. We found that SVs isolated from cultured neurons have neurotransmitter uptake comparable to that of SVs isolated from intact cortex. Using total internal reflection fluorescence (TIRF) microscopy, we visualized an exogenous SV-targeted marker protein and demonstrated the high efficiency of SV modification.\r\n\r\nComparison with existing methods\r\nObtaining SVs from genetically engineered neurons currently generally requires the availability of transgenic animals, which is constrained by technical (e.g. cost and time) and biological (e.g. developmental defects and lethality) limitations.\r\n\r\nConclusions\r\nThese results demonstrate the modification and isolation of functional SVs using cultured neurons and viral transduction. The ability to readily obtain SVs from genetically engineered neurons will permit linking in situ studies to in vitro experiments in a variety of genetic contexts.","lang":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"}],"oa_version":"None","pmid":1,"scopus_import":"1","intvolume":" 312","month":"01","publication_status":"published","publication_identifier":{"issn":["0165-0270"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":312},{"citation":{"ista":"Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu J. 2019. Distributed learning over unreliable networks. 36th International Conference on Machine Learning, ICML 2019. ICML: International Conference on Machine Learning vol. 2019–June, 12481–12512.","chicago":"Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In 36th International Conference on Machine Learning, ICML 2019, 2019–June:12481–512. IMLS, 2019.","apa":"Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., … Liu, J. (2019). Distributed learning over unreliable networks. In 36th International Conference on Machine Learning, ICML 2019 (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.","ama":"Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: 36th International Conference on Machine Learning, ICML 2019. Vol 2019-June. IMLS; 2019:12481-12512.","ieee":"C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.","short":"C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.","mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International Conference on Machine Learning, ICML 2019, vol. 2019–June, IMLS, 2019, pp. 12481–512."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Chen","full_name":"Yu, Chen","last_name":"Yu"},{"full_name":"Tang, Hanlin","last_name":"Tang","first_name":"Hanlin"},{"first_name":"Cedric","last_name":"Renggli","full_name":"Renggli, Cedric"},{"last_name":"Kassing","full_name":"Kassing, Simon","first_name":"Simon"},{"last_name":"Singla","full_name":"Singla, Ankit","first_name":"Ankit"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Zhang, Ce","last_name":"Zhang","first_name":"Ce"},{"first_name":"Ji","last_name":"Liu","full_name":"Liu, Ji"}],"external_id":{"isi":["000684034307036"],"arxiv":["1810.07766"]},"article_processing_charge":"No","title":"Distributed learning over unreliable networks","publisher":"IMLS","quality_controlled":"1","oa":1,"isi":1,"year":"2019","day":"01","publication":"36th International Conference on Machine Learning, ICML 2019","page":"12481-12512","date_published":"2019-06-01T00:00:00Z","date_created":"2020-02-02T23:01:06Z","_id":"7437","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2019-06-15","location":"Long Beach, CA, United States","start_date":"2019-06-10"},"status":"public","date_updated":"2023-09-06T15:21:48Z","department":[{"_id":"DaAl"}],"abstract":[{"lang":"eng","text":"Most of today's distributed machine learning systems assume reliable networks: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: Can we design machine learning systems that are tolerant to network unreliability during training? With this motivation, we focus on a theoretical problem of independent interest-given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability p of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of parameter servers. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.07766"}],"month":"06","publication_identifier":{"isbn":["9781510886988"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":"2019-June"},{"department":[{"_id":"VlKo"}],"date_updated":"2023-09-06T15:25:29Z","status":"public","type":"journal_article","article_type":"original","_id":"7412","issue":"5","volume":48,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"publication_status":"published","month":"10","intvolume":" 48","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01537"}],"oa_version":"Preprint","abstract":[{"text":"We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These algorithms search a state space by repeatedly selecting some constraint that is violated in the current state and moving to a random nearby state that addresses the violation, while (we hope) not introducing many new violations. An important class of focused local search algorithms with provable performance guarantees has recently arisen from algorithmizations of the Lovász local lemma (LLL), a nonconstructive tool for proving the existence of satisfying states by introducing a background measure on the state space. While powerful, the state transitions of algorithms in this class must be, in a precise sense, perfectly compatible with the background measure. In many applications this is a very restrictive requirement, and one needs to step outside the class. Here we introduce the notion of measure distortion and develop a framework for analyzing arbitrary focused stochastic local search algorithms, recovering LLL algorithmizations as the special case of no distortion. Our framework takes as input an arbitrary algorithm of such type and an arbitrary probability measure and shows how to use the measure as a yardstick of algorithmic progress, even for algorithms designed independently of the measure.","lang":"eng"}],"title":"A local lemma for focused stochastical algorithms","author":[{"first_name":"Dimitris","full_name":"Achlioptas, Dimitris","last_name":"Achlioptas"},{"first_name":"Fotis","full_name":"Iliopoulos, Fotis","last_name":"Iliopoulos"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"article_processing_charge":"No","external_id":{"isi":["000493900200005"],"arxiv":["1809.01537"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local Lemma for Focused Stochastical Algorithms.” SIAM Journal on Computing. SIAM, 2019. https://doi.org/10.1137/16m109332x.","ista":"Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602.","mla":"Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.” SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:10.1137/16m109332x.","short":"D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.","ieee":"D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5. SIAM, pp. 1583–1602, 2019.","ama":"Achlioptas D, Iliopoulos F, Kolmogorov V. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 2019;48(5):1583-1602. doi:10.1137/16m109332x","apa":"Achlioptas, D., Iliopoulos, F., & Kolmogorov, V. (2019). A local lemma for focused stochastical algorithms. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16m109332x"},"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"doi":"10.1137/16m109332x","date_published":"2019-10-31T00:00:00Z","date_created":"2020-01-30T09:27:32Z","page":"1583-1602","day":"31","publication":"SIAM Journal on Computing","isi":1,"year":"2019","quality_controlled":"1","publisher":"SIAM","oa":1},{"scopus_import":"1","month":"11","intvolume":" 38","abstract":[{"text":"Multiple importance sampling (MIS) has become an indispensable tool in Monte Carlo rendering, widely accepted as a near-optimal solution for combining different sampling techniques. But an MIS combination, using the common balance or power heuristics, often results in an overly defensive estimator, leading to high variance. We show that by generalizing the MIS framework, variance can be substantially reduced. Specifically, we optimize one of the combined sampling techniques so as to decrease the overall variance of the resulting MIS estimator. We apply the approach to the computation of direct illumination due to an HDR environment map and to the computation of global illumination using a path guiding algorithm. The implementation can be as simple as subtracting a constant value from the tabulated sampling density done entirely in a preprocessing step. This produces a consistent noise reduction in all our tests with no negative influence on run time, no artifacts or bias, and no failure cases.","lang":"eng"}],"oa_version":"None","issue":"6","volume":38,"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","status":"public","_id":"7418","department":[{"_id":"ChWo"}],"date_updated":"2023-09-06T15:22:23Z","publisher":"ACM","quality_controlled":"1","date_published":"2019-11-01T00:00:00Z","doi":"10.1145/3355089.3356565","date_created":"2020-01-30T10:19:43Z","isi":1,"year":"2019","day":"01","publication":"ACM Transactions on Graphics","article_number":"151","author":[{"first_name":"Ondřej","full_name":"Karlík, Ondřej","last_name":"Karlík"},{"first_name":"Martin","full_name":"Šik, Martin","last_name":"Šik"},{"last_name":"Vévoda","full_name":"Vévoda, Petr","first_name":"Petr"},{"last_name":"Skrivan","full_name":"Skrivan, Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas"},{"first_name":"Jaroslav","full_name":"Křivánek, Jaroslav","last_name":"Křivánek"}],"article_processing_charge":"No","external_id":{"isi":["000498397300001"]},"title":"MIS compensation: Optimizing sampling techniques in multiple importance sampling","citation":{"ista":"Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. 2019. MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. 38(6), 151.","chicago":"Karlík, Ondřej, Martin Šik, Petr Vévoda, Tomas Skrivan, and Jaroslav Křivánek. “MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356565.","short":"O. Karlík, M. Šik, P. Vévoda, T. Skrivan, J. Křivánek, ACM Transactions on Graphics 38 (2019).","ieee":"O. Karlík, M. Šik, P. Vévoda, T. Skrivan, and J. Křivánek, “MIS compensation: Optimizing sampling techniques in multiple importance sampling,” ACM Transactions on Graphics, vol. 38, no. 6. ACM, 2019.","apa":"Karlík, O., Šik, M., Vévoda, P., Skrivan, T., & Křivánek, J. (2019). MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356565","ama":"Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. MIS compensation: Optimizing sampling techniques in multiple importance sampling. ACM Transactions on Graphics. 2019;38(6). doi:10.1145/3355089.3356565","mla":"Karlík, Ondřej, et al. “MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.” ACM Transactions on Graphics, vol. 38, no. 6, 151, ACM, 2019, doi:10.1145/3355089.3356565."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"quality_controlled":"1","publisher":"International Press of Boston","oa":1,"isi":1,"year":"2019","day":"07","publication":"Acta Mathematica","page":"219-335","date_published":"2019-06-07T00:00:00Z","doi":"10.4310/acta.2019.v222.n2.a1","date_created":"2020-01-30T09:30:41Z","citation":{"ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2019. Bogoliubov theory in the Gross–Pitaevskii limit. Acta Mathematica. 222(2), 219–335.","chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Bogoliubov Theory in the Gross–Pitaevskii Limit.” Acta Mathematica. International Press of Boston, 2019. https://doi.org/10.4310/acta.2019.v222.n2.a1.","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Acta Mathematica 222 (2019) 219–335.","ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Bogoliubov theory in the Gross–Pitaevskii limit,” Acta Mathematica, vol. 222, no. 2. International Press of Boston, pp. 219–335, 2019.","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Bogoliubov theory in the Gross–Pitaevskii limit. Acta Mathematica. 2019;222(2):219-335. doi:10.4310/acta.2019.v222.n2.a1","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2019). Bogoliubov theory in the Gross–Pitaevskii limit. Acta Mathematica. International Press of Boston. https://doi.org/10.4310/acta.2019.v222.n2.a1","mla":"Boccato, Chiara, et al. “Bogoliubov Theory in the Gross–Pitaevskii Limit.” Acta Mathematica, vol. 222, no. 2, International Press of Boston, 2019, pp. 219–335, doi:10.4310/acta.2019.v222.n2.a1."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Chiara","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","full_name":"Boccato, Chiara","last_name":"Boccato"},{"full_name":"Brennecke, Christian","last_name":"Brennecke","first_name":"Christian"},{"first_name":"Serena","last_name":"Cenatiempo","full_name":"Cenatiempo, Serena"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"}],"external_id":{"isi":["000495865300001"],"arxiv":["1801.01389"]},"article_processing_charge":"No","title":"Bogoliubov theory in the Gross–Pitaevskii limit","abstract":[{"text":"We consider Bose gases consisting of N particles trapped in a box with volume one and interacting through a repulsive potential with scattering length of order N−1 (Gross–Pitaevskii regime). We determine the ground state energy and the low-energy excitation spectrum, up to errors vanishing as N→∞. Our results confirm Bogoliubov’s predictions.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1801.01389","open_access":"1"}],"month":"06","intvolume":" 222","publication_identifier":{"eissn":["1871-2509"],"issn":["0001-5962"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"2","volume":222,"_id":"7413","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-09-06T15:24:31Z","department":[{"_id":"RoSe"}]},{"date_updated":"2023-09-06T15:35:56Z","ddc":["570"],"file_date_updated":"2020-07-14T12:47:57Z","department":[{"_id":"NiBa"}],"_id":"7393","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"article_type":"original","type":"journal_article","status":"public","publication_status":"published","publication_identifier":{"issn":["2375-2548"]},"language":[{"iso":"eng"}],"file":[{"file_id":"7442","checksum":"af99a5dcdc66c6d6102051faf3be48d8","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-02-03T13:33:25Z","file_name":"2019_ScienceAdvances_Morales.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:57Z","file_size":1869449}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","ec_funded":1,"issue":"12","volume":5,"abstract":[{"lang":"eng","text":"The study of parallel ecological divergence provides important clues to the operation of natural selection. Parallel divergence often occurs in heterogeneous environments with different kinds of environmental gradients in different locations, but the genomic basis underlying this process is unknown. We investigated the genomics of rapid parallel adaptation in the marine snail Littorina saxatilis in response to two independent environmental axes (crab-predation versus wave-action and low-shore versus high-shore). Using pooled whole-genome resequencing, we show that sharing of genomic regions of high differentiation between environments is generally low but increases at smaller spatial scales. We identify different shared genomic regions of divergence for each environmental axis and show that most of these regions overlap with candidate chromosomal inversions. Several inversion regions are divergent and polymorphic across many localities. We argue that chromosomal inversions could store shared variation that fuels rapid parallel adaptation to heterogeneous environments, possibly as balanced polymorphism shared by adaptive gene flow."}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","intvolume":" 5","month":"12","citation":{"chicago":"Morales, Hernán E., Rui Faria, Kerstin Johannesson, Tomas Larsson, Marina Panova, Anja M Westram, and Roger K. Butlin. “Genomic Architecture of Parallel Ecological Divergence: Beyond a Single Environmental Contrast.” Science Advances. AAAS, 2019. https://doi.org/10.1126/sciadv.aav9963.","ista":"Morales HE, Faria R, Johannesson K, Larsson T, Panova M, Westram AM, Butlin RK. 2019. Genomic architecture of parallel ecological divergence: Beyond a single environmental contrast. Science Advances. 5(12), eaav9963.","mla":"Morales, Hernán E., et al. “Genomic Architecture of Parallel Ecological Divergence: Beyond a Single Environmental Contrast.” Science Advances, vol. 5, no. 12, eaav9963, AAAS, 2019, doi:10.1126/sciadv.aav9963.","ieee":"H. E. Morales et al., “Genomic architecture of parallel ecological divergence: Beyond a single environmental contrast,” Science Advances, vol. 5, no. 12. AAAS, 2019.","short":"H.E. Morales, R. Faria, K. Johannesson, T. Larsson, M. Panova, A.M. Westram, R.K. Butlin, Science Advances 5 (2019).","ama":"Morales HE, Faria R, Johannesson K, et al. Genomic architecture of parallel ecological divergence: Beyond a single environmental contrast. Science Advances. 2019;5(12). doi:10.1126/sciadv.aav9963","apa":"Morales, H. E., Faria, R., Johannesson, K., Larsson, T., Panova, M., Westram, A. M., & Butlin, R. K. (2019). Genomic architecture of parallel ecological divergence: Beyond a single environmental contrast. Science Advances. AAAS. https://doi.org/10.1126/sciadv.aav9963"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"pmid":["31840052"],"isi":["000505069600008"]},"article_processing_charge":"No","author":[{"full_name":"Morales, Hernán E.","last_name":"Morales","first_name":"Hernán E."},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"},{"full_name":"Larsson, Tomas","last_name":"Larsson","first_name":"Tomas"},{"last_name":"Panova","full_name":"Panova, Marina","first_name":"Marina"},{"last_name":"Westram","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M"},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."}],"title":"Genomic architecture of parallel ecological divergence: Beyond a single environmental contrast","article_number":"eaav9963","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"H2020","_id":"265B41B8-B435-11E9-9278-68D0E5697425","grant_number":"797747","name":"Theoretical and empirical approaches to understanding Parallel Adaptation"}],"year":"2019","isi":1,"has_accepted_license":"1","publication":"Science Advances","day":"04","date_created":"2020-01-29T15:58:27Z","doi":"10.1126/sciadv.aav9963","date_published":"2019-12-04T00:00:00Z","oa":1,"publisher":"AAAS","quality_controlled":"1"},{"article_processing_charge":"No","external_id":{"isi":["000475349900001"],"arxiv":["1808.04080"]},"author":[{"orcid":"0000-0002-0384-2022","full_name":"Lopez Alonso, Jose M","last_name":"Lopez Alonso","id":"40770848-F248-11E8-B48F-1D18A9856A87","first_name":"Jose M"},{"id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","first_name":"George H","full_name":"Choueiri, George H","last_name":"Choueiri"},{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"title":"Dynamics of viscoelastic pipe flow at low Reynolds numbers in the maximum drag reduction limit","citation":{"short":"J.M. Lopez Alonso, G.H. Choueiri, B. Hof, Journal of Fluid Mechanics 874 (2019) 699–719.","ieee":"J. M. Lopez Alonso, G. H. Choueiri, and B. Hof, “Dynamics of viscoelastic pipe flow at low Reynolds numbers in the maximum drag reduction limit,” Journal of Fluid Mechanics, vol. 874. CUP, pp. 699–719, 2019.","ama":"Lopez Alonso JM, Choueiri GH, Hof B. Dynamics of viscoelastic pipe flow at low Reynolds numbers in the maximum drag reduction limit. Journal of Fluid Mechanics. 2019;874:699-719. doi:10.1017/jfm.2019.486","apa":"Lopez Alonso, J. M., Choueiri, G. H., & Hof, B. (2019). Dynamics of viscoelastic pipe flow at low Reynolds numbers in the maximum drag reduction limit. Journal of Fluid Mechanics. CUP. https://doi.org/10.1017/jfm.2019.486","mla":"Lopez Alonso, Jose M., et al. “Dynamics of Viscoelastic Pipe Flow at Low Reynolds Numbers in the Maximum Drag Reduction Limit.” Journal of Fluid Mechanics, vol. 874, CUP, 2019, pp. 699–719, doi:10.1017/jfm.2019.486.","ista":"Lopez Alonso JM, Choueiri GH, Hof B. 2019. Dynamics of viscoelastic pipe flow at low Reynolds numbers in the maximum drag reduction limit. Journal of Fluid Mechanics. 874, 699–719.","chicago":"Lopez Alonso, Jose M, George H Choueiri, and Björn Hof. “Dynamics of Viscoelastic Pipe Flow at Low Reynolds Numbers in the Maximum Drag Reduction Limit.” Journal of Fluid Mechanics. CUP, 2019. https://doi.org/10.1017/jfm.2019.486."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"699-719","date_created":"2020-01-29T16:05:19Z","date_published":"2019-09-10T00:00:00Z","doi":"10.1017/jfm.2019.486","year":"2019","isi":1,"publication":"Journal of Fluid Mechanics","day":"10","oa":1,"publisher":"CUP","quality_controlled":"1","department":[{"_id":"BjHo"}],"date_updated":"2023-09-06T15:36:36Z","article_type":"original","type":"journal_article","status":"public","_id":"7397","volume":874,"publication_status":"published","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1808.04080","open_access":"1"}],"scopus_import":"1","intvolume":" 874","month":"09","abstract":[{"text":"Polymer additives can substantially reduce the drag of turbulent flows and the upperlimit, the so called “maximum drag reduction” (MDR) asymptote is universal, i.e. inde-pendent of the type of polymer and solvent used. Until recently, the consensus was that,in this limit, flows are in a marginal state where only a minimal level of turbulence activ-ity persists. Observations in direct numerical simulations using minimal sized channelsappeared to support this view and reported long “hibernation” periods where turbu-lence is marginalized. In simulations of pipe flow we find that, indeed, with increasingWeissenberg number (Wi), turbulence expresses long periods of hibernation if the domainsize is small. However, with increasing pipe length, the temporal hibernation continuouslyalters to spatio-temporal intermittency and here the flow consists of turbulent puffs sur-rounded by laminar flow. Moreover, upon an increase in Wi, the flow fully relaminarises,in agreement with recent experiments. At even larger Wi, a different instability is en-countered causing a drag increase towards MDR. Our findings hence link earlier minimalflow unit simulations with recent experiments and confirm that the addition of polymersinitially suppresses Newtonian turbulence and leads to a reverse transition. The MDRstate on the other hand results from a separate instability and the underlying dynamicscorresponds to the recently proposed state of elasto-inertial-turbulence (EIT).","lang":"eng"}],"oa_version":"Preprint"},{"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"citation":{"mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” Discrete and Computational Geometry, vol. 62, no. 4, Springer, 2019, pp. 865–878, doi:10.1007/s00454-018-0049-2.","apa":"Edelsbrunner, H., & Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. Springer. https://doi.org/10.1007/s00454-018-0049-2","ama":"Edelsbrunner H, Nikitenko A. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 2019;62(4):865–878. doi:10.1007/s00454-018-0049-2","ieee":"H. Edelsbrunner and A. Nikitenko, “Poisson–Delaunay Mosaics of Order k,” Discrete and Computational Geometry, vol. 62, no. 4. Springer, pp. 865–878, 2019.","short":"H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019) 865–878.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” Discrete and Computational Geometry. Springer, 2019. https://doi.org/10.1007/s00454-018-0049-2.","ista":"Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["1709.09380"],"isi":["000494042900008"]},"article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","last_name":"Nikitenko","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87"}],"title":"Poisson–Delaunay Mosaics of Order k","oa":1,"quality_controlled":"1","publisher":"Springer","year":"2019","isi":1,"has_accepted_license":"1","publication":"Discrete and Computational Geometry","day":"01","page":"865–878","date_created":"2018-12-16T22:59:20Z","date_published":"2019-12-01T00:00:00Z","doi":"10.1007/s00454-018-0049-2","_id":"5678","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","date_updated":"2023-09-07T12:07:12Z","ddc":["516"],"file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"The order-k Voronoi tessellation of a locally finite set 𝑋⊆ℝ𝑛 decomposes ℝ𝑛 into convex domains whose points have the same k nearest neighbors in X. Assuming X is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by counting only faces, for which the k nearest points in X are within a given distance threshold."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 62","month":"12","publication_status":"published","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5932","checksum":"f9d00e166efaccb5a76bbcbb4dcea3b4","file_size":599339,"date_updated":"2020-07-14T12:47:10Z","creator":"dernst","file_name":"2018_DiscreteCompGeometry_Edelsbrunner.pdf","date_created":"2019-02-06T10:10:46Z"}],"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"issue":"4","volume":62,"related_material":{"record":[{"id":"6287","status":"public","relation":"dissertation_contains"}]}},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.1016/j.neuron.2018.11.015"}],"month":"01","intvolume":" 101","abstract":[{"text":"Hippocampus is needed for both spatial working and reference memories. Here, using a radial eight-arm maze, we examined how the combined demand on these memories influenced CA1 place cell assemblies while reference memories were partially updated. This was contrasted with control tasks requiring only working memory or the update of reference memory. Reference memory update led to the reward-directed place field shifts at newly rewarded arms and to the gradual strengthening of firing in passes between newly rewarded arms but not between those passes that included a familiar-rewarded arm. At the maze center, transient network synchronization periods preferentially replayed trajectories of the next chosen arm in reference memory tasks but the previously visited arm in the working memory task. Hence, reference memory demand was uniquely associated with a gradual, goal novelty-related reorganization of place cell assemblies and with trajectory replay that reflected the animal's decision of which arm to visit next.","lang":"eng"}],"oa_version":"Published Version","volume":101,"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/reading-rats-minds/"}],"record":[{"relation":"dissertation_contains","status":"public","id":"837"}]},"issue":"1","ec_funded":1,"publication_identifier":{"issn":["10974199"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","status":"public","_id":"5828","department":[{"_id":"JoCs"}],"date_updated":"2023-09-07T12:06:37Z","publisher":"Elsevier","quality_controlled":"1","oa":1,"page":"119-132.e4","doi":"10.1016/j.neuron.2018.11.015","date_published":"2019-01-02T00:00:00Z","date_created":"2019-01-13T22:59:10Z","isi":1,"year":"2019","day":"02","publication":"Neuron","project":[{"name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","grant_number":"281511","call_identifier":"FP7","_id":"257A4776-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Haibing","id":"310349D0-F248-11E8-B48F-1D18A9856A87","last_name":"Xu","full_name":"Xu, Haibing"},{"id":"361CC00E-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Baracskay, Peter","last_name":"Baracskay"},{"id":"426376DC-F248-11E8-B48F-1D18A9856A87","first_name":"Joseph","full_name":"O'Neill, Joseph","last_name":"O'Neill"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L"}],"article_processing_charge":"No","external_id":{"isi":["000454791500014"]},"title":"Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze","citation":{"chicago":"Xu, Haibing, Peter Baracskay, Joseph O’Neill, and Jozsef L Csicsvari. “Assembly Responses of Hippocampal CA1 Place Cells Predict Learned Behavior in Goal-Directed Spatial Tasks on the Radial Eight-Arm Maze.” Neuron. Elsevier, 2019. https://doi.org/10.1016/j.neuron.2018.11.015.","ista":"Xu H, Baracskay P, O’Neill J, Csicsvari JL. 2019. Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze. Neuron. 101(1), 119–132.e4.","mla":"Xu, Haibing, et al. “Assembly Responses of Hippocampal CA1 Place Cells Predict Learned Behavior in Goal-Directed Spatial Tasks on the Radial Eight-Arm Maze.” Neuron, vol. 101, no. 1, Elsevier, 2019, p. 119–132.e4, doi:10.1016/j.neuron.2018.11.015.","ieee":"H. Xu, P. Baracskay, J. O’Neill, and J. L. Csicsvari, “Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze,” Neuron, vol. 101, no. 1. Elsevier, p. 119–132.e4, 2019.","short":"H. Xu, P. Baracskay, J. O’Neill, J.L. Csicsvari, Neuron 101 (2019) 119–132.e4.","ama":"Xu H, Baracskay P, O’Neill J, Csicsvari JL. Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze. Neuron. 2019;101(1):119-132.e4. doi:10.1016/j.neuron.2018.11.015","apa":"Xu, H., Baracskay, P., O’Neill, J., & Csicsvari, J. L. (2019). Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.11.015"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"date_updated":"2023-09-07T12:37:42Z","ddc":["530"],"file_date_updated":"2020-07-14T12:47:12Z","department":[{"_id":"RoSe"}],"_id":"5856","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"issn":["14240637"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"255e42f957a8e2b10aad2499c750a8d6","file_id":"5894","creator":"dernst","date_updated":"2020-07-14T12:47:12Z","file_size":859846,"date_created":"2019-01-28T15:27:17Z","file_name":"2019_Annales_Moser.pdf"}],"language":[{"iso":"eng"}],"issue":"4","volume":20,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"52"}]},"ec_funded":1,"abstract":[{"text":"We give a bound on the ground-state energy of a system of N non-interacting fermions in a three-dimensional cubic box interacting with an impurity particle via point interactions. We show that the change in energy compared to the system in the absence of the impurity is bounded in terms of the gas density and the scattering length of the interaction, independently of N. Our bound holds as long as the ratio of the mass of the impurity to the one of the gas particles is larger than a critical value m∗ ∗≈ 0.36 , which is the same regime for which we recently showed stability of the system.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"04","intvolume":" 20","citation":{"ista":"Moser T, Seiringer R. 2019. Energy contribution of a point-interacting impurity in a Fermi gas. Annales Henri Poincare. 20(4), 1325–1365.","chicago":"Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting Impurity in a Fermi Gas.” Annales Henri Poincare. Springer, 2019. https://doi.org/10.1007/s00023-018-00757-0.","ieee":"T. Moser and R. Seiringer, “Energy contribution of a point-interacting impurity in a Fermi gas,” Annales Henri Poincare, vol. 20, no. 4. Springer, pp. 1325–1365, 2019.","short":"T. Moser, R. Seiringer, Annales Henri Poincare 20 (2019) 1325–1365.","ama":"Moser T, Seiringer R. Energy contribution of a point-interacting impurity in a Fermi gas. Annales Henri Poincare. 2019;20(4):1325–1365. doi:10.1007/s00023-018-00757-0","apa":"Moser, T., & Seiringer, R. (2019). Energy contribution of a point-interacting impurity in a Fermi gas. Annales Henri Poincare. Springer. https://doi.org/10.1007/s00023-018-00757-0","mla":"Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting Impurity in a Fermi Gas.” Annales Henri Poincare, vol. 20, no. 4, Springer, 2019, pp. 1325–1365, doi:10.1007/s00023-018-00757-0."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Moser, Thomas","last_name":"Moser"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000462444300008"],"arxiv":["1807.00739"]},"title":"Energy contribution of a point-interacting impurity in a Fermi gas","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"isi":1,"has_accepted_license":"1","year":"2019","day":"01","publication":"Annales Henri Poincare","page":"1325–1365","doi":"10.1007/s00023-018-00757-0","date_published":"2019-04-01T00:00:00Z","date_created":"2019-01-20T22:59:17Z","quality_controlled":"1","publisher":"Springer","oa":1},{"oa":1,"publisher":"Institute of Science and Technology Austria","day":"24","year":"2019","has_accepted_license":"1","date_created":"2019-10-22T12:08:43Z","date_published":"2019-10-24T00:00:00Z","doi":"10.15479/AT:ISTA:6957","page":"138","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Paranjape CS. 2019. Onset of turbulence in plane Poiseuille flow. Institute of Science and Technology Austria.","chicago":"Paranjape, Chaitanya S. “Onset of Turbulence in Plane Poiseuille Flow.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6957.","apa":"Paranjape, C. S. (2019). Onset of turbulence in plane Poiseuille flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6957","ama":"Paranjape CS. Onset of turbulence in plane Poiseuille flow. 2019. doi:10.15479/AT:ISTA:6957","short":"C.S. Paranjape, Onset of Turbulence in Plane Poiseuille Flow, Institute of Science and Technology Austria, 2019.","ieee":"C. S. Paranjape, “Onset of turbulence in plane Poiseuille flow,” Institute of Science and Technology Austria, 2019.","mla":"Paranjape, Chaitanya S. Onset of Turbulence in Plane Poiseuille Flow. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6957."},"title":"Onset of turbulence in plane Poiseuille flow","article_processing_charge":"No","author":[{"id":"3D85B7C4-F248-11E8-B48F-1D18A9856A87","first_name":"Chaitanya S","full_name":"Paranjape, Chaitanya S","last_name":"Paranjape"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"In many shear flows like pipe flow, plane Couette flow, plane Poiseuille flow, etc. turbulence emerges subcritically. Here, when subjected to strong enough perturbations, the flow becomes turbulent in spite of the laminar base flow being linearly stable. The nature of this instability has puzzled the scientific community for decades. At onset, turbulence appears in localized patches and flows are spatio-temporally intermittent. In pipe flow the localized turbulent structures are referred to as puffs and in planar flows like plane Couette and channel flow, patches arise in the form of localized oblique bands. In this thesis, we study the onset of turbulence in channel flow in direct numerical simulations from a dynamical system theory perspective, as well as by performing experiments in a large aspect ratio channel.\r\n\r\nThe aim of the experimental work is to determine the critical Reynolds number where turbulence first becomes sustained. Recently, the onset of turbulence has been described in analogy to absorbing state phase transition (i.e. directed percolation). In particular, it has been shown that the critical point can be estimated from the competition between spreading and decay processes. Here, by performing experiments, we identify the mechanisms underlying turbulence proliferation in channel flow and find the critical Reynolds number, above which turbulence becomes sustained. Above the critical point, the continuous growth at the tip of the stripes outweighs the stochastic shedding of turbulent patches at the tail and the stripes expand. For growing stripes, the probability to decay decreases while the probability of stripe splitting increases. Consequently, and unlike for the puffs in pipe flow, neither of these two processes is time-independent i.e. memoryless. Coupling between stripe expansion and creation of new stripes via splitting leads to a significantly lower critical point ($Re_c=670+/-10$) than most earlier studies suggest. \r\n\r\nWhile the above approach sheds light on how turbulence first becomes sustained, it provides no insight into the origin of the stripes themselves. In the numerical part of the thesis we investigate how turbulent stripes form from invariant solutions of the Navier-Stokes equations. The origin of these turbulent stripes can be identified by applying concepts from the dynamical system theory. In doing so, we identify the exact coherent structures underlying stripes and their bifurcations and how they give rise to the turbulent attractor in phase space. We first report a family of localized nonlinear traveling wave solutions of the Navier-Stokes equations in channel flow. These solutions show structural similarities with turbulent stripes in experiments like obliqueness, quasi-streamwise streaks and vortices, etc. A parametric study of these traveling wave solution is performed, with parameters like Reynolds number, stripe tilt angle and domain size, including the stability of the solutions. These solutions emerge through saddle-node bifurcations and form a phase space skeleton for the turbulent stripes observed in the experiments. The lower branches of these TW solutions at different tilt angles undergo Hopf bifurcation and new solutions branches of relative periodic orbits emerge. These RPO solutions do not belong to the same family and therefore the routes to chaos for different angles are different. \r\n\r\nIn shear flows, turbulence at onset is transient in nature. Consequently,turbulence can not be tracked to lower Reynolds numbers, where the dynamics may simplify. Before this happens, turbulence becomes short-lived and laminarizes. In the last part of the thesis, we show that using numerical simulations we can continue turbulent stripes in channel flow past the 'relaminarization barrier' all the way to their origin. Here, turbulent stripe dynamics simplifies and the fluctuations are no longer stochastic and the stripe settles down to a relative periodic orbit. This relative periodic orbit originates from the aforementioned traveling wave solutions. Starting from the relative periodic orbit, a small increase in speed i.e. Reynolds number gives rise to chaos and the attractor dimension sharply increases in contrast to the classical transition scenario where the instabilities affect the flow globally and give rise to much more gradual route to turbulence."}],"month":"10","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"file":[{"checksum":"7ba298ba0ce7e1d11691af6b8eaf0a0a","file_id":"6962","content_type":"application/zip","access_level":"closed","relation":"source_file","date_created":"2019-10-23T09:54:43Z","file_name":"Chaitanya_Paranjape_source_files_tex_figures.zip","date_updated":"2020-07-14T12:47:46Z","file_size":45828099,"creator":"cparanjape"},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"642697618314e31ac31392da7909c2d9","file_id":"6963","date_updated":"2020-07-14T12:47:46Z","file_size":19504197,"creator":"cparanjape","date_created":"2019-10-23T10:37:09Z","file_name":"Chaitanya_Paranjape_Thesis.pdf"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"eissn":["2663-337X"]},"_id":"6957","keyword":["Instabilities","Turbulence","Nonlinear dynamics"],"status":"public","type":"dissertation","ddc":["532"],"date_updated":"2023-09-07T12:53:25Z","supervisor":[{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"department":[{"_id":"BjHo"}],"file_date_updated":"2020-07-14T12:47:46Z"},{"publication_identifier":{"eissn":["20505094"]},"publication_status":"published","file":[{"date_created":"2019-09-17T14:24:13Z","file_name":"2019_Forum_Erdoes.pdf","date_updated":"2020-07-14T12:47:22Z","file_size":1520344,"creator":"dernst","file_id":"6883","checksum":"933a472568221c73b2c3ce8c87bf6d15","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6179"}]},"volume":7,"ec_funded":1,"abstract":[{"lang":"eng","text":"We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the recent result of Ajanki et al. [‘Stability of the matrix Dyson equation and random matrices with correlations’, Probab. Theory Related Fields 173(1–2) (2019), 293–373] to allow slow correlation decay and arbitrary expectation. The main novel tool is\r\na systematic diagrammatic control of a multivariate cumulant expansion."}],"oa_version":"Published Version","scopus_import":"1","month":"03","intvolume":" 7","date_updated":"2023-09-07T12:54:12Z","ddc":["510"],"file_date_updated":"2020-07-14T12:47:22Z","department":[{"_id":"LaEr"}],"_id":"6182","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","has_accepted_license":"1","isi":1,"year":"2019","day":"26","publication":"Forum of Mathematics, Sigma","doi":"10.1017/fms.2019.2","date_published":"2019-03-26T00:00:00Z","date_created":"2019-03-28T09:05:23Z","publisher":"Cambridge University Press","quality_controlled":"1","oa":1,"citation":{"ista":"Erdös L, Krüger TH, Schröder DJ. 2019. Random matrices with slow correlation decay. Forum of Mathematics, Sigma. 7, e8.","chicago":"Erdös, László, Torben H Krüger, and Dominik J Schröder. “Random Matrices with Slow Correlation Decay.” Forum of Mathematics, Sigma. Cambridge University Press, 2019. https://doi.org/10.1017/fms.2019.2.","ieee":"L. Erdös, T. H. Krüger, and D. J. Schröder, “Random matrices with slow correlation decay,” Forum of Mathematics, Sigma, vol. 7. Cambridge University Press, 2019.","short":"L. Erdös, T.H. Krüger, D.J. Schröder, Forum of Mathematics, Sigma 7 (2019).","ama":"Erdös L, Krüger TH, Schröder DJ. Random matrices with slow correlation decay. Forum of Mathematics, Sigma. 2019;7. doi:10.1017/fms.2019.2","apa":"Erdös, L., Krüger, T. H., & Schröder, D. J. (2019). Random matrices with slow correlation decay. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2019.2","mla":"Erdös, László, et al. “Random Matrices with Slow Correlation Decay.” Forum of Mathematics, Sigma, vol. 7, e8, Cambridge University Press, 2019, doi:10.1017/fms.2019.2."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös"},{"first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H","last_name":"Krüger"},{"orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1705.10661"],"isi":["000488847100001"]},"article_processing_charge":"No","title":"Random matrices with slow correlation decay","article_number":"e8","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}]},{"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Cipolloni, Giorgio, et al. “Cusp Universality for Random Matrices, II: The Real Symmetric Case.” Pure and Applied Analysis , vol. 1, no. 4, MSP, 2019, pp. 615–707, doi:10.2140/paa.2019.1.615.","ama":"Cipolloni G, Erdös L, Krüger TH, Schröder DJ. Cusp universality for random matrices, II: The real symmetric case. Pure and Applied Analysis . 2019;1(4):615–707. doi:10.2140/paa.2019.1.615","apa":"Cipolloni, G., Erdös, L., Krüger, T. H., & Schröder, D. J. (2019). Cusp universality for random matrices, II: The real symmetric case. Pure and Applied Analysis . MSP. https://doi.org/10.2140/paa.2019.1.615","short":"G. Cipolloni, L. Erdös, T.H. Krüger, D.J. Schröder, Pure and Applied Analysis 1 (2019) 615–707.","ieee":"G. Cipolloni, L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality for random matrices, II: The real symmetric case,” Pure and Applied Analysis , vol. 1, no. 4. MSP, pp. 615–707, 2019.","chicago":"Cipolloni, Giorgio, László Erdös, Torben H Krüger, and Dominik J Schröder. “Cusp Universality for Random Matrices, II: The Real Symmetric Case.” Pure and Applied Analysis . MSP, 2019. https://doi.org/10.2140/paa.2019.1.615.","ista":"Cipolloni G, Erdös L, Krüger TH, Schröder DJ. 2019. Cusp universality for random matrices, II: The real symmetric case. Pure and Applied Analysis . 1(4), 615–707."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["1811.04055"]},"title":"Cusp universality for random matrices, II: The real symmetric case","publisher":"MSP","quality_controlled":"1","oa":1,"year":"2019","day":"12","publication":"Pure and Applied Analysis ","page":"615–707","date_published":"2019-10-12T00:00:00Z","doi":"10.2140/paa.2019.1.615","date_created":"2019-03-28T10:21:17Z","_id":"6186","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-09-07T12:54:12Z","department":[{"_id":"LaEr"}],"abstract":[{"lang":"eng","text":"We prove that the local eigenvalue statistics of real symmetric Wigner-type\r\nmatrices near the cusp points of the eigenvalue density are universal. Together\r\nwith the companion paper [arXiv:1809.03971], which proves the same result for\r\nthe complex Hermitian symmetry class, this completes the last remaining case of\r\nthe Wigner-Dyson-Mehta universality conjecture after bulk and edge\r\nuniversalities have been established in the last years. We extend the recent\r\nDyson Brownian motion analysis at the edge [arXiv:1712.03881] to the cusp\r\nregime using the optimal local law from [arXiv:1809.03971] and the accurate\r\nlocal shape analysis of the density from [arXiv:1506.05095, arXiv:1804.07752].\r\nWe also present a PDE-based method to improve the estimate on eigenvalue\r\nrigidity via the maximum principle of the heat flow related to the Dyson\r\nBrownian motion."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1811.04055"}],"month":"10","intvolume":" 1","publication_identifier":{"eissn":["2578-5885"],"issn":["2578-5893"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"4","volume":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"6179","status":"public"}]},"ec_funded":1},{"year":"2019","has_accepted_license":"1","isi":1,"publication":"PLoS computational biology","day":"03","page":"e1007290","date_created":"2019-09-22T22:00:37Z","date_published":"2019-09-03T00:00:00Z","doi":"10.1371/journal.pcbi.1007290","oa":1,"publisher":"Public Library of Science","quality_controlled":"1","citation":{"mla":"Cepeda Humerez, Sarah A., et al. “Estimating Information in Time-Varying Signals.” PLoS Computational Biology, vol. 15, no. 9, Public Library of Science, 2019, p. e1007290, doi:10.1371/journal.pcbi.1007290.","ieee":"S. A. Cepeda Humerez, J. Ruess, and G. Tkačik, “Estimating information in time-varying signals,” PLoS computational biology, vol. 15, no. 9. Public Library of Science, p. e1007290, 2019.","short":"S.A. Cepeda Humerez, J. Ruess, G. Tkačik, PLoS Computational Biology 15 (2019) e1007290.","ama":"Cepeda Humerez SA, Ruess J, Tkačik G. Estimating information in time-varying signals. PLoS computational biology. 2019;15(9):e1007290. doi:10.1371/journal.pcbi.1007290","apa":"Cepeda Humerez, S. A., Ruess, J., & Tkačik, G. (2019). Estimating information in time-varying signals. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007290","chicago":"Cepeda Humerez, Sarah A, Jakob Ruess, and Gašper Tkačik. “Estimating Information in Time-Varying Signals.” PLoS Computational Biology. Public Library of Science, 2019. https://doi.org/10.1371/journal.pcbi.1007290.","ista":"Cepeda Humerez SA, Ruess J, Tkačik G. 2019. Estimating information in time-varying signals. PLoS computational biology. 15(9), e1007290."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","external_id":{"pmid":["31479447"],"isi":["000489741800021"]},"author":[{"id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","first_name":"Sarah A","last_name":"Cepeda Humerez","full_name":"Cepeda Humerez, Sarah A"},{"full_name":"Ruess, Jakob","orcid":"0000-0003-1615-3282","last_name":"Ruess","first_name":"Jakob"},{"first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik"}],"title":"Estimating information in time-varying signals","project":[{"grant_number":"P28844-B27","name":"Biophysics of information processing in gene regulation","_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_status":"published","publication_identifier":{"eissn":["15537358"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"81bdce1361c9aa8395d6fa635fb6ab47","file_id":"6925","creator":"kschuh","date_updated":"2020-07-14T12:47:44Z","file_size":3081855,"date_created":"2019-10-01T10:53:45Z","file_name":"2019_PLoS_Cepeda-Humerez.pdf"}],"volume":15,"issue":"9","related_material":{"record":[{"relation":"part_of_dissertation","id":"6473","status":"public"}]},"abstract":[{"lang":"eng","text":"Across diverse biological systems—ranging from neural networks to intracellular signaling and genetic regulatory networks—the information about changes in the environment is frequently encoded in the full temporal dynamics of the network nodes. A pressing data-analysis challenge has thus been to efficiently estimate the amount of information that these dynamics convey from experimental data. Here we develop and evaluate decoding-based estimation methods to lower bound the mutual information about a finite set of inputs, encoded in single-cell high-dimensional time series data. For biological reaction networks governed by the chemical Master equation, we derive model-based information approximations and analytical upper bounds, against which we benchmark our proposed model-free decoding estimators. In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based estimators robustly extract a large fraction of the available information from high-dimensional trajectories with a realistic number of data samples. We apply these estimators to previously published data on Erk and Ca2+ signaling in mammalian cells and to yeast stress-response, and find that substantial amount of information about environmental state can be encoded by non-trivial response statistics even in stationary signals. We argue that these single-cell, decoding-based information estimates, rather than the commonly-used tests for significant differences between selected population response statistics, provide a proper and unbiased measure for the performance of biological signaling networks."}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","intvolume":" 15","month":"09","date_updated":"2023-09-07T12:55:21Z","ddc":["570"],"department":[{"_id":"GaTk"}],"file_date_updated":"2020-07-14T12:47:44Z","_id":"6900","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","status":"public"},{"abstract":[{"lang":"eng","text":"Clathrin-mediated endocytosis (CME) is a highly conserved and essential cellular process in eukaryotic cells, but its dynamic and vital nature makes it challenging to study using classical genetics tools. In contrast, although small molecules can acutely and reversibly perturb CME, the few chemical CME inhibitors that have been applied to plants are either ineffective or show undesirable side effects. Here, we identify the previously described endosidin9 (ES9) as an inhibitor of clathrin heavy chain (CHC) function in both Arabidopsis and human cells through affinity-based target isolation, in vitro binding studies and X-ray crystallography. Moreover, we present a chemically improved ES9 analog, ES9-17, which lacks the undesirable side effects of ES9 while retaining the ability to target CHC. ES9 and ES9-17 have expanded the chemical toolbox used to probe CHC function, and present chemical scaffolds for further design of more specific and potent CHC inhibitors across different systems."}],"oa_version":"None","scopus_import":"1","intvolume":" 15","month":"06","publication_status":"published","publication_identifier":{"eissn":["15524469"],"issn":["15524450"]},"language":[{"iso":"eng"}],"volume":15,"issue":"6","related_material":{"record":[{"relation":"dissertation_contains","id":"7172","status":"public"}]},"_id":"6377","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-09-07T12:54:35Z","department":[{"_id":"JiFr"}],"quality_controlled":"1","publisher":"Springer Nature","year":"2019","isi":1,"publication":"Nature Chemical Biology","day":"01","page":"641–649","date_created":"2019-05-05T21:59:11Z","date_published":"2019-06-01T00:00:00Z","doi":"10.1038/s41589-019-0262-1","citation":{"short":"W. Dejonghe, I. Sharma, B. Denoo, S. De Munck, Q. Lu, K. Mishev, H. Bulut, E. Mylle, R. De Rycke, M.K. Vasileva, D.V. Savatin, W. Nerinckx, A. Staes, A. Drozdzecki, D. Audenaert, K. Yperman, A. Madder, J. Friml, D. Van Damme, K. Gevaert, V. Haucke, S.N. Savvides, J. Winne, E. Russinova, Nature Chemical Biology 15 (2019) 641–649.","ieee":"W. Dejonghe et al., “Disruption of endocytosis through chemical inhibition of clathrin heavy chain function,” Nature Chemical Biology, vol. 15, no. 6. Springer Nature, pp. 641–649, 2019.","ama":"Dejonghe W, Sharma I, Denoo B, et al. Disruption of endocytosis through chemical inhibition of clathrin heavy chain function. Nature Chemical Biology. 2019;15(6):641–649. doi:10.1038/s41589-019-0262-1","apa":"Dejonghe, W., Sharma, I., Denoo, B., De Munck, S., Lu, Q., Mishev, K., … Russinova, E. (2019). Disruption of endocytosis through chemical inhibition of clathrin heavy chain function. Nature Chemical Biology. Springer Nature. https://doi.org/10.1038/s41589-019-0262-1","mla":"Dejonghe, Wim, et al. “Disruption of Endocytosis through Chemical Inhibition of Clathrin Heavy Chain Function.” Nature Chemical Biology, vol. 15, no. 6, Springer Nature, 2019, pp. 641–649, doi:10.1038/s41589-019-0262-1.","ista":"Dejonghe W, Sharma I, Denoo B, De Munck S, Lu Q, Mishev K, Bulut H, Mylle E, De Rycke R, Vasileva MK, Savatin DV, Nerinckx W, Staes A, Drozdzecki A, Audenaert D, Yperman K, Madder A, Friml J, Van Damme D, Gevaert K, Haucke V, Savvides SN, Winne J, Russinova E. 2019. Disruption of endocytosis through chemical inhibition of clathrin heavy chain function. Nature Chemical Biology. 15(6), 641–649.","chicago":"Dejonghe, Wim, Isha Sharma, Bram Denoo, Steven De Munck, Qing Lu, Kiril Mishev, Haydar Bulut, et al. “Disruption of Endocytosis through Chemical Inhibition of Clathrin Heavy Chain Function.” Nature Chemical Biology. Springer Nature, 2019. https://doi.org/10.1038/s41589-019-0262-1."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000468195600018"]},"article_processing_charge":"No","author":[{"full_name":"Dejonghe, Wim","last_name":"Dejonghe","first_name":"Wim"},{"first_name":"Isha","full_name":"Sharma, Isha","last_name":"Sharma"},{"full_name":"Denoo, Bram","last_name":"Denoo","first_name":"Bram"},{"last_name":"De Munck","full_name":"De Munck, Steven","first_name":"Steven"},{"first_name":"Qing","full_name":"Lu, Qing","last_name":"Lu"},{"first_name":"Kiril","full_name":"Mishev, Kiril","last_name":"Mishev"},{"first_name":"Haydar","last_name":"Bulut","full_name":"Bulut, Haydar"},{"last_name":"Mylle","full_name":"Mylle, Evelien","first_name":"Evelien"},{"full_name":"De Rycke, Riet","last_name":"De Rycke","first_name":"Riet"},{"last_name":"Vasileva","full_name":"Vasileva, Mina K","id":"3407EB18-F248-11E8-B48F-1D18A9856A87","first_name":"Mina K"},{"first_name":"Daniel V.","full_name":"Savatin, Daniel V.","last_name":"Savatin"},{"first_name":"Wim","full_name":"Nerinckx, Wim","last_name":"Nerinckx"},{"full_name":"Staes, An","last_name":"Staes","first_name":"An"},{"last_name":"Drozdzecki","full_name":"Drozdzecki, Andrzej","first_name":"Andrzej"},{"full_name":"Audenaert, Dominique","last_name":"Audenaert","first_name":"Dominique"},{"last_name":"Yperman","full_name":"Yperman, Klaas","first_name":"Klaas"},{"first_name":"Annemieke","last_name":"Madder","full_name":"Madder, Annemieke"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml"},{"first_name":"Daniël","full_name":"Van Damme, Daniël","last_name":"Van Damme"},{"full_name":"Gevaert, Kris","last_name":"Gevaert","first_name":"Kris"},{"last_name":"Haucke","full_name":"Haucke, Volker","first_name":"Volker"},{"first_name":"Savvas N.","last_name":"Savvides","full_name":"Savvides, Savvas N."},{"first_name":"Johan","full_name":"Winne, Johan","last_name":"Winne"},{"full_name":"Russinova, Eugenia","last_name":"Russinova","first_name":"Eugenia"}],"title":"Disruption of endocytosis through chemical inhibition of clathrin heavy chain function"},{"related_material":{"record":[{"status":"public","id":"1096","relation":"dissertation_contains"},{"relation":"part_of_dissertation","id":"7001","status":"public"}]},"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/zip","access_level":"closed","relation":"source_file","file_id":"7194","checksum":"585583c1c875c5d9525703a539668a7c","date_updated":"2020-07-14T12:47:52Z","file_size":19431292,"creator":"cschwayer","date_created":"2019-12-19T15:18:11Z","file_name":"DocumentSourceFiles.zip"},{"file_name":"Thesis_CS_final.pdf","date_created":"2019-12-19T15:19:21Z","file_size":19226428,"date_updated":"2020-07-14T12:47:52Z","creator":"cschwayer","checksum":"9b9b24351514948d27cec659e632e2cd","file_id":"7195","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"alternative_title":["ISTA Thesis"],"month":"12","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"EM-Fac"},{"_id":"SSU"}],"abstract":[{"lang":"eng","text":"Tissue morphogenesis in developmental or physiological processes is regulated by molecular\r\nand mechanical signals. While the molecular signaling cascades are increasingly well\r\ndescribed, the mechanical signals affecting tissue shape changes have only recently been\r\nstudied in greater detail. To gain more insight into the mechanochemical and biophysical\r\nbasis of an epithelial spreading process (epiboly) in early zebrafish development, we studied\r\ncell-cell junction formation and actomyosin network dynamics at the boundary between\r\nsurface layer epithelial cells (EVL) and the yolk syncytial layer (YSL). During zebrafish epiboly,\r\nthe cell mass sitting on top of the yolk cell spreads to engulf the yolk cell by the end of\r\ngastrulation. It has been previously shown that an actomyosin ring residing within the YSL\r\npulls on the EVL tissue through a cable-constriction and a flow-friction motor, thereby\r\ndragging the tissue vegetal wards. Pulling forces are likely transmitted from the YSL\r\nactomyosin ring to EVL cells; however, the nature and formation of the junctional structure\r\nmediating this process has not been well described so far. Therefore, our main aim was to\r\ndetermine the nature, dynamics and potential function of the EVL-YSL junction during this\r\nepithelial tissue spreading. Specifically, we show that the EVL-YSL junction is a\r\nmechanosensitive structure, predominantly made of tight junction (TJ) proteins. The process\r\nof TJ mechanosensation depends on the retrograde flow of non-junctional, phase-separated\r\nZonula Occludens-1 (ZO-1) protein clusters towards the EVL-YSL boundary. Interestingly, we\r\ncould demonstrate that ZO-1 is present in a non-junctional pool on the surface of the yolk\r\ncell, and ZO-1 undergoes a phase separation process that likely renders the protein\r\nresponsive to flows. These flows are directed towards the junction and mediate proper\r\ntension-dependent recruitment of ZO-1. Upon reaching the EVL-YSL junction ZO-1 gets\r\nincorporated into the junctional pool mediated through its direct actin-binding domain.\r\nWhen the non-junctional pool and/or ZO-1 direct actin binding is absent, TJs fail in their\r\nproper mechanosensitive responses resulting in slower tissue spreading. We could further\r\ndemonstrate that depletion of ZO proteins within the YSL results in diminished actomyosin\r\nring formation. This suggests that a mechanochemical feedback loop is at work during\r\nzebrafish epiboly: ZO proteins help in proper actomyosin ring formation and actomyosin\r\ncontractility and flows positively influence ZO-1 junctional recruitment. Finally, such a\r\nmesoscale polarization process mediated through the flow of phase-separated protein\r\nclusters might have implications for other processes such as immunological synapse\r\nformation, C. elegans zygote polarization and wound healing."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:52Z","department":[{"_id":"CaHe"}],"date_updated":"2023-09-07T12:56:42Z","supervisor":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"ddc":["570"],"type":"dissertation","status":"public","_id":"7186","page":"107","date_created":"2019-12-16T14:26:14Z","doi":"10.15479/AT:ISTA:7186","date_published":"2019-12-16T00:00:00Z","year":"2019","has_accepted_license":"1","day":"16","oa":1,"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","author":[{"first_name":"Cornelia","id":"3436488C-F248-11E8-B48F-1D18A9856A87","last_name":"Schwayer","orcid":"0000-0001-5130-2226","full_name":"Schwayer, Cornelia"}],"title":"Mechanosensation of tight junctions depends on ZO-1 phase separation and flow","citation":{"mla":"Schwayer, Cornelia. Mechanosensation of Tight Junctions Depends on ZO-1 Phase Separation and Flow. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:7186.","short":"C. Schwayer, Mechanosensation of Tight Junctions Depends on ZO-1 Phase Separation and Flow, Institute of Science and Technology Austria, 2019.","ieee":"C. Schwayer, “Mechanosensation of tight junctions depends on ZO-1 phase separation and flow,” Institute of Science and Technology Austria, 2019.","ama":"Schwayer C. Mechanosensation of tight junctions depends on ZO-1 phase separation and flow. 2019. doi:10.15479/AT:ISTA:7186","apa":"Schwayer, C. (2019). Mechanosensation of tight junctions depends on ZO-1 phase separation and flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7186","chicago":"Schwayer, Cornelia. “Mechanosensation of Tight Junctions Depends on ZO-1 Phase Separation and Flow.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:7186.","ista":"Schwayer C. 2019. Mechanosensation of tight junctions depends on ZO-1 phase separation and flow. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"title":"Algorithmic aspects of homotopy theory and embeddability","article_processing_charge":"No","author":[{"first_name":"Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","full_name":"Zhechev, Stephan Y","last_name":"Zhechev"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"S. Y. Zhechev, “Algorithmic aspects of homotopy theory and embeddability,” Institute of Science and Technology Austria, 2019.","short":"S.Y. Zhechev, Algorithmic Aspects of Homotopy Theory and Embeddability, Institute of Science and Technology Austria, 2019.","apa":"Zhechev, S. Y. (2019). Algorithmic aspects of homotopy theory and embeddability. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6681","ama":"Zhechev SY. Algorithmic aspects of homotopy theory and embeddability. 2019. doi:10.15479/AT:ISTA:6681","mla":"Zhechev, Stephan Y. Algorithmic Aspects of Homotopy Theory and Embeddability. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6681.","ista":"Zhechev SY. 2019. Algorithmic aspects of homotopy theory and embeddability. Institute of Science and Technology Austria.","chicago":"Zhechev, Stephan Y. “Algorithmic Aspects of Homotopy Theory and Embeddability.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6681."},"oa":1,"publisher":"Institute of Science and Technology Austria","date_created":"2019-07-26T11:14:34Z","date_published":"2019-08-08T00:00:00Z","doi":"10.15479/AT:ISTA:6681","page":"104","day":"08","year":"2019","has_accepted_license":"1","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","_id":"6681","file_date_updated":"2020-07-14T12:47:37Z","department":[{"_id":"UlWa"}],"ddc":["514"],"date_updated":"2023-09-07T13:10:36Z","supervisor":[{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"month":"08","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The first part of the thesis considers the computational aspects of the homotopy groups πd(X) of a topological space X. It is well known that there is no algorithm to decide whether the fundamental group π1(X) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with π1(X) trivial), compute the higher homotopy group πd(X) for any given d ≥ 2.\r\nHowever, these algorithms come with a caveat: They compute the isomorphism type of πd(X), d ≥ 2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of πd(X). We present an algorithm that, given a simply connected space X, computes πd(X) and represents its elements as simplicial maps from suitable triangulations of the d-sphere Sd to X. For fixed d, the algorithm runs in time exponential in size(X), the number of simplices of X. Moreover, we prove that this is optimal: For every fixed d ≥ 2,\r\nwe construct a family of simply connected spaces X such that for any simplicial map representing a generator of πd(X), the size of the triangulation of S d on which the map is defined, is exponential in size(X).\r\nIn the second part of the thesis, we prove that the following question is algorithmically undecidable for d < ⌊3(k+1)/2⌋, k ≥ 5 and (k, d) ̸= (5, 7), which covers essentially everything outside the meta-stable range: Given a finite simplicial complex K of dimension k, decide whether there exists a piecewise-linear (i.e., linear on an arbitrarily fine subdivision of K) embedding f : K ↪→ Rd of K into a d-dimensional Euclidean space."}],"related_material":{"record":[{"status":"public","id":"6774","relation":"part_of_dissertation"}]},"language":[{"iso":"eng"}],"file":[{"file_name":"Stephan_Zhechev_thesis.pdf","date_created":"2019-08-07T13:02:50Z","file_size":1464227,"date_updated":"2020-07-14T12:47:37Z","creator":"szhechev","file_id":"6771","checksum":"3231e7cbfca3b5687366f84f0a57a0c0","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"relation":"source_file","access_level":"closed","content_type":"application/octet-stream","file_id":"6772","checksum":"85d65eb27b4377a9e332ee37a70f08b6","creator":"szhechev","file_size":303988,"date_updated":"2020-07-14T12:47:37Z","file_name":"Stephan_Zhechev_thesis.tex","date_created":"2019-08-07T13:03:22Z"},{"date_created":"2019-08-07T13:03:34Z","file_name":"supplementary_material.zip","creator":"szhechev","date_updated":"2020-07-14T12:47:37Z","file_size":1087004,"checksum":"86b374d264ca2dd53e712728e253ee75","file_id":"6773","access_level":"closed","relation":"supplementary_material","content_type":"application/zip"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]}},{"status":"public","project":[{"call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory"}],"type":"preprint","article_number":"1910.12628","_id":"8182","title":"Vanishing of all equivariant obstructions and the mapping degree","department":[{"_id":"UlWa"}],"article_processing_charge":"No","external_id":{"arxiv":["1910.12628"]},"author":[{"last_name":"Avvakumov","full_name":"Avvakumov, Sergey","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kudrya, Sergey","last_name":"Kudrya","first_name":"Sergey","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T13:12:17Z","citation":{"chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv. arXiv, n.d.","ista":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv, 1910.12628.","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, 1910.12628, arXiv.","short":"S. Avvakumov, S. Kudrya, ArXiv (n.d.).","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” arXiv. arXiv.","ama":"Avvakumov S, Kudrya S. 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. arXiv."},"month":"10","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1910.12628","open_access":"1"}],"publisher":"arXiv","oa_version":"Preprint","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."}],"date_created":"2020-07-30T10:45:08Z","date_published":"2019-10-28T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"11446"},{"id":"8156","status":"public","relation":"dissertation_contains"}]},"publication":"arXiv","language":[{"iso":"eng"}],"day":"28","year":"2019","publication_status":"submitted"}]