[{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["001081646400010"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1007/s11856-023-2521-9","language":[{"iso":"eng"}],"month":"09","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"year":"2023","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"UlWa"}],"author":[{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner"},{"id":"4C20D868-F248-11E8-B48F-1D18A9856A87","last_name":"Wild","first_name":"Pascal","full_name":"Wild, Pascal"}],"date_updated":"2023-12-13T13:09:07Z","date_created":"2023-10-22T22:01:14Z","volume":256,"file_date_updated":"2023-10-31T11:20:31Z","publication":"Israel Journal of Mathematics","citation":{"short":"U. Wagner, P. Wild, Israel Journal of Mathematics 256 (2023) 675–717.","mla":"Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.","chicago":"Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics. Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2521-9.","ama":"Wagner U, Wild P. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 2023;256(2):675-717. doi:10.1007/s11856-023-2521-9","ieee":"U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 675–717, 2023.","apa":"Wagner, U., & Wild, P. (2023). Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2521-9","ista":"Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717."},"article_type":"original","page":"675-717","date_published":"2023-09-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","_id":"14445","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes","status":"public","ddc":["510"],"intvolume":" 256","file":[{"date_updated":"2023-10-31T11:20:31Z","date_created":"2023-10-31T11:20:31Z","success":1,"checksum":"fbb05619fe4b650f341cc730425dd9c3","file_id":"14475","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":623787,"file_name":"2023_IsraelJourMath_Wagner.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"We prove the following quantitative Borsuk–Ulam-type result (an equivariant analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with 0 ∈ F (σ) is at least 2−d Π d−1k=0ηk.\r\n\r\nAs an application, we show that for every sufficiently thick d-dimensional spherical building Y and every map f: Y → ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ} of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d, which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical buildings.\r\n\r\nWe complement these results by upper bounds on the coboundary expansion of two families of simplicial complexes; this indicates some limitations to the bounds one can obtain by straighforward applications of the quantitative Borsuk–Ulam theorem. Specifically, we prove\r\n\r\n• an upper bound of (d + 1)/2d on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite d-dimensional complexes (under a mild divisibility assumption on the sizes of the parts); and\r\n\r\n• an upper bound of (d + 1)/2d + ε on the normalized (d − 1)-th coboundary expansion of the d-dimensional spherical building associated with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather strong sense, a conjecture of Lubotzky, Meshulam and Mozes.","lang":"eng"}],"issue":"2"},{"file_date_updated":"2023-04-17T08:10:28Z","article_number":"9","date_updated":"2024-01-04T12:42:09Z","date_created":"2023-04-16T22:01:08Z","volume":24,"author":[{"full_name":"Biniaz, Ahmad","first_name":"Ahmad","last_name":"Biniaz"},{"full_name":"Jain, Kshitij","last_name":"Jain","first_name":"Kshitij"},{"last_name":"Lubiw","first_name":"Anna","full_name":"Lubiw, Anna"},{"first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana"},{"full_name":"Miltzow, Tillmann","last_name":"Miltzow","first_name":"Tillmann"},{"full_name":"Mondal, Debajyoti","last_name":"Mondal","first_name":"Debajyoti"},{"full_name":"Naredla, Anurag Murty","first_name":"Anurag Murty","last_name":"Naredla"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","first_name":"Josef"},{"last_name":"Turcotte","first_name":"Alexi","full_name":"Turcotte, Alexi"}],"related_material":{"record":[{"id":"7950","relation":"earlier_version","status":"public"}]},"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"UlWa"}],"publisher":"EPI Sciences","year":"2023","acknowledgement":"This work was begun at the University of Waterloo and was partially supported by the Natural Sciences and Engineering Council of Canada (NSERC).\r\n","month":"01","publication_identifier":{"eissn":["1365-8050"],"issn":["1462-7264"]},"language":[{"iso":"eng"}],"doi":"10.46298/DMTCS.8383","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1903.06981"]},"oa":1,"abstract":[{"lang":"eng","text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete. We present some partial results: 1. An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan. 2. Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3. Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2. 3. A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars. In this version, tokens and vertices have colours, and colours have weights. The goal is to get every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved."}],"issue":"2","type":"journal_article","file":[{"file_id":"12844","relation":"main_file","success":1,"checksum":"439102ea4f6e2aeefd7107dfb9ccf532","date_updated":"2023-04-17T08:10:28Z","date_created":"2023-04-17T08:10:28Z","access_level":"open_access","file_name":"2022_DMTCS_Biniaz.pdf","creator":"dernst","file_size":2072197,"content_type":"application/pdf"}],"oa_version":"Published Version","title":"Token swapping on trees","ddc":["000"],"status":"public","intvolume":" 24","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"12833","day":"18","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2023-01-18T00:00:00Z","article_type":"original","publication":"Discrete Mathematics and Theoretical Computer Science","citation":{"apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (2023). Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. EPI Sciences. https://doi.org/10.46298/DMTCS.8383","ieee":"A. Biniaz et al., “Token swapping on trees,” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2. EPI Sciences, 2023.","ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. 2023. Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. 24(2), 9.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. Discrete Mathematics and Theoretical Computer Science. 2023;24(2). doi:10.46298/DMTCS.8383","chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” Discrete Mathematics and Theoretical Computer Science. EPI Sciences, 2023. https://doi.org/10.46298/DMTCS.8383.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, Discrete Mathematics and Theoretical Computer Science 24 (2023).","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383."}},{"abstract":[{"lang":"eng","text":"John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies."}],"issue":"23","type":"journal_article","oa_version":"Published Version","file":[{"success":1,"checksum":"353666cea80633beb0f1ffd342dff6d4","date_created":"2024-01-08T09:53:09Z","date_updated":"2024-01-08T09:53:09Z","file_id":"14738","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":815777,"access_level":"open_access","file_name":"2023_IMRN_Ivanov.pdf"}],"_id":"14737","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"title":"Functional John and Löwner conditions for pairs of log-concave functions","status":"public","intvolume":" 2023","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","keyword":["General Mathematics"],"date_published":"2023-12-01T00:00:00Z","publication":"International Mathematics Research Notices","citation":{"short":"G. Ivanov, M. Naszódi, International Mathematics Research Notices 2023 (2023) 20613–20669.","mla":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” International Mathematics Research Notices, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:10.1093/imrn/rnad210.","chicago":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” International Mathematics Research Notices. Oxford University Press, 2023. https://doi.org/10.1093/imrn/rnad210.","ama":"Ivanov G, Naszódi M. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023;2023(23):20613-20669. doi:10.1093/imrn/rnad210","ieee":"G. Ivanov and M. Naszódi, “Functional John and Löwner conditions for pairs of log-concave functions,” International Mathematics Research Notices, vol. 2023, no. 23. Oxford University Press, pp. 20613–20669, 2023.","apa":"Ivanov, G., & Naszódi, M. (2023). Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnad210","ista":"Ivanov G, Naszódi M. 2023. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023(23), 20613–20669."},"article_type":"original","page":"20613-20669","file_date_updated":"2024-01-08T09:53:09Z","author":[{"full_name":"Ivanov, Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","first_name":"Grigory"},{"first_name":"Márton","last_name":"Naszódi","full_name":"Naszódi, Márton"}],"date_created":"2024-01-08T09:48:56Z","date_updated":"2024-01-08T09:57:25Z","volume":2023,"acknowledgement":"We thank Alexander Litvak for the many discussions on Theorem 1.1. Igor Tsiutsiurupa participated in the early stage of this project. To our deep regret, Igor chose another road for his life and stopped working with us.\r\nThis work was supported by the János Bolyai Scholarship of the Hungarian Academy of Sciences [to M.N.]; the National Research, Development, and Innovation Fund (NRDI) [K119670 and K131529 to M.N.]; and the ÚNKP-22-5 New National Excellence Program of the Ministry for Innovation and Technology from the source of the NRDI [to M.N.].","year":"2023","publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"UlWa"}],"month":"12","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"doi":"10.1093/imrn/rnad210","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"arxiv":["2212.11781"]},"oa":1,"quality_controlled":"1"},{"publication":"Geometriae Dedicata","citation":{"ama":"Dymond M, Kaluza V. Divergence of separated nets with respect to displacement equivalence. Geometriae Dedicata. 2023. doi:10.1007/s10711-023-00862-3","ieee":"M. Dymond and V. Kaluza, “Divergence of separated nets with respect to displacement equivalence,” Geometriae Dedicata. Springer Nature, 2023.","apa":"Dymond, M., & Kaluza, V. (2023). Divergence of separated nets with respect to displacement equivalence. Geometriae Dedicata. Springer Nature. https://doi.org/10.1007/s10711-023-00862-3","ista":"Dymond M, Kaluza V. 2023. Divergence of separated nets with respect to displacement equivalence. Geometriae Dedicata., 15.","short":"M. Dymond, V. Kaluza, Geometriae Dedicata (2023).","mla":"Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” Geometriae Dedicata, 15, Springer Nature, 2023, doi:10.1007/s10711-023-00862-3.","chicago":"Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” Geometriae Dedicata. Springer Nature, 2023. https://doi.org/10.1007/s10711-023-00862-3."},"article_type":"original","date_published":"2023-11-17T00:00:00Z","scopus_import":"1","day":"17","article_processing_charge":"Yes (via OA deal)","_id":"9651","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Divergence of separated nets with respect to displacement equivalence","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞). Two separated nets are called ϕ-displacement equivalent if, roughly speaking, there is a bijection between them which, for large radii R, displaces points of norm at most R by something of order at most ϕ(R). We show that the spectrum of ϕ-displacement equivalence spans from the established notion of bounded displacement equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation, coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞. We further undertake a comparison of our notion of ϕ-displacement equivalence with previously studied relations on separated nets. Particular attention is given to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz equivalence."}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s10711-023-00862-3"}],"external_id":{"arxiv":["2102.13046"],"isi":["001105681500001"]},"quality_controlled":"1","isi":1,"doi":"10.1007/s10711-023-00862-3","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"eissn":["1572-9168"],"issn":["0046-5755"]},"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was started while both authors were employed at the University of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35. It was continued when the first named author was employed at University of Leipzig and the second named author was employed at Institute of Science and Technology of Austria, where he was supported by an IST Fellowship.","year":"2023","publication_status":"epub_ahead","department":[{"_id":"UlWa"}],"publisher":"Springer Nature","author":[{"full_name":"Dymond, Michael","first_name":"Michael","last_name":"Dymond"},{"id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","orcid":"0000-0002-2512-8698","first_name":"Vojtech","last_name":"Kaluza","full_name":"Kaluza, Vojtech"}],"date_created":"2021-07-14T07:01:27Z","date_updated":"2024-01-11T13:06:32Z","article_number":"15"},{"issue":"3","abstract":[{"lang":"eng","text":"Consider a geodesic triangle on a surface of constant curvature and subdivide it recursively into four triangles by joining the midpoints of its edges. We show the existence of a uniform δ>0\r\n such that, at any step of the subdivision, all the triangle angles lie in the interval (δ,π−δ)\r\n. Additionally, we exhibit stabilising behaviours for both angles and lengths as this subdivision progresses."}],"type":"journal_article","file":[{"content_type":"application/pdf","file_size":1466020,"creator":"dernst","access_level":"open_access","file_name":"2023_DiscreteComputGeometry_Brunck.pdf","checksum":"865e68daafdd4edcfc280172ec50f5ea","success":1,"date_updated":"2024-01-29T11:15:22Z","date_created":"2024-01-29T11:15:22Z","relation":"main_file","file_id":"14897"}],"oa_version":"Published Version","_id":"13270","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 70","title":"Iterated medial triangle subdivision in surfaces of constant curvature","status":"public","ddc":["510"],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"05","scopus_import":"1","date_published":"2023-07-05T00:00:00Z","citation":{"apa":"Brunck, F. R. (2023). Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-023-00500-5","ieee":"F. R. Brunck, “Iterated medial triangle subdivision in surfaces of constant curvature,” Discrete and Computational Geometry, vol. 70, no. 3. Springer Nature, pp. 1059–1089, 2023.","ista":"Brunck FR. 2023. Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. 70(3), 1059–1089.","ama":"Brunck FR. Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. 2023;70(3):1059-1089. doi:10.1007/s00454-023-00500-5","chicago":"Brunck, Florestan R. “Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-023-00500-5.","short":"F.R. Brunck, Discrete and Computational Geometry 70 (2023) 1059–1089.","mla":"Brunck, Florestan R. “Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature.” Discrete and Computational Geometry, vol. 70, no. 3, Springer Nature, 2023, pp. 1059–89, doi:10.1007/s00454-023-00500-5."},"publication":"Discrete and Computational Geometry","page":"1059-1089","article_type":"original","file_date_updated":"2024-01-29T11:15:22Z","author":[{"full_name":"Brunck, Florestan R","id":"6ab6e556-f394-11eb-9cf6-9dfb78f00d8d","first_name":"Florestan R","last_name":"Brunck"}],"volume":70,"date_updated":"2024-01-29T11:16:16Z","date_created":"2023-07-23T22:01:14Z","year":"2023","acknowledgement":"Open access funding provided by the Institute of Science and Technology (IST Austria).","publisher":"Springer Nature","department":[{"_id":"UlWa"}],"publication_status":"published","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"07","doi":"10.1007/s00454-023-00500-5","language":[{"iso":"eng"}],"external_id":{"isi":["001023742800003"],"arxiv":["2107.04112"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1},{"date_published":"2022-07-01T00:00:00Z","publication":"ACM SIGLOG News","citation":{"chicago":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News. Association for Computing Machinery, 2022. https://doi.org/10.1145/3559736.3559740.","mla":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.","short":"A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.","ista":"Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.","apa":"Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery. https://doi.org/10.1145/3559736.3559740","ieee":"A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” ACM SIGLOG News, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022.","ama":"Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 2022;9(3):30-59. doi:10.1145/3559736.3559740"},"article_type":"original","page":"30-59","day":"01","article_processing_charge":"No","oa_version":"Preprint","_id":"11991","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"An invitation to the promise constraint satisfaction problem","intvolume":" 9","abstract":[{"text":"The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been.","lang":"eng"}],"issue":"3","type":"journal_article","doi":"10.1145/3559736.3559740","language":[{"iso":"eng"}],"external_id":{"arxiv":["2208.13538"]},"main_file_link":[{"url":"http://arxiv.org/abs/2208.13538","open_access":"1"}],"oa":1,"quality_controlled":"1","month":"07","publication_identifier":{"issn":["2372-3491"]},"author":[{"first_name":"Andrei","last_name":"Krokhin","full_name":"Krokhin, Andrei"},{"full_name":"Opršal, Jakub","id":"ec596741-c539-11ec-b829-c79322a91242","orcid":"0000-0003-1245-3456","first_name":"Jakub","last_name":"Opršal"}],"date_created":"2022-08-27T11:23:37Z","date_updated":"2022-09-05T08:19:38Z","volume":9,"year":"2022","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Association for Computing Machinery"},{"ec_funded":1,"file_date_updated":"2022-08-22T06:42:42Z","acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","year":"2022","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"publisher":"Brown University","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"9296"}]},"author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","last_name":"Arroyo Guevara","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M"},{"full_name":"Masárová, Zuzana","first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322"},{"full_name":"Parada, Irene","first_name":"Irene","last_name":"Parada"},{"last_name":"Perz","first_name":"Daniel","full_name":"Perz, Daniel"},{"last_name":"Pilz","first_name":"Alexander","full_name":"Pilz, Alexander"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","first_name":"Josef"},{"full_name":"Vogtenhuber, Birgit","first_name":"Birgit","last_name":"Vogtenhuber"}],"volume":26,"date_updated":"2023-02-23T13:54:21Z","date_created":"2022-08-21T22:01:56Z","publication_identifier":{"issn":["1526-1719"]},"month":"06","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2101.03928"]},"oa":1,"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"}],"quality_controlled":"1","doi":"10.7155/jgaa.00591","language":[{"iso":"eng"}],"type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge."}],"_id":"11938","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 26","title":"On compatible matchings","status":"public","ddc":["000"],"file":[{"relation":"main_file","file_id":"11940","date_updated":"2022-08-22T06:42:42Z","date_created":"2022-08-22T06:42:42Z","checksum":"dc6e255e3558faff924fd9e370886c11","success":1,"file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","access_level":"open_access","content_type":"application/pdf","file_size":694538,"creator":"dernst"}],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” Journal of Graph Algorithms and Applications. Brown University, 2022. https://doi.org/10.7155/jgaa.00591.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591","ieee":"O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591"},"publication":"Journal of Graph Algorithms and Applications","page":"225-240","article_type":"original","date_published":"2022-06-01T00:00:00Z"},{"file_date_updated":"2022-08-11T16:09:19Z","ec_funded":1,"year":"2022","publication_status":"published","publisher":"Institute of Science and Technology","department":[{"_id":"GradSch"},{"_id":"UlWa"}],"author":[{"full_name":"Wild, Pascal","id":"4C20D868-F248-11E8-B48F-1D18A9856A87","last_name":"Wild","first_name":"Pascal"}],"date_created":"2022-08-10T15:51:19Z","date_updated":"2023-06-22T09:56:36Z","month":"08","publication_identifier":{"isbn":["978-3-99078-021-3"],"issn":["2663-337X"]},"oa":1,"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/at:ista:11777","supervisor":[{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications.\r\nOur main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise."}],"_id":"11777","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ddc":["500","516","514"],"title":"High-dimensional expansion and crossing numbers of simplicial complexes","status":"public","file":[{"file_size":16828,"content_type":"text/x-python","creator":"pwild","access_level":"open_access","description":"Code for computer-assisted proofs in Section 8.4.7 in Thesis","file_name":"flags.py","checksum":"f5f3af1fb7c8a24b71ddc88ad7f7c5b4","date_created":"2022-08-10T15:34:04Z","date_updated":"2022-08-10T15:34:04Z","relation":"supplementary_material","file_id":"11780"},{"access_level":"open_access","description":"Code for proof of Lemma 8.20 in Thesis","file_name":"lowerbound.cpp","file_size":12226,"content_type":"text/x-c++src","creator":"pwild","relation":"supplementary_material","file_id":"11781","checksum":"1f7c12dfe3bdaa9b147e4fbc3d34e3d5","date_updated":"2022-08-10T15:34:10Z","date_created":"2022-08-10T15:34:10Z"},{"file_id":"11782","relation":"supplementary_material","checksum":"4cf81455c49e5dec3b9b2e3980137eeb","date_updated":"2022-08-10T15:34:17Z","date_created":"2022-08-10T15:34:17Z","access_level":"open_access","description":"Code for proof of Proposition 7.9 in Thesis","file_name":"upperbound.py","creator":"pwild","content_type":"text/x-python","file_size":3240},{"access_level":"open_access","file_name":"finalthesisPascalWildPDFA.pdf","content_type":"application/pdf","file_size":5086282,"creator":"pwild","relation":"main_file","title":"High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes","file_id":"11809","checksum":"4e96575b10cbe4e0d0db2045b2847774","date_updated":"2022-08-11T16:08:33Z","date_created":"2022-08-11T16:08:33Z"},{"creator":"pwild","file_size":18150068,"content_type":"application/zip","access_level":"closed","file_name":"ThesisSubmission.zip","checksum":"92d94842a1fb6dca5808448137573b2e","date_created":"2022-08-11T16:09:19Z","date_updated":"2022-08-11T16:09:19Z","file_id":"11810","relation":"source_file"}],"oa_version":"Published Version","day":"11","has_accepted_license":"1","article_processing_charge":"No","citation":{"chicago":"Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology, 2022. https://doi.org/10.15479/at:ista:11777.","mla":"Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777.","short":"P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology, 2022.","ista":"Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology.","apa":"Wild, P. (2022). High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology. https://doi.org/10.15479/at:ista:11777","ieee":"P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology, 2022.","ama":"Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:10.15479/at:ista:11777"},"page":"170","date_published":"2022-08-11T00:00:00Z"},{"oa_version":"Preprint","ddc":["514","516"],"status":"public","title":"Even maps, the Colin de Verdière number and representations of graphs","intvolume":" 42","_id":"10335","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.\r\nEquality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2."}],"type":"journal_article","date_published":"2022-12-01T00:00:00Z","article_type":"original","page":"1317-1345","publication":"Combinatorica","citation":{"ista":"Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 42, 1317–1345.","ieee":"V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations of graphs,” Combinatorica, vol. 42. Springer Nature, pp. 1317–1345, 2022.","apa":"Kaluza, V., & Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-021-4443-7","ama":"Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 2022;42:1317-1345. doi:10.1007/s00493-021-4443-7","chicago":"Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica. Springer Nature, 2022. https://doi.org/10.1007/s00493-021-4443-7.","mla":"Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7.","short":"V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345."},"day":"01","article_processing_charge":"No","scopus_import":"1","date_created":"2021-11-25T13:49:16Z","date_updated":"2023-08-02T06:43:27Z","volume":42,"author":[{"full_name":"Kaluza, Vojtech","id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","orcid":"0000-0002-2512-8698","first_name":"Vojtech","last_name":"Kaluza"},{"full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin","last_name":"Tancer"}],"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer Nature","year":"2022","acknowledgement":"V. K. gratefully acknowledges the support of Austrian Science Fund (FWF): P 30902-N35. This work was done mostly while he was employed at the University of Innsbruck. During the early stage of this research, V. K. was partially supported by Charles University project GAUK 926416. M. T. is supported by the grant no. 19-04113Y of the Czech Science Foundation(GA ˇCR) and partially supported by Charles University project UNCE/SCI/004.","language":[{"iso":"eng"}],"doi":"10.1007/s00493-021-4443-7","quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1907.05055"}],"oa":1,"external_id":{"arxiv":["1907.05055"],"isi":["000798210100003"]},"month":"12","publication_identifier":{"issn":["0209-9683"]}},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"10776","intvolume":" 68","status":"public","title":"Barycentric cuts through a convex body","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Let K be a convex body in Rn (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K∩h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p0 is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n≥2, there are always at least three distinct barycentric cuts through the point p0∈K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p0 are guaranteed if n≥3.","lang":"eng"}],"citation":{"chicago":"Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” Discrete and Computational Geometry. Springer Nature, 2022. https://doi.org/10.1007/s00454-021-00364-7.","mla":"Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 1133–54, doi:10.1007/s00454-021-00364-7.","short":"Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68 (2022) 1133–1154.","ista":"Patakova Z, Tancer M, Wagner U. 2022. Barycentric cuts through a convex body. Discrete and Computational Geometry. 68, 1133–1154.","ieee":"Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 1133–1154, 2022.","apa":"Patakova, Z., Tancer, M., & Wagner, U. (2022). Barycentric cuts through a convex body. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-021-00364-7","ama":"Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. Discrete and Computational Geometry. 2022;68:1133-1154. doi:10.1007/s00454-021-00364-7"},"publication":"Discrete and Computational Geometry","page":"1133-1154","article_type":"original","date_published":"2022-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","acknowledgement":"The work by Zuzana Patáková has been partially supported by Charles University Research Center Program No. UNCE/SCI/022, and part of it was done during her research stay at IST Austria. The work by Martin Tancer is supported by the GAČR Grant 19-04113Y and by the Charles University Projects PRIMUS/17/SCI/3 and UNCE/SCI/004.","year":"2022","publisher":"Springer Nature","department":[{"_id":"UlWa"}],"publication_status":"published","author":[{"last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","full_name":"Patakova, Zuzana"},{"full_name":"Tancer, Martin","first_name":"Martin","last_name":"Tancer"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli"}],"volume":68,"date_updated":"2023-08-02T14:38:58Z","date_created":"2022-02-20T23:01:35Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2003.13536"}],"external_id":{"arxiv":["2003.13536"],"isi":["000750681500001"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1007/s00454-021-00364-7","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"12"}]