--- _id: '21971' abstract: - lang: eng text: "A Rust library for analyzing dendritic structures using quadric matrices. This project provides efficient tools for representing dendritic trees, computing quadric error metrics, and visualizing eigenvalue distributions on hexagonal plots.\r\n\r\nThis library implements quadric-based geometric analysis of dendritic structures, commonly found in neuroscience applications. Key features include:\r\n\r\nTree data structures: Hierarchical vertex and edge representations for dendritic trees\r\nQuadric matrices: Computation of quadric error metrics for edges and vertices\r\nVisualisation: Hexagonal plot generation using NormPolar transformations\r\nInteractive tools: Desktop application with plotting capabilities" author: - first_name: Yossi full_name: Bleile, Yossi id: 920a7385-7995-11ef-9bfd-8c434cd8f3c2 last_name: Bleile orcid: 0000-0002-4861-9174 - first_name: Emanuele full_name: Cortinovis, Emanuele last_name: Cortinovis citation: ama: Bokor Bleile Y, Cortinovis E. Quadrix. 2026. doi:10.15479/AT-ISTA-21971 apa: Bokor Bleile, Y., & Cortinovis, E. (2026). Quadrix. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21971 chicago: Bokor Bleile, Yossi, and Emanuele Cortinovis. “Quadrix.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21971. ieee: Y. Bokor Bleile and E. Cortinovis, “Quadrix.” Institute of Science and Technology Austria, 2026. ista: Bokor Bleile Y, Cortinovis E. 2026. Quadrix, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21971. mla: Bokor Bleile, Yossi, and Emanuele Cortinovis. Quadrix. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21971. short: Y. Bokor Bleile, E. Cortinovis, (2026). corr_author: '1' date_created: 2026-06-09T19:19:13Z date_published: 2026-06-15T00:00:00Z date_updated: 2026-06-15T23:00:03Z day: '15' department: - _id: HeEd doi: 10.15479/AT-ISTA-21971 file: - access_level: open_access checksum: 48f633b6767c4b15dd6220ca2b4dc175 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:02Z date_updated: 2026-06-09T19:16:02Z file_id: '21974' file_name: LICENSE file_size: 1081 relation: main_file success: 1 - access_level: open_access checksum: de25d0b224acbde3d38f837fdd8f97d5 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:27Z date_updated: 2026-06-09T19:16:27Z file_id: '21975' file_name: quadrix-x64.exe file_size: 11308032 relation: main_file success: 1 - access_level: open_access checksum: a7b94a7380dc178e76ebdba9f1fa45c2 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:28Z date_updated: 2026-06-09T19:16:28Z file_id: '21976' file_name: quadrix-arm64.exe file_size: 10655744 relation: main_file success: 1 - access_level: open_access checksum: 2404aa8619a56668bd95032791ee1250 content_type: application/zip creator: ybleile date_created: 2026-06-09T19:16:27Z date_updated: 2026-06-09T19:16:27Z file_id: '21977' file_name: Quadrix Desktop.app.zip file_size: 2032 relation: main_file success: 1 - access_level: open_access checksum: 106930f81563c5c719a5f4030b5ca5ed content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:40Z date_updated: 2026-06-09T19:16:40Z file_id: '21978' file_name: quadrix-arm64 file_size: 12187896 relation: main_file success: 1 - access_level: open_access checksum: 0e6ba129318446676f220087e7e6ff41 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:52Z date_updated: 2026-06-09T19:16:52Z file_id: '21979' file_name: quadrix-x64 file_size: 20587592 relation: main_file success: 1 - access_level: open_access checksum: f0b03385d17df049219465ab7403fe09 content_type: application/gzip creator: pub-gitlab-bot date_created: 2026-06-09T19:19:12Z date_updated: 2026-06-09T19:19:12Z file_id: '21972' file_name: Quadrix.zip file_size: 1914198 relation: main_file - access_level: open_access checksum: ede0bbb24bf41ab4009cf1b6a9009671 content_type: application/zip creator: ybleile date_created: 2026-06-10T19:09:38Z date_updated: 2026-06-10T19:09:38Z file_id: '21993' file_name: THIRD_PARTY_LICENSES.zip file_size: 37557 relation: supplementary_material - access_level: open_access checksum: f3c5fcc62c88e449ab5c660244df5aef content_type: text/markdown creator: ybleile date_created: 2026-06-15T08:13:32Z date_updated: 2026-06-15T08:13:32Z file_id: '22009' file_name: README.md file_size: 3839 relation: main_file success: 1 - access_level: open_access checksum: aa74828c3165aafcdee4ddcc9ecd37ac content_type: application/gzip creator: pub-gitlab-bot date_created: 2026-06-15T08:14:24Z date_updated: 2026-06-15T08:14:24Z file_id: '22008' file_name: Quadrix.zip file_size: 1912923 relation: main_file file_date_updated: 2026-06-15T08:14:24Z fulldoi: https://doi.org/10.15479/AT-ISTA-21971 has_accepted_license: '1' keyword: - quadratics - mathematics - dendrites - geometry - topology month: '06' oa: 1 project: - _id: 9106a876-16d5-11f0-9cad-bbf11c9952f9 grant_number: ESP 9584724 name: Quantitative Unbiased Shape Analysis with Geometry & Topology publisher: Institute of Science and Technology Austria status: public title: Quadrix tmp: legal_code_url: https://opensource.org/licenses/MIT name: The MIT License short: MIT type: software user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22617' abstract: - lang: eng text: "Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says \"Heads\" or \"Tails\". The team wins if all four choices match; otherwise the Devil wins. If all team players randomise independently, they win with probability 1/8; if all players share a common source of randomness, they win with probability 1/2. What happens when each pair of team players shares a source of randomness? Can the team do better than win with probability 1/4? The surprising (and nontrivial) answer is yes!\r\nWe introduce Dicey Games, a formal framework motivated by the study of distributed systems with shared sources of randomness (of which the above example is a specific instance). We characterise the existence, representation and computational complexity of optimal strategies in Dicey Games, and we study the problem of allocating limited sources of randomness optimally within a team." acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\nLéonard Brice: Part of this work was realised when this author was an FNRS aspirant at Université libre de Bruxelles.\r\nK. S. Thejaswini: Part of this work was realised when this author was a post-doctoral researcher at IST Austria.\r\nAcknowledgements We thank all our colleagues who took the time to hear our puzzle and wasted several hours of their research time in pursuit of the optimal bounds for the 3-player matching.\r\npennies problem.\r\n" alternative_title: - LIPIcs article_number: 23:1-23:26 article_processing_charge: No arxiv: 1 author: - first_name: Leonard J full_name: Brice, Leonard J id: ce3b3409-db6c-11f0-aa64-ad678f7fd937 last_name: Brice - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: K. S. full_name: Thejaswini, K. S. last_name: Thejaswini citation: ama: 'Brice LJ, Henzinger TA, Thejaswini KS. Dicey games: Shared sources of randomness in distributed systems. In: 41st Annual Symposium on Logic in Computer Science. Vol 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.LICS.2026.23' apa: 'Brice, L. J., Henzinger, T. A., & Thejaswini, K. S. (2026). Dicey games: Shared sources of randomness in distributed systems. In 41st Annual Symposium on Logic in Computer Science (Vol. 380). Lisbon, Portugal: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.LICS.2026.23' chicago: 'Brice, Leonard J, Thomas A Henzinger, and K. S. Thejaswini. “Dicey Games: Shared Sources of Randomness in Distributed Systems.” In 41st Annual Symposium on Logic in Computer Science, Vol. 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.LICS.2026.23.' ieee: 'L. J. Brice, T. A. Henzinger, and K. S. Thejaswini, “Dicey games: Shared sources of randomness in distributed systems,” in 41st Annual Symposium on Logic in Computer Science, Lisbon, Portugal, 2026, vol. 380.' ista: 'Brice LJ, Henzinger TA, Thejaswini KS. 2026. Dicey games: Shared sources of randomness in distributed systems. 41st Annual Symposium on Logic in Computer Science. LICS: Logic in Computer Science, LIPIcs, vol. 380, 23:1-23:26.' mla: 'Brice, Leonard J., et al. “Dicey Games: Shared Sources of Randomness in Distributed Systems.” 41st Annual Symposium on Logic in Computer Science, vol. 380, 23:1-23:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.LICS.2026.23.' short: L.J. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 41st Annual Symposium on Logic in Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. conference: end_date: 2026-07-23 location: Lisbon, Portugal name: 'LICS: Logic in Computer Science' start_date: 2026-07-20 corr_author: '1' das_tickbox: '0' date_created: 2026-08-02T22:01:52Z date_published: 2026-07-09T00:00:00Z date_updated: 2026-08-03T07:03:28Z day: '09' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.LICS.2026.23 ec_funded: 1 external_id: arxiv: - '2601.18303' file: - access_level: open_access checksum: 5d0ff4d267565188a8b4c7502e1bd243 content_type: application/pdf creator: dernst date_created: 2026-08-03T07:02:30Z date_updated: 2026-08-03T07:02:30Z file_id: '22625' file_name: 2026_LIPICSLICS_Brice.pdf file_size: 919708 relation: main_file success: 1 file_date_updated: 2026-08-03T07:02:30Z fulldoi: https://doi.org/10.4230/LIPIcs.LICS.2026.23 has_accepted_license: '1' intvolume: ' 380' keyword: - Concurrent games - Shared randomness - Topology - Algebraic Geometry language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '07' oa: 1 oa_version: Published Version project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 41st Annual Symposium on Logic in Computer Science publication_identifier: isbn: - '9783959774345' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: 'Dicey games: Shared sources of randomness in distributed systems' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 380 year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22405' abstract: - lang: eng text: "Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in 2D, the problem is solvable in truly subquadratic time [Chan et al., 2025], while for other objects, including unit segments and equilateral triangles in 2D or unit balls and axis-parallel unit cubes in 3D, there is no truly subquadratic time algorithm under the Orthogonal Vector (OV) hypothesis [Bringmann et al., 2022]. \r\nWe undertake a comprehensive study of computing the diameter of geometric intersection graphs for various types of objects. We discover many new irregularities, showing that the landscape is extremely nuanced: the source of hardness is a combination of the object type, the true diameter value, and how the objects intersect with each other. Our highlighted results for the 2D case include: \r\n1) The diameter of non-degenerate, axis-aligned line segments can be computed in truly subquadratic time. Previous hardness result [Bringmann et al., 2022] for line segments applies only to degenerate instances. On the other hand, for the degenerate case, we show that a truly subquadratic time algorithm exists when the true diameter is constant. \r\n2) An almost-linear-time algorithm for unit-square graphs of constant diameter. Previous algorithms [Duraj et al., 2024; Chan et al., 2025] rely on succinct representation assuming bounded VC-dimension; for such a strategy Ω(n^{7/4}) time is an inherent barrier. \r\n3) An Õ(n^{4/3})-time algorithm to decide if the diameter of a unit-disk graph is at most 2. This improves upon the recent algorithm with running time Õ(n^{2-1/9}) [Chan et al., 2025]. \r\n4) Deciding if the diameter of intersection graphs of fat triangles or line segments is at most 2 is truly subquadratic-hard under fine-grained complexity assumptions. Previous lower bounds [Bringmann et al., 2022] only hold when deciding if diameter is at most 3. Our findings are presented in a pair of papers. This paper focuses solely on the 2D case, while the companion paper is devoted to higher-dimensional cases." acknowledgement: "Timothy M. Chan: Supported by NSF grant CCF-2224271.\r\nHsien-Chih Chang: Supported by NSF CAREER award CCF-2443017.\r\nJie Gao: Supported by NSF DMS-2220271, DMS-2311064, IIS-2229876, CCF-2118953, CNS-2515159.\r\nSándor Kisfaludi-Bak: Supported by the Research Council of Finland, Grant 363444.\r\nHung Le: Supported by an NSF grant CCF-2517033 and an NSF CAREER Award CCF-2237288.\r\nDa Wei Zheng: This project has received funding from the Austrian Science Fund (FWF) grant\r\nDOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright\r\nlicense to any author-accepted manuscript version arising from this submission.\r\n" article_number: 54:1-54:22 article_processing_charge: No arxiv: 1 author: - first_name: Timothy M. full_name: Chan, Timothy M. last_name: Chan orcid: 0000-0002-8093-0675 - first_name: Hsien-Chih full_name: Chang, Hsien-Chih last_name: Chang orcid: 0000-0001-6714-7988 - first_name: Jie full_name: Gao, Jie last_name: Gao orcid: 0000-0001-5083-6082 - first_name: Sándor full_name: Kisfaludi-Bak, Sándor last_name: Kisfaludi-Bak orcid: 0000-0002-6856-2902 - first_name: Hung full_name: Le, Hung last_name: Le orcid: 0000-0001-8223-9944 - first_name: Da Wei full_name: Zheng, Da Wei id: af77956b-e859-11ef-8dc9-d301b898e32f last_name: Zheng citation: ama: 'Chan TM, Chang H-C, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. Charting the landscape of diameter computation on geometric intersection graphs in the plane. In: 53rd International Colloquium on Automata, Languages, and Programming. Vol 374. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPICS.ICALP.2026.54' apa: 'Chan, T. M., Chang, H.-C., Gao, J., Kisfaludi-Bak, S., Le, H., & Zheng, D. W. (2026). Charting the landscape of diameter computation on geometric intersection graphs in the plane. In 53rd International Colloquium on Automata, Languages, and Programming (Vol. 374). Egham, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2026.54' chicago: Chan, Timothy M., Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” In 53rd International Colloquium on Automata, Languages, and Programming, Vol. 374. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPICS.ICALP.2026.54. ieee: T. M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, and D. W. Zheng, “Charting the landscape of diameter computation on geometric intersection graphs in the plane,” in 53rd International Colloquium on Automata, Languages, and Programming, Egham, United Kingdom, 2026, vol. 374. ista: 'Chan TM, Chang H-C, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. 2026. Charting the landscape of diameter computation on geometric intersection graphs in the plane. 53rd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming vol. 374, 54:1-54:22.' mla: Chan, Timothy M., et al. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” 53rd International Colloquium on Automata, Languages, and Programming, vol. 374, 54:1-54:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPICS.ICALP.2026.54. short: T.M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D.W. Zheng, in:, 53rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. conference: end_date: 2026-07-10 location: Egham, United Kingdom name: 'ICALP: Automata, Languages and Programming' start_date: 2026-07-07 corr_author: '1' das_tickbox: '0' date_created: 2026-07-27T05:53:08Z date_published: 2026-07-01T00:00:00Z date_updated: 2026-08-12T09:03:26Z day: '01' ddc: - '000' department: - _id: MoHe doi: 10.4230/LIPICS.ICALP.2026.54 external_id: arxiv: - '2605.10692' file: - access_level: open_access checksum: 1e66eba4cfe4e74ab28108b1ca0bb956 content_type: application/pdf creator: dernst date_created: 2026-07-27T06:20:41Z date_updated: 2026-07-27T06:20:41Z file_id: '22407' file_name: 2026_LIPIcSICALP_Chan.pdf file_size: 1440497 relation: main_file success: 1 file_date_updated: 2026-07-27T06:20:41Z fulldoi: https://doi.org/10.4230/LIPICS.ICALP.2026.54 has_accepted_license: '1' intvolume: ' 374' keyword: - String graphs - Fine-grained complexity - Theory of computation → Computational geometry language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions publication: 53rd International Colloquium on Automata, Languages, and Programming publication_identifier: eissn: - 1868-8969 - '9783959774284' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Charting the landscape of diameter computation on geometric intersection graphs in the plane tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 374 year: '2026' ... --- OA_place: publisher OA_type: gold _id: '22299' abstract: - lang: eng text: The depth poset of a filtered Lefschetz complex reflects the dependencies between the cancellations of different shallow birth-death pairs. Using the fast algorithms for computing the depth poset in [Edelsbrunner et al., 2026] and for updating the persistence diagram under transpositions in [Cohen-Steiner et al., 2006], we give a complete case analysis of how transpositions of cells in the filter affect the depth poset. In addition, we present statistics on the depth poset for random point data and its sensitivity to the transpositions that occur in random straight-line homotopies. acknowledgement: "The authors thank Jakub Leśkiewicz and Bartosz Furmanek for discussions\r\nthat helped improve the paper. Herbert Edelsbrunner: DFG Collaborative Research Center TRR 109, Austrian Science\r\nFund (FWF), grant no. I 02979-N35\r\nMichał Lipiński: European Union’s Horizon 2020 research and innovation programme under the\r\nMarie Skłodowska-Curie Grant Agreement No. 101034413\r\nMarian Mrozek: Polish National Science Center under Opus Grant 2019/35/B/ST1/00874 and Opus\r\nGrant 2025/57/B/ST1/00550" alternative_title: - LIPIcs article_number: 41:1-41:18 article_processing_charge: Yes arxiv: 1 author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Michał full_name: Lipiński, Michał id: dfffb474-4317-11ee-8f5c-fe3fc95a425e last_name: Lipiński orcid: 0000-0001-9789-9750 - first_name: Marian full_name: Mrozek, Marian last_name: Mrozek orcid: 0000-0002-0619-6417 - first_name: Manuel full_name: Soriano Trigueros, Manuel id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8 last_name: Soriano Trigueros orcid: 0000-0003-2449-1433 - first_name: Fedor full_name: Zimin, Fedor id: afd27eda-91c1-11f0-aad8-c6edbec24c04 last_name: Zimin citation: ama: 'Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. The depth poset under transpositions in the filter. In: 42nd International Symposium on Computational Geometry. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPICS.SOCG.2026.41' apa: 'Edelsbrunner, H., Lipiński, M., Mrozek, M., Soriano Trigueros, M., & Zimin, F. (2026). The depth poset under transpositions in the filter. In 42nd International Symposium on Computational Geometry (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2026.41' chicago: Edelsbrunner, Herbert, Michał Lipiński, Marian Mrozek, Manuel Soriano Trigueros, and Fedor Zimin. “The Depth Poset under Transpositions in the Filter.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPICS.SOCG.2026.41. ieee: H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, and F. Zimin, “The depth poset under transpositions in the filter,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367. ista: 'Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. 2026. The depth poset under transpositions in the filter. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 41:1-41:18.' mla: Edelsbrunner, Herbert, et al. “The Depth Poset under Transpositions in the Filter.” 42nd International Symposium on Computational Geometry, vol. 367, 41:1-41:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPICS.SOCG.2026.41. short: H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, F. Zimin, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. conference: end_date: 2026-06-05 location: New Brunswick, NJ, United States name: 'SoCG: Symposium on Computational Geometry' start_date: 2026-06-02 corr_author: '1' das_tickbox: '0' date_created: 2026-07-13T09:56:38Z date_published: 2026-05-27T00:00:00Z date_updated: 2026-08-12T09:02:56Z day: '27' ddc: - '500' department: - _id: HeEd - _id: GradSch doi: 10.4230/LIPICS.SOCG.2026.41 ec_funded: 1 external_id: arxiv: - '2511.21961' file: - access_level: open_access checksum: 9dfb96ee66985c724b499b0e5888dc8e content_type: application/pdf creator: dernst date_created: 2026-07-14T06:08:05Z date_updated: 2026-07-14T06:08:05Z file_id: '22329' file_name: 2026_LIPIcSSoCG_Edelsbrunner.pdf file_size: 2902144 relation: main_file success: 1 file_date_updated: 2026-07-14T06:08:05Z fulldoi: https://doi.org/10.4230/LIPICS.SOCG.2026.41 has_accepted_license: '1' intvolume: ' 367' keyword: - Algebraic topology - Lefschetz complexes - persistent homology - vines and vineyards - birth-death pairs - shallow pairs - relations - partial orders - transpositions - Theory of computation → Computational geometry language: - iso: eng month: '05' oa: 1 oa_version: Published Version project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: 42nd International Symposium on Computational Geometry publication_identifier: eissn: - 1868-8969 isbn: - '9783959774185' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: The depth poset under transpositions in the filter tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 367 year: '2026' ... --- OA_place: repository OA_type: green _id: '10011' abstract: - lang: eng text: We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow-is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle. acknowledgement: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. The content of this paper was developed and parts of it were written during a visit of the first author to the Hausdorff Center of Mathematics (HCM), University of Bonn. The hospitality and the support of HCM are gratefully acknowledged. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tim full_name: Laux, Tim last_name: Laux citation: ama: 'Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. 2025;130:209-268. doi:10.4310/jdg/1747065796' apa: 'Hensel, S., & Laux, T. (2025). A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. International Press of Boston. https://doi.org/10.4310/jdg/1747065796' chicago: 'Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.” Journal of Differential Geometry. International Press of Boston, 2025. https://doi.org/10.4310/jdg/1747065796.' ieee: 'S. Hensel and T. Laux, “A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness,” Journal of Differential Geometry, vol. 130. International Press of Boston, pp. 209–268, 2025.' ista: 'Hensel S, Laux T. 2025. A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. 130, 209–268.' mla: 'Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.” Journal of Differential Geometry, vol. 130, International Press of Boston, 2025, pp. 209–68, doi:10.4310/jdg/1747065796.' short: S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 209–268. corr_author: '1' das_tickbox: '1' date_created: 2021-09-13T12:17:10Z date_published: 2025-05-01T00:00:00Z date_updated: 2026-07-06T13:37:21Z day: '01' department: - _id: JuFi doi: 10.4310/jdg/1747065796 ec_funded: 1 external_id: arxiv: - '2109.04233' fulldoi: https://doi.org/10.4310/jdg/1747065796 intvolume: ' 130' keyword: - Mean curvature flow - gradient flows - varifolds - weak solutions - weak-strong uniqueness - calibrated geometry - gradient-flow calibrations language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2109.04233 month: '05' oa: 1 oa_version: Preprint page: 209-268 project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication: Journal of Differential Geometry publication_identifier: eissn: - 1945-743X issn: - 0022-040X publication_status: published publisher: International Press of Boston quality_controlled: '1' scopus_import: '1' status: public title: 'A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 130 year: '2025' ... --- OA_place: repository OA_type: green _id: '22340' abstract: - lang: eng text: We show that Laplace isospectral deformations within a conformal class of generic Liouville metrics on the two-dimensional torus that are linear in the deformation parameter are necessarily trivial. Two of the main ingredients in our proof are a noncancellation result for the wave trace and an analysis of the second order variational formula for the energy functional associated to closed geodesics. Noncancellation allows us to detect parts of the length spectrum from the Laplace spectrum and conclude rational integrability for the deformed geodesic flow (Liouville metrics are folklorically conjectured to be the only Riemannian metrics with integrable geodesic flow on the torus). We then use the second variational formula to show how the preservation of a single rational torus is sufficient to conclude triviality of the deformation, assuming linearity. We also present some evidence that our hypothesis of linearity may indeed be necessary. article_processing_charge: No arxiv: 1 author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 - first_name: Yunzhe full_name: Li, Yunzhe id: 41cb05d3-f128-11eb-9611-e4e2b3cfba31 last_name: Li - first_name: Amir full_name: Vig, Amir id: 49d58dd5-45f5-11ec-9f86-8ce1276989b9 last_name: Vig citation: ama: Henheik SJ, Kaloshin V, Li Y, Vig A. Spectral rigidity of Liouville tori. arXiv. doi:10.48550/ARXIV.2511.10398 apa: Henheik, S. J., Kaloshin, V., Li, Y., & Vig, A. (n.d.). Spectral rigidity of Liouville tori. arXiv. https://doi.org/10.48550/ARXIV.2511.10398 chicago: Henheik, Sven Joscha, Vadim Kaloshin, Yunzhe Li, and Amir Vig. “Spectral Rigidity of Liouville Tori.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2511.10398. ieee: S. J. Henheik, V. Kaloshin, Y. Li, and A. Vig, “Spectral rigidity of Liouville tori,” arXiv. . ista: Henheik SJ, Kaloshin V, Li Y, Vig A. Spectral rigidity of Liouville tori. arXiv, 10.48550/ARXIV.2511.10398. mla: Henheik, Sven Joscha, et al. “Spectral Rigidity of Liouville Tori.” ArXiv, doi:10.48550/ARXIV.2511.10398. short: S.J. Henheik, V. Kaloshin, Y. Li, A. Vig, ArXiv (n.d.). corr_author: '1' date_created: 2026-07-14T12:51:50Z date_published: 2025-11-13T00:00:00Z date_updated: 2026-07-20T14:58:23Z day: '13' department: - _id: VaKa - _id: LaEr doi: 10.48550/ARXIV.2511.10398 external_id: arxiv: - '2511.10398' fulldoi: https://doi.org/10.48550/ARXIV.2511.10398 keyword: - Differential Geometry (math.DG) - Mathematical Physics (math-ph) - Dynamical Systems (math.DS) - Spectral Theory (math.SP) - 'FOS: Mathematics' - 'FOS: Mathematics' - 'FOS: Physical sciences' - 'FOS: Physical sciences' - 58J42 - 37J35 - 37J35 - 35P20 - 58J40 - 58J50 - 37D40 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2511.10398 month: '11' oa: 1 oa_version: Preprint publication: arXiv publication_status: draft related_material: record: - id: '22255' relation: dissertation_contains status: public status: public title: Spectral rigidity of Liouville tori tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- _id: '17203' abstract: - lang: eng text: "The behavior of a rigid body primarily depends on its mass moments, which consist of the mass, center of mass, and moments of inertia. It is possible to manipulate these quantities without altering the geometric appearance of an object by introducing cavities in its interior. Algorithms that find cavities of suitable shapes and sizes have enabled the computational design of spinning tops, yo-yos, wheels, buoys, and statically balanced objects. Previous work is based, for example, on topology optimization on voxel grids, which introduces a large number of optimization variables and box constraints, or offset surface computation, which cannot guarantee that solutions to a feasible problem will always be found.\r\n\r\nIn this work, we provide a mathematical analysis of constrained topology optimization problems that depend only on mass moments. This class of problems covers, among others, all applications mentioned above. Our main result is to show that no matter the outer shape of the rigid body to be optimized or the optimization objective and constraints considered, the optimal solution always features a quadric-shaped interface between material and cavities. This proves that optimal interfaces are always ellipsoids, hyperboloids, paraboloids, or one of a few degenerate cases, such as planes.\r\n\r\nThis insight lets us replace a difficult topology optimization problem with a provably equivalent non-linear equation system in a small number (<10) of variables, which represent the coefficients of the quadric. This system can be solved in a few seconds for most examples, provides insights into the geometric structure of many specific applications, and lets us describe their solution properties. Finally, our method integrates seamlessly into modern fabrication workflows because our solutions are analytical surfaces that are native to the CAD domain." acknowledgement: We thank Gianmarco Cherchi for his help in tailoring the Mesh Booleans code for this project, Stefan Jeschke for his help with the photographs, Malina Strugaru and Aleksei Kalinov for their help with the samples, and the anonymous reviewers as well as the members of the ISTA Visual Computing Group for their feedback. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA). article_number: '78' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Christian full_name: Hafner, Christian id: 400429CC-F248-11E8-B48F-1D18A9856A87 last_name: Hafner - first_name: Mickaël full_name: Ly, Mickaël id: 6340d7f0-b48d-11eb-b10d-b7487e71d9f1 last_name: Ly - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: 'Hafner C, Ly M, Wojtan C. Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. 2024;43(4). doi:10.1145/3658194' apa: 'Hafner, C., Ly, M., & Wojtan, C. (2024). Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. Denver, Colorado: Association for Computing Machinery. https://doi.org/10.1145/3658194' chicago: 'Hafner, Christian, Mickaël Ly, and Chris Wojtan. “Spin-It Faster: Quadrics Solve All Topology Optimization Problems That Depend Only on Mass Moments.” Transactions on Graphics. Association for Computing Machinery, 2024. https://doi.org/10.1145/3658194.' ieee: 'C. Hafner, M. Ly, and C. Wojtan, “Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments,” Transactions on Graphics, vol. 43, no. 4. Association for Computing Machinery, 2024.' ista: 'Hafner C, Ly M, Wojtan C. 2024. Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. 43(4), 78.' mla: 'Hafner, Christian, et al. “Spin-It Faster: Quadrics Solve All Topology Optimization Problems That Depend Only on Mass Moments.” Transactions on Graphics, vol. 43, no. 4, 78, Association for Computing Machinery, 2024, doi:10.1145/3658194.' short: C. Hafner, M. Ly, C. Wojtan, Transactions on Graphics 43 (2024). conference: end_date: 2024-08-01 location: Denver, Colorado start_date: 2024-07-28 corr_author: '1' date_created: 2024-07-05T12:08:57Z date_published: 2024-07-01T00:00:00Z date_updated: 2025-09-08T08:29:09Z day: '01' ddc: - '516' department: - _id: ChWo doi: 10.1145/3658194 external_id: isi: - '001289270900045' file: - access_level: open_access checksum: 0dc9f5a6422b8a49a79026900f349ee5 content_type: application/pdf creator: chafner date_created: 2024-07-05T12:05:17Z date_updated: 2024-07-05T12:05:17Z file_id: '17204' file_name: sif-final.pdf file_size: 7225150 relation: main_file success: 1 - access_level: open_access checksum: cde433c6a40688d5f1187fb5721f6f94 content_type: application/pdf creator: chafner date_created: 2024-07-05T12:06:03Z date_updated: 2024-07-05T12:06:03Z file_id: '17205' file_name: sif-supp-final.pdf file_size: 397262 relation: supplementary_material - access_level: open_access checksum: c0457a09c2ab9a1c2935c995dcc84907 content_type: video/mp4 creator: chafner date_created: 2024-07-17T09:29:13Z date_updated: 2024-07-17T09:29:13Z file_id: '17276' file_name: sif-video-final.mp4 file_size: 170001305 relation: supplementary_material title: Submission Video file_date_updated: 2024-07-17T09:29:13Z fulldoi: https://doi.org/10.1145/3658194 has_accepted_license: '1' intvolume: ' 43' isi: 1 issue: '4' keyword: - Topology Optimization - Mass Moments - Computational Geometry language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088 grant_number: '101045083' name: Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena publication: Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: 'Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments' type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 43 year: '2024' ... --- OA_place: publisher OA_type: free access _id: '18443' abstract: - lang: eng text: "In [KW06] Kapustin and Witten conjectured that there is a mirror symmetry relation between\r\nthe hyperkähler structures on certain Higgs bundle moduli spaces. As a consequence, they\r\nconjecture an equivalence between categories of BBB and BAA-branes. At the classical\r\nlevel, this mirror symmetry is given by T-duality between semi-flat hyperkähler structures on\r\nalgebraic integrable systems.\r\nIn this thesis, we investigate the T-duality relation between hyperkähler structures and the\r\ncorresponding branes on affine torus bundles. We use the techniques of generalized geometry\r\nto show that semi-flat hyperkähler structures are T-dual on algebraic integrable systems.\r\nWe also describe T-duality for generalized branes. Motivated by Fourier-Mukai transform\r\nwe upgrade the T-duality between generalized branes to T-duality of submanifolds endowed\r\nwith U(1)-bundles and connections. This T-duality in the appropriate context specializes to\r\nT-duality between BBB and BAA-branes.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Maria A full_name: Sisak, Maria A id: 44A03D04-AEA4-11E9-B225-EA2DE6697425 last_name: Sisak citation: ama: Sisak MA. T-dual branes on hyperkähler manifolds. 2024. doi:10.15479/at:ista:18443 apa: Sisak, M. A. (2024). T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18443 chicago: Sisak, Maria A. “T-Dual Branes on Hyperkähler Manifolds.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18443. ieee: M. A. Sisak, “T-dual branes on hyperkähler manifolds,” Institute of Science and Technology Austria, 2024. ista: Sisak MA. 2024. T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria. mla: Sisak, Maria A. T-Dual Branes on Hyperkähler Manifolds. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18443. short: M.A. Sisak, T-Dual Branes on Hyperkähler Manifolds, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-10-19T12:00:37Z date_published: 2024-10-24T00:00:00Z date_updated: 2026-04-07T12:42:44Z day: '24' ddc: - '516' degree_awarded: PhD department: - _id: GradSch - _id: TaHa doi: 10.15479/at:ista:18443 file: - access_level: open_access checksum: 8c4893e726aaa4b3efb82758da9b6851 content_type: application/pdf creator: msisak date_created: 2024-10-23T14:42:45Z date_updated: 2024-10-23T14:42:45Z file_id: '18467' file_name: MASisak_dissertation.pdf file_size: 1672547 relation: main_file success: 1 - access_level: closed checksum: 1831b072e861a1e5481024ca9d02b036 content_type: application/x-zip-compressed creator: msisak date_created: 2024-10-23T14:43:56Z date_updated: 2024-10-24T08:09:13Z file_id: '18468' file_name: MASisak_source.zip file_size: 617913 relation: source_file file_date_updated: 2024-10-24T08:09:13Z fulldoi: https://doi.org/10.15479/at:ista:18443 has_accepted_license: '1' keyword: - hyperkaehler geometry - branes - mirror symmetry - T-duality language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '178' project: - _id: 6286e8c4-2b32-11ec-9570-f5297902f67f grant_number: '26069' name: Branes on hyperkähler manifolds publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Tamás full_name: Hausel, Tamás id: 4A0666D8-F248-11E8-B48F-1D18A9856A87 last_name: Hausel orcid: 0000-0002-9582-2634 title: T-dual branes on hyperkähler manifolds tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- _id: '12287' abstract: - lang: eng 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. 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)." article_processing_charge: No article_type: original author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Ramsay full_name: Dyer, Ramsay last_name: Dyer - first_name: Arijit full_name: Ghosh, Arijit last_name: Ghosh - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7 apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7 chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7. ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023. ista: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191. mla: Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7. short: J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191. corr_author: '1' date_created: 2023-01-16T10:04:06Z date_published: 2023-01-01T00:00:00Z date_updated: 2025-04-14T07:44:00Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s00454-022-00431-7 ec_funded: 1 external_id: isi: - '000862193600001' file: - access_level: open_access checksum: 46352e0ee71e460848f88685ca852681 content_type: application/pdf creator: dernst date_created: 2023-02-02T11:01:10Z date_updated: 2023-02-02T11:01:10Z file_id: '12488' file_name: 2023_DiscreteCompGeometry_Boissonnat.pdf file_size: 582850 relation: main_file success: 1 file_date_updated: 2023-02-02T11:01:10Z fulldoi: https://doi.org/10.1007/s00454-022-00431-7 has_accepted_license: '1' intvolume: ' 69' isi: 1 keyword: - Computational Theory and Mathematics - Discrete Mathematics and Combinatorics - Geometry and Topology - Theoretical Computer Science language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 156-191 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: Discrete & Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Local criteria for triangulating general manifolds tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 69 year: '2023' ... --- _id: '14192' abstract: - lang: eng 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. 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. article_number: '17' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Jonas full_name: Lampart, Jonas last_name: Lampart - first_name: David Johannes full_name: Mitrouskas, David Johannes id: cbddacee-2b11-11eb-a02e-a2e14d04e52d last_name: Mitrouskas - first_name: Krzysztof full_name: Mysliwy, Krzysztof id: 316457FC-F248-11E8-B48F-1D18A9856A87 last_name: Mysliwy citation: ama: Lampart J, Mitrouskas DJ, Mysliwy K. On the global minimum of the energy–momentum relation for the polaron. Mathematical Physics, Analysis and Geometry. 2023;26(3). doi:10.1007/s11040-023-09460-x apa: Lampart, J., Mitrouskas, D. J., & Mysliwy, K. (2023). On the global minimum of the energy–momentum relation for the polaron. Mathematical Physics, Analysis and Geometry. Springer Nature. https://doi.org/10.1007/s11040-023-09460-x chicago: Lampart, Jonas, David Johannes Mitrouskas, and Krzysztof Mysliwy. “On the Global Minimum of the Energy–Momentum Relation for the Polaron.” Mathematical Physics, Analysis and Geometry. Springer Nature, 2023. https://doi.org/10.1007/s11040-023-09460-x. ieee: J. Lampart, D. J. Mitrouskas, and K. Mysliwy, “On the global minimum of the energy–momentum relation for the polaron,” Mathematical Physics, Analysis and Geometry, vol. 26, no. 3. Springer Nature, 2023. 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. mla: Lampart, Jonas, et al. “On the Global Minimum of the Energy–Momentum Relation for the Polaron.” Mathematical Physics, Analysis and Geometry, vol. 26, no. 3, 17, Springer Nature, 2023, doi:10.1007/s11040-023-09460-x. short: J. Lampart, D.J. Mitrouskas, K. Mysliwy, Mathematical Physics, Analysis and Geometry 26 (2023). corr_author: '1' date_created: 2023-08-22T14:09:47Z date_published: 2023-07-26T00:00:00Z date_updated: 2024-10-09T21:06:41Z day: '26' ddc: - '510' department: - _id: RoSe doi: 10.1007/s11040-023-09460-x external_id: arxiv: - '2206.14708' isi: - '001032992600001' file: - access_level: open_access checksum: f0941cc66cb3ed06a12ca4b7e356cfd6 content_type: application/pdf creator: dernst date_created: 2023-08-23T10:59:15Z date_updated: 2023-08-23T10:59:15Z file_id: '14225' file_name: 2023_MathPhysics_Lampart.pdf file_size: 317026 relation: main_file success: 1 file_date_updated: 2023-08-23T10:59:15Z fulldoi: https://doi.org/10.1007/s11040-023-09460-x has_accepted_license: '1' intvolume: ' 26' isi: 1 issue: '3' keyword: - Geometry and Topology - Mathematical Physics language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Mathematical Physics, Analysis and Geometry publication_identifier: eissn: - 1572-9656 issn: - 1385-0172 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: On the global minimum of the energy–momentum relation for the polaron tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2023' ... --- _id: '14499' 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." 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. article_number: e21 article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Matthew Alan full_name: Kwan, Matthew Alan id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3 last_name: Kwan orcid: 0000-0002-4003-7567 - first_name: Ashwin full_name: Sah, Ashwin last_name: Sah - first_name: Lisa full_name: Sauermann, Lisa last_name: Sauermann - first_name: Mehtaab full_name: Sawhney, Mehtaab last_name: Sawhney citation: ama: Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 2023;11. doi:10.1017/fmp.2023.17 apa: Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17 chicago: Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17. ieee: M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi, vol. 11. Cambridge University Press, 2023. 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. mla: Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21, Cambridge University Press, 2023, doi:10.1017/fmp.2023.17. short: M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (2023). corr_author: '1' date_created: 2023-11-07T09:02:48Z date_published: 2023-08-24T00:00:00Z date_updated: 2025-09-09T13:16:15Z day: '24' ddc: - '510' department: - _id: MaKw doi: 10.1017/fmp.2023.17 external_id: arxiv: - '2208.02874' isi: - '001123866200001' file: - access_level: open_access checksum: 54b824098d59073cc87a308d458b0a3e content_type: application/pdf creator: dernst date_created: 2023-11-07T09:16:23Z date_updated: 2023-11-07T09:16:23Z file_id: '14500' file_name: 2023_ForumMathematics_Kwan.pdf file_size: 1218719 relation: main_file success: 1 file_date_updated: 2023-11-07T09:16:23Z fulldoi: https://doi.org/10.1017/fmp.2023.17 has_accepted_license: '1' intvolume: ' 11' isi: 1 keyword: - Discrete Mathematics and Combinatorics - Geometry and Topology - Mathematical Physics - Statistics and Probability - Algebra and Number Theory - Analysis language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: bd95085b-d553-11ed-ba76-e55d3349be45 grant_number: '101076777' name: Randomness and structure in combinatorics publication: Forum of Mathematics, Pi publication_identifier: issn: - 2050-5086 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 11 year: '2023' ... --- _id: '14756' abstract: - lang: eng 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." 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." article_processing_charge: Yes article_type: original author: - first_name: Nils full_name: Carqueville, Nils last_name: Carqueville - first_name: Lorant full_name: Szegedy, Lorant id: 7943226E-220E-11EA-94C7-D59F3DDC885E last_name: Szegedy orcid: 0000-0003-2834-5054 citation: ama: Carqueville N, Szegedy L. Fully extended r-spin TQFTs. Quantum Topology. 2023;14(3):467-532. doi:10.4171/qt/193 apa: Carqueville, N., & Szegedy, L. (2023). Fully extended r-spin TQFTs. Quantum Topology. EMS Press. https://doi.org/10.4171/qt/193 chicago: Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” Quantum Topology. EMS Press, 2023. https://doi.org/10.4171/qt/193. ieee: N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” Quantum Topology, vol. 14, no. 3. EMS Press, pp. 467–532, 2023. ista: Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532. mla: Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” Quantum Topology, vol. 14, no. 3, EMS Press, 2023, pp. 467–532, doi:10.4171/qt/193. short: N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532. corr_author: '1' das_tickbox: '1' date_created: 2024-01-08T13:14:48Z date_published: 2023-10-16T00:00:00Z date_updated: 2026-07-06T11:52:15Z day: '16' ddc: - '530' department: - _id: MiLe doi: 10.4171/qt/193 external_id: isi: - '001104620800003' file: - access_level: open_access checksum: b0590aff6e7ec89cc149ba94d459d3a3 content_type: application/pdf creator: dernst date_created: 2024-01-09T09:25:34Z date_updated: 2024-01-09T09:25:34Z file_id: '14764' file_name: 2023_QuantumTopol_Carqueville.pdf file_size: 707344 relation: main_file success: 1 file_date_updated: 2024-01-09T09:25:34Z fulldoi: https://doi.org/10.4171/qt/193 has_accepted_license: '1' intvolume: ' 14' isi: 1 issue: '3' keyword: - Geometry and Topology - Mathematical Physics language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 467-532 publication: Quantum Topology publication_identifier: issn: - 1663-487X publication_status: published publisher: EMS Press quality_controlled: '1' scopus_import: '1' status: public title: Fully extended r-spin TQFTs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2023' ... --- _id: '13049' abstract: - lang: eng text: "We propose a computational design approach for covering a surface with individually addressable RGB LEDs, effectively forming a low-resolution surface screen. To achieve a low-cost and scalable approach, we propose creating designs from flat PCB panels bent in-place along the surface of a 3D printed core. Working with standard rigid PCBs enables the use of\r\nestablished PCB manufacturing services, allowing the fabrication of designs with several hundred LEDs. \r\nOur approach optimizes the PCB geometry for folding, and then jointly optimizes the LED packing, circuit and routing, solving a challenging layout problem under strict manufacturing requirements. Unlike paper, PCBs cannot bend beyond a certain point without breaking. Therefore, we introduce parametric cut patterns acting as hinges, designed to allow bending while remaining compact. To tackle the joint optimization of placement, circuit and routing, we propose a specialized algorithm that splits the global problem into one sub-problem per triangle, which is then individually solved.\r\nOur technique generates PCB blueprints in a completely automated way. After being fabricated by a PCB manufacturing service, the boards are bent and glued by the user onto the 3D printed support. We demonstrate our technique on a range of physical models and virtual examples, creating intricate surface light patterns from hundreds of LEDs." acknowledged_ssus: - _id: M-Shop acknowledgement: We thank the reviewers for the valuable feedback. We also thank the Miba Machine Shop at ISTA, PCBWay, and PragoBoard for helping us with fabrication and assembly. This project was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 715767 – MATERIALIZABLE). article_number: '142' article_processing_charge: No article_type: original author: - first_name: Marco full_name: Freire, Marco last_name: Freire - first_name: Manas full_name: Bhargava, Manas id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425 last_name: Bhargava orcid: 0009-0007-6138-6890 - first_name: Camille full_name: Schreck, Camille id: 2B14B676-F248-11E8-B48F-1D18A9856A87 last_name: Schreck - first_name: Pierre-Alexandre full_name: Hugron, Pierre-Alexandre last_name: Hugron - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Sylvain full_name: Lefebvre, Sylvain last_name: Lefebvre citation: ama: 'Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on Graphics. 2023;42(4). doi:10.1145/3592411' apa: 'Freire, M., Bhargava, M., Schreck, C., Hugron, P.-A., Bickel, B., & Lefebvre, S. (2023). PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on Graphics. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3592411' chicago: 'Freire, Marco, Manas Bhargava, Camille Schreck, Pierre-Alexandre Hugron, Bernd Bickel, and Sylvain Lefebvre. “PCBend: Light up Your 3D Shapes with Foldable Circuit Boards.” Transactions on Graphics. Association for Computing Machinery, 2023. https://doi.org/10.1145/3592411.' ieee: 'M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, and S. Lefebvre, “PCBend: Light up your 3D shapes with foldable circuit boards,” Transactions on Graphics, vol. 42, no. 4. Association for Computing Machinery, 2023.' ista: 'Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. 2023. PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on Graphics. 42(4), 142.' mla: 'Freire, Marco, et al. “PCBend: Light up Your 3D Shapes with Foldable Circuit Boards.” Transactions on Graphics, vol. 42, no. 4, 142, Association for Computing Machinery, 2023, doi:10.1145/3592411.' short: M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, S. Lefebvre, Transactions on Graphics 42 (2023). conference: end_date: 2023-08-10 location: Los Angeles, CA, United States name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference' start_date: 2023-08-06 corr_author: '1' date_created: 2023-05-22T08:37:04Z date_published: 2023-07-26T00:00:00Z date_updated: 2026-07-29T13:03:30Z day: '26' ddc: - '006' department: - _id: GradSch - _id: BeBi doi: 10.1145/3592411 ec_funded: 1 external_id: isi: - '001044671300108' file: - access_level: open_access checksum: a0b0ba3b36f43a94388e8824613d812a content_type: application/pdf creator: dernst date_created: 2023-06-19T11:02:23Z date_updated: 2023-06-19T11:02:23Z file_id: '13156' file_name: 2023_ACMToG_Freire.pdf file_size: 78940724 relation: main_file success: 1 - access_level: open_access checksum: b9206bbb67af82df49b7e7cdbde3410c content_type: application/pdf creator: dernst date_created: 2023-06-20T12:20:51Z date_updated: 2023-06-20T12:20:51Z file_id: '13157' file_name: 2023_ACMToG_SuppMaterial_Freire.pdf file_size: 34345905 relation: main_file success: 1 file_date_updated: 2023-06-20T12:20:51Z fulldoi: https://doi.org/10.1145/3592411 has_accepted_license: '1' intvolume: ' 42' isi: 1 issue: '4' keyword: - PCB design and layout - Mesh geometry models language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '20276' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'PCBend: Light up your 3D shapes with foldable circuit boards' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 42 year: '2023' ... --- _id: '13188' abstract: - lang: eng text: "The Kirchhoff rod model describes the bending and twisting of slender elastic rods in three dimensions, and has been widely studied to enable the prediction of how a rod will deform, given its geometry and boundary conditions. In this work, we study a number of inverse problems with the goal of computing the geometry of a straight rod that will automatically deform to match a curved target shape after attaching its endpoints to a support structure. Our solution lets us finely control the static equilibrium state of a rod by varying the cross-sectional profiles along its length.\r\nWe also show that the set of physically realizable equilibrium states admits a concise geometric description in terms of linear line complexes, which leads to very efficient computational design algorithms. Implemented in an interactive software tool, they allow us to convert three-dimensional hand-drawn spline curves to elastic rods, and give feedback about the feasibility and practicality of a design in real time. We demonstrate the efficacy of our method by designing and manufacturing several physical prototypes with applications to interior design and soft robotics." acknowledged_ssus: - _id: M-Shop acknowledgement: We thank the anonymous reviewers for their generous feedback, and Julian Fischer for his help in proving Proposition 1. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 715767). article_number: '171' article_processing_charge: No article_type: original author: - first_name: Christian full_name: Hafner, Christian id: 400429CC-F248-11E8-B48F-1D18A9856A87 last_name: Hafner - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Hafner C, Bickel B. The design space of Kirchhoff rods. ACM Transactions on Graphics. 2023;42(5). doi:10.1145/3606033 apa: Hafner, C., & Bickel, B. (2023). The design space of Kirchhoff rods. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3606033 chicago: Hafner, Christian, and Bernd Bickel. “The Design Space of Kirchhoff Rods.” ACM Transactions on Graphics. Association for Computing Machinery, 2023. https://doi.org/10.1145/3606033. ieee: C. Hafner and B. Bickel, “The design space of Kirchhoff rods,” ACM Transactions on Graphics, vol. 42, no. 5. Association for Computing Machinery, 2023. ista: Hafner C, Bickel B. 2023. The design space of Kirchhoff rods. ACM Transactions on Graphics. 42(5), 171. mla: Hafner, Christian, and Bernd Bickel. “The Design Space of Kirchhoff Rods.” ACM Transactions on Graphics, vol. 42, no. 5, 171, Association for Computing Machinery, 2023, doi:10.1145/3606033. short: C. Hafner, B. Bickel, ACM Transactions on Graphics 42 (2023). corr_author: '1' date_created: 2023-07-04T07:41:30Z date_published: 2023-09-20T00:00:00Z date_updated: 2026-09-12T22:30:07Z day: '20' ddc: - '516' department: - _id: BeBi doi: 10.1145/3606033 ec_funded: 1 external_id: isi: - '001086833300010' file: - access_level: open_access checksum: 4954c1cfa487725bc156dcfec872478a content_type: application/pdf creator: chafner date_created: 2023-07-04T08:11:28Z date_updated: 2023-07-04T08:11:28Z file_id: '13194' file_name: kirchhoff-rods.pdf file_size: 19635168 relation: main_file success: 1 - access_level: open_access checksum: 79c9975fbc82ff71f1767331d2204cca content_type: application/pdf creator: chafner date_created: 2023-07-04T07:46:28Z date_updated: 2023-07-04T07:46:28Z file_id: '13190' file_name: supp-main.pdf file_size: 420909 relation: supplementary_material title: Supplemental Material with Proofs - access_level: open_access checksum: 4ab647e4f03c711e1e6a5fc1eb8684db content_type: application/pdf creator: chafner date_created: 2023-07-04T07:46:30Z date_updated: 2023-07-04T07:46:30Z file_id: '13191' file_name: supp-cheat.pdf file_size: 430086 relation: supplementary_material title: Cheat Sheet for Notation - access_level: open_access checksum: c0fd9a57d012046de90c185ffa904b76 content_type: video/mp4 creator: chafner date_created: 2023-07-04T07:46:39Z date_updated: 2023-07-04T07:46:39Z file_id: '13192' file_name: kirchhoff-video-final.mp4 file_size: 268088064 relation: supplementary_material title: Supplemental Video - access_level: open_access checksum: 71b00712b489ada2cd9815910ee180a9 content_type: application/x-zip-compressed creator: chafner date_created: 2023-07-04T07:47:10Z date_updated: 2023-07-04T07:47:10Z file_id: '13193' file_name: matlab-submission.zip file_size: 25790 relation: supplementary_material title: Matlab Source Code with Example file_date_updated: 2023-07-04T08:11:28Z fulldoi: https://doi.org/10.1145/3606033 has_accepted_license: '1' intvolume: ' 42' isi: 1 issue: '5' keyword: - Computer Graphics - Computational Design - Computational Geometry - Shape Modeling language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '12897' relation: part_of_dissertation status: public scopus_import: '1' status: public title: The design space of Kirchhoff rods type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 42 year: '2023' ... --- _id: '12129' 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.' 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" article_processing_charge: No article_type: original author: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Emo full_name: Welzl, Emo last_name: Welzl citation: ama: Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2 apa: Wagner, U., & Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00436-2 chicago: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” Discrete & Computational Geometry. Springer Nature, 2022. https://doi.org/10.1007/s00454-022-00436-2. ieee: U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane,” Discrete & Computational Geometry, vol. 68, no. 4. Springer Nature, pp. 1227–1284, 2022. ista: Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 68(4), 1227–1284. mla: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” Discrete & Computational Geometry, vol. 68, no. 4, Springer Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2. short: U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284. corr_author: '1' date_created: 2023-01-12T12:02:28Z date_published: 2022-11-14T00:00:00Z date_updated: 2025-07-10T11:54:56Z day: '14' ddc: - '510' department: - _id: UlWa doi: 10.1007/s00454-022-00436-2 external_id: isi: - '000883222200003' file: - access_level: open_access checksum: 307e879d09e52eddf5b225d0aaa9213a content_type: application/pdf creator: dernst date_created: 2023-01-23T11:10:03Z date_updated: 2023-01-23T11:10:03Z file_id: '12345' file_name: 2022_DiscreteCompGeometry_Wagner.pdf file_size: 1747581 relation: main_file success: 1 file_date_updated: 2023-01-23T11:10:03Z fulldoi: https://doi.org/10.1007/s00454-022-00436-2 has_accepted_license: '1' intvolume: ' 68' isi: 1 issue: '4' keyword: - Computational Theory and Mathematics - Discrete Mathematics and Combinatorics - Geometry and Topology - Theoretical Computer Science language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 1227-1284 publication: Discrete & Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '7807' relation: earlier_version status: public - id: '7990' relation: earlier_version status: public scopus_import: '1' status: public title: Connectivity of triangulation flip graphs in the plane tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 68 year: '2022' ... --- _id: '12148' abstract: - lang: eng 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.' 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. article_number: e96 article_processing_charge: No article_type: original author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2022.86 apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2022). Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2022.86 chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform Local Law for Wigner Matrices.” Forum of Mathematics, Sigma. Cambridge University Press, 2022. https://doi.org/10.1017/fms.2022.86. ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner matrices,” Forum of Mathematics, Sigma, vol. 10. Cambridge University Press, 2022. ista: Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 10, e96. mla: Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.” Forum of Mathematics, Sigma, vol. 10, e96, Cambridge University Press, 2022, doi:10.1017/fms.2022.86. short: G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022). corr_author: '1' date_created: 2023-01-12T12:07:30Z date_published: 2022-10-27T00:00:00Z date_updated: 2025-04-14T07:57:18Z day: '27' ddc: - '510' department: - _id: LaEr doi: 10.1017/fms.2022.86 ec_funded: 1 external_id: isi: - '000873719200001' file: - access_level: open_access checksum: 94a049aeb1eea5497aa097712a73c400 content_type: application/pdf creator: dernst date_created: 2023-01-24T10:02:40Z date_updated: 2023-01-24T10:02:40Z file_id: '12356' file_name: 2022_ForumMath_Cipolloni.pdf file_size: 817089 relation: main_file success: 1 file_date_updated: 2023-01-24T10:02:40Z fulldoi: https://doi.org/10.1017/fms.2022.86 has_accepted_license: '1' intvolume: ' 10' isi: 1 keyword: - Computational Mathematics - Discrete Mathematics and Combinatorics - Geometry and Topology - Mathematical Physics - Statistics and Probability - Algebra and Number Theory - Theoretical Computer Science - Analysis language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Forum of Mathematics, Sigma publication_identifier: issn: - 2050-5094 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: Rank-uniform local law for Wigner matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 10 year: '2022' ... --- _id: '12216' 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. acknowledgement: Work partially supported by the Lise Meitner fellowship, Austrian Science Fund (FWF) M3337. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Eric A. full_name: Carlen, Eric A. last_name: Carlen - first_name: Haonan full_name: Zhang, Haonan id: D8F41E38-9E66-11E9-A9E2-65C2E5697425 last_name: Zhang citation: ama: Carlen EA, Zhang H. Monotonicity versions of Epstein’s concavity theorem and related inequalities. Linear Algebra and its Applications. 2022;654:289-310. doi:10.1016/j.laa.2022.09.001 apa: Carlen, E. A., & Zhang, H. (2022). Monotonicity versions of Epstein’s concavity theorem and related inequalities. Linear Algebra and Its Applications. Elsevier. https://doi.org/10.1016/j.laa.2022.09.001 chicago: Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s Concavity Theorem and Related Inequalities.” Linear Algebra and Its Applications. Elsevier, 2022. https://doi.org/10.1016/j.laa.2022.09.001. ieee: E. A. Carlen and H. Zhang, “Monotonicity versions of Epstein’s concavity theorem and related inequalities,” Linear Algebra and its Applications, vol. 654. Elsevier, pp. 289–310, 2022. ista: Carlen EA, Zhang H. 2022. Monotonicity versions of Epstein’s concavity theorem and related inequalities. Linear Algebra and its Applications. 654, 289–310. mla: Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s Concavity Theorem and Related Inequalities.” Linear Algebra and Its Applications, vol. 654, Elsevier, 2022, pp. 289–310, doi:10.1016/j.laa.2022.09.001. short: E.A. Carlen, H. Zhang, Linear Algebra and Its Applications 654 (2022) 289–310. corr_author: '1' date_created: 2023-01-16T09:46:38Z date_published: 2022-12-01T00:00:00Z date_updated: 2025-04-14T13:05:27Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1016/j.laa.2022.09.001 external_id: isi: - '000860689600014' file: - access_level: open_access checksum: cf3cb7e7e34baa967849f01d8f0c1ae4 content_type: application/pdf creator: dernst date_created: 2023-01-27T08:08:39Z date_updated: 2023-01-27T08:08:39Z file_id: '12415' file_name: 2022_LinearAlgebra_Carlen.pdf file_size: 441184 relation: main_file success: 1 file_date_updated: 2023-01-27T08:08:39Z fulldoi: https://doi.org/10.1016/j.laa.2022.09.001 has_accepted_license: '1' intvolume: ' 654' isi: 1 keyword: - Discrete Mathematics and Combinatorics - Geometry and Topology - Numerical Analysis - Algebra and Number Theory language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 289-310 project: - _id: eb958bca-77a9-11ec-83b8-c565cb50d8d6 grant_number: M03337 name: Curvature-dimension in noncommutative analysis publication: Linear Algebra and its Applications publication_identifier: issn: - 0024-3795 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Monotonicity versions of Epstein's concavity theorem and related inequalities tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 654 year: '2022' ... --- _id: '10588' abstract: - lang: eng text: We prove the Sobolev-to-Lipschitz property for metric measure spaces satisfying the quasi curvature-dimension condition recently introduced in Milman (Commun Pure Appl Math, to appear). We provide several applications to properties of the corresponding heat semigroup. In particular, under the additional assumption of infinitesimal Hilbertianity, we show the Varadhan short-time asymptotics for the heat semigroup with respect to the distance, and prove the irreducibility of the heat semigroup. These results apply in particular to large classes of (ideal) sub-Riemannian manifolds. acknowledgement: "The authors are grateful to Dr. Bang-Xian Han for helpful discussions on the Sobolev-to-Lipschitz property on metric measure spaces, and to Professor Kazuhiro Kuwae, Professor Emanuel Milman, Dr. Giorgio Stefani, and Dr. Gioacchino Antonelli for reading a preliminary version of this work and for their valuable comments and suggestions. Finally, they wish to express their gratitude to two anonymous Reviewers whose suggestions improved the presentation of this work.\r\n\r\nL.D.S. gratefully acknowledges funding of his position by the Austrian Science Fund (FWF) grant F65, and by the European Research Council (ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas).\r\n\r\nK.S. gratefully acknowledges funding by: the JSPS Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research Center Initiative (WPI), MEXT, Japan; JSPS Grant-in-Aid for Scientific Research on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number 17H06465; and the Alexander von Humboldt Stiftung, Humboldt-Forschungsstipendium." article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Lorenzo full_name: Dello Schiavo, Lorenzo id: ECEBF480-9E4F-11EA-B557-B0823DDC885E last_name: Dello Schiavo orcid: 0000-0002-9881-6870 - first_name: Kohei full_name: Suzuki, Kohei last_name: Suzuki citation: ama: Dello Schiavo L, Suzuki K. Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. 2022;384:1815-1832. doi:10.1007/s00208-021-02331-2 apa: Dello Schiavo, L., & Suzuki, K. (2022). Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-021-02331-2 chicago: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property on QCD- Spaces and Applications.” Mathematische Annalen. Springer Nature, 2022. https://doi.org/10.1007/s00208-021-02331-2. ieee: L. Dello Schiavo and K. Suzuki, “Sobolev-to-Lipschitz property on QCD- spaces and applications,” Mathematische Annalen, vol. 384. Springer Nature, pp. 1815–1832, 2022. ista: Dello Schiavo L, Suzuki K. 2022. Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. 384, 1815–1832. mla: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property on QCD- Spaces and Applications.” Mathematische Annalen, vol. 384, Springer Nature, 2022, pp. 1815–32, doi:10.1007/s00208-021-02331-2. short: L. Dello Schiavo, K. Suzuki, Mathematische Annalen 384 (2022) 1815–1832. corr_author: '1' date_created: 2022-01-02T23:01:35Z date_published: 2022-12-01T00:00:00Z date_updated: 2025-04-14T07:27:46Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1007/s00208-021-02331-2 ec_funded: 1 external_id: arxiv: - '2110.05137' isi: - '000734150200001' file: - access_level: open_access checksum: 2593abbf195e38efa93b6006b1e90eb1 content_type: application/pdf creator: alisjak date_created: 2022-01-03T11:08:31Z date_updated: 2022-01-03T11:08:31Z file_id: '10596' file_name: 2021_MathAnn_DelloSchiavo.pdf file_size: 410090 relation: main_file success: 1 file_date_updated: 2022-01-03T11:08:31Z fulldoi: https://doi.org/10.1007/s00208-021-02331-2 has_accepted_license: '1' intvolume: ' 384' isi: 1 keyword: - quasi curvature-dimension condition - sub-riemannian geometry - Sobolev-to-Lipschitz property - Varadhan short-time asymptotics language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 1815-1832 project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Mathematische Annalen publication_identifier: eissn: - 1432-1807 issn: - 0025-5831 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Sobolev-to-Lipschitz property on QCD- spaces and applications tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 384 year: '2022' ... --- _id: '10643' 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" 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. article_number: e4 article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Stefan full_name: Teufel, Stefan last_name: Teufel citation: ama: 'Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2021.80' apa: 'Henheik, S. J., & Teufel, S. (2022). Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2021.80' chicago: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma. Cambridge University Press, 2022. https://doi.org/10.1017/fms.2021.80.' ieee: 'S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk,” Forum of Mathematics, Sigma, vol. 10. Cambridge University Press, 2022.' 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.' mla: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma, vol. 10, e4, Cambridge University Press, 2022, doi:10.1017/fms.2021.80.' short: S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022). corr_author: '1' date_created: 2022-01-18T16:18:51Z date_published: 2022-01-18T00:00:00Z date_updated: 2025-04-14T07:57:17Z day: '18' ddc: - '510' department: - _id: GradSch - _id: LaEr doi: 10.1017/fms.2021.80 ec_funded: 1 external_id: arxiv: - '2012.15239' isi: - '000743615000001' file: - access_level: open_access checksum: 87592a755adcef22ea590a99dc728dd3 content_type: application/pdf creator: cchlebak date_created: 2022-01-19T09:27:43Z date_updated: 2022-01-19T09:27:43Z file_id: '10646' file_name: 2022_ForumMathSigma_Henheik.pdf file_size: 705323 relation: main_file success: 1 file_date_updated: 2022-01-19T09:27:43Z fulldoi: https://doi.org/10.1017/fms.2021.80 has_accepted_license: '1' intvolume: ' 10' isi: 1 keyword: - computational mathematics - discrete mathematics and combinatorics - geometry and topology - mathematical physics - statistics and probability - algebra and number theory - theoretical computer science - analysis language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Forum of Mathematics, Sigma publication_identifier: eissn: - 2050-5094 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: 'Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 10 year: '2022' ... --- _id: '10623' 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. 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. article_number: '3' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X citation: ama: Henheik SJ. The BCS critical temperature at high density. Mathematical Physics, Analysis and Geometry. 2022;25(1). doi:10.1007/s11040-021-09415-0 apa: Henheik, S. J. (2022). The BCS critical temperature at high density. Mathematical Physics, Analysis and Geometry. Springer Nature. https://doi.org/10.1007/s11040-021-09415-0 chicago: Henheik, Sven Joscha. “The BCS Critical Temperature at High Density.” Mathematical Physics, Analysis and Geometry. Springer Nature, 2022. https://doi.org/10.1007/s11040-021-09415-0. ieee: S. J. Henheik, “The BCS critical temperature at high density,” Mathematical Physics, Analysis and Geometry, vol. 25, no. 1. Springer Nature, 2022. ista: Henheik SJ. 2022. The BCS critical temperature at high density. Mathematical Physics, Analysis and Geometry. 25(1), 3. mla: Henheik, Sven Joscha. “The BCS Critical Temperature at High Density.” Mathematical Physics, Analysis and Geometry, vol. 25, no. 1, 3, Springer Nature, 2022, doi:10.1007/s11040-021-09415-0. short: S.J. Henheik, Mathematical Physics, Analysis and Geometry 25 (2022). corr_author: '1' date_created: 2022-01-13T15:40:53Z date_published: 2022-01-11T00:00:00Z date_updated: 2026-07-29T13:18:16Z day: '11' ddc: - '514' department: - _id: GradSch - _id: LaEr doi: 10.1007/s11040-021-09415-0 ec_funded: 1 external_id: arxiv: - '2106.02015' isi: - '000741387600001' file: - access_level: open_access checksum: d44f8123a52592a75b2c3b8ee2cd2435 content_type: application/pdf creator: cchlebak date_created: 2022-01-14T07:27:45Z date_updated: 2022-01-14T07:27:45Z file_id: '10624' file_name: 2022_MathPhyAnalGeo_Henheik.pdf file_size: 505804 relation: main_file success: 1 file_date_updated: 2022-01-14T07:27:45Z fulldoi: https://doi.org/10.1007/s11040-021-09415-0 has_accepted_license: '1' intvolume: ' 25' isi: 1 issue: '1' keyword: - geometry and topology - mathematical physics language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Mathematical Physics, Analysis and Geometry publication_identifier: eissn: - 1572-9656 issn: - 1385-0172 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19540' relation: dissertation_contains status: public scopus_import: '1' status: public title: The BCS critical temperature at high density tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 25 year: '2022' ...