[{"month":"04","department":[{"_id":"FrLo"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2107.05686"}],"title":"The role of pretrained representations for the OOD generalization of reinforcement learning agents","day":"25","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Virtual","name":"ICLR: International Conference on Learning Representations","start_date":"2022-04-25","end_date":"2022-04-29"},"citation":{"ieee":"A. Dittadi et al., “The role of pretrained representations for the OOD generalization of  reinforcement learning agents,” in 10th International Conference on Learning Representations, Virtual, 2022.","mla":"Dittadi, Andrea, et al. “The Role of Pretrained Representations for the OOD Generalization of  Reinforcement Learning Agents.” 10th International Conference on Learning Representations, 2022.","apa":"Dittadi, A., Träuble, F., Wüthrich, M., Widmaier, F., Gehler, P., Winther, O., … Bauer, S. (2022). The role of pretrained representations for the OOD generalization of  reinforcement learning agents. In 10th International Conference on Learning Representations. Virtual.","short":"A. Dittadi, F. Träuble, M. Wüthrich, F. Widmaier, P. Gehler, O. Winther, F. Locatello, O. Bachem, B. Schölkopf, S. Bauer, in:, 10th International Conference on Learning Representations, 2022.","chicago":"Dittadi, Andrea, Frederik Träuble, Manuel Wüthrich, Felix Widmaier, Peter Gehler, Ole Winther, Francesco Locatello, Olivier Bachem, Bernhard Schölkopf, and Stefan Bauer. “The Role of Pretrained Representations for the OOD Generalization of  Reinforcement Learning Agents.” In 10th International Conference on Learning Representations, 2022.","ista":"Dittadi A, Träuble F, Wüthrich M, Widmaier F, Gehler P, Winther O, Locatello F, Bachem O, Schölkopf B, Bauer S. 2022. The role of pretrained representations for the OOD generalization of  reinforcement learning agents. 10th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Dittadi A, Träuble F, Wüthrich M, et al. The role of pretrained representations for the OOD generalization of  reinforcement learning agents. In: 10th International Conference on Learning Representations. ; 2022."},"publication":"10th International Conference on Learning Representations","external_id":{"arxiv":["2107.05686"]},"abstract":[{"text":"Building sample-efficient agents that generalize out-of-distribution (OOD) in real-world settings remains a fundamental unsolved problem on the path towards achieving higher-level cognition. One particularly promising approach is to begin with low-dimensional, pretrained representations of our world, which should facilitate efficient downstream learning and generalization. By training 240 representations and over 10,000 reinforcement learning (RL) policies on a simulated robotic setup, we evaluate to what extent different properties of\r\npretrained VAE-based representations affect the OOD generalization of downstream agents. We observe that many agents are surprisingly robust to realistic distribution shifts, including the challenging sim-to-real case. In addition, we find that the generalization performance of a simple downstream proxy task reliably predicts the generalization performance of our RL agents\r\nunder a wide range of OOD settings. Such proxy tasks can thus be used to select pretrained representations that will lead to agents that generalize.","lang":"eng"}],"date_created":"2023-08-22T14:02:13Z","language":[{"iso":"eng"}],"_id":"14174","article_processing_charge":"No","oa":1,"oa_version":"Preprint","status":"public","extern":"1","date_published":"2022-04-25T00:00:00Z","year":"2022","publication_status":"published","date_updated":"2023-09-11T09:48:36Z","quality_controlled":"1","author":[{"last_name":"Dittadi","first_name":"Andrea","full_name":"Dittadi, Andrea"},{"full_name":"Träuble, Frederik","first_name":"Frederik","last_name":"Träuble"},{"full_name":"Wüthrich, Manuel","first_name":"Manuel","last_name":"Wüthrich"},{"full_name":"Widmaier, Felix","last_name":"Widmaier","first_name":"Felix"},{"full_name":"Gehler, Peter","last_name":"Gehler","first_name":"Peter"},{"full_name":"Winther, Ole","first_name":"Ole","last_name":"Winther"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Bauer, Stefan","last_name":"Bauer","first_name":"Stefan"}]},{"quality_controlled":"1","author":[{"last_name":"Makansi","first_name":"Osama","full_name":"Makansi, Osama"},{"full_name":"Kügelgen, Julius von","last_name":"Kügelgen","first_name":"Julius von"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"last_name":"Gehler","first_name":"Peter","full_name":"Gehler, Peter"},{"full_name":"Janzing, Dominik","first_name":"Dominik","last_name":"Janzing"},{"full_name":"Brox, Thomas","last_name":"Brox","first_name":"Thomas"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"}],"date_published":"2022-04-25T00:00:00Z","year":"2022","publication_status":"published","date_updated":"2023-09-11T09:52:20Z","oa":1,"oa_version":"Preprint","status":"public","extern":"1","language":[{"iso":"eng"}],"date_created":"2023-08-22T14:02:34Z","_id":"14175","article_processing_charge":"No","publication":"10th International Conference on Learning Representations","external_id":{"arxiv":["2110.05304"]},"abstract":[{"lang":"eng","text":"Predicting the future trajectory of a moving agent can be easy when the past trajectory continues smoothly but is challenging when complex interactions with other agents are involved. Recent deep learning approaches for trajectory prediction show promising performance and partially attribute this to successful reasoning about agent-agent interactions. However, it remains unclear which features such black-box models actually learn to use for making predictions. This paper proposes a procedure that quantifies the contributions\r\nof different cues to model performance based on a variant of Shapley values. Applying this procedure to state-of-the-art trajectory prediction methods on standard benchmark datasets shows that they are, in fact, unable to reason about interactions. Instead, the past trajectory of the target is the only feature used for predicting its future. For a task with richer social\r\ninteraction patterns, on the other hand, the tested models do pick up such interactions to a certain extent, as quantified by our feature attribution method. We discuss the limits of the proposed method and its links to causality."}],"conference":{"end_date":"2022-04-29","start_date":"2022-04-25","name":"ICLR: International Conference on Learning Representations","location":"Virtual"},"citation":{"ama":"Makansi O, Kügelgen J von, Locatello F, et al. You mostly walk alone: Analyzing feature attribution in trajectory prediction. In: 10th International Conference on Learning Representations. ; 2022.","chicago":"Makansi, Osama, Julius von Kügelgen, Francesco Locatello, Peter Gehler, Dominik Janzing, Thomas Brox, and Bernhard Schölkopf. “You Mostly Walk Alone: Analyzing Feature Attribution in Trajectory Prediction.” In 10th International Conference on Learning Representations, 2022.","ista":"Makansi O, Kügelgen J von, Locatello F, Gehler P, Janzing D, Brox T, Schölkopf B. 2022. You mostly walk alone: Analyzing feature attribution in trajectory prediction. 10th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","short":"O. Makansi, J. von Kügelgen, F. Locatello, P. Gehler, D. Janzing, T. Brox, B. Schölkopf, in:, 10th International Conference on Learning Representations, 2022.","apa":"Makansi, O., Kügelgen, J. von, Locatello, F., Gehler, P., Janzing, D., Brox, T., & Schölkopf, B. (2022). You mostly walk alone: Analyzing feature attribution in trajectory prediction. In 10th International Conference on Learning Representations. Virtual.","mla":"Makansi, Osama, et al. “You Mostly Walk Alone: Analyzing Feature Attribution in Trajectory Prediction.” 10th International Conference on Learning Representations, 2022.","ieee":"O. Makansi et al., “You mostly walk alone: Analyzing feature attribution in trajectory prediction,” in 10th International Conference on Learning Representations, Virtual, 2022."},"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2110.05304"}],"title":"You mostly walk alone: Analyzing feature attribution in trajectory prediction","type":"conference","day":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","department":[{"_id":"FrLo"}]},{"article_processing_charge":"No","date_created":"2023-08-22T14:21:47Z","language":[{"iso":"eng"}],"_id":"14215","oa_version":"Preprint","status":"public","extern":"1","oa":1,"year":"2022","publication_status":"submitted","date_updated":"2023-09-13T09:35:59Z","date_published":"2022-11-04T00:00:00Z","quality_controlled":"1","author":[{"full_name":"Rahaman, Nasim","first_name":"Nasim","last_name":"Rahaman"},{"last_name":"Weiss","first_name":"Martin","full_name":"Weiss, Martin"},{"first_name":"Frederik","last_name":"Träuble","full_name":"Träuble, Frederik"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"last_name":"Lacoste","first_name":"Alexandre","full_name":"Lacoste, Alexandre"},{"first_name":"Yoshua","last_name":"Bengio","full_name":"Bengio, Yoshua"},{"first_name":"Chris","last_name":"Pal","full_name":"Pal, Chris"},{"last_name":"Li","first_name":"Li Erran","full_name":"Li, Li Erran"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"}],"month":"11","department":[{"_id":"FrLo"}],"title":"A general purpose neural architecture for geospatial systems","type":"conference","day":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.02348","open_access":"1"}],"arxiv":1,"citation":{"ista":"Rahaman N, Weiss M, Träuble F, Locatello F, Lacoste A, Bengio Y, Pal C, Li LE, Schölkopf B. A general purpose neural architecture for geospatial systems. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","ama":"Rahaman N, Weiss M, Träuble F, et al. A general purpose neural architecture for geospatial systems. In: 36th Conference on Neural Information Processing Systems.","chicago":"Rahaman, Nasim, Martin Weiss, Frederik Träuble, Francesco Locatello, Alexandre Lacoste, Yoshua Bengio, Chris Pal, Li Erran Li, and Bernhard Schölkopf. “A General Purpose Neural Architecture for Geospatial Systems.” In 36th Conference on Neural Information Processing Systems, n.d.","apa":"Rahaman, N., Weiss, M., Träuble, F., Locatello, F., Lacoste, A., Bengio, Y., … Schölkopf, B. (n.d.). A general purpose neural architecture for geospatial systems. In 36th Conference on Neural Information Processing Systems. New Orleans, LA, United States.","short":"N. Rahaman, M. Weiss, F. Träuble, F. Locatello, A. Lacoste, Y. Bengio, C. Pal, L.E. Li, B. Schölkopf, in:, 36th Conference on Neural Information Processing Systems, n.d.","mla":"Rahaman, Nasim, et al. “A General Purpose Neural Architecture for Geospatial Systems.” 36th Conference on Neural Information Processing Systems.","ieee":"N. Rahaman et al., “A general purpose neural architecture for geospatial systems,” in 36th Conference on Neural Information Processing Systems, New Orleans, LA, United States."},"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2022-11-28","location":"New Orleans, LA, United States","end_date":"2022-12-09"},"external_id":{"arxiv":["2211.02348"]},"abstract":[{"lang":"eng","text":"Geospatial Information Systems are used by researchers and Humanitarian Assistance and Disaster Response (HADR) practitioners to support a wide variety of important applications. However, collaboration between these actors is difficult due to the heterogeneous nature of geospatial data modalities (e.g., multi-spectral images of various resolutions, timeseries, weather data) and diversity of tasks (e.g., regression of human activity indicators or detecting forest fires). In this work, we present a roadmap towards the construction of a general-purpose neural architecture (GPNA) with a geospatial inductive bias, pre-trained on large amounts of unlabelled earth observation data in a self-supervised manner. We envision how such a model may facilitate cooperation between members of the community. We show preliminary results on the first step of the roadmap, where we instantiate an architecture that can process a wide variety of geospatial data modalities and demonstrate that it can achieve competitive performance with domain-specific architectures on tasks relating to the U.N.'s Sustainable Development Goals."}],"publication":"36th Conference on Neural Information Processing Systems"},{"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2210.01738","open_access":"1"}],"type":"preprint","day":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"ASIF: Coupled data turns unimodal models to multimodal without training","department":[{"_id":"FrLo"}],"month":"10","publication":"arXiv","abstract":[{"text":"CLIP proved that aligning visual and language spaces is key to solving many vision tasks without explicit training, but required to train image and text encoders from scratch on a huge dataset. LiT improved this by only training the text encoder and using a pre-trained vision network. In this paper, we show that a common space can be created without any training at all, using single-domain encoders (trained with or without supervision) and a much smaller amount of image-text pairs. Furthermore, our model has unique properties. Most notably, deploying a new version with updated training samples can be done in a matter of seconds. Additionally, the representations in the common space are easily interpretable as every dimension corresponds to the similarity of the input to a unique entry in the multimodal dataset. Experiments on standard zero-shot visual benchmarks demonstrate the typical transfer ability of image-text models. Overall, our method represents a simple yet surprisingly strong baseline for foundation multi-modal models, raising important questions on their data efficiency and on the role of retrieval in machine learning.","lang":"eng"}],"external_id":{"arxiv":["2210.01738"]},"doi":"10.48550/arXiv.2210.01738","citation":{"ieee":"A. Norelli, M. Fumero, V. Maiorca, L. Moschella, E. Rodolà, and F. Locatello, “ASIF: Coupled data turns unimodal models to multimodal without training,” arXiv. .","short":"A. Norelli, M. Fumero, V. Maiorca, L. Moschella, E. Rodolà, F. Locatello, ArXiv (n.d.).","apa":"Norelli, A., Fumero, M., Maiorca, V., Moschella, L., Rodolà, E., & Locatello, F. (n.d.). ASIF: Coupled data turns unimodal models to multimodal without training. arXiv. https://doi.org/10.48550/arXiv.2210.01738","mla":"Norelli, Antonio, et al. “ASIF: Coupled Data Turns Unimodal Models to Multimodal without Training.” ArXiv, 2210.01738, doi:10.48550/arXiv.2210.01738.","ama":"Norelli A, Fumero M, Maiorca V, Moschella L, Rodolà E, Locatello F. ASIF: Coupled data turns unimodal models to multimodal without training. arXiv. doi:10.48550/arXiv.2210.01738","chicago":"Norelli, Antonio, Marco Fumero, Valentino Maiorca, Luca Moschella, Emanuele Rodolà, and Francesco Locatello. “ASIF: Coupled Data Turns Unimodal Models to Multimodal without Training.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2210.01738.","ista":"Norelli A, Fumero M, Maiorca V, Moschella L, Rodolà E, Locatello F. ASIF: Coupled data turns unimodal models to multimodal without training. arXiv, 2210.01738."},"oa":1,"status":"public","oa_version":"Preprint","article_number":"2210.01738","_id":"14216","date_created":"2023-08-22T14:22:04Z","language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"last_name":"Norelli","first_name":"Antonio","full_name":"Norelli, Antonio"},{"last_name":"Fumero","first_name":"Marco","full_name":"Fumero, Marco"},{"last_name":"Maiorca","first_name":"Valentino","full_name":"Maiorca, Valentino"},{"last_name":"Moschella","first_name":"Luca","full_name":"Moschella, Luca"},{"first_name":"Emanuele","last_name":"Rodolà","full_name":"Rodolà, Emanuele"},{"first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"}],"date_published":"2022-10-04T00:00:00Z","date_updated":"2024-02-12T09:57:14Z","year":"2022","publication_status":"submitted"},{"publication":"arXiv","abstract":[{"lang":"eng","text":"Although reinforcement learning has seen remarkable progress over the last years, solving robust dexterous object-manipulation tasks in multi-object settings remains a challenge. In this paper, we focus on models that can learn manipulation tasks in fixed multi-object settings and extrapolate this skill zero-shot without any drop in performance when the number of objects changes. We consider the generic task of bringing a specific cube out of a set to a goal position. We find that previous approaches, which primarily leverage attention and graph neural network-based architectures, do not generalize their skills when the number of input objects changes while scaling as K2. We propose an alternative plug-and-play module based on relational inductive biases to overcome these limitations. Besides exceeding performances in their training environment, we show that our approach, which scales linearly in K, allows agents to extrapolate and generalize zero-shot to any new object number."}],"external_id":{"arxiv":["2201.13388"]},"doi":"10.48550/arXiv.2201.13388","citation":{"ieee":"D. Mambelli, F. Träuble, S. Bauer, B. Schölkopf, and F. Locatello, “Compositional multi-object reinforcement learning with linear relation networks,” arXiv. .","ama":"Mambelli D, Träuble F, Bauer S, Schölkopf B, Locatello F. Compositional multi-object reinforcement learning with linear relation networks. arXiv. doi:10.48550/arXiv.2201.13388","ista":"Mambelli D, Träuble F, Bauer S, Schölkopf B, Locatello F. Compositional multi-object reinforcement learning with linear relation networks. arXiv, 2201.13388.","chicago":"Mambelli, Davide, Frederik Träuble, Stefan Bauer, Bernhard Schölkopf, and Francesco Locatello. “Compositional Multi-Object Reinforcement Learning with Linear Relation Networks.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2201.13388.","apa":"Mambelli, D., Träuble, F., Bauer, S., Schölkopf, B., & Locatello, F. (n.d.). Compositional multi-object reinforcement learning with linear relation networks. arXiv. https://doi.org/10.48550/arXiv.2201.13388","short":"D. Mambelli, F. Träuble, S. Bauer, B. Schölkopf, F. Locatello, ArXiv (n.d.).","mla":"Mambelli, Davide, et al. “Compositional Multi-Object Reinforcement Learning with Linear Relation Networks.” ArXiv, 2201.13388, doi:10.48550/arXiv.2201.13388."},"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2201.13388","open_access":"1"}],"type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"31","title":"Compositional multi-object reinforcement learning with linear relation networks","month":"01","department":[{"_id":"FrLo"}],"author":[{"first_name":"Davide","last_name":"Mambelli","full_name":"Mambelli, Davide"},{"full_name":"Träuble, Frederik","last_name":"Träuble","first_name":"Frederik"},{"full_name":"Bauer, Stefan","first_name":"Stefan","last_name":"Bauer"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"}],"date_published":"2022-01-31T00:00:00Z","date_updated":"2023-09-11T11:49:40Z","year":"2022","publication_status":"submitted","oa":1,"status":"public","extern":"1","oa_version":"Preprint","_id":"14220","article_number":"2201.13388","language":[{"iso":"eng"}],"date_created":"2023-08-22T14:23:16Z","article_processing_charge":"No"},{"doi":"10.48550/arXiv.2211.09606","citation":{"short":"G. Goranci, M.H. Henzinger, ArXiv (n.d.).","mla":"Goranci, Gramoz, and Monika H. Henzinger. “Incremental Approximate Maximum Flow in M1/2+o(1) Update Time.” ArXiv, 2211.09606, doi:10.48550/arXiv.2211.09606.","apa":"Goranci, G., & Henzinger, M. H. (n.d.). Incremental approximate maximum flow in m1/2+o(1) update time. arXiv. https://doi.org/10.48550/arXiv.2211.09606","chicago":"Goranci, Gramoz, and Monika H Henzinger. “Incremental Approximate Maximum Flow in M1/2+o(1) Update Time.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2211.09606.","ista":"Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. arXiv, 2211.09606.","ama":"Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. arXiv. doi:10.48550/arXiv.2211.09606","ieee":"G. Goranci and M. H. Henzinger, “Incremental approximate maximum flow in m1/2+o(1) update time,” arXiv. ."},"publication":"arXiv","external_id":{"arxiv":["2211.09606"]},"abstract":[{"text":"We show an $(1+\\epsilon)$-approximation algorithm for maintaining maximum $s$-$t$ flow under $m$ edge insertions in $m^{1/2+o(1)} \\epsilon^{-1/2}$ amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee.","lang":"eng"}],"month":"11","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.09606"}],"title":"Incremental approximate maximum flow in m1/2+o(1) update time","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"17","type":"preprint","date_published":"2022-11-17T00:00:00Z","publication_status":"submitted","year":"2022","date_updated":"2023-09-04T08:31:19Z","author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"language":[{"iso":"eng"}],"date_created":"2023-08-25T15:04:29Z","_id":"14236","article_number":"2211.09606","article_processing_charge":"No","oa":1,"oa_version":"Preprint","status":"public","extern":"1"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","oa":1,"extern":"1","status":"public","oa_version":"Published Version","date_published":"2022-02-13T00:00:00Z","publication_status":"published","publication_identifier":{"issn":["2576-3725"]},"year":"2022","page":"24-51","publisher":"California State University","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://journals.calstate.edu/pump/article/view/2711"}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Affine dimers from characteristic polygons","publication":"PUMP Journal of Undergraduate Research","abstract":[{"text":"Recent work by Forsgård indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the classication of convex lattice polygons arising as characteristic polygons of affine dimers. We present several general constructions of new affine dimers from old, and an algorithm for finding affine dimers with prescribed polygon.\r\n\r\nWith these tools we prove that all lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer.","lang":"eng"}],"_id":"14248","date_created":"2023-08-29T13:08:09Z","volume":5,"date_updated":"2023-09-05T09:28:32Z","keyword":["dimer model","hyperplane arrangement","torus","lattice polygon"],"author":[{"full_name":"Holmes, Daniel","first_name":"Daniel","last_name":"Holmes","id":"3a443b4c-080d-11ed-979a-feb062bdcee0"}],"article_type":"original","month":"02","arxiv":1,"day":"13","intvolume":" 5","citation":{"chicago":"Holmes, Daniel. “Affine Dimers from Characteristic Polygons.” PUMP Journal of Undergraduate Research. California State University, 2022.","ista":"Holmes D. 2022. Affine dimers from characteristic polygons. PUMP Journal of Undergraduate Research. 5, 24–51.","ama":"Holmes D. Affine dimers from characteristic polygons. PUMP Journal of Undergraduate Research. 2022;5:24-51.","mla":"Holmes, Daniel. “Affine Dimers from Characteristic Polygons.” PUMP Journal of Undergraduate Research, vol. 5, California State University, 2022, pp. 24–51.","apa":"Holmes, D. (2022). Affine dimers from characteristic polygons. PUMP Journal of Undergraduate Research. California State University.","short":"D. Holmes, PUMP Journal of Undergraduate Research 5 (2022) 24–51.","ieee":"D. Holmes, “Affine dimers from characteristic polygons,” PUMP Journal of Undergraduate Research, vol. 5. California State University, pp. 24–51, 2022."},"external_id":{"arxiv":["2110.01703"]}},{"volume":16,"acknowledgement":"The authors are very grateful to Will Sawin for useful remarks about this topic. While working on this paper the first two authors were supported by EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35.","issue":"10","date_created":"2021-02-25T09:56:57Z","_id":"9199","article_type":"original","author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"full_name":"Horesh, Tal","first_name":"Tal","id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","last_name":"Horesh"},{"orcid":"0000-0001-7302-8256","full_name":"Wilsch, Florian Alexander","last_name":"Wilsch","id":"560601DA-8D36-11E9-A136-7AC1E5697425","first_name":"Florian Alexander"}],"date_updated":"2023-08-02T06:46:38Z","intvolume":" 16","day":"01","arxiv":1,"isi":1,"month":"12","department":[{"_id":"TiBr"}],"external_id":{"arxiv":["2102.11552"],"isi":["000961514100004"]},"citation":{"ieee":"T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness on Grassmannians,” Algebra & Number Theory, vol. 16, no. 10. Mathematical Sciences Publishers, pp. 2385–2407, 2022.","mla":"Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.” Algebra & Number Theory, vol. 16, no. 10, Mathematical Sciences Publishers, 2022, pp. 2385–407, doi:10.2140/ant.2022.16.2385.","short":"T.D. Browning, T. Horesh, F.A. Wilsch, Algebra & Number Theory 16 (2022) 2385–2407.","apa":"Browning, T. D., Horesh, T., & Wilsch, F. A. (2022). Equidistribution and freeness on Grassmannians. Algebra & Number Theory. Mathematical Sciences Publishers. https://doi.org/10.2140/ant.2022.16.2385","ista":"Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians. Algebra & Number Theory. 16(10), 2385–2407.","chicago":"Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution and Freeness on Grassmannians.” Algebra & Number Theory. Mathematical Sciences Publishers, 2022. https://doi.org/10.2140/ant.2022.16.2385.","ama":"Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians. Algebra & Number Theory. 2022;16(10):2385-2407. doi:10.2140/ant.2022.16.2385"},"scopus_import":"1","project":[{"grant_number":"EP-P026710-2","name":"Between rational and integral points","_id":"26A8D266-B435-11E9-9278-68D0E5697425"},{"grant_number":"P32428","call_identifier":"FWF","name":"New frontiers of the Manin conjecture","_id":"26AEDAB2-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","status":"public","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Mathematical Sciences Publishers","page":"2385-2407","publication_status":"published","year":"2022","publication_identifier":{"eissn":["1944-7833"],"issn":["1937-0652"]},"date_published":"2022-12-01T00:00:00Z","title":"Equidistribution and freeness on Grassmannians","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.11552"}],"abstract":[{"lang":"eng","text":"We associate a certain tensor product lattice to any primitive integer lattice and ask about its typical shape. These lattices are related to the tangent bundle of Grassmannians and their study is motivated by Peyre's programme on \"freeness\" for rational points of bounded height on Fano\r\nvarieties."}],"publication":"Algebra & Number Theory","doi":"10.2140/ant.2022.16.2385"},{"day":"01","intvolume":" 47","arxiv":1,"month":"02","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"isi":1,"external_id":{"isi":["000731918100001"],"arxiv":["1904.13360"]},"citation":{"ieee":"K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.","ama":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119. doi:10.1287/moor.2020.1116","ista":"Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.","chicago":"Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.","mla":"Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116.","apa":"Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116","short":"K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119."},"project":[{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"}],"scopus_import":"1","issue":"1","acknowledgement":"Partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT through grant C15E03.\r\n","volume":47,"_id":"9311","date_created":"2021-04-08T09:33:31Z","keyword":["Management Science and Operations Research","General Mathematics","Computer Science Applications"],"article_type":"original","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X"},{"first_name":"Bruno","last_name":"Ziliotto","full_name":"Ziliotto, Bruno"}],"date_updated":"2023-09-05T13:16:11Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article","title":"Finite-memory strategies in POMDPs with long-run average objectives","main_file_link":[{"url":"https://arxiv.org/abs/1904.13360","open_access":"1"}],"abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite memory. This implies notably that approximating the long-run value is recursively enumerable, as well as a weak continuity property of the value with respect to the transition function. ","lang":"eng"}],"publication":"Mathematics of Operations Research","doi":"10.1287/moor.2020.1116","status":"public","oa_version":"Preprint","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Institute for Operations Research and the Management Sciences","quality_controlled":"1","page":"100-119","year":"2022","publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"publication_status":"published","date_published":"2022-02-01T00:00:00Z"},{"quality_controlled":"1","publisher":"Cambridge University Press","page":"563 - 590","year":"2022","publication_identifier":{"eissn":["1469-8064"],"issn":["0305-0041"]},"publication_status":"published","date_published":"2022-05-01T00:00:00Z","oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"abstract":[{"text":"Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H

0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary).","lang":"eng"}],"publication":"Mathematical Proceedings of the Cambridge Philosophical Society","doi":"10.1017/S030500412100030X","title":"On the size of the maximum of incomplete Kloosterman sums","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["510"],"file":[{"relation":"main_file","date_created":"2021-12-01T14:01:54Z","checksum":"614d2e9b83a78100408e4ee7752a80a8","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","success":1,"file_name":"2021_MathProcCamPhilSoc_Bonolis.pdf","date_updated":"2021-12-01T14:01:54Z","file_id":"10395","file_size":334064}],"author":[{"id":"6A459894-5FDD-11E9-AF35-BB24E6697425","last_name":"Bonolis","first_name":"Dante","full_name":"Bonolis, Dante"}],"article_type":"original","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-02T06:47:48Z","volume":172,"acknowledgement":"I am most thankful to my advisor, Emmanuel Kowalski, for suggesting this problem and for his guidance during these years. I also would like to thank Youness Lamzouri for informing me about his work on sum of incomplete Birch sums and Tal Horesh for her suggestions on a previous version of the paper. Finally, I am very grateful to the anonymous referee for their careful reading of the manuscript and their valuable comments.","file_date_updated":"2021-12-01T14:01:54Z","issue":"3","date_created":"2021-05-02T22:01:29Z","_id":"9364","external_id":{"arxiv":["1811.10563"],"isi":["000784421500001"]},"citation":{"ieee":"D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3. Cambridge University Press, pp. 563–590, 2022.","ista":"Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590.","ama":"Bonolis D. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 2022;172(3):563-590. doi:10.1017/S030500412100030X","chicago":"Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press, 2022. https://doi.org/10.1017/S030500412100030X.","mla":"Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3, Cambridge University Press, 2022, pp. 563–90, doi:10.1017/S030500412100030X.","apa":"Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/S030500412100030X","short":"D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society 172 (2022) 563–590."},"scopus_import":"1","intvolume":" 172","day":"01","arxiv":1,"isi":1,"department":[{"_id":"TiBr"}],"month":"05"},{"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"The topological correctness of PL approximations of isomanifolds","file":[{"date_created":"2021-07-14T06:44:36Z","relation":"main_file","access_level":"open_access","creator":"mwintrae","content_type":"application/pdf","checksum":"f1d372ec3c08ec22e84f8e93e1126b8c","file_id":"9650","file_name":"Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf","date_updated":"2021-07-14T06:44:36Z","file_size":1455699}],"ddc":["516"],"publication":"Foundations of Computational Mathematics ","abstract":[{"lang":"eng","text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently\r\nfine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary."}],"doi":"10.1007/s10208-021-09520-0","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","ec_funded":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"7952","status":"public","relation":"earlier_version"}]},"article_processing_charge":"Yes (via OA deal)","page":"967-1012","publisher":"Springer Nature","quality_controlled":"1","date_published":"2022-01-01T00:00:00Z","year":"2022","publication_identifier":{"eissn":["1615-3383"]},"publication_status":"published","day":"01","intvolume":" 22","department":[{"_id":"HeEd"}],"month":"0","isi":1,"external_id":{"isi":["000673039600001"]},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"scopus_import":"1","citation":{"ama":"Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012. doi:10.1007/s10208-021-09520-0","chicago":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics . Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0.","ista":"Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.","short":"J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22 (2022) 967–1012.","apa":"Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . Springer Nature. https://doi.org/10.1007/s10208-021-09520-0","mla":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics , vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0.","ieee":"J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer Nature, pp. 967–1012, 2022."},"file_date_updated":"2021-07-14T06:44:36Z","volume":22,"acknowledgement":"First and foremost, we acknowledge Siargey Kachanovich for discussions. We thank Herbert Edelsbrunner and all members of his group, all former and current members of the Datashape team (formerly known as Geometrica), and André Lieutier for encouragement. We further thank the reviewers of Foundations of Computational Mathematics and the reviewers and program committee of the Symposium on Computational Geometry for their feedback, which improved the exposition.\r\nThis work was funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). This work was also supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411.","_id":"9649","date_created":"2021-07-14T06:44:53Z","article_type":"original","author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"date_updated":"2023-08-02T06:49:17Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"oa":1,"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"article_number":"a039859","article_processing_charge":"No","quality_controlled":"1","publisher":"Cold Spring Harbor Laboratory","date_published":"2022-05-27T00:00:00Z","publication_identifier":{"issn":["1943-0264"]},"year":"2022","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/cshperspect.a039859 "}],"title":"Fourteen stations of auxin","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","publication":"Cold Spring Harbor Perspectives in Biology","abstract":[{"lang":"eng","text":"Auxin has always been at the forefront of research in plant physiology and development. Since the earliest contemplations by Julius von Sachs and Charles Darwin, more than a century-long struggle has been waged to understand its function. This largely reflects the failures, successes, and inevitable progress in the entire field of plant signaling and development. Here I present 14 stations on our long and sometimes mystical journey to understand auxin. These highlights were selected to give a flavor of the field and to show the scope and limits of our current knowledge. A special focus is put on features that make auxin unique among phytohormones, such as its dynamic, directional transport network, which integrates external and internal signals, including self-organizing feedback. Accented are persistent mysteries and controversies. The unexpected discoveries related to rapid auxin responses and growth regulation recently disturbed our contentment regarding understanding of the auxin signaling mechanism. These new revelations, along with advances in technology, usher us into a new, exciting era in auxin research. "}],"doi":"10.1101/cshperspect.a039859 ","acknowledgement":"The author thanks the whole community of researchers consciously or unconsciously working on questions related to auxin, whose hard work and enthusiasm contributed to development of this exciting story. Particular thanks go to many\r\nbrilliant present and past members of the Friml group and our numerous excellent collaborators, without whom my own personal journey would not be possible. The way of the cross with its 14 stations is a popular devotion among Roman Catholics and inspires them to make a spiritual pilgrimage through contemplation of Christ on his last day. Its aspects of gradual progress, struggle, passion, and revelation served as an inspiration for the formal depiction of our journey to understanding auxin as described in this review. It is in no way intended to reflect the personal beliefs of the author and readers. I am grateful to Nick Barton, Eva Benková, Lenka Caisová, Matyáš Fendrych, Lukáš Fiedler, Monika Frátriková, Jarmila Frimlová, Michelle Gallei, Jakub Hajný, Lukas Hoermayer, Alexandra Mally, Ondrˇej Novák, Jan Petrášek, Aleš Pěnčík, Steffen Vanneste, Tongda Xu, and Zhenbiao Yang for their valuable comments. Special thanks go to Michelle Gallei for her invaluable assistance with the figures.","volume":14,"issue":"5","date_created":"2021-09-14T11:36:53Z","_id":"10016","author":[{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří"}],"article_type":"review","date_updated":"2023-08-02T06:54:42Z","intvolume":" 14","day":"27","isi":1,"pmid":1,"month":"05","department":[{"_id":"JiFr"}],"external_id":{"isi":["000806563000003"],"pmid":["34400554"]},"scopus_import":"1","citation":{"ieee":"J. Friml, “Fourteen stations of auxin,” Cold Spring Harbor Perspectives in Biology, vol. 14, no. 5. Cold Spring Harbor Laboratory, 2022.","chicago":"Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory, 2022. https://doi.org/10.1101/cshperspect.a039859 .","ama":"Friml J. Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. 2022;14(5). doi:10.1101/cshperspect.a039859 ","ista":"Friml J. 2022. Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. 14(5), a039859.","apa":"Friml, J. (2022). Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory. https://doi.org/10.1101/cshperspect.a039859 ","short":"J. Friml, Cold Spring Harbor Perspectives in Biology 14 (2022).","mla":"Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives in Biology, vol. 14, no. 5, a039859, Cold Spring Harbor Laboratory, 2022, doi:10.1101/cshperspect.a039859 ."}},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/S1474748022000482"}],"title":"Integral points on singular del Pezzo surfaces","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","doi":"10.1017/S1474748022000482","publication":"Journal of the Institute of Mathematics of Jussieu","abstract":[{"text":"In order to study integral points of bounded log-anticanonical height on weak del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example, we consider a quartic del Pezzo surface of singularity type A1 + A3 and prove an analogue of Manin's conjecture for integral points with respect to its singularities and its lines.","lang":"eng"}],"language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","oa":1,"oa_version":"Published Version","status":"public","date_published":"2022-11-10T00:00:00Z","year":"2022","publication_identifier":{"issn":["1474-7480"],"eissn":["1475-3030 "]},"publication_status":"epub_ahead","quality_controlled":"1","publisher":"Cambridge University Press","isi":1,"department":[{"_id":"TiBr"}],"month":"11","arxiv":1,"day":"10","project":[{"_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","name":"New frontiers of the Manin conjecture","grant_number":"P32428","call_identifier":"FWF"}],"scopus_import":"1","citation":{"chicago":"Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2022. https://doi.org/10.1017/S1474748022000482.","ama":"Derenthal U, Wilsch FA. Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. 2022. doi:10.1017/S1474748022000482","ista":"Derenthal U, Wilsch FA. 2022. Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu.","apa":"Derenthal, U., & Wilsch, F. A. (2022). Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. Cambridge University Press. https://doi.org/10.1017/S1474748022000482","mla":"Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu, Cambridge University Press, 2022, doi:10.1017/S1474748022000482.","short":"U. Derenthal, F.A. Wilsch, Journal of the Institute of Mathematics of Jussieu (2022).","ieee":"U. Derenthal and F. A. Wilsch, “Integral points on singular del Pezzo surfaces,” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2022."},"external_id":{"isi":["000881319200001"],"arxiv":["2109.06778"]},"date_created":"2021-09-15T10:06:48Z","_id":"10018","acknowledgement":"The first author was partly supported by grant DE 1646/4-2 of the Deutsche Forschungsgemeinschaft. The second author was partly supported by FWF grant P 32428-N35 and conducted part of this work as a guest at the Institut de Mathématiques de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD.","date_updated":"2023-08-02T06:55:10Z","keyword":["Integral points","del Pezzo surface","universal torsor","Manin’s conjecture"],"article_type":"original","author":[{"full_name":"Derenthal, Ulrich","first_name":"Ulrich","last_name":"Derenthal"},{"full_name":"Wilsch, Florian Alexander","orcid":"0000-0001-7302-8256","first_name":"Florian Alexander","id":"560601DA-8D36-11E9-A136-7AC1E5697425","last_name":"Wilsch"}]},{"ddc":["540"],"file":[{"file_id":"10808","date_updated":"2022-03-02T16:17:29Z","success":1,"file_name":"2022_ACSNano_Liu.pdf","file_size":9050764,"date_created":"2022-03-02T16:17:29Z","relation":"main_file","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","checksum":"74f9c1aa5f95c0b992a4328e8e0247b4"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance","doi":"10.1021/acsnano.1c06720","publication":"ACS Nano","abstract":[{"text":"SnSe has emerged as one of the most promising materials for thermoelectric energy conversion due to its extraordinary performance in its single-crystal form and its low-cost constituent elements. However, to achieve an economic impact, the polycrystalline counterpart needs to replicate the performance of the single crystal. Herein, we optimize the thermoelectric performance of polycrystalline SnSe produced by consolidating solution-processed and surface-engineered SnSe particles. In particular, the SnSe particles are coated with CdSe molecular complexes that crystallize during the sintering process, forming CdSe nanoparticles. The presence of CdSe nanoparticles inhibits SnSe grain growth during the consolidation step due to Zener pinning, yielding a material with a high density of grain boundaries. Moreover, the resulting SnSe–CdSe nanocomposites present a large number of defects at different length scales, which significantly reduce the thermal conductivity. The produced SnSe–CdSe nanocomposites exhibit thermoelectric figures of merit up to 2.2 at 786 K, which is among the highest reported for solution-processed SnSe.","lang":"eng"}],"ec_funded":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12885"}]},"article_processing_charge":"Yes (via OA deal)","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","date_published":"2022-01-25T00:00:00Z","year":"2022","publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"publication_status":"published","page":"78-88","publisher":"American Chemical Society ","quality_controlled":"1","month":"01","department":[{"_id":"MaIb"}],"pmid":1,"isi":1,"day":"25","intvolume":" 16","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020"},{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"},{"grant_number":"M02889","_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications"}],"scopus_import":"1","citation":{"ieee":"Y. Liu et al., “Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance,” ACS Nano, vol. 16, no. 1. American Chemical Society , pp. 78–88, 2022.","short":"Y. Liu, M. Calcabrini, Y. Yu, S. Lee, C. Chang, J. David, T. Ghosh, M.C. Spadaro, C. Xie, O. Cojocaru-Mirédin, J. Arbiol, M. Ibáñez, ACS Nano 16 (2022) 78–88.","mla":"Liu, Yu, et al. “Defect Engineering in Solution-Processed Polycrystalline SnSe Leads to High Thermoelectric Performance.” ACS Nano, vol. 16, no. 1, American Chemical Society , 2022, pp. 78–88, doi:10.1021/acsnano.1c06720.","apa":"Liu, Y., Calcabrini, M., Yu, Y., Lee, S., Chang, C., David, J., … Ibáñez, M. (2022). Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. American Chemical Society . https://doi.org/10.1021/acsnano.1c06720","ista":"Liu Y, Calcabrini M, Yu Y, Lee S, Chang C, David J, Ghosh T, Spadaro MC, Xie C, Cojocaru-Mirédin O, Arbiol J, Ibáñez M. 2022. Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. 16(1), 78–88.","ama":"Liu Y, Calcabrini M, Yu Y, et al. Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. 2022;16(1):78-88. doi:10.1021/acsnano.1c06720","chicago":"Liu, Yu, Mariano Calcabrini, Yuan Yu, Seungho Lee, Cheng Chang, Jérémy David, Tanmoy Ghosh, et al. “Defect Engineering in Solution-Processed Polycrystalline SnSe Leads to High Thermoelectric Performance.” ACS Nano. American Chemical Society , 2022. https://doi.org/10.1021/acsnano.1c06720."},"external_id":{"pmid":["34549956"],"isi":["000767223400008"]},"_id":"10042","date_created":"2021-09-24T07:55:12Z","issue":"1","file_date_updated":"2022-03-02T16:17:29Z","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. S.L. and M.C. received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385. J.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 665919 (P-SPHERE) cofunded by Severo Ochoa Programme. C.C. acknowledges funding from the FWF “Lise Meitner Fellowship” grant agreement M 2889-N. Y.Y. and O.C.-M. acknowledge the financial support from DFG within the project SFB 917: Nanoswitches. M.C.S. received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754510 (PROBIST) and the Severo Ochoa programme. J.D. received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 665919 (P-SPHERE) cofunded by Severo Ochoa Programme. The ICN2 is funded by the CERCA Program/Generalitat de Catalunya and by the Severo Ochoa program of the Spanish Ministry of Economy, Industry, and Competitiveness (MINECO, grant no. SEV-2017-0706). ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project NANOGEN (PID2020-116093RB-C43). This project received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No. 823717-ESTEEM3. The FIB sample preparation was conducted in the LMA-INA-Universidad de Zaragoza.","volume":16,"date_updated":"2023-08-02T14:41:05Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","keyword":["tin selenide","nanocomposite","grain growth","Zener pinning","thermoelectricity","annealing","solution processing"],"author":[{"full_name":"Liu, Yu","orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","first_name":"Yu"},{"id":"45D7531A-F248-11E8-B48F-1D18A9856A87","last_name":"Calcabrini","first_name":"Mariano","full_name":"Calcabrini, Mariano"},{"full_name":"Yu, Yuan","first_name":"Yuan","last_name":"Yu"},{"last_name":"Lee","id":"BB243B88-D767-11E9-B658-BC13E6697425","first_name":"Seungho","orcid":"0000-0002-6962-8598","full_name":"Lee, Seungho"},{"full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","last_name":"Chang","first_name":"Cheng"},{"full_name":"David, Jérémy","first_name":"Jérémy","last_name":"David"},{"first_name":"Tanmoy","last_name":"Ghosh","id":"a5fc9bc3-feff-11ea-93fe-e8015a3c7e9d","full_name":"Ghosh, Tanmoy"},{"full_name":"Spadaro, Maria Chiara","last_name":"Spadaro","first_name":"Maria Chiara"},{"first_name":"Chenyang","last_name":"Xie","full_name":"Xie, Chenyang"},{"last_name":"Cojocaru-Mirédin","first_name":"Oana","full_name":"Cojocaru-Mirédin, Oana"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"}]},{"external_id":{"isi":["000712198000001"]},"project":[{"call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"scopus_import":"1","citation":{"ista":"Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. 13, 2621–2635.","chicago":"Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and Humanized Computing. Springer Nature, 2022. https://doi.org/10.1007/s12652-021-03569-z.","ama":"Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. 2022;13:2621–2635. doi:10.1007/s12652-021-03569-z","mla":"Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and Humanized Computing, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:10.1007/s12652-021-03569-z.","short":"S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and Humanized Computing 13 (2022) 2621–2635.","apa":"Goudarzi, S., Sharif, M., & Karimipour, F. (2022). A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. Springer Nature. https://doi.org/10.1007/s12652-021-03569-z","ieee":"S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction framework for trajectory and health signal analyses,” Journal of Ambient Intelligence and Humanized Computing, vol. 13. Springer Nature, pp. 2621–2635, 2022."},"day":"01","intvolume":" 13","department":[{"_id":"HeEd"}],"month":"05","isi":1,"author":[{"last_name":"Goudarzi","first_name":"Samira","full_name":"Goudarzi, Samira"},{"full_name":"Sharif, Mohammad","first_name":"Mohammad","last_name":"Sharif"},{"full_name":"Karimipour, Farid","orcid":"0000-0001-6746-4174","id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425","last_name":"Karimipour","first_name":"Farid"}],"article_type":"original","keyword":["general computer science"],"date_updated":"2023-08-02T13:31:48Z","file_date_updated":"2022-12-20T23:30:08Z","volume":13,"acknowledgement":"The third author acknowledges the funding received from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","_id":"10208","date_created":"2021-11-02T09:28:55Z","publication":"Journal of Ambient Intelligence and Humanized Computing","abstract":[{"lang":"eng","text":"It is practical to collect a huge amount of movement data and environmental context information along with the health signals of individuals because there is the emergence of new generations of positioning and tracking technologies and rapid advancements of health sensors. The study of the relations between these datasets and their sequence similarity analysis is of interest to many applications such as health monitoring and recommender systems. However, entering all movement parameters and health signals can lead to the complexity of the problem and an increase in its computational load. In this situation, dimension reduction techniques can be used to avoid consideration of simultaneous dependent parameters in the process of similarity measurement of the trajectories. The present study provides a framework, named CaDRAW, to use spatial–temporal data and movement parameters along with independent context information in the process of measuring the similarity of trajectories. In this regard, the omission of dependent movement characteristic signals is conducted by using an unsupervised feature selection dimension reduction technique. To evaluate the effectiveness of the proposed framework, it was applied to a real contextualized movement and related health signal datasets of individuals. The results indicated the capability of the proposed framework in measuring the similarity and in decreasing the characteristic signals in such a way that the similarity results -before and after reduction of dependent characteristic signals- have small differences. The mean differences between the obtained results before and after reducing the dimension were 0.029 and 0.023 for the round path, respectively."}],"doi":"10.1007/s12652-021-03569-z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"A context-aware dimension reduction framework for trajectory and health signal analyses","file":[{"file_id":"10279","file_name":"A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence 2021 (Preprint version).pdf","date_updated":"2022-12-20T23:30:08Z","file_size":1634958,"embargo":"2022-11-12","date_created":"2021-11-12T19:38:05Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","creator":"fkarimip","checksum":"0a8961416a9bb2be5a1cebda65468bcf"}],"ddc":["000"],"page":"2621–2635","publisher":"Springer Nature","quality_controlled":"1","date_published":"2022-05-01T00:00:00Z","year":"2022","publication_status":"published","publication_identifier":{"issn":["1868-5137"],"eissn":["1868-5145"]},"oa":1,"has_accepted_license":"1","status":"public","oa_version":"Submitted Version","language":[{"iso":"eng"}],"article_processing_charge":"No"},{"author":[{"first_name":"Barbara E","id":"351ED2AA-F248-11E8-B48F-1D18A9856A87","last_name":"Casillas Perez","full_name":"Casillas Perez, Barbara E"},{"last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher"},{"full_name":"Naiser, Filip","last_name":"Naiser","first_name":"Filip"},{"first_name":"Elisabeth","id":"31757262-F248-11E8-B48F-1D18A9856A87","last_name":"Naderlinger","full_name":"Naderlinger, Elisabeth"},{"full_name":"Matas, Jiri","first_name":"Jiri","last_name":"Matas"},{"first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"}],"article_type":"original","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-14T11:45:29Z","volume":25,"acknowledgement":"The authors are grateful to G. Tkačik and V. Mireles for advice on data analyses and to A. Schloegl for help using the IST Austria HPC cluster for data processing. The authors thank J. Eilenberg for providing the fungal strain and A.V. Grasse for support with the molecular analysis. The authors also thank the Social Immunity group at IST Austria, in particular B. Milutinović, for discussions throughout and comments on the manuscript.","file_date_updated":"2022-02-03T13:37:11Z","issue":"1","date_created":"2021-11-14T23:01:25Z","_id":"10284","external_id":{"isi":["000713396100001"],"pmid":["34725912"]},"citation":{"ama":"Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies. Ecology Letters. 2022;25(1):89-100. doi:10.1111/ele.13907","chicago":"Casillas Perez, Barbara E, Christopher Pull, Filip Naiser, Elisabeth Naderlinger, Jiri Matas, and Sylvia Cremer. “Early Queen Infection Shapes Developmental Dynamics and Induces Long-Term Disease Protection in Incipient Ant Colonies.” Ecology Letters. Wiley, 2022. https://doi.org/10.1111/ele.13907.","ista":"Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. 2022. Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies. Ecology Letters. 25(1), 89–100.","apa":"Casillas Perez, B. E., Pull, C., Naiser, F., Naderlinger, E., Matas, J., & Cremer, S. (2022). Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies. Ecology Letters. Wiley. https://doi.org/10.1111/ele.13907","mla":"Casillas Perez, Barbara E., et al. “Early Queen Infection Shapes Developmental Dynamics and Induces Long-Term Disease Protection in Incipient Ant Colonies.” Ecology Letters, vol. 25, no. 1, Wiley, 2022, pp. 89–100, doi:10.1111/ele.13907.","short":"B.E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, S. Cremer, Ecology Letters 25 (2022) 89–100.","ieee":"B. E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, and S. Cremer, “Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies,” Ecology Letters, vol. 25, no. 1. Wiley, pp. 89–100, 2022."},"project":[{"grant_number":"771402","call_identifier":"H2020","_id":"2649B4DE-B435-11E9-9278-68D0E5697425","name":"Epidemics in ant societies on a chip"}],"scopus_import":"1","intvolume":" 25","day":"01","pmid":1,"isi":1,"month":"01","department":[{"_id":"SyCr"}],"quality_controlled":"1","publisher":"Wiley","page":"89-100","publication_identifier":{"issn":["1461-023X"],"eissn":["1461-0248"]},"publication_status":"published","year":"2022","date_published":"2022-01-01T00:00:00Z","oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"13061","status":"public","relation":"research_data"}]},"ec_funded":1,"abstract":[{"lang":"eng","text":"Infections early in life can have enduring effects on an organism's development and immunity. In this study, we show that this equally applies to developing ‘superorganisms’––incipient social insect colonies. When we exposed newly mated Lasius niger ant queens to a low pathogen dose, their colonies grew more slowly than controls before winter, but reached similar sizes afterwards. Independent of exposure, queen hibernation survival improved when the ratio of pupae to workers was small. Queens that reared fewer pupae before worker emergence exhibited lower pathogen levels, indicating that high brood rearing efforts interfere with the ability of the queen's immune system to suppress pathogen proliferation. Early-life queen pathogen exposure also improved the immunocompetence of her worker offspring, as demonstrated by challenging the workers to the same pathogen a year later. Transgenerational transfer of the queen's pathogen experience to her workforce can hence durably reduce the disease susceptibility of the whole superorganism."}],"publication":"Ecology Letters","doi":"10.1111/ele.13907","title":"Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","file":[{"date_created":"2022-02-03T13:37:11Z","relation":"main_file","checksum":"0bd4210400e9876609b7c538ab4f9a3c","content_type":"application/pdf","creator":"cchlebak","access_level":"open_access","date_updated":"2022-02-03T13:37:11Z","file_name":"2021_EcologyLetters_CasillasPerez.pdf","success":1,"file_id":"10721","file_size":700087}],"acknowledged_ssus":[{"_id":"ScienComp"}],"ddc":["573"]},{"ddc":["514","516"],"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1907.05055"}],"title":"Even maps, the Colin de Verdière number and representations of graphs","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1007/s00493-021-4443-7","publication":"Combinatorica","abstract":[{"text":"Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.\r\nEquality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2.","lang":"eng"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","status":"public","date_published":"2022-12-01T00:00:00Z","publication_identifier":{"issn":["0209-9683"]},"publication_status":"published","year":"2022","page":"1317-1345","quality_controlled":"1","publisher":"Springer Nature","isi":1,"department":[{"_id":"UlWa"}],"month":"12","arxiv":1,"intvolume":" 42","day":"01","scopus_import":"1","citation":{"ista":"Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 42, 1317–1345.","chicago":"Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica. Springer Nature, 2022. https://doi.org/10.1007/s00493-021-4443-7.","ama":"Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 2022;42:1317-1345. doi:10.1007/s00493-021-4443-7","mla":"Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7.","short":"V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345.","apa":"Kaluza, V., & Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-021-4443-7","ieee":"V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations of graphs,” Combinatorica, vol. 42. Springer Nature, pp. 1317–1345, 2022."},"external_id":{"isi":["000798210100003"],"arxiv":["1907.05055"]},"date_created":"2021-11-25T13:49:16Z","_id":"10335","volume":42,"acknowledgement":"V. K. gratefully acknowledges the support of Austrian Science Fund (FWF): P 30902-N35. This work was done mostly while he was employed at the University of Innsbruck. During the early stage of this research, V. K. was partially supported by Charles University project GAUK 926416. M. T. is supported by the grant no. 19-04113Y of the Czech Science Foundation(GA ˇCR) and partially supported by Charles University project UNCE/SCI/004.","date_updated":"2023-08-02T06:43:27Z","article_type":"original","author":[{"orcid":"0000-0002-2512-8698","full_name":"Kaluza, Vojtech","last_name":"Kaluza","id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","first_name":"Vojtech"},{"first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"}]},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.13378"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","publication":"IEEE Transactions on Wireless Communications","abstract":[{"text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1-1/μ + N/P log2 log2 N/P), where N is the block length of the code and μ is the scaling exponent of the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block length. This recovers a result from our earlier work. Second, in a fully-serial implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2 N). The multiplicative constant is also calculated: we show that the latency of SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P = N1/μ. The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.","lang":"eng"}],"doi":"10.1109/TWC.2021.3125626","oa":1,"status":"public","oa_version":"Preprint","related_material":{"record":[{"status":"public","id":"10053","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"article_processing_charge":"No","page":"3909-3920","publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","date_published":"2022-06-01T00:00:00Z","publication_status":"published","publication_identifier":{"eissn":["1558-2248"],"issn":["1536-1276"]},"year":"2022","arxiv":1,"day":"01","intvolume":" 21","department":[{"_id":"MaMo"}],"month":"06","isi":1,"external_id":{"arxiv":["2012.13378"],"isi":["000809406400028"]},"scopus_import":"1","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"citation":{"ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” IEEE Transactions on Wireless Communications, vol. 21, no. 6. Institute of Electrical and Electronics Engineers, pp. 3909–3920, 2022.","apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith, A. (2022). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TWC.2021.3125626","short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, IEEE Transactions on Wireless Communications 21 (2022) 3909–3920.","mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” IEEE Transactions on Wireless Communications, vol. 21, no. 6, Institute of Electrical and Electronics Engineers, 2022, pp. 3909–20, doi:10.1109/TWC.2021.3125626.","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 2022;21(6):3909-3920. doi:10.1109/TWC.2021.3125626","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” IEEE Transactions on Wireless Communications. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/TWC.2021.3125626.","ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2022. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 21(6), 3909–3920."},"issue":"6","acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli is partially\r\nsupported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by\r\nthe National Science Foundation under Grant CCF-1764104.","volume":21,"_id":"10364","date_created":"2021-11-28T23:01:29Z","article_type":"original","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"last_name":"Fazeli","first_name":"Arman","full_name":"Fazeli, Arman"},{"full_name":"Vardy, Alexander","last_name":"Vardy","first_name":"Alexander"},{"full_name":"Cioffi, John","first_name":"John","last_name":"Cioffi"},{"last_name":"Goldsmith","first_name":"Andrea","full_name":"Goldsmith, Andrea"}],"date_updated":"2024-09-10T13:03:18Z"},{"doi":"10.1016/j.tplants.2021.11.006","abstract":[{"text":"The phytohormone auxin is the major growth regulator governing tropic responses including gravitropism. Auxin build-up at the lower side of stimulated shoots promotes cell expansion, whereas in roots it inhibits growth, leading to upward shoot bending and downward root bending, respectively. Yet it remains an enigma how the same signal can trigger such opposite cellular responses. In this review, we discuss several recent unexpected insights into the mechanisms underlying auxin regulation of growth, challenging several existing models. We focus on the divergent mechanisms of apoplastic pH regulation in shoots and roots revisiting the classical Acid Growth Theory and discuss coordinated involvement of multiple auxin signaling pathways. From this emerges a more comprehensive, updated picture how auxin regulates growth.","lang":"eng"}],"publication":"Trends in Plant Science","ddc":["580"],"file":[{"relation":"main_file","date_created":"2023-11-02T17:00:03Z","creator":"amally","access_level":"open_access","content_type":"application/pdf","checksum":"3d94980ee1ff6bec100dd813f6a921a6","file_id":"14480","success":1,"file_name":"Li Plants 2021_accepted.pdf","date_updated":"2023-11-02T17:00:03Z","file_size":805779}],"title":"Bending to auxin: Fast acid growth for tropisms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publication_status":"published","publication_identifier":{"issn":["1360-1385"]},"year":"2022","date_published":"2022-05-01T00:00:00Z","quality_controlled":"1","publisher":"Cell Press","page":"440-449","article_processing_charge":"No","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"11626","relation":"dissertation_contains"}]},"oa_version":"Submitted Version","status":"public","has_accepted_license":"1","oa":1,"citation":{"ieee":"L. Li, M. C. Gallei, and J. Friml, “Bending to auxin: Fast acid growth for tropisms,” Trends in Plant Science, vol. 27, no. 5. Cell Press, pp. 440–449, 2022.","ama":"Li L, Gallei MC, Friml J. Bending to auxin: Fast acid growth for tropisms. Trends in Plant Science. 2022;27(5):440-449. doi:10.1016/j.tplants.2021.11.006","chicago":"Li, Lanxin, Michelle C Gallei, and Jiří Friml. “Bending to Auxin: Fast Acid Growth for Tropisms.” Trends in Plant Science. Cell Press, 2022. https://doi.org/10.1016/j.tplants.2021.11.006.","ista":"Li L, Gallei MC, Friml J. 2022. Bending to auxin: Fast acid growth for tropisms. Trends in Plant Science. 27(5), 440–449.","apa":"Li, L., Gallei, M. C., & Friml, J. (2022). Bending to auxin: Fast acid growth for tropisms. Trends in Plant Science. Cell Press. https://doi.org/10.1016/j.tplants.2021.11.006","short":"L. Li, M.C. Gallei, J. Friml, Trends in Plant Science 27 (2022) 440–449.","mla":"Li, Lanxin, et al. “Bending to Auxin: Fast Acid Growth for Tropisms.” Trends in Plant Science, vol. 27, no. 5, Cell Press, 2022, pp. 440–49, doi:10.1016/j.tplants.2021.11.006."},"project":[{"name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03630"},{"grant_number":"25351","_id":"26B4D67E-B435-11E9-9278-68D0E5697425","name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root"}],"scopus_import":"1","external_id":{"isi":["000793707900005"],"pmid":["34848141"]},"pmid":1,"isi":1,"month":"05","department":[{"_id":"JiFr"}],"intvolume":" 27","day":"01","date_updated":"2024-10-29T10:12:33Z","author":[{"orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin","first_name":"Lanxin","last_name":"Li","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gallei","id":"35A03822-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle C","orcid":"0000-0003-1286-7368","full_name":"Gallei, Michelle C"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"article_type":"original","date_created":"2021-12-05T23:01:43Z","_id":"10411","volume":27,"acknowledgement":"The authors thank Alexandra Mally for editing the text. This work was supported by the Austrian Science Fund (FWF) I 3630-B25 to Jiří Friml and the DOC Fellowship of the Austrian Academy of Sciences to Lanxin Li. All figures were created with BioRender.com.","issue":"5","file_date_updated":"2023-11-02T17:00:03Z"},{"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration","file":[{"checksum":"1aa7c3478e0c8256b973b632efd1f6b4","access_level":"open_access","content_type":"application/pdf","creator":"dernst","date_created":"2022-07-29T10:17:10Z","relation":"main_file","file_size":4475504,"success":1,"file_name":"2022_BiophysicalJour_Zisis.pdf","date_updated":"2022-07-29T10:17:10Z","file_id":"11697"}],"ddc":["570"],"abstract":[{"text":"Cell dispersion from a confined area is fundamental in a number of biological processes,\r\nincluding cancer metastasis. To date, a quantitative understanding of the interplay of single\r\ncell motility, cell proliferation, and intercellular contacts remains elusive. In particular, the role\r\nof E- and N-Cadherin junctions, central components of intercellular contacts, is still\r\ncontroversial. Combining theoretical modeling with in vitro observations, we investigate the\r\ncollective spreading behavior of colonies of human cancer cells (T24). The spreading of these\r\ncolonies is driven by stochastic single-cell migration with frequent transient cell-cell contacts.\r\nWe find that inhibition of E- and N-Cadherin junctions decreases colony spreading and average\r\nspreading velocities, without affecting the strength of correlations in spreading velocities of\r\nneighboring cells. Based on a biophysical simulation model for cell migration, we show that the\r\nbehavioral changes upon disruption of these junctions can be explained by reduced repulsive\r\nexcluded volume interactions between cells. This suggests that in cancer cell migration,\r\ncadherin-based intercellular contacts sharpen cell boundaries leading to repulsive rather than\r\ncohesive interactions between cells, thereby promoting efficient cell spreading during collective\r\nmigration.\r\n","lang":"eng"}],"publication":"Biophysical Journal","doi":"10.1016/j.bpj.2021.12.006","status":"public","oa_version":"Published Version","oa":1,"has_accepted_license":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Elsevier","quality_controlled":"1","page":"P44-60","publication_status":"published","year":"2022","publication_identifier":{"issn":["0006-3495"]},"date_published":"2022-01-04T00:00:00Z","day":"04","intvolume":" 121","department":[{"_id":"EdHa"},{"_id":"GaTk"}],"month":"01","isi":1,"external_id":{"isi":["000740815400007"]},"citation":{"apa":"Zisis, T., Brückner, D., Brandstätter, T., Siow, W. X., d’Alessandro, J., Vollmar, A. M., … Zahler, S. (2022). Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. Elsevier. https://doi.org/10.1016/j.bpj.2021.12.006","short":"T. Zisis, D. Brückner, T. Brandstätter, W.X. Siow, J. d’Alessandro, A.M. Vollmar, C.P. Broedersz, S. Zahler, Biophysical Journal 121 (2022) P44-60.","mla":"Zisis, Themistoklis, et al. “Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell Migration.” Biophysical Journal, vol. 121, no. 1, Elsevier, 2022, pp. P44-60, doi:10.1016/j.bpj.2021.12.006.","chicago":"Zisis, Themistoklis, David Brückner, Tom Brandstätter, Wei Xiong Siow, Joseph d’Alessandro, Angelika M. Vollmar, Chase P. Broedersz, and Stefan Zahler. “Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell Migration.” Biophysical Journal. Elsevier, 2022. https://doi.org/10.1016/j.bpj.2021.12.006.","ista":"Zisis T, Brückner D, Brandstätter T, Siow WX, d’Alessandro J, Vollmar AM, Broedersz CP, Zahler S. 2022. Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. 121(1), P44-60.","ama":"Zisis T, Brückner D, Brandstätter T, et al. Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. 2022;121(1):P44-60. doi:10.1016/j.bpj.2021.12.006","ieee":"T. Zisis et al., “Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration,” Biophysical Journal, vol. 121, no. 1. Elsevier, pp. P44-60, 2022."},"project":[{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"}],"file_date_updated":"2022-07-29T10:17:10Z","issue":"1","acknowledgement":"Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Project-ID 201269156 - SFB 1032 (Projects B8 and B12). D.B.B. is supported in part by a DFG fellowship within the Graduate School of Quantitative Biosciences Munich (QBM) and by the Joachim Herz Stiftung.","volume":121,"_id":"10530","date_created":"2021-12-10T09:48:19Z","article_type":"original","keyword":["Biophysics"],"author":[{"full_name":"Zisis, Themistoklis","first_name":"Themistoklis","last_name":"Zisis"},{"orcid":"0000-0001-7205-2975","full_name":"Brückner, David","first_name":"David","last_name":"Brückner","id":"e1e86031-6537-11eb-953a-f7ab92be508d"},{"full_name":"Brandstätter, Tom","last_name":"Brandstätter","first_name":"Tom"},{"first_name":"Wei Xiong","last_name":"Siow","full_name":"Siow, Wei Xiong"},{"first_name":"Joseph","last_name":"d’Alessandro","full_name":"d’Alessandro, Joseph"},{"full_name":"Vollmar, Angelika M.","first_name":"Angelika M.","last_name":"Vollmar"},{"last_name":"Broedersz","first_name":"Chase P.","full_name":"Broedersz, Chase P."},{"full_name":"Zahler, Stefan","last_name":"Zahler","first_name":"Stefan"}],"date_updated":"2023-08-02T13:34:25Z","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"}}]