[{"author":[{"full_name":"Bleile, Yossi","id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2","orcid":"0000-0002-4861-9174","first_name":"Yossi","last_name":"Bleile"},{"last_name":"Cortinovis","first_name":"Emanuele","full_name":"Cortinovis, Emanuele"}],"project":[{"grant_number":"ESP 9584724","_id":"9106a876-16d5-11f0-9cad-bbf11c9952f9","name":"Quantitative Unbiased Shape Analysis with Geometry & Topology"}],"date_created":"2026-06-09T19:19:13Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","date_updated":"2026-06-15T23:00:03Z","file":[{"checksum":"48f633b6767c4b15dd6220ca2b4dc175","success":1,"creator":"ybleile","file_size":1081,"content_type":"application/octet-stream","file_name":"LICENSE","access_level":"open_access","date_updated":"2026-06-09T19:16:02Z","date_created":"2026-06-09T19:16:02Z","file_id":"21974","relation":"main_file"},{"file_name":"quadrix-x64.exe","success":1,"checksum":"de25d0b224acbde3d38f837fdd8f97d5","file_size":11308032,"content_type":"application/octet-stream","creator":"ybleile","date_created":"2026-06-09T19:16:27Z","relation":"main_file","file_id":"21975","access_level":"open_access","date_updated":"2026-06-09T19:16:27Z"},{"file_name":"quadrix-arm64.exe","file_size":10655744,"creator":"ybleile","content_type":"application/octet-stream","checksum":"a7b94a7380dc178e76ebdba9f1fa45c2","success":1,"date_created":"2026-06-09T19:16:28Z","file_id":"21976","relation":"main_file","date_updated":"2026-06-09T19:16:28Z","access_level":"open_access"},{"file_name":"Quadrix Desktop.app.zip","success":1,"checksum":"2404aa8619a56668bd95032791ee1250","creator":"ybleile","content_type":"application/zip","file_size":2032,"file_id":"21977","date_created":"2026-06-09T19:16:27Z","relation":"main_file","access_level":"open_access","date_updated":"2026-06-09T19:16:27Z"},{"file_name":"quadrix-arm64","file_size":12187896,"content_type":"application/octet-stream","creator":"ybleile","success":1,"checksum":"106930f81563c5c719a5f4030b5ca5ed","file_id":"21978","relation":"main_file","date_created":"2026-06-09T19:16:40Z","date_updated":"2026-06-09T19:16:40Z","access_level":"open_access"},{"success":1,"checksum":"0e6ba129318446676f220087e7e6ff41","content_type":"application/octet-stream","file_size":20587592,"creator":"ybleile","file_name":"quadrix-x64","access_level":"open_access","date_updated":"2026-06-09T19:16:52Z","relation":"main_file","date_created":"2026-06-09T19:16:52Z","file_id":"21979"},{"creator":"pub-gitlab-bot","content_type":"application/gzip","file_size":1914198,"checksum":"f0b03385d17df049219465ab7403fe09","file_name":"Quadrix.zip","date_updated":"2026-06-09T19:19:12Z","access_level":"open_access","date_created":"2026-06-09T19:19:12Z","file_id":"21972","relation":"main_file"},{"file_name":"THIRD_PARTY_LICENSES.zip","content_type":"application/zip","creator":"ybleile","file_size":37557,"checksum":"ede0bbb24bf41ab4009cf1b6a9009671","date_created":"2026-06-10T19:09:38Z","file_id":"21993","relation":"supplementary_material","date_updated":"2026-06-10T19:09:38Z","access_level":"open_access"},{"file_size":3839,"content_type":"text/markdown","creator":"ybleile","checksum":"f3c5fcc62c88e449ab5c660244df5aef","success":1,"file_name":"README.md","date_updated":"2026-06-15T08:13:32Z","access_level":"open_access","file_id":"22009","relation":"main_file","date_created":"2026-06-15T08:13:32Z"},{"access_level":"open_access","date_updated":"2026-06-15T08:14:24Z","file_id":"22008","date_created":"2026-06-15T08:14:24Z","relation":"main_file","checksum":"aa74828c3165aafcdee4ddcc9ecd37ac","file_size":1912923,"creator":"pub-gitlab-bot","content_type":"application/gzip","file_name":"Quadrix.zip"}],"title":"Quadrix","tmp":{"short":"MIT","legal_code_url":"https://opensource.org/licenses/MIT","name":"The MIT License"},"department":[{"_id":"HeEd"}],"status":"public","has_accepted_license":"1","month":"06","type":"software","oa":1,"corr_author":"1","doi":"10.15479/AT-ISTA-21971","publisher":"Institute of Science and Technology Austria","date_published":"2026-06-15T00:00:00Z","day":"15","citation":{"short":"Y. Bokor Bleile, E. Cortinovis, (2026).","ista":"Bokor Bleile Y, Cortinovis E. 2026. Quadrix, Institute of Science and Technology Austria, 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.","ama":"Bokor Bleile Y, Cortinovis E. Quadrix. 2026. doi: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."},"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"}],"license":"https://opensource.org/licenses/MIT","file_date_updated":"2026-06-15T08:14:24Z","_id":"21971","year":"2026","keyword":["quadratics","mathematics","dendrites","geometry","topology"]},{"department":[{"_id":"JuFi"}],"intvolume":" 130","external_id":{"arxiv":["2109.04233"]},"title":"A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness","OA_type":"green","OA_place":"repository","author":[{"full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072","first_name":"Sebastian","last_name":"Hensel"},{"full_name":"Laux, Tim","last_name":"Laux","first_name":"Tim"}],"date_created":"2021-09-13T12:17:10Z","project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","name":"Bridging Scales in Random Materials","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"_id":"10011","keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"],"ec_funded":1,"article_processing_charge":"No","date_published":"2025-05-01T00:00:00Z","citation":{"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.","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","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.","short":"S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 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.","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","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."},"article_type":"original","quality_controlled":"1","publisher":"International Press of Boston","oa":1,"doi":"10.4310/jdg/1747065796","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2109.04233"}],"type":"journal_article","publication_status":"published","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.","status":"public","month":"05","arxiv":1,"page":"209-268","volume":130,"date_updated":"2026-07-06T13:37:21Z","das_tickbox":"1","year":"2025","publication_identifier":{"issn":["0022-040X"],"eissn":["1945-743X"]},"day":"01","language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Preprint","publication":"Journal of Differential Geometry","scopus_import":"1"},{"quality_controlled":"1","oa":1,"doi":"10.1145/3658194","publisher":"Association for Computing Machinery","publication_status":"published","type":"journal_article","abstract":[{"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.","lang":"eng"}],"file_date_updated":"2024-07-17T09:29:13Z","_id":"17203","keyword":["Topology Optimization","Mass Moments","Computational Geometry"],"article_processing_charge":"Yes (via OA deal)","date_published":"2024-07-01T00:00:00Z","citation":{"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.","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","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).","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.","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.","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"},"article_type":"original","isi":1,"file":[{"file_size":7225150,"creator":"chafner","content_type":"application/pdf","success":1,"checksum":"0dc9f5a6422b8a49a79026900f349ee5","file_name":"sif-final.pdf","date_updated":"2024-07-05T12:05:17Z","access_level":"open_access","date_created":"2024-07-05T12:05:17Z","relation":"main_file","file_id":"17204"},{"checksum":"cde433c6a40688d5f1187fb5721f6f94","file_size":397262,"content_type":"application/pdf","creator":"chafner","file_name":"sif-supp-final.pdf","access_level":"open_access","date_updated":"2024-07-05T12:06:03Z","relation":"supplementary_material","file_id":"17205","date_created":"2024-07-05T12:06:03Z"},{"date_created":"2024-07-17T09:29:13Z","relation":"supplementary_material","file_id":"17276","access_level":"open_access","title":"Submission Video","date_updated":"2024-07-17T09:29:13Z","file_name":"sif-video-final.mp4","checksum":"c0457a09c2ab9a1c2935c995dcc84907","creator":"chafner","file_size":170001305,"content_type":"video/mp4"}],"title":"Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments","issue":"4","author":[{"first_name":"Christian","last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87","full_name":"Hafner, Christian"},{"last_name":"Ly","first_name":"Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan","first_name":"Christopher J"}],"project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"date_created":"2024-07-05T12:08:57Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ChWo"}],"has_accepted_license":"1","ddc":["516"],"article_number":"78","intvolume":" 43","external_id":{"isi":["001289270900045"]},"language":[{"iso":"eng"}],"corr_author":"1","publication":"Transactions on Graphics","oa_version":"Published Version","scopus_import":"1","conference":{"start_date":"2024-07-28","end_date":"2024-08-01","location":"Denver, Colorado"},"year":"2024","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"day":"01","volume":43,"date_updated":"2025-09-08T08:29:09Z","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).","status":"public","month":"07"},{"keyword":["hyperkaehler geometry","branes","mirror symmetry","T-duality"],"_id":"18443","file_date_updated":"2024-10-24T08:09:13Z","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"}],"citation":{"ieee":"M. A. Sisak, “T-dual branes on hyperkähler manifolds,” Institute of Science and Technology Austria, 2024.","mla":"Sisak, Maria A. T-Dual Branes on Hyperkähler Manifolds. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18443.","ama":"Sisak MA. T-dual branes on hyperkähler manifolds. 2024. doi:10.15479/at:ista:18443","ista":"Sisak MA. 2024. T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria.","short":"M.A. Sisak, T-Dual Branes on Hyperkähler Manifolds, Institute of Science and Technology Austria, 2024.","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."},"date_published":"2024-10-24T00:00:00Z","article_processing_charge":"No","oa":1,"publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:18443","type":"dissertation","publication_status":"published","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"TaHa"}],"ddc":["516"],"title":"T-dual branes on hyperkähler manifolds","OA_type":"free access","OA_place":"publisher","file":[{"date_created":"2024-10-23T14:42:45Z","relation":"main_file","file_id":"18467","access_level":"open_access","date_updated":"2024-10-23T14:42:45Z","file_name":"MASisak_dissertation.pdf","checksum":"8c4893e726aaa4b3efb82758da9b6851","success":1,"file_size":1672547,"content_type":"application/pdf","creator":"msisak"},{"date_updated":"2024-10-24T08:09:13Z","access_level":"closed","date_created":"2024-10-23T14:43:56Z","file_id":"18468","relation":"source_file","content_type":"application/x-zip-compressed","creator":"msisak","file_size":617913,"checksum":"1831b072e861a1e5481024ca9d02b036","file_name":"MASisak_source.zip"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"project":[{"_id":"6286e8c4-2b32-11ec-9570-f5297902f67f","grant_number":"26069","name":"Branes on hyperkähler manifolds"}],"date_created":"2024-10-19T12:00:37Z","author":[{"id":"44A03D04-AEA4-11E9-B225-EA2DE6697425","full_name":"Sisak, Maria A","first_name":"Maria A","last_name":"Sisak"}],"year":"2024","day":"24","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Published Version","month":"10","status":"public","page":"178","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-04-07T12:42:44Z","supervisor":[{"full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9582-2634","first_name":"Tamás","last_name":"Hausel"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":69,"date_updated":"2025-04-14T07:44:00Z","month":"01","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).","status":"public","page":"156-191","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"Published Version","publication":"Discrete & Computational Geometry","year":"2023","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"day":"01","title":"Local criteria for triangulating general manifolds","isi":1,"file":[{"content_type":"application/pdf","creator":"dernst","file_size":582850,"checksum":"46352e0ee71e460848f88685ca852681","success":1,"file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf","date_updated":"2023-02-02T11:01:10Z","access_level":"open_access","relation":"main_file","date_created":"2023-02-02T11:01:10Z","file_id":"12488"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"date_created":"2023-01-16T10:04:06Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel","last_name":"Boissonnat"},{"last_name":"Dyer","first_name":"Ramsay","full_name":"Dyer, Ramsay"},{"last_name":"Ghosh","first_name":"Arijit","full_name":"Ghosh, Arijit"},{"first_name":"Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs"}],"has_accepted_license":"1","department":[{"_id":"HeEd"}],"intvolume":" 69","external_id":{"isi":["000862193600001"]},"ddc":["510"],"publisher":"Springer Nature","doi":"10.1007/s00454-022-00431-7","oa":1,"quality_controlled":"1","publication_status":"published","type":"journal_article","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"abstract":[{"text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.","lang":"eng"}],"file_date_updated":"2023-02-02T11:01:10Z","_id":"12287","date_published":"2023-01-01T00:00:00Z","article_processing_charge":"No","article_type":"original","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","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.","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.","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.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191."},"ec_funded":1},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":42,"date_updated":"2026-05-04T12:41:52Z","month":"07","status":"public","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).","scopus_import":"1","oa_version":"Submitted Version","publication":"Transactions on Graphics","language":[{"iso":"eng"}],"corr_author":"1","day":"26","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"acknowledged_ssus":[{"_id":"M-Shop"}],"conference":{"end_date":"2023-08-10","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","start_date":"2023-08-06","location":"Los Angeles, CA, United States"},"year":"2023","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2023-05-22T08:37:04Z","project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"author":[{"full_name":"Freire, Marco","first_name":"Marco","last_name":"Freire"},{"full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","orcid":"0009-0007-6138-6890","first_name":"Manas","last_name":"Bhargava"},{"first_name":"Camille","last_name":"Schreck","full_name":"Schreck, Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hugron, Pierre-Alexandre","last_name":"Hugron","first_name":"Pierre-Alexandre"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"full_name":"Lefebvre, Sylvain","last_name":"Lefebvre","first_name":"Sylvain"}],"issue":"4","title":"PCBend: Light up your 3D shapes with foldable circuit boards","related_material":{"record":[{"id":"20276","status":"public","relation":"dissertation_contains"}]},"file":[{"content_type":"application/pdf","creator":"dernst","file_size":78940724,"checksum":"a0b0ba3b36f43a94388e8824613d812a","success":1,"file_name":"2023_ACMToG_Freire.pdf","date_updated":"2023-06-19T11:02:23Z","access_level":"open_access","date_created":"2023-06-19T11:02:23Z","file_id":"13156","relation":"main_file"},{"relation":"main_file","date_created":"2023-06-20T12:20:51Z","file_id":"13157","access_level":"open_access","date_updated":"2023-06-20T12:20:51Z","file_name":"2023_ACMToG_SuppMaterial_Freire.pdf","checksum":"b9206bbb67af82df49b7e7cdbde3410c","success":1,"file_size":34345905,"content_type":"application/pdf","creator":"dernst"}],"isi":1,"external_id":{"isi":["001044671300108"]},"intvolume":" 42","article_number":"142","ddc":["006"],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"type":"journal_article","publication_status":"published","publisher":"Association for Computing Machinery","oa":1,"doi":"10.1145/3592411","quality_controlled":"1","article_type":"original","citation":{"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.","short":"M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, S. Lefebvre, Transactions on Graphics 42 (2023).","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.","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.","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"},"article_processing_charge":"No","date_published":"2023-07-26T00:00:00Z","ec_funded":1,"keyword":["PCB design and layout","Mesh geometry models"],"_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."}],"file_date_updated":"2023-06-20T12:20:51Z"},{"oa":1,"publisher":"Springer Nature","doi":"10.1007/s11040-023-09460-x","quality_controlled":"1","type":"journal_article","publication_status":"published","keyword":["Geometry and Topology","Mathematical Physics"],"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."}],"file_date_updated":"2023-08-23T10:59:15Z","_id":"14192","date_published":"2023-07-26T00:00:00Z","article_processing_charge":"Yes (via OA deal)","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","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.","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.","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.","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","short":"J. Lampart, D.J. Mitrouskas, K. Mysliwy, Mathematical Physics, Analysis and Geometry 26 (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."},"article_type":"original","title":"On the global minimum of the energy–momentum relation for the polaron","isi":1,"file":[{"file_name":"2023_MathPhysics_Lampart.pdf","success":1,"checksum":"f0941cc66cb3ed06a12ca4b7e356cfd6","file_size":317026,"content_type":"application/pdf","creator":"dernst","date_created":"2023-08-23T10:59:15Z","file_id":"14225","relation":"main_file","access_level":"open_access","date_updated":"2023-08-23T10:59:15Z"}],"date_created":"2023-08-22T14:09:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","author":[{"first_name":"Jonas","last_name":"Lampart","full_name":"Lampart, Jonas"},{"full_name":"Mitrouskas, David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","last_name":"Mitrouskas","first_name":"David Johannes"},{"first_name":"Krzysztof","last_name":"Mysliwy","full_name":"Mysliwy, Krzysztof","id":"316457FC-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","department":[{"_id":"RoSe"}],"intvolume":" 26","external_id":{"isi":["001032992600001"],"arxiv":["2206.14708"]},"ddc":["510"],"article_number":"17","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","publication":"Mathematical Physics, Analysis and Geometry","oa_version":"Published Version","year":"2023","publication_identifier":{"eissn":["1572-9656"],"issn":["1385-0172"]},"day":"26","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":26,"date_updated":"2024-10-09T21:06:41Z","month":"07","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.","status":"public","arxiv":1},{"quality_controlled":"1","publisher":"Cambridge University Press","oa":1,"doi":"10.1017/fmp.2023.17","publication_status":"published","type":"journal_article","_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."}],"file_date_updated":"2023-11-07T09:16:23Z","keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Analysis"],"article_type":"original","citation":{"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.","short":"M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11 (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.","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","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.","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."},"article_processing_charge":"Yes","date_published":"2023-08-24T00:00:00Z","file":[{"date_updated":"2023-11-07T09:16:23Z","access_level":"open_access","relation":"main_file","file_id":"14500","date_created":"2023-11-07T09:16:23Z","file_size":1218719,"content_type":"application/pdf","creator":"dernst","success":1,"checksum":"54b824098d59073cc87a308d458b0a3e","file_name":"2023_ForumMathematics_Kwan.pdf"}],"isi":1,"title":"Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture","author":[{"last_name":"Kwan","first_name":"Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan"},{"first_name":"Ashwin","last_name":"Sah","full_name":"Sah, Ashwin"},{"first_name":"Lisa","last_name":"Sauermann","full_name":"Sauermann, Lisa"},{"last_name":"Sawhney","first_name":"Mehtaab","full_name":"Sawhney, Mehtaab"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45","grant_number":"101076777"}],"date_created":"2023-11-07T09:02:48Z","department":[{"_id":"MaKw"}],"has_accepted_license":"1","article_number":"e21","ddc":["510"],"intvolume":" 11","external_id":{"isi":["001123866200001"],"arxiv":["2208.02874"]},"language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Published Version","publication":"Forum of Mathematics, Pi","scopus_import":"1","year":"2023","day":"24","publication_identifier":{"issn":["2050-5086"]},"date_updated":"2025-09-09T13:16:15Z","volume":11,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","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.","month":"08","arxiv":1},{"article_processing_charge":"Yes","date_published":"2023-10-16T00:00:00Z","citation":{"ieee":"N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” Quantum Topology, vol. 14, no. 3. EMS Press, pp. 467–532, 2023.","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.","ama":"Carqueville N, Szegedy L. Fully extended r-spin TQFTs. Quantum Topology. 2023;14(3):467-532. doi:10.4171/qt/193","ista":"Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532.","short":"N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532.","chicago":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” Quantum Topology. EMS Press, 2023. https://doi.org/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"},"article_type":"original","keyword":["Geometry and Topology","Mathematical Physics"],"file_date_updated":"2024-01-09T09:25:34Z","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."}],"_id":"14756","type":"journal_article","publication_status":"published","oa":1,"publisher":"EMS Press","doi":"10.4171/qt/193","quality_controlled":"1","external_id":{"isi":["001104620800003"]},"intvolume":" 14","ddc":["530"],"has_accepted_license":"1","department":[{"_id":"MiLe"}],"date_created":"2024-01-08T13:14:48Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","author":[{"full_name":"Carqueville, Nils","last_name":"Carqueville","first_name":"Nils"},{"full_name":"Szegedy, Lorant","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","orcid":"0000-0003-2834-5054","last_name":"Szegedy","first_name":"Lorant"}],"title":"Fully extended r-spin TQFTs","isi":1,"file":[{"access_level":"open_access","date_updated":"2024-01-09T09:25:34Z","relation":"main_file","file_id":"14764","date_created":"2024-01-09T09:25:34Z","success":1,"checksum":"b0590aff6e7ec89cc149ba94d459d3a3","file_size":707344,"content_type":"application/pdf","creator":"dernst","file_name":"2023_QuantumTopol_Carqueville.pdf"}],"publication_identifier":{"issn":["1663-487X"]},"day":"16","year":"2023","scopus_import":"1","publication":"Quantum Topology","oa_version":"Published Version","language":[{"iso":"eng"}],"corr_author":"1","page":"467-532","month":"10","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.","status":"public","das_tickbox":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":14,"date_updated":"2026-07-06T11:52:15Z"},{"intvolume":" 42","external_id":{"isi":["001086833300010"]},"article_number":"171","ddc":["516"],"has_accepted_license":"1","department":[{"_id":"BeBi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"date_created":"2023-07-04T07:41:30Z","author":[{"last_name":"Hafner","first_name":"Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","full_name":"Hafner, Christian"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"}],"issue":"5","title":"The design space of Kirchhoff rods","related_material":{"record":[{"relation":"part_of_dissertation","id":"12897","status":"public"}]},"file":[{"file_name":"kirchhoff-rods.pdf","file_size":19635168,"creator":"chafner","content_type":"application/pdf","success":1,"checksum":"4954c1cfa487725bc156dcfec872478a","file_id":"13194","relation":"main_file","date_created":"2023-07-04T08:11:28Z","date_updated":"2023-07-04T08:11:28Z","access_level":"open_access"},{"date_updated":"2023-07-04T07:46:28Z","access_level":"open_access","title":"Supplemental Material with Proofs","file_id":"13190","relation":"supplementary_material","date_created":"2023-07-04T07:46:28Z","content_type":"application/pdf","file_size":420909,"creator":"chafner","checksum":"79c9975fbc82ff71f1767331d2204cca","file_name":"supp-main.pdf"},{"creator":"chafner","content_type":"application/pdf","file_size":430086,"checksum":"4ab647e4f03c711e1e6a5fc1eb8684db","file_name":"supp-cheat.pdf","date_updated":"2023-07-04T07:46:30Z","access_level":"open_access","title":"Cheat Sheet for Notation","file_id":"13191","relation":"supplementary_material","date_created":"2023-07-04T07:46:30Z"},{"relation":"supplementary_material","file_id":"13192","date_created":"2023-07-04T07:46:39Z","date_updated":"2023-07-04T07:46:39Z","access_level":"open_access","title":"Supplemental Video","file_name":"kirchhoff-video-final.mp4","content_type":"video/mp4","creator":"chafner","file_size":268088064,"checksum":"c0fd9a57d012046de90c185ffa904b76"},{"content_type":"application/x-zip-compressed","file_size":25790,"creator":"chafner","checksum":"71b00712b489ada2cd9815910ee180a9","file_name":"matlab-submission.zip","date_updated":"2023-07-04T07:47:10Z","title":"Matlab Source Code with Example","access_level":"open_access","date_created":"2023-07-04T07:47:10Z","relation":"supplementary_material","file_id":"13193"}],"isi":1,"citation":{"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.","ama":"Hafner C, Bickel B. The design space of Kirchhoff rods. ACM Transactions on Graphics. 2023;42(5). doi: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.","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.","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","ista":"Hafner C, Bickel B. 2023. The design space of Kirchhoff rods. ACM Transactions on Graphics. 42(5), 171.","short":"C. Hafner, B. Bickel, ACM Transactions on Graphics 42 (2023)."},"article_type":"original","date_published":"2023-09-20T00:00:00Z","article_processing_charge":"No","ec_funded":1,"keyword":["Computer Graphics","Computational Design","Computational Geometry","Shape Modeling"],"_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."}],"file_date_updated":"2023-07-04T08:11:28Z","publication_status":"published","type":"journal_article","doi":"10.1145/3606033","publisher":"Association for Computing Machinery","oa":1,"quality_controlled":"1","month":"09","status":"public","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).","volume":42,"date_updated":"2026-07-13T22:30:06Z","day":"20","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"acknowledged_ssus":[{"_id":"M-Shop"}],"year":"2023","scopus_import":"1","publication":"ACM Transactions on Graphics","oa_version":"Submitted Version","corr_author":"1","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","publication":"Discrete & Computational Geometry","oa_version":"Published Version","year":"2022","day":"14","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-07-10T11:54:56Z","volume":68,"month":"11","status":"public","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","page":"1227-1284","oa":1,"publisher":"Springer Nature","doi":"10.1007/s00454-022-00436-2","quality_controlled":"1","publication_status":"published","type":"journal_article","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"_id":"12129","file_date_updated":"2023-01-23T11:10:03Z","abstract":[{"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.","lang":"eng"}],"citation":{"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.","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","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.","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.","ista":"Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 68(4), 1227–1284.","short":"U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284."},"article_type":"original","date_published":"2022-11-14T00:00:00Z","article_processing_charge":"No","title":"Connectivity of triangulation flip graphs in the plane","file":[{"relation":"main_file","date_created":"2023-01-23T11:10:03Z","file_id":"12345","access_level":"open_access","date_updated":"2023-01-23T11:10:03Z","file_name":"2022_DiscreteCompGeometry_Wagner.pdf","checksum":"307e879d09e52eddf5b225d0aaa9213a","success":1,"file_size":1747581,"creator":"dernst","content_type":"application/pdf"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7807"},{"relation":"earlier_version","status":"public","id":"7990"}]},"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2023-01-12T12:02:28Z","author":[{"orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"issue":"4","has_accepted_license":"1","department":[{"_id":"UlWa"}],"external_id":{"isi":["000883222200003"]},"intvolume":" 68","ddc":["510"]},{"corr_author":"1","language":[{"iso":"eng"}],"publication":"Forum of Mathematics, Sigma","oa_version":"Published Version","scopus_import":"1","year":"2022","day":"27","publication_identifier":{"issn":["2050-5094"]},"date_updated":"2025-04-14T07:57:18Z","volume":10,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","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.","month":"10","quality_controlled":"1","oa":1,"doi":"10.1017/fms.2022.86","publisher":"Cambridge University Press","publication_status":"published","type":"journal_article","_id":"12148","file_date_updated":"2023-01-24T10:02:40Z","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."}],"keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Mathematical Physics","Statistics and Probability","Algebra and Number Theory","Theoretical Computer Science","Analysis"],"ec_funded":1,"article_type":"original","citation":{"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.","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.","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","ista":"Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner matrices. Forum of Mathematics, Sigma. 10, e96.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).","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."},"date_published":"2022-10-27T00:00:00Z","article_processing_charge":"No","file":[{"file_name":"2022_ForumMath_Cipolloni.pdf","checksum":"94a049aeb1eea5497aa097712a73c400","success":1,"file_size":817089,"content_type":"application/pdf","creator":"dernst","relation":"main_file","date_created":"2023-01-24T10:02:40Z","file_id":"12356","access_level":"open_access","date_updated":"2023-01-24T10:02:40Z"}],"isi":1,"title":"Rank-uniform local law for Wigner matrices","author":[{"first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"orcid":"0000-0002-2904-1856","last_name":"Schröder","first_name":"Dominik J","full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2023-01-12T12:07:30Z","project":[{"grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"department":[{"_id":"LaEr"}],"has_accepted_license":"1","article_number":"e96","ddc":["510"],"intvolume":" 10","external_id":{"isi":["000873719200001"]}},{"month":"12","status":"public","acknowledgement":"Work partially supported by the Lise Meitner fellowship, Austrian Science Fund (FWF) M3337.","page":"289-310","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-04-14T13:05:27Z","volume":654,"year":"2022","day":"01","publication_identifier":{"issn":["0024-3795"]},"language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","oa_version":"Published Version","publication":"Linear Algebra and its Applications","has_accepted_license":"1","department":[{"_id":"JaMa"}],"intvolume":" 654","external_id":{"isi":["000860689600014"]},"ddc":["510"],"title":"Monotonicity versions of Epstein's concavity theorem and related inequalities","file":[{"file_name":"2022_LinearAlgebra_Carlen.pdf","checksum":"cf3cb7e7e34baa967849f01d8f0c1ae4","success":1,"creator":"dernst","content_type":"application/pdf","file_size":441184,"file_id":"12415","date_created":"2023-01-27T08:08:39Z","relation":"main_file","access_level":"open_access","date_updated":"2023-01-27T08:08:39Z"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Curvature-dimension in noncommutative analysis","grant_number":"M03337","_id":"eb958bca-77a9-11ec-83b8-c565cb50d8d6"}],"date_created":"2023-01-16T09:46:38Z","author":[{"first_name":"Eric A.","last_name":"Carlen","full_name":"Carlen, Eric A."},{"first_name":"Haonan","last_name":"Zhang","full_name":"Zhang, Haonan","id":"D8F41E38-9E66-11E9-A9E2-65C2E5697425"}],"keyword":["Discrete Mathematics and Combinatorics","Geometry and Topology","Numerical Analysis","Algebra and Number Theory"],"_id":"12216","file_date_updated":"2023-01-27T08:08:39Z","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."}],"citation":{"ista":"Carlen EA, Zhang H. 2022. Monotonicity versions of Epstein’s concavity theorem and related inequalities. Linear Algebra and its Applications. 654, 289–310.","short":"E.A. Carlen, H. Zhang, Linear Algebra and Its Applications 654 (2022) 289–310.","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.","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","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.","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.","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"},"article_type":"original","date_published":"2022-12-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","doi":"10.1016/j.laa.2022.09.001","oa":1,"publisher":"Elsevier","quality_controlled":"1","publication_status":"published","type":"journal_article"},{"acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","status":"public","month":"10","volume":29,"date_updated":"2023-08-04T10:29:18Z","tmp":{"image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"publication_identifier":{"eissn":["1077-8926"]},"day":"21","license":"https://creativecommons.org/licenses/by-nd/4.0/","year":"2022","oa_version":"Published Version","publication":"The Electronic Journal of Combinatorics","scopus_import":"1","language":[{"iso":"eng"}],"ddc":["510"],"article_number":"P4.13","intvolume":" 29","external_id":{"isi":["000876763300001"]},"department":[{"_id":"MaKw"}],"has_accepted_license":"1","issue":"4","author":[{"first_name":"Oliver","last_name":"Cooley","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","full_name":"Cooley, Oliver"},{"last_name":"Kang","first_name":"Mihyun","full_name":"Kang, Mihyun"},{"last_name":"Zalla","first_name":"Julian","full_name":"Zalla, Julian"}],"date_created":"2023-01-16T10:03:57Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"file":[{"date_updated":"2023-01-30T11:45:13Z","access_level":"open_access","file_id":"12462","date_created":"2023-01-30T11:45:13Z","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":626953,"checksum":"00122b2459f09b5ae43073bfba565e94","success":1,"file_name":"2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf"}],"title":"Loose cores and cycles in random hypergraphs","date_published":"2022-10-21T00:00:00Z","article_processing_charge":"No","article_type":"original","citation":{"mla":"Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” The Electronic Journal of Combinatorics, vol. 29, no. 4, P4.13, The Electronic Journal of Combinatorics, 2022, doi:10.37236/10794.","ama":"Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 2022;29(4). doi:10.37236/10794","ieee":"O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.","chicago":"Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.” The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2022. https://doi.org/10.37236/10794.","apa":"Cooley, O., Kang, M., & Zalla, J. (2022). Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/10794","ista":"Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 29(4), P4.13.","short":"O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022)."},"file_date_updated":"2023-01-30T11:45:13Z","abstract":[{"text":"Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes.
\r\nOur main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$.","lang":"eng"}],"_id":"12286","keyword":["Computational Theory and Mathematics","Geometry and Topology","Theoretical Computer Science","Applied Mathematics","Discrete Mathematics and Combinatorics"],"publication_status":"published","type":"journal_article","quality_controlled":"1","doi":"10.37236/10794","oa":1,"publisher":"The Electronic Journal of Combinatorics"},{"publication_status":"published","type":"journal_article","doi":"10.1007/s00208-021-02331-2","publisher":"Springer Nature","oa":1,"quality_controlled":"1","date_published":"2022-12-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","article_type":"original","citation":{"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.","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.","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","ista":"Dello Schiavo L, Suzuki K. 2022. Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. 384, 1815–1832.","short":"L. Dello Schiavo, K. Suzuki, Mathematische Annalen 384 (2022) 1815–1832.","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.","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"},"ec_funded":1,"keyword":["quasi curvature-dimension condition","sub-riemannian geometry","Sobolev-to-Lipschitz property","Varadhan short-time asymptotics"],"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."}],"file_date_updated":"2022-01-03T11:08:31Z","_id":"10588","project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"date_created":"2022-01-02T23:01:35Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0002-9881-6870","first_name":"Lorenzo","last_name":"Dello Schiavo","full_name":"Dello Schiavo, Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E"},{"full_name":"Suzuki, Kohei","last_name":"Suzuki","first_name":"Kohei"}],"title":"Sobolev-to-Lipschitz property on QCD- spaces and applications","isi":1,"file":[{"file_name":"2021_MathAnn_DelloSchiavo.pdf","checksum":"2593abbf195e38efa93b6006b1e90eb1","success":1,"content_type":"application/pdf","file_size":410090,"creator":"alisjak","relation":"main_file","date_created":"2022-01-03T11:08:31Z","file_id":"10596","access_level":"open_access","date_updated":"2022-01-03T11:08:31Z"}],"external_id":{"isi":["000734150200001"],"arxiv":["2110.05137"]},"intvolume":" 384","ddc":["510"],"has_accepted_license":"1","department":[{"_id":"JaMa"}],"scopus_import":"1","oa_version":"Published Version","publication":"Mathematische Annalen","language":[{"iso":"eng"}],"corr_author":"1","publication_identifier":{"eissn":["1432-1807"],"issn":["0025-5831"]},"day":"01","year":"2022","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-04-14T07:27:46Z","volume":384,"page":"1815-1832","arxiv":1,"month":"12","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.","status":"public"},{"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"external_id":{"arxiv":["2106.02015"],"isi":["000741387600001"]},"intvolume":" 25","ddc":["514"],"article_number":"3","title":"The BCS critical temperature at high density","isi":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19540"}]},"file":[{"file_id":"10624","date_created":"2022-01-14T07:27:45Z","relation":"main_file","access_level":"open_access","date_updated":"2022-01-14T07:27:45Z","file_name":"2022_MathPhyAnalGeo_Henheik.pdf","success":1,"checksum":"d44f8123a52592a75b2c3b8ee2cd2435","file_size":505804,"content_type":"application/pdf","creator":"cchlebak"}],"project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"date_created":"2022-01-13T15:40:53Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"1","author":[{"orcid":"0000-0003-1106-327X","first_name":"Sven Joscha","last_name":"Henheik","full_name":"Henheik, Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb"}],"keyword":["geometry and topology","mathematical physics"],"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."}],"file_date_updated":"2022-01-14T07:27:45Z","_id":"10623","article_processing_charge":"Yes (via OA deal)","date_published":"2022-01-11T00:00:00Z","article_type":"original","citation":{"short":"S.J. Henheik, Mathematical Physics, Analysis and Geometry 25 (2022).","ista":"Henheik SJ. 2022. The BCS critical temperature at high density. Mathematical Physics, Analysis and Geometry. 25(1), 3.","chicago":"Henheik, Sven Joscha. “The BCS Critical Temperature at High Density.” Mathematical Physics, Analysis and Geometry. Springer Nature, 2022. https://doi.org/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","ieee":"S. J. Henheik, “The BCS critical temperature at high density,” Mathematical Physics, Analysis and Geometry, vol. 25, no. 1. Springer Nature, 2022.","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","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."},"ec_funded":1,"publisher":"Springer Nature","doi":"10.1007/s11040-021-09415-0","oa":1,"quality_controlled":"1","type":"journal_article","publication_status":"published","month":"01","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.","status":"public","arxiv":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":25,"date_updated":"2026-04-07T12:37:10Z","year":"2022","publication_identifier":{"eissn":["1572-9656"],"issn":["1385-0172"]},"day":"11","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","publication":"Mathematical Physics, Analysis and Geometry","oa_version":"Published Version"},{"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"external_id":{"isi":["000743615000001"],"arxiv":["2012.15239"]},"intvolume":" 10","ddc":["510"],"article_number":"e4","title":"Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk","isi":1,"file":[{"relation":"main_file","file_id":"10646","date_created":"2022-01-19T09:27:43Z","date_updated":"2022-01-19T09:27:43Z","access_level":"open_access","file_name":"2022_ForumMathSigma_Henheik.pdf","file_size":705323,"content_type":"application/pdf","creator":"cchlebak","checksum":"87592a755adcef22ea590a99dc728dd3","success":1}],"project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"date_created":"2022-01-18T16:18:51Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0003-1106-327X","last_name":"Henheik","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb"},{"full_name":"Teufel, Stefan","last_name":"Teufel","first_name":"Stefan"}],"keyword":["computational mathematics","discrete mathematics and combinatorics","geometry and topology","mathematical physics","statistics and probability","algebra and number theory","theoretical computer science","analysis"],"file_date_updated":"2022-01-19T09:27:43Z","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"}],"_id":"10643","date_published":"2022-01-18T00:00:00Z","article_processing_charge":"Yes","article_type":"original","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","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.","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.","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.","short":"S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (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."},"ec_funded":1,"oa":1,"publisher":"Cambridge University Press","doi":"10.1017/fms.2021.80","quality_controlled":"1","type":"journal_article","publication_status":"published","month":"01","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.","status":"public","arxiv":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":10,"date_updated":"2025-04-14T07:57:17Z","year":"2022","publication_identifier":{"eissn":["2050-5094"]},"day":"18","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"Published Version","publication":"Forum of Mathematics, Sigma"},{"date_updated":"2023-08-17T07:07:58Z","volume":9,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","month":"01","arxiv":1,"page":"1-18","language":[{"iso":"eng"}],"publication":"Analysis and Geometry in Metric Spaces","oa_version":"Published Version","scopus_import":"1","year":"2021","day":"29","publication_identifier":{"issn":["2299-3274"]},"file":[{"file_id":"10857","date_created":"2022-03-18T09:31:59Z","relation":"main_file","date_updated":"2022-03-18T09:31:59Z","access_level":"open_access","file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","creator":"dernst","content_type":"application/pdf","file_size":789801,"success":1,"checksum":"7e615ac8489f5eae580b6517debfdc53"}],"isi":1,"title":"On the volume of sections of the cube","author":[{"id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","full_name":"Ivanov, Grigory","first_name":"Grigory","last_name":"Ivanov"},{"full_name":"Tsiutsiurupa, Igor","last_name":"Tsiutsiurupa","first_name":"Igor"}],"issue":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2022-03-18T09:25:14Z","department":[{"_id":"UlWa"}],"has_accepted_license":"1","ddc":["510"],"external_id":{"arxiv":["2004.02674"],"isi":["000734286800001"]},"intvolume":" 9","quality_controlled":"1","doi":"10.1515/agms-2020-0103","oa":1,"publisher":"De Gruyter","publication_status":"published","type":"journal_article","_id":"10856","abstract":[{"lang":"eng","text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2."}],"file_date_updated":"2022-03-18T09:31:59Z","keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"citation":{"ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","apa":"Ivanov, G., & Tsiutsiurupa, I. (2021). On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. De Gruyter. https://doi.org/10.1515/agms-2020-0103","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” Analysis and Geometry in Metric Spaces. De Gruyter, 2021. https://doi.org/10.1515/agms-2020-0103.","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” Analysis and Geometry in Metric Spaces, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” Analysis and Geometry in Metric Spaces, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:10.1515/agms-2020-0103.","ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 2021;9(1):1-18. doi:10.1515/agms-2020-0103"},"article_type":"original","article_processing_charge":"No","date_published":"2021-01-29T00:00:00Z"},{"intvolume":" 66","external_id":{"arxiv":["1910.12628"]},"issue":"3","author":[{"last_name":"Avvakumov","first_name":"Sergey","orcid":"0000-0002-7840-5062","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey"},{"first_name":"Sergey","last_name":"Kudrya","full_name":"Kudrya, Sergey","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67"}],"date_created":"2022-06-17T08:45:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"8182"}]},"title":"Vanishing of all equivariant obstructions and the mapping degree","date_published":"2021-10-01T00:00:00Z","article_processing_charge":"No","article_type":"original","citation":{"short":"S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021) 1202–1216.","ista":"Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. 66(3), 1202–1216.","apa":"Avvakumov, S., & Kudrya, S. (2021). Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-021-00299-z","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-021-00299-z.","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” Discrete & Computational Geometry, vol. 66, no. 3. Springer Nature, pp. 1202–1216, 2021.","ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” Discrete & Computational Geometry, vol. 66, no. 3, Springer Nature, 2021, pp. 1202–16, doi:10.1007/s00454-021-00299-z."},"abstract":[{"text":"Suppose that n is not a prime power and not twice a prime power. We prove that for any Hausdorff compactum X with a free action of the symmetric group Sn, there exists an Sn-equivariant map X→Rn whose image avoids the diagonal {(x,x,…,x)∈Rn∣x∈R}. Previously, the special cases of this statement for certain X were usually proved using the equivartiant obstruction theory. Such calculations are difficult and may become infeasible past the first (primary) obstruction. We take a different approach which allows us to prove the vanishing of all obstructions simultaneously. The essential step in the proof is classifying the possible degrees of Sn-equivariant maps from the boundary ∂Δn−1 of (n−1)-simplex to itself. Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser’s conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result applying it to one such question, a specific instance of envy-free division problem.","lang":"eng"}],"_id":"11446","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"publication_status":"published","type":"journal_article","quality_controlled":"1","publisher":"Springer Nature","doi":"10.1007/s00454-021-00299-z","arxiv":1,"page":"1202-1216","acknowledgement":"S. Avvakumov has received funding from the European Research Council under the European Union’s Seventh Framework Programme ERC Grant agreement ERC StG 716424–CASe. S. Kudrya was supported by the Austrian Academic Exchange Service (OeAD), ICM-2019-13577.","status":"public","extern":"1","month":"10","volume":66,"date_updated":"2025-04-14T09:10:06Z","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"day":"01","year":"2021","publication":"Discrete & Computational Geometry","oa_version":"Preprint","scopus_import":"1","corr_author":"1","language":[{"iso":"eng"}]},{"year":"2021","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"day":"01","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","publication":"Discrete & Computational Geometry","oa_version":"Published Version","month":"07","acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement Number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. Open access funding provided by the Institute of Science and Technology (IST Austria).","status":"public","page":"386-434","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-04-14T07:43:50Z","volume":66,"keyword":["Theoretical Computer Science","Computational Theory and Mathematics","Geometry and Topology","Discrete Mathematics and Combinatorics"],"abstract":[{"lang":"eng","text":"We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric."}],"file_date_updated":"2021-08-06T09:52:29Z","_id":"8940","article_processing_charge":"Yes (via OA deal)","date_published":"2021-07-01T00:00:00Z","citation":{"short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete & Computational Geometry 66 (2021) 386–434.","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 66(1), 386–434.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00250-8.","apa":"Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00250-8","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Triangulating submanifolds: An elementary and quantified version of Whitney’s method,” Discrete & Computational Geometry, vol. 66, no. 1. Springer Nature, pp. 386–434, 2021.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8","mla":"Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry, vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:10.1007/s00454-020-00250-8."},"article_type":"original","ec_funded":1,"publisher":"Springer Nature","doi":"10.1007/s00454-020-00250-8","oa":1,"quality_controlled":"1","type":"journal_article","publication_status":"published","has_accepted_license":"1","department":[{"_id":"HeEd"}],"intvolume":" 66","external_id":{"isi":["000597770300001"]},"ddc":["516"],"title":"Triangulating submanifolds: An elementary and quantified version of Whitney’s method","isi":1,"file":[{"checksum":"c848986091e56699dc12de85adb1e39c","success":1,"content_type":"application/pdf","file_size":983307,"creator":"kschuh","file_name":"2021_DescreteCompGeopmetry_Boissonnat.pdf","access_level":"open_access","date_updated":"2021-08-06T09:52:29Z","date_created":"2021-08-06T09:52:29Z","relation":"main_file","file_id":"9795"}],"date_created":"2020-12-12T11:07:02Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"1","author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs"}]}]