[{"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","date_updated":"2021-01-12T08:16:23Z","ddc":["510"],"conference":{"location":"Zürich, Switzerland","end_date":"2020-06-26","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public","_id":"7991","license":"https://creativecommons.org/licenses/by/3.0/","volume":164,"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"6872df6549142f709fb6354a1b2f2c06","file_id":"8007","file_size":575896,"date_updated":"2020-07-14T12:48:06Z","creator":"dernst","file_name":"2020_LIPIcsSoCG_Avvakumov.pdf","date_created":"2020-06-23T11:13:49Z"}],"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 164","month":"06","abstract":[{"text":"We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between \"grid peeling\" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase.","lang":"eng"}],"oa_version":"Published Version","external_id":{"arxiv":["1909.00263"]},"article_processing_charge":"No","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","last_name":"Avvakumov","full_name":"Avvakumov, Sergey"},{"last_name":"Nivasch","full_name":"Nivasch, Gabriel","first_name":"Gabriel"}],"title":"Homotopic curve shortening and the affine curve-shortening flow","citation":{"chicago":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.12.","ista":"Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.","mla":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.","apa":"Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12","ama":"Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12","short":"S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening flow,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory"}],"article_number":"12:1 - 12:15","date_created":"2020-06-22T09:14:19Z","doi":"10.4230/LIPIcs.SoCG.2020.12","date_published":"2020-06-01T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"36th International Symposium on Computational Geometry","day":"01","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"_id":"7989","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Zürich, Switzerland","end_date":"2020-06-26","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"},"status":"public","date_updated":"2021-01-12T08:16:22Z","ddc":["510"],"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","abstract":[{"text":"We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","month":"06","intvolume":" 164","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"publication_status":"published","file":[{"file_name":"2020_LIPIcsSoCG_Patakova_61.pdf","date_created":"2020-06-23T06:56:23Z","creator":"dernst","file_size":645421,"date_updated":"2020-07-14T12:48:06Z","file_id":"8005","checksum":"d0996ca5f6eb32ce955ce782b4f2afbe","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":164,"article_number":"61:1-61:13","citation":{"chicago":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61.","ista":"Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 61:1-61:13.","mla":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.","apa":"Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61","ama":"Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61","ieee":"Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87","last_name":"Patakova","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683"}],"article_processing_charge":"No","external_id":{"arxiv":["1908.01677"]},"title":"Bounding radon number via Betti numbers","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"36th International Symposium on Computational Geometry","doi":"10.4230/LIPIcs.SoCG.2020.61","date_published":"2020-06-01T00:00:00Z","date_created":"2020-06-22T09:14:18Z"},{"publication":"36th International Symposium on Computational Geometry","day":"01","year":"2020","has_accepted_license":"1","date_created":"2020-06-22T09:14:20Z","doi":"10.4230/LIPIcs.SoCG.2020.62","date_published":"2020-06-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.","chicago":"Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62.","ieee":"Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62","apa":"Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62","mla":"Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62."},"title":"Barycentric cuts through a convex body","article_processing_charge":"No","external_id":{"arxiv":["2003.13536"]},"author":[{"full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","last_name":"Patakova","id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana"},{"orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","last_name":"Tancer","first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"article_number":"62:1 - 62:16","language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:48:06Z","file_size":750318,"creator":"dernst","date_created":"2020-06-23T06:45:52Z","file_name":"2020_LIPIcsSoCG_Patakova.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8004","checksum":"ce1c9194139a664fb59d1efdfc88eaae"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"volume":164,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Let K be a convex body in ℝⁿ (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=p₀ 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 p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3."}],"intvolume":" 164","month":"06","alternative_title":["LIPIcs"],"scopus_import":1,"ddc":["510"],"date_updated":"2021-01-12T08:16:23Z","file_date_updated":"2020-07-14T12:48:06Z","department":[{"_id":"UlWa"}],"_id":"7992","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2020-06-22","end_date":"2020-06-26","location":"Zürich, Switzerland","name":"SoCG: Symposium on Computational Geometry"},"type":"conference"},{"file_date_updated":"2020-07-14T12:48:06Z","department":[{"_id":"UlWa"}],"date_updated":"2023-02-23T13:22:12Z","ddc":["510"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","_id":"7994","ec_funded":1,"volume":164,"publication_status":"published","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8006","checksum":"93571b76cf97d5b7c8aabaeaa694dd7e","creator":"dernst","date_updated":"2020-07-14T12:48:06Z","file_size":592661,"date_created":"2020-06-23T11:06:23Z","file_name":"2020_LIPIcsSoCG_Arroyo.pdf"}],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 164","month":"06","abstract":[{"text":"In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.","lang":"eng"}],"oa_version":"Published Version","external_id":{"arxiv":["1804.09317"]},"article_processing_charge":"No","author":[{"first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara"},{"full_name":"Bensmail, Julien","last_name":"Bensmail","first_name":"Julien"},{"full_name":"Bruce Richter, R.","last_name":"Bruce Richter","first_name":"R."}],"title":"Extending drawings of graphs to arrangements of pseudolines","citation":{"ista":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.","chicago":"Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.","ama":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9","apa":"Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9","short":"A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"article_number":"9:1 - 9:14","date_created":"2020-06-22T09:14:21Z","date_published":"2020-06-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2020.9","year":"2020","has_accepted_license":"1","publication":"36th International Symposium on Computational Geometry","day":"01","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"date_updated":"2021-01-12T08:16:30Z","ddc":["530"],"department":[{"_id":"MaSe"}],"file_date_updated":"2020-07-14T12:48:08Z","_id":"8011","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"issn":["2643-1564"]},"language":[{"iso":"eng"}],"file":[{"checksum":"e6959dc8220f14a008d1933858795e6d","file_id":"8050","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_PhysicalReviewResearch_Michailidis.pdf","date_created":"2020-06-29T14:41:27Z","creator":"dernst","file_size":2066011,"date_updated":"2020-07-14T12:48:08Z"}],"ec_funded":1,"issue":"2","volume":2,"abstract":[{"text":"Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.","lang":"eng"}],"oa_version":"Published Version","intvolume":" 2","month":"06","citation":{"apa":"Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065","ama":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2020;2(2). doi:10.1103/physrevresearch.2.022065","short":"A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review Research 2 (2020).","ieee":"A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing two-dimensional quantum scars by deformation and synchronization,” Physical Review Research, vol. 2, no. 2. American Physical Society, 2020.","mla":"Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research, vol. 2, no. 2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065.","ista":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2(2), 022065.","chicago":"Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","first_name":"Alexios","last_name":"Michailidis","full_name":"Michailidis, Alexios"},{"last_name":"Turner","full_name":"Turner, C. J.","first_name":"C. J."},{"first_name":"Z.","last_name":"Papić","full_name":"Papić, Z."},{"first_name":"D. A.","last_name":"Abanin","full_name":"Abanin, D. A."},{"last_name":"Serbyn","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"title":"Stabilizing two-dimensional quantum scars by deformation and synchronization","article_number":"022065","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"year":"2020","has_accepted_license":"1","publication":"Physical Review Research","day":"22","date_created":"2020-06-23T12:00:19Z","date_published":"2020-06-22T00:00:00Z","doi":"10.1103/physrevresearch.2.022065","oa":1,"quality_controlled":"1","publisher":"American Physical Society"}]