[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","date_published":"2023-07-26T00:00:00Z","oa_version":"Published Version","year":"2023","date_updated":"2024-10-09T21:06:41Z","day":"26","publisher":"Springer Nature","type":"journal_article","issue":"3","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"doi":"10.1007/s11040-023-09460-x","article_type":"original","arxiv":1,"ddc":["510"],"article_processing_charge":"Yes (via OA deal)","citation":{"chicago":"Lampart, Jonas, David Johannes Mitrouskas, and Krzysztof Mysliwy. “On the Global Minimum of the Energy–Momentum Relation for the Polaron.” <i>Mathematical Physics, Analysis and Geometry</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11040-023-09460-x\">https://doi.org/10.1007/s11040-023-09460-x</a>.","ista":"Lampart J, Mitrouskas DJ, Mysliwy K. 2023. On the global minimum of the energy–momentum relation for the polaron. Mathematical Physics, Analysis and Geometry. 26(3), 17.","ama":"Lampart J, Mitrouskas DJ, Mysliwy K. On the global minimum of the energy–momentum relation for the polaron. <i>Mathematical Physics, Analysis and Geometry</i>. 2023;26(3). doi:<a href=\"https://doi.org/10.1007/s11040-023-09460-x\">10.1007/s11040-023-09460-x</a>","apa":"Lampart, J., Mitrouskas, D. J., &#38; Mysliwy, K. (2023). On the global minimum of the energy–momentum relation for the polaron. <i>Mathematical Physics, Analysis and Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11040-023-09460-x\">https://doi.org/10.1007/s11040-023-09460-x</a>","ieee":"J. Lampart, D. J. Mitrouskas, and K. Mysliwy, “On the global minimum of the energy–momentum relation for the polaron,” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 26, no. 3. Springer Nature, 2023.","short":"J. Lampart, D.J. Mitrouskas, K. Mysliwy, Mathematical Physics, Analysis and Geometry 26 (2023).","mla":"Lampart, Jonas, et al. “On the Global Minimum of the Energy–Momentum Relation for the Polaron.” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 26, no. 3, 17, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1007/s11040-023-09460-x\">10.1007/s11040-023-09460-x</a>."},"_id":"14192","title":"On the global minimum of the energy–momentum relation for the polaron","month":"07","file_date_updated":"2023-08-23T10:59:15Z","keyword":["Geometry and Topology","Mathematical Physics"],"publication":"Mathematical Physics, Analysis and Geometry","scopus_import":"1","author":[{"first_name":"Jonas","last_name":"Lampart","full_name":"Lampart, Jonas"},{"last_name":"Mitrouskas","full_name":"Mitrouskas, David Johannes","first_name":"David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d"},{"id":"316457FC-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof","full_name":"Mysliwy, Krzysztof","last_name":"Mysliwy"}],"intvolume":"        26","isi":1,"acknowledgement":"D.M. and K.M. thank Robert Seiringer for helpful discussions. Open access funding provided by Institute of Science and Technology (IST Austria). Financial support from the Agence Nationale de la Recherche (ANR) through the projects ANR-17-CE40-0016, ANR-17-CE40-0007-01, ANR-17-EURE-0002 (J.L.) and from the European Union’s Horizon 2020 research and innovation programme under the Maria Skłodowska-Curie grant agreement No. 665386 (K.M.) is gratefully acknowledged.","file":[{"date_updated":"2023-08-23T10:59:15Z","content_type":"application/pdf","checksum":"f0941cc66cb3ed06a12ca4b7e356cfd6","file_size":317026,"file_id":"14225","date_created":"2023-08-23T10:59:15Z","creator":"dernst","file_name":"2023_MathPhysics_Lampart.pdf","relation":"main_file","access_level":"open_access","success":1}],"oa":1,"publication_identifier":{"issn":["1385-0172"],"eissn":["1572-9656"]},"external_id":{"isi":["001032992600001"],"arxiv":["2206.14708"]},"department":[{"_id":"RoSe"}],"date_created":"2023-08-22T14:09:47Z","language":[{"iso":"eng"}],"corr_author":"1","publication_status":"published","abstract":[{"text":"For the Fröhlich model of the large polaron, we prove that the ground state energy as a function of the total momentum has a unique global minimum at momentum zero. This implies the non-existence of a ground state of the translation invariant Fröhlich Hamiltonian and thus excludes the possibility of a localization transition at finite coupling.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by/4.0/","article_number":"17","volume":26,"quality_controlled":"1"},{"type":"journal_article","day":"24","publisher":"Cambridge University Press","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","project":[{"name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45","grant_number":"101076777"}],"date_published":"2023-08-24T00:00:00Z","date_updated":"2025-09-09T13:16:15Z","year":"2023","oa_version":"Published Version","article_processing_charge":"Yes","citation":{"mla":"Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” <i>Forum of Mathematics, Pi</i>, vol. 11, e21, Cambridge University Press, 2023, doi:<a href=\"https://doi.org/10.1017/fmp.2023.17\">10.1017/fmp.2023.17</a>.","short":"M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023).","ieee":"M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” <i>Forum of Mathematics, Pi</i>, vol. 11. Cambridge University Press, 2023.","apa":"Kwan, M. A., Sah, A., Sauermann, L., &#38; Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fmp.2023.17\">https://doi.org/10.1017/fmp.2023.17</a>","ama":"Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. <i>Forum of Mathematics, Pi</i>. 2023;11. doi:<a href=\"https://doi.org/10.1017/fmp.2023.17\">10.1017/fmp.2023.17</a>","ista":"Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11, e21.","chicago":"Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” <i>Forum of Mathematics, Pi</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/fmp.2023.17\">https://doi.org/10.1017/fmp.2023.17</a>."},"_id":"14499","month":"08","title":"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture","article_type":"original","doi":"10.1017/fmp.2023.17","ddc":["510"],"arxiv":1,"acknowledgement":"Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research Fellowship.","file":[{"checksum":"54b824098d59073cc87a308d458b0a3e","content_type":"application/pdf","date_updated":"2023-11-07T09:16:23Z","creator":"dernst","file_name":"2023_ForumMathematics_Kwan.pdf","file_id":"14500","date_created":"2023-11-07T09:16:23Z","file_size":1218719,"access_level":"open_access","relation":"main_file","success":1}],"publication_identifier":{"issn":["2050-5086"]},"oa":1,"keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Analysis"],"file_date_updated":"2023-11-07T09:16:23Z","scopus_import":"1","author":[{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","last_name":"Kwan"},{"first_name":"Ashwin","full_name":"Sah, Ashwin","last_name":"Sah"},{"last_name":"Sauermann","full_name":"Sauermann, Lisa","first_name":"Lisa"},{"first_name":"Mehtaab","last_name":"Sawhney","full_name":"Sawhney, Mehtaab"}],"publication":"Forum of Mathematics, Pi","isi":1,"intvolume":"        11","article_number":"e21","abstract":[{"lang":"eng","text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes."}],"volume":11,"quality_controlled":"1","date_created":"2023-11-07T09:02:48Z","external_id":{"arxiv":["2208.02874"],"isi":["001123866200001"]},"department":[{"_id":"MaKw"}],"language":[{"iso":"eng"}],"corr_author":"1","publication_status":"published"},{"abstract":[{"text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.","lang":"eng"}],"volume":69,"quality_controlled":"1","date_created":"2023-01-16T10:04:06Z","external_id":{"isi":["000862193600001"]},"department":[{"_id":"HeEd"}],"corr_author":"1","language":[{"iso":"eng"}],"publication_status":"published","acknowledgement":"This work has been 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). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). 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 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","file":[{"file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf","creator":"dernst","file_id":"12488","date_created":"2023-02-02T11:01:10Z","file_size":582850,"checksum":"46352e0ee71e460848f88685ca852681","content_type":"application/pdf","date_updated":"2023-02-02T11:01:10Z","success":1,"access_level":"open_access","relation":"main_file"}],"oa":1,"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"last_name":"Dyer","full_name":"Dyer, Ramsay","first_name":"Ramsay"},{"first_name":"Arijit","last_name":"Ghosh","full_name":"Ghosh, Arijit"},{"orcid":"0000-0002-7472-2220","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs"}],"publication":"Discrete & Computational Geometry","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"scopus_import":"1","file_date_updated":"2023-02-02T11:01:10Z","isi":1,"intvolume":"        69","ec_funded":1,"article_processing_charge":"No","citation":{"short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete &#38; Computational Geometry 69 (2023) 156–191.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 69, Springer Nature, 2023, pp. 156–91, doi:<a href=\"https://doi.org/10.1007/s00454-022-00431-7\">10.1007/s00454-022-00431-7</a>.","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 69. Springer Nature, pp. 156–191, 2023.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. <i>Discrete &#38; Computational Geometry</i>. 2023;69:156-191. doi:<a href=\"https://doi.org/10.1007/s00454-022-00431-7\">10.1007/s00454-022-00431-7</a>","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., &#38; Wintraecken, M. (2023). Local criteria for triangulating general manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-022-00431-7\">https://doi.org/10.1007/s00454-022-00431-7</a>","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00454-022-00431-7\">https://doi.org/10.1007/s00454-022-00431-7</a>.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete &#38; Computational Geometry. 69, 156–191."},"_id":"12287","month":"01","title":"Local criteria for triangulating general manifolds","article_type":"original","doi":"10.1007/s00454-022-00431-7","ddc":["510"],"publisher":"Springer Nature","day":"01","type":"journal_article","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"156-191","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073","name":"Learning and triangulating manifolds via collapses"}],"has_accepted_license":"1","date_published":"2023-01-01T00:00:00Z","date_updated":"2025-04-14T07:44:00Z","oa_version":"Published Version","year":"2023"},{"publication_identifier":{"issn":["1663-487X"]},"oa":1,"file":[{"creator":"dernst","file_name":"2023_QuantumTopol_Carqueville.pdf","file_id":"14764","date_created":"2024-01-09T09:25:34Z","file_size":707344,"checksum":"b0590aff6e7ec89cc149ba94d459d3a3","content_type":"application/pdf","date_updated":"2024-01-09T09:25:34Z","success":1,"access_level":"open_access","relation":"main_file"}],"acknowledgement":"N.C. is supported by the DFG Heisenberg Programme.\r\nWe are grateful to Tobias Dyckerhoff, Lukas Müller, Ingo Runkel, and Christopher Schommer-Pries for helpful discussions.","isi":1,"intvolume":"        14","author":[{"first_name":"Nils","full_name":"Carqueville, Nils","last_name":"Carqueville"},{"orcid":"0000-0003-2834-5054","full_name":"Szegedy, Lorant","last_name":"Szegedy","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","first_name":"Lorant"}],"publication":"Quantum Topology","scopus_import":"1","keyword":["Geometry and Topology","Mathematical Physics"],"file_date_updated":"2024-01-09T09:25:34Z","abstract":[{"text":"We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2.\r\nTo construct examples, we explicitly describe Spin 2r​-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category.","lang":"eng"}],"quality_controlled":"1","volume":14,"corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"MiLe"}],"external_id":{"isi":["001104620800003"]},"date_created":"2024-01-08T13:14:48Z","publication_status":"published","type":"journal_article","day":"16","publisher":"European Mathematical Society","issue":"3","tmp":{"short":"CC BY (4.0)","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)"},"status":"public","page":"467-532","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2023","oa_version":"Published Version","date_updated":"2025-09-09T14:16:16Z","date_published":"2023-10-16T00:00:00Z","has_accepted_license":"1","citation":{"ama":"Carqueville N, Szegedy L. Fully extended r-spin TQFTs. <i>Quantum Topology</i>. 2023;14(3):467-532. doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>","apa":"Carqueville, N., &#38; Szegedy, L. (2023). Fully extended r-spin TQFTs. <i>Quantum Topology</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>","chicago":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>. European Mathematical Society, 2023. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>.","ista":"Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532.","short":"N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532.","mla":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>, vol. 14, no. 3, European Mathematical Society, 2023, pp. 467–532, doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>.","ieee":"N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” <i>Quantum Topology</i>, vol. 14, no. 3. European Mathematical Society, pp. 467–532, 2023."},"article_processing_charge":"Yes","title":"Fully extended r-spin TQFTs","month":"10","_id":"14756","doi":"10.4171/qt/193","article_type":"original","ddc":["530"]},{"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"oa":1,"acknowledgement":"This is a full and revised version of [38] (on partial triangulations) in Proceedings of the 36th Annual International Symposium on Computational Geometry (SoCG‘20) and of some of the results in [37] (on full triangulations) in Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA‘20).\r\nThis research started at the 11th Gremo’s Workshop on Open Problems (GWOP), Alp Sellamatt, Switzerland, June 24–28, 2013, motivated by a question posed by Filip Mori´c on full triangulations. Research was supported by the Swiss National Science Foundation within the collaborative DACH project Arrangements and Drawings as SNSF Project 200021E-171681, and by IST Austria and Berlin Free University during a sabbatical stay of the second author. We thank Michael Joswig, Jesús De Loera, and Francisco Santos for helpful discussions on the topics of this paper, and Daniel Bertschinger and Valentin Stoppiello for carefully reading earlier versions and for many helpful comments.\r\nOpen access funding provided by the Swiss Federal Institute of Technology Zürich","file":[{"file_size":1747581,"file_id":"12345","date_created":"2023-01-23T11:10:03Z","file_name":"2022_DiscreteCompGeometry_Wagner.pdf","creator":"dernst","date_updated":"2023-01-23T11:10:03Z","content_type":"application/pdf","checksum":"307e879d09e52eddf5b225d0aaa9213a","success":1,"relation":"main_file","access_level":"open_access"}],"isi":1,"intvolume":"        68","author":[{"last_name":"Wagner","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"scopus_import":"1","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"file_date_updated":"2023-01-23T11:10:03Z","publication":"Discrete & Computational Geometry","abstract":[{"lang":"eng","text":"Given a finite point set P in general position in the plane, a full triangulation of P is a maximal straight-line embedded plane graph on P. A partial triangulation of P is a full triangulation of some subset P′ of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge (called edge flip), removes a non-extreme point of degree 3, or adds a point in P∖P′ as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The edge flip graph is defined with full triangulations as vertices, and edge flips determining the adjacencies. Lawson showed in the early seventies that these graphs are connected. The goal of this paper is to investigate the structure of these graphs, with emphasis on their vertex connectivity. For sets P of n points in the plane in general position, we show that the edge flip graph is ⌈n/2−2⌉-vertex connected, and the bistellar flip graph is (n−3)-vertex connected; both results are tight. The latter bound matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points to 3-space and projecting back the lower convex hull), where (n−3)-vertex connectivity has been known since the late eighties through the secondary polytope due to Gelfand, Kapranov, & Zelevinsky and Balinski’s Theorem. For the edge flip-graph, we additionally show that the vertex connectivity is at least as large as (and hence equal to) the minimum degree (i.e., the minimum number of flippable edges in any full triangulation), provided that n is large enough. Our methods also yield several other results: (i) The edge flip graph can be covered by graphs of polytopes of dimension ⌈n/2−2⌉ (products of associahedra) and the bistellar flip graph can be covered by graphs of polytopes of dimension n−3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n−3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations of a point set are regular iff the partial order of partial subdivisions has height n−3. (iv) There are arbitrarily large sets P with non-regular partial triangulations and such that every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular triangulations."}],"quality_controlled":"1","volume":68,"corr_author":"1","language":[{"iso":"eng"}],"date_created":"2023-01-12T12:02:28Z","external_id":{"isi":["000883222200003"]},"department":[{"_id":"UlWa"}],"publication_status":"published","issue":"4","type":"journal_article","day":"14","publisher":"Springer Nature","tmp":{"short":"CC BY (4.0)","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)"},"status":"public","page":"1227-1284","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2025-07-10T11:54:56Z","year":"2022","oa_version":"Published Version","has_accepted_license":"1","date_published":"2022-11-14T00:00:00Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7807"},{"relation":"earlier_version","status":"public","id":"7990"}]},"citation":{"short":"U. Wagner, E. Welzl, Discrete &#38; Computational Geometry 68 (2022) 1227–1284.","mla":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” <i>Discrete &#38; Computational Geometry</i>, vol. 68, no. 4, Springer Nature, 2022, pp. 1227–84, doi:<a href=\"https://doi.org/10.1007/s00454-022-00436-2\">10.1007/s00454-022-00436-2</a>.","ieee":"U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane,” <i>Discrete &#38; Computational Geometry</i>, vol. 68, no. 4. Springer Nature, pp. 1227–1284, 2022.","ama":"Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane. <i>Discrete &#38; Computational Geometry</i>. 2022;68(4):1227-1284. doi:<a href=\"https://doi.org/10.1007/s00454-022-00436-2\">10.1007/s00454-022-00436-2</a>","apa":"Wagner, U., &#38; Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-022-00436-2\">https://doi.org/10.1007/s00454-022-00436-2</a>","chicago":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00454-022-00436-2\">https://doi.org/10.1007/s00454-022-00436-2</a>.","ista":"Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete &#38; Computational Geometry. 68(4), 1227–1284."},"article_processing_charge":"No","month":"11","title":"Connectivity of triangulation flip graphs in the plane","_id":"12129","article_type":"original","doi":"10.1007/s00454-022-00436-2","ddc":["510"]},{"date_published":"2022-10-27T00:00:00Z","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"has_accepted_license":"1","year":"2022","oa_version":"Published Version","date_updated":"2025-04-14T07:57:18Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"day":"27","publisher":"Cambridge University Press","type":"journal_article","ddc":["510"],"doi":"10.1017/fms.2022.86","article_type":"original","_id":"12148","title":"Rank-uniform local law for Wigner matrices","month":"10","article_processing_charge":"No","citation":{"short":"G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).","mla":"Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>, vol. 10, e96, Cambridge University Press, 2022, doi:<a href=\"https://doi.org/10.1017/fms.2022.86\">10.1017/fms.2022.86</a>.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner matrices,” <i>Forum of Mathematics, Sigma</i>, vol. 10. Cambridge University Press, 2022.","ama":"Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. 2022;10. doi:<a href=\"https://doi.org/10.1017/fms.2022.86\">10.1017/fms.2022.86</a>","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2022). Rank-uniform local law for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2022.86\">https://doi.org/10.1017/fms.2022.86</a>","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform Local Law for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2022. <a href=\"https://doi.org/10.1017/fms.2022.86\">https://doi.org/10.1017/fms.2022.86</a>.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 10, e96."},"keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Theoretical Computer Science","Analysis"],"author":[{"orcid":"0000-0002-4901-7992","first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","last_name":"Schröder","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856"}],"scopus_import":"1","publication":"Forum of Mathematics, Sigma","file_date_updated":"2023-01-24T10:02:40Z","ec_funded":1,"isi":1,"intvolume":"        10","acknowledgement":"L.E. acknowledges support by ERC Advanced Grant ‘RMTBeyond’ No. 101020331. D.S. acknowledges the support of Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation.","file":[{"relation":"main_file","access_level":"open_access","success":1,"checksum":"94a049aeb1eea5497aa097712a73c400","content_type":"application/pdf","date_updated":"2023-01-24T10:02:40Z","date_created":"2023-01-24T10:02:40Z","file_id":"12356","creator":"dernst","file_name":"2022_ForumMath_Cipolloni.pdf","file_size":817089}],"publication_identifier":{"issn":["2050-5094"]},"oa":1,"publication_status":"published","department":[{"_id":"LaEr"}],"external_id":{"isi":["000873719200001"]},"date_created":"2023-01-12T12:07:30Z","corr_author":"1","language":[{"iso":"eng"}],"volume":10,"quality_controlled":"1","abstract":[{"text":"We prove a general local law for Wigner matrices that optimally handles observables of arbitrary rank and thus unifies the well-known averaged and isotropic local laws. As an application, we prove a central limit theorem in quantum unique ergodicity (QUE): that is, we show that the quadratic forms of a general deterministic matrix A on the bulk eigenvectors of a Wigner matrix have approximately Gaussian fluctuation. For the bulk spectrum, we thus generalise our previous result [17] as valid for test matrices A of large rank as well as the result of Benigni and Lopatto [7] as valid for specific small-rank observables.","lang":"eng"}],"article_number":"e96"},{"ddc":["510"],"doi":"10.1016/j.laa.2022.09.001","article_type":"original","_id":"12216","title":"Monotonicity versions of Epstein's concavity theorem and related inequalities","month":"12","article_processing_charge":"Yes (via OA deal)","citation":{"chicago":"Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s Concavity Theorem and Related Inequalities.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.laa.2022.09.001\">https://doi.org/10.1016/j.laa.2022.09.001</a>.","ista":"Carlen EA, Zhang H. 2022. Monotonicity versions of Epstein’s concavity theorem and related inequalities. Linear Algebra and its Applications. 654, 289–310.","ama":"Carlen EA, Zhang H. Monotonicity versions of Epstein’s concavity theorem and related inequalities. <i>Linear Algebra and its Applications</i>. 2022;654:289-310. doi:<a href=\"https://doi.org/10.1016/j.laa.2022.09.001\">10.1016/j.laa.2022.09.001</a>","apa":"Carlen, E. A., &#38; Zhang, H. (2022). Monotonicity versions of Epstein’s concavity theorem and related inequalities. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2022.09.001\">https://doi.org/10.1016/j.laa.2022.09.001</a>","ieee":"E. A. Carlen and H. Zhang, “Monotonicity versions of Epstein’s concavity theorem and related inequalities,” <i>Linear Algebra and its Applications</i>, vol. 654. Elsevier, pp. 289–310, 2022.","short":"E.A. Carlen, H. Zhang, Linear Algebra and Its Applications 654 (2022) 289–310.","mla":"Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s Concavity Theorem and Related Inequalities.” <i>Linear Algebra and Its Applications</i>, vol. 654, Elsevier, 2022, pp. 289–310, doi:<a href=\"https://doi.org/10.1016/j.laa.2022.09.001\">10.1016/j.laa.2022.09.001</a>."},"date_published":"2022-12-01T00:00:00Z","has_accepted_license":"1","project":[{"_id":"eb958bca-77a9-11ec-83b8-c565cb50d8d6","grant_number":"M03337","name":"Curvature-dimension in noncommutative analysis"}],"year":"2022","oa_version":"Published Version","date_updated":"2025-04-14T13:05:27Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"289-310","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"day":"01","publisher":"Elsevier","type":"journal_article","publication_status":"published","external_id":{"isi":["000860689600014"]},"department":[{"_id":"JaMa"}],"date_created":"2023-01-16T09:46:38Z","language":[{"iso":"eng"}],"corr_author":"1","volume":654,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The latter says that quantum operations can never increase the relative entropy. The monotonicity versions often have many advantages, and often have direct physical application, as in the example just mentioned. Moreover, the monotonicity results are often valid for a larger class of maps than, say, quantum operations (which are completely positive). In this paper we prove several new monotonicity results, the first of which is a monotonicity theorem that has as a simple corollary a celebrated concavity theorem of Epstein. Our starting points are the monotonicity versions of the Lieb Concavity and the Lieb Convexity Theorems. We also give two new proofs of these in their general forms using interpolation. We then prove our new monotonicity theorems by several duality arguments."}],"author":[{"first_name":"Eric A.","full_name":"Carlen, Eric A.","last_name":"Carlen"},{"first_name":"Haonan","id":"D8F41E38-9E66-11E9-A9E2-65C2E5697425","last_name":"Zhang","full_name":"Zhang, Haonan"}],"file_date_updated":"2023-01-27T08:08:39Z","publication":"Linear Algebra and its Applications","scopus_import":"1","keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Numerical Analysis","Algebra and Number Theory"],"isi":1,"intvolume":"       654","file":[{"relation":"main_file","access_level":"open_access","success":1,"checksum":"cf3cb7e7e34baa967849f01d8f0c1ae4","content_type":"application/pdf","date_updated":"2023-01-27T08:08:39Z","date_created":"2023-01-27T08:08:39Z","file_id":"12415","file_name":"2022_LinearAlgebra_Carlen.pdf","creator":"dernst","file_size":441184}],"acknowledgement":"Work partially supported by the Lise Meitner fellowship, Austrian Science Fund (FWF) M3337.","oa":1,"publication_identifier":{"issn":["0024-3795"]}},{"status":"public","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"day":"21","type":"journal_article","publisher":"The Electronic Journal of Combinatorics","issue":"4","has_accepted_license":"1","date_published":"2022-10-21T00:00:00Z","year":"2022","oa_version":"Published Version","date_updated":"2023-08-04T10:29:18Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12286","title":"Loose cores and cycles in random hypergraphs","month":"10","article_processing_charge":"No","citation":{"mla":"Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4, P4.13, The Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10794\">10.37236/10794</a>.","short":"O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).","ieee":"O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.","ama":"Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. <i>The Electronic Journal of Combinatorics</i>. 2022;29(4). doi:<a href=\"https://doi.org/10.37236/10794\">10.37236/10794</a>","apa":"Cooley, O., Kang, M., &#38; Zalla, J. (2022). Loose cores and cycles in random hypergraphs. <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10794\">https://doi.org/10.37236/10794</a>","chicago":"Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10794\">https://doi.org/10.37236/10794</a>.","ista":"Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 29(4), P4.13."},"ddc":["510"],"doi":"10.37236/10794","article_type":"original","file":[{"relation":"main_file","access_level":"open_access","success":1,"date_updated":"2023-01-30T11:45:13Z","content_type":"application/pdf","checksum":"00122b2459f09b5ae43073bfba565e94","file_size":626953,"date_created":"2023-01-30T11:45:13Z","file_id":"12462","creator":"dernst","file_name":"2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf"}],"acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","publication_identifier":{"eissn":["1077-8926"]},"oa":1,"publication":"The Electronic Journal of Combinatorics","file_date_updated":"2023-01-30T11:45:13Z","author":[{"first_name":"Oliver","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","full_name":"Cooley, Oliver","last_name":"Cooley"},{"first_name":"Mihyun","last_name":"Kang","full_name":"Kang, Mihyun"},{"first_name":"Julian","last_name":"Zalla","full_name":"Zalla, Julian"}],"keyword":["Computational Theory and Mathematics","Geometry and Topology","Theoretical Computer Science","Applied Mathematics","Discrete Mathematics and Combinatorics"],"scopus_import":"1","intvolume":"        29","isi":1,"volume":29,"quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","abstract":[{"lang":"eng","text":"Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes.&#x0D;\r\nOur main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$."}],"article_number":"P4.13","publication_status":"published","department":[{"_id":"MaKw"}],"external_id":{"isi":["000876763300001"]},"date_created":"2023-01-16T10:03:57Z","language":[{"iso":"eng"}]},{"day":"18","type":"journal_article","publisher":"Cambridge University Press","tmp":{"short":"CC BY (4.0)","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)"},"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","year":"2022","date_updated":"2025-04-14T07:57:17Z","date_published":"2022-01-18T00:00:00Z","has_accepted_license":"1","project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"citation":{"apa":"Henheik, S. J., &#38; Teufel, S. (2022). Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2021.80\">https://doi.org/10.1017/fms.2021.80</a>","ama":"Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. <i>Forum of Mathematics, Sigma</i>. 2022;10. doi:<a href=\"https://doi.org/10.1017/fms.2021.80\">10.1017/fms.2021.80</a>","ista":"Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. 10, e4.","chicago":"Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2022. <a href=\"https://doi.org/10.1017/fms.2021.80\">https://doi.org/10.1017/fms.2021.80</a>.","mla":"Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.” <i>Forum of Mathematics, Sigma</i>, vol. 10, e4, Cambridge University Press, 2022, doi:<a href=\"https://doi.org/10.1017/fms.2021.80\">10.1017/fms.2021.80</a>.","short":"S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022).","ieee":"S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk,” <i>Forum of Mathematics, Sigma</i>, vol. 10. Cambridge University Press, 2022."},"article_processing_charge":"Yes","title":"Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk","month":"01","_id":"10643","doi":"10.1017/fms.2021.80","article_type":"original","arxiv":1,"ddc":["510"],"publication_identifier":{"eissn":["2050-5094"]},"oa":1,"acknowledgement":"J.H. acknowledges partial financial support by the ERC Advanced Grant ‘RMTBeyond’ No. 101020331. Support for publication costs from the Deutsche Forschungsgemeinschaft and the Open Access Publishing Fund of the University of Tübingen is gratefully acknowledged.","file":[{"access_level":"open_access","relation":"main_file","success":1,"date_updated":"2022-01-19T09:27:43Z","checksum":"87592a755adcef22ea590a99dc728dd3","content_type":"application/pdf","file_size":705323,"file_name":"2022_ForumMathSigma_Henheik.pdf","creator":"cchlebak","date_created":"2022-01-19T09:27:43Z","file_id":"10646"}],"ec_funded":1,"isi":1,"intvolume":"        10","keyword":["computational mathematics","discrete mathematics and combinatorics","geometry and topology","mathematical physics","statistics and probability","algebra and number theory","theoretical computer science","analysis"],"scopus_import":"1","author":[{"orcid":"0000-0003-1106-327X","last_name":"Henheik","full_name":"Henheik, Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","first_name":"Sven Joscha"},{"last_name":"Teufel","full_name":"Teufel, Stefan","first_name":"Stefan"}],"file_date_updated":"2022-01-19T09:27:43Z","publication":"Forum of Mathematics, Sigma","abstract":[{"lang":"eng","text":"We prove a generalised super-adiabatic theorem for extended fermionic systems assuming a spectral gap only in the bulk. More precisely, we assume that the infinite system has a unique ground state and that the corresponding Gelfand–Naimark–Segal Hamiltonian has a spectral gap above its eigenvalue zero. Moreover, we show that a similar adiabatic theorem also holds in the bulk of finite systems up to errors that vanish faster than any inverse power of the system size, although the corresponding finite-volume Hamiltonians need not have a spectral gap.\r\n\r\n"}],"article_number":"e4","quality_controlled":"1","volume":10,"corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"external_id":{"arxiv":["2012.15239"],"isi":["000743615000001"]},"date_created":"2022-01-18T16:18:51Z","publication_status":"published"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2022-01-11T00:00:00Z","has_accepted_license":"1","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"date_updated":"2026-04-07T12:37:10Z","year":"2022","oa_version":"Published Version","issue":"1","type":"journal_article","publisher":"Springer Nature","day":"11","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"article_type":"original","doi":"10.1007/s11040-021-09415-0","ddc":["514"],"arxiv":1,"article_processing_charge":"Yes (via OA deal)","related_material":{"record":[{"id":"19540","status":"public","relation":"dissertation_contains"}]},"citation":{"ista":"Henheik SJ. 2022. The BCS critical temperature at high density. Mathematical Physics, Analysis and Geometry. 25(1), 3.","chicago":"Henheik, Sven Joscha. “The BCS Critical Temperature at High Density.” <i>Mathematical Physics, Analysis and Geometry</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s11040-021-09415-0\">https://doi.org/10.1007/s11040-021-09415-0</a>.","apa":"Henheik, S. J. (2022). The BCS critical temperature at high density. <i>Mathematical Physics, Analysis and Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11040-021-09415-0\">https://doi.org/10.1007/s11040-021-09415-0</a>","ama":"Henheik SJ. The BCS critical temperature at high density. <i>Mathematical Physics, Analysis and Geometry</i>. 2022;25(1). doi:<a href=\"https://doi.org/10.1007/s11040-021-09415-0\">10.1007/s11040-021-09415-0</a>","ieee":"S. J. Henheik, “The BCS critical temperature at high density,” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 25, no. 1. Springer Nature, 2022.","short":"S.J. Henheik, Mathematical Physics, Analysis and Geometry 25 (2022).","mla":"Henheik, Sven Joscha. “The BCS Critical Temperature at High Density.” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 25, no. 1, 3, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s11040-021-09415-0\">10.1007/s11040-021-09415-0</a>."},"_id":"10623","month":"01","title":"The BCS critical temperature at high density","keyword":["geometry and topology","mathematical physics"],"publication":"Mathematical Physics, Analysis and Geometry","scopus_import":"1","author":[{"id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha","last_name":"Henheik","orcid":"0000-0003-1106-327X"}],"file_date_updated":"2022-01-14T07:27:45Z","isi":1,"intvolume":"        25","ec_funded":1,"file":[{"success":1,"relation":"main_file","access_level":"open_access","date_created":"2022-01-14T07:27:45Z","file_id":"10624","creator":"cchlebak","file_name":"2022_MathPhyAnalGeo_Henheik.pdf","file_size":505804,"content_type":"application/pdf","checksum":"d44f8123a52592a75b2c3b8ee2cd2435","date_updated":"2022-01-14T07:27:45Z"}],"acknowledgement":"I am very grateful to Robert Seiringer for his guidance during this project and for many valuable comments on an earlier version of the manuscript. Moreover, I would like to thank Asbjørn Bækgaard Lauritsen for many helpful discussions and comments, pointing out the reference [22] and for his involvement in a closely related joint project [13]. Finally, I am grateful to Christian Hainzl for valuable comments on an earlier version of the manuscript and Andreas Deuchert for interesting discussions.","publication_identifier":{"issn":["1385-0172"],"eissn":["1572-9656"]},"oa":1,"date_created":"2022-01-13T15:40:53Z","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"external_id":{"isi":["000741387600001"],"arxiv":["2106.02015"]},"language":[{"iso":"eng"}],"corr_author":"1","publication_status":"published","article_number":"3","abstract":[{"lang":"eng","text":"We investigate the BCS critical temperature Tc in the high-density limit and derive an asymptotic formula, which strongly depends on the behavior of the interaction potential V on the Fermi-surface. Our results include a rigorous confirmation for the behavior of Tc at high densities proposed by Langmann et al. (Phys Rev Lett 122:157001, 2019) and identify precise conditions under which superconducting domes arise in BCS theory."}],"volume":25,"quality_controlled":"1"},{"intvolume":"        66","author":[{"orcid":"0000-0002-7840-5062","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","full_name":"Avvakumov, Sergey"},{"first_name":"Sergey","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67","last_name":"Kudrya","full_name":"Kudrya, Sergey"}],"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"scopus_import":"1","publication":"Discrete & Computational Geometry","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"acknowledgement":"S. Avvakumov has received funding from the European Research Council under the European Union’s Seventh Framework Programme ERC Grant agreement ERC StG 716424–CASe. S. Kudrya was supported by the Austrian Academic Exchange Service (OeAD), ICM-2019-13577.","publication_status":"published","corr_author":"1","language":[{"iso":"eng"}],"date_created":"2022-06-17T08:45:15Z","external_id":{"arxiv":["1910.12628"]},"quality_controlled":"1","volume":66,"abstract":[{"text":"Suppose that n is not a prime power and not twice a prime power. We prove that for any Hausdorff compactum X with a free action of the symmetric group Sn, there exists an Sn-equivariant map X→Rn whose image avoids the diagonal {(x,x,…,x)∈Rn∣x∈R}. 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 take 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 Sn-equivariant maps from the boundary ∂Δn−1 of (n−1)-simplex to itself. Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser’s conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result applying it to one such question, a specific instance of envy-free division problem.","lang":"eng"}],"date_updated":"2025-04-14T09:10:06Z","oa_version":"Preprint","year":"2021","date_published":"2021-10-01T00:00:00Z","page":"1202-1216","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","issue":"3","day":"01","publisher":"Springer Nature","type":"journal_article","arxiv":1,"article_type":"original","doi":"10.1007/s00454-021-00299-z","month":"10","title":"Vanishing of all equivariant obstructions and the mapping degree","_id":"11446","related_material":{"record":[{"id":"8182","relation":"earlier_version","status":"public"}]},"citation":{"mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>Discrete &#38; Computational Geometry</i>, vol. 66, no. 3, Springer Nature, 2021, pp. 1202–16, doi:<a href=\"https://doi.org/10.1007/s00454-021-00299-z\">10.1007/s00454-021-00299-z</a>.","short":"S. Avvakumov, S. Kudrya, Discrete &#38; Computational Geometry 66 (2021) 1202–1216.","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” <i>Discrete &#38; Computational Geometry</i>, vol. 66, no. 3. Springer Nature, pp. 1202–1216, 2021.","ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. <i>Discrete &#38; Computational Geometry</i>. 2021;66(3):1202-1216. doi:<a href=\"https://doi.org/10.1007/s00454-021-00299-z\">10.1007/s00454-021-00299-z</a>","apa":"Avvakumov, S., &#38; Kudrya, S. (2021). Vanishing of all equivariant obstructions and the mapping degree. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-021-00299-z\">https://doi.org/10.1007/s00454-021-00299-z</a>","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-021-00299-z\">https://doi.org/10.1007/s00454-021-00299-z</a>.","ista":"Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and the mapping degree. Discrete &#38; Computational Geometry. 66(3), 1202–1216."},"article_processing_charge":"No"},{"article_processing_charge":"No","citation":{"apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>","ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021."},"_id":"10856","month":"01","title":"On the volume of sections of the cube","article_type":"original","doi":"10.1515/agms-2020-0103","ddc":["510"],"arxiv":1,"issue":"1","publisher":"De Gruyter","day":"29","type":"journal_article","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"1-18","has_accepted_license":"1","date_published":"2021-01-29T00:00:00Z","date_updated":"2023-08-17T07:07:58Z","oa_version":"Published Version","year":"2021","abstract":[{"lang":"eng","text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2."}],"volume":9,"quality_controlled":"1","date_created":"2022-03-18T09:25:14Z","department":[{"_id":"UlWa"}],"external_id":{"arxiv":["2004.02674"],"isi":["000734286800001"]},"language":[{"iso":"eng"}],"publication_status":"published","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","file":[{"file_size":789801,"creator":"dernst","file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","date_created":"2022-03-18T09:31:59Z","file_id":"10857","date_updated":"2022-03-18T09:31:59Z","checksum":"7e615ac8489f5eae580b6517debfdc53","content_type":"application/pdf","success":1,"access_level":"open_access","relation":"main_file"}],"oa":1,"publication_identifier":{"issn":["2299-3274"]},"file_date_updated":"2022-03-18T09:31:59Z","publication":"Analysis and Geometry in Metric Spaces","author":[{"full_name":"Ivanov, Grigory","last_name":"Ivanov","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"},{"full_name":"Tsiutsiurupa, Igor","last_name":"Tsiutsiurupa","first_name":"Igor"}],"keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"scopus_import":"1","intvolume":"         9","isi":1},{"ddc":["516"],"article_type":"original","doi":"10.1007/s00454-020-00250-8","month":"07","title":"Triangulating submanifolds: An elementary and quantified version of Whitney’s method","_id":"8940","citation":{"short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete &#38; Computational Geometry 66 (2021) 386–434.","mla":"Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” <i>Discrete &#38; Computational Geometry</i>, vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:<a href=\"https://doi.org/10.1007/s00454-020-00250-8\">10.1007/s00454-020-00250-8</a>.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Triangulating submanifolds: An elementary and quantified version of Whitney’s method,” <i>Discrete &#38; Computational Geometry</i>, vol. 66, no. 1. Springer Nature, pp. 386–434, 2021.","apa":"Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Triangulating submanifolds: An elementary and quantified version of Whitney’s method. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00250-8\">https://doi.org/10.1007/s00454-020-00250-8</a>","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. <i>Discrete &#38; Computational Geometry</i>. 2021;66(1):386-434. doi:<a href=\"https://doi.org/10.1007/s00454-020-00250-8\">10.1007/s00454-020-00250-8</a>","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete &#38; Computational Geometry. 66(1), 386–434.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00250-8\">https://doi.org/10.1007/s00454-020-00250-8</a>."},"article_processing_charge":"Yes (via OA deal)","date_updated":"2025-04-14T07:43:50Z","oa_version":"Published Version","year":"2021","date_published":"2021-07-01T00:00:00Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"has_accepted_license":"1","page":"386-434","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"short":"CC BY (4.0)","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)"},"status":"public","issue":"1","day":"01","publisher":"Springer Nature","type":"journal_article","publication_status":"published","language":[{"iso":"eng"}],"corr_author":"1","date_created":"2020-12-12T11:07:02Z","external_id":{"isi":["000597770300001"]},"department":[{"_id":"HeEd"}],"quality_controlled":"1","volume":66,"abstract":[{"lang":"eng","text":"We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric."}],"intvolume":"        66","isi":1,"ec_funded":1,"publication":"Discrete & Computational Geometry","file_date_updated":"2021-08-06T09:52:29Z","scopus_import":"1","keyword":["Theoretical Computer Science","Computational Theory and Mathematics","Geometry and Topology","Discrete Mathematics and Combinatorics"],"author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"first_name":"Siargey","full_name":"Kachanovich, Siargey","last_name":"Kachanovich"},{"orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs"}],"oa":1,"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"acknowledgement":"This work has been 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). The third author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. Open access funding provided by the Institute of Science and Technology (IST Austria).","file":[{"success":1,"relation":"main_file","access_level":"open_access","file_id":"9795","date_created":"2021-08-06T09:52:29Z","creator":"kschuh","file_name":"2021_DescreteCompGeopmetry_Boissonnat.pdf","file_size":983307,"checksum":"c848986091e56699dc12de85adb1e39c","content_type":"application/pdf","date_updated":"2021-08-06T09:52:29Z"}]},{"publication":"Geometric and Functional Analysis","keyword":["Geometry and Topology","Analysis"],"author":[{"first_name":"Guan","last_name":"Huang","full_name":"Huang, Guan"},{"orcid":"0000-0002-6051-2628","first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim","last_name":"Kaloshin"},{"full_name":"Sorrentino, Alfonso","last_name":"Sorrentino","first_name":"Alfonso"}],"intvolume":"        28","main_file_link":[{"url":"https://arxiv.org/abs/1705.10601","open_access":"1"}],"oa":1,"publication_identifier":{"issn":["1016-443X","1420-8970"]},"external_id":{"arxiv":["1705.10601"]},"date_created":"2020-09-17T10:42:30Z","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of an ellipse of small eccentricity which preserves integrability near the boundary, is itself an ellipse. This extends the result in Avila et al. (Ann Math 184:527–558, ADK16), where integrability was assumed on a larger set. In particular, it shows that (local) integrability near the boundary implies global integrability. One of the crucial ideas in the proof consists in analyzing Taylor expansion of the corresponding action-angle coordinates with respect to the eccentricity parameter, deriving and studying higher order conditions for the preservation of integrable rational caustics.","lang":"eng"}],"volume":28,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","page":"334-392","date_published":"2018-03-18T00:00:00Z","year":"2018","oa_version":"Preprint","date_updated":"2021-01-12T08:19:11Z","day":"18","type":"journal_article","publisher":"Springer Nature","issue":"2","status":"public","doi":"10.1007/s00039-018-0440-4","article_type":"original","arxiv":1,"article_processing_charge":"No","citation":{"short":"G. Huang, V. Kaloshin, A. Sorrentino, Geometric and Functional Analysis 28 (2018) 334–392.","mla":"Huang, Guan, et al. “Nearly Circular Domains Which Are Integrable Close to the Boundary Are Ellipses.” <i>Geometric and Functional Analysis</i>, vol. 28, no. 2, Springer Nature, 2018, pp. 334–92, doi:<a href=\"https://doi.org/10.1007/s00039-018-0440-4\">10.1007/s00039-018-0440-4</a>.","ieee":"G. Huang, V. Kaloshin, and A. Sorrentino, “Nearly circular domains which are integrable close to the boundary are ellipses,” <i>Geometric and Functional Analysis</i>, vol. 28, no. 2. Springer Nature, pp. 334–392, 2018.","ama":"Huang G, Kaloshin V, Sorrentino A. Nearly circular domains which are integrable close to the boundary are ellipses. <i>Geometric and Functional Analysis</i>. 2018;28(2):334-392. doi:<a href=\"https://doi.org/10.1007/s00039-018-0440-4\">10.1007/s00039-018-0440-4</a>","apa":"Huang, G., Kaloshin, V., &#38; Sorrentino, A. (2018). Nearly circular domains which are integrable close to the boundary are ellipses. <i>Geometric and Functional Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00039-018-0440-4\">https://doi.org/10.1007/s00039-018-0440-4</a>","chicago":"Huang, Guan, Vadim Kaloshin, and Alfonso Sorrentino. “Nearly Circular Domains Which Are Integrable Close to the Boundary Are Ellipses.” <i>Geometric and Functional Analysis</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/s00039-018-0440-4\">https://doi.org/10.1007/s00039-018-0440-4</a>.","ista":"Huang G, Kaloshin V, Sorrentino A. 2018. Nearly circular domains which are integrable close to the boundary are ellipses. Geometric and Functional Analysis. 28(2), 334–392."},"_id":"8422","title":"Nearly circular domains which are integrable close to the boundary are ellipses","month":"03"}]