[{"language":[{"iso":"eng"}],"researchdata_availability":"not applicable","date_updated":"2026-10-21T13:22:57Z","department":[{"_id":"UlWa"}],"arxiv":1,"oa":1,"author":[{"last_name":"Dymond","first_name":"Michael","full_name":"Dymond, Michael"},{"last_name":"Kaluza","id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","orcid":"0000-0002-2512-8698","first_name":"Vojtech","full_name":"Kaluza, Vojtech"}],"ddc":["510"],"isi":1,"article_type":"original","intvolume":"       218","external_id":{"isi":["001105681500001"],"arxiv":["2102.13046"],"pmid":["38021107"]},"corr_author":"1","fulldoi":"https://doi.org/10.1007/s10711-023-00862-3","citation":{"ama":"Dymond M, Kaluza V. Divergence of separated nets with respect to displacement equivalence. <i>Geometriae Dedicata</i>. 2024;218. doi:<a href=\"https://doi.org/10.1007/s10711-023-00862-3\">10.1007/s10711-023-00862-3</a>","apa":"Dymond, M., &#38; Kaluza, V. (2024). Divergence of separated nets with respect to displacement equivalence. <i>Geometriae Dedicata</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10711-023-00862-3\">https://doi.org/10.1007/s10711-023-00862-3</a>","ista":"Dymond M, Kaluza V. 2024. Divergence of separated nets with respect to displacement equivalence. Geometriae Dedicata. 218, 15.","ieee":"M. Dymond and V. Kaluza, “Divergence of separated nets with respect to displacement equivalence,” <i>Geometriae Dedicata</i>, vol. 218. Springer Nature, 2024.","mla":"Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>, vol. 218, 15, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1007/s10711-023-00862-3\">10.1007/s10711-023-00862-3</a>.","chicago":"Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s10711-023-00862-3\">https://doi.org/10.1007/s10711-023-00862-3</a>.","short":"M. Dymond, V. Kaluza, Geometriae Dedicata 218 (2024)."},"date_created":"2021-07-14T07:01:27Z","publisher":"Springer Nature","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2024","file":[{"content_type":"application/pdf","date_created":"2024-07-16T10:14:13Z","success":1,"relation":"main_file","file_name":"2024_GeometriaeDedicata_Dymond.pdf","date_updated":"2024-07-16T10:14:13Z","file_id":"17257","checksum":"9418534ac2f3d6f1f091a8b8ccaed01e","file_size":540981,"access_level":"open_access","creator":"dernst"}],"article_number":"15","_id":"9651","status":"public","type":"journal_article","date_published":"2024-02-01T00:00:00Z","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.","OA_type":"hybrid","OA_place":"publisher","title":"Divergence of separated nets with respect to displacement equivalence","scopus_import":"1","doi":"10.1007/s10711-023-00862-3","day":"01","publication":"Geometriae Dedicata","file_date_updated":"2024-07-16T10:14:13Z","volume":218,"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_version":"Published Version","das_tickbox":"1","dataavailabilitystatement":"Data sharing not applicable to this article as no datasets were generated or analysed during the current study.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","pmid":1,"supplementarymaterial":"no","quality_controlled":"1","month":"02","publication_identifier":{"issn":["0046-5755"],"eissn":["1572-9168"]},"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"date_updated":"2026-10-21T13:23:20Z","researchdata_availability":"no","department":[{"_id":"UlWa"}],"oa":1,"arxiv":1,"ddc":["510"],"author":[{"last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","first_name":"Grigory","full_name":"Ivanov, Grigory","orcid":"0000-0002-5021-3982"},{"full_name":"Naszódi, Márton","first_name":"Márton","last_name":"Naszódi"}],"intvolume":"        56","article_type":"original","isi":1,"citation":{"mla":"Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial Bound.” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 2, London Mathematical Society, 2024, pp. 796–802, doi:<a href=\"https://doi.org/10.1112/blms.12965\">10.1112/blms.12965</a>.","chicago":"Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial Bound.” <i>Bulletin of the London Mathematical Society</i>. London Mathematical Society, 2024. <a href=\"https://doi.org/10.1112/blms.12965\">https://doi.org/10.1112/blms.12965</a>.","short":"G. Ivanov, M. Naszódi, Bulletin of the London Mathematical Society 56 (2024) 796–802.","ama":"Ivanov G, Naszódi M. Quantitative Steinitz theorem: A polynomial bound. <i>Bulletin of the London Mathematical Society</i>. 2024;56(2):796-802. doi:<a href=\"https://doi.org/10.1112/blms.12965\">10.1112/blms.12965</a>","apa":"Ivanov, G., &#38; Naszódi, M. (2024). Quantitative Steinitz theorem: A polynomial bound. <i>Bulletin of the London Mathematical Society</i>. London Mathematical Society. <a href=\"https://doi.org/10.1112/blms.12965\">https://doi.org/10.1112/blms.12965</a>","ieee":"G. Ivanov and M. Naszódi, “Quantitative Steinitz theorem: A polynomial bound,” <i>Bulletin of the London Mathematical Society</i>, vol. 56, no. 2. London Mathematical Society, pp. 796–802, 2024.","ista":"Ivanov G, Naszódi M. 2024. Quantitative Steinitz theorem: A polynomial bound. Bulletin of the London Mathematical Society. 56(2), 796–802."},"fulldoi":"https://doi.org/10.1112/blms.12965","corr_author":"1","page":"796-802","external_id":{"isi":["001113277100001"],"arxiv":["2212.04308"]},"publisher":"London Mathematical Society","date_created":"2023-12-10T23:00:58Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"14660","year":"2024","file":[{"success":1,"relation":"main_file","date_created":"2024-07-16T10:35:10Z","content_type":"application/pdf","creator":"dernst","file_size":111756,"date_updated":"2024-07-16T10:35:10Z","checksum":"30ea0694757bc668cf7cd15ae357b35e","file_name":"2024_BulletinLondonMathSoc_Ivanov.pdf","file_id":"17259","access_level":"open_access"}],"acknowledgement":"M.N. was supported by the János Bolyai Scholarship of the Hungarian Academy of Sciences aswell as the National Research, Development and Innovation Fund (NRDI) grants K119670 andK131529, and the ÚNKP-22-5 New National Excellence Program of the Ministry for Innovationand Technology from the source of the NRDI as well as the ELTE TKP 2021-NKTA-62 fundingscheme","date_published":"2024-02-01T00:00:00Z","type":"journal_article","status":"public","scopus_import":"1","title":"Quantitative Steinitz theorem: A polynomial bound","issue":"2","publication":"Bulletin of the London Mathematical Society","file_date_updated":"2024-07-16T10:35:10Z","volume":56,"day":"01","doi":"10.1112/blms.12965","das_tickbox":"0","oa_version":"Published Version","abstract":[{"text":"The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set 𝑆⊂ℝ𝑑, then there are at most 2𝑑 points of 𝑆 whose convex hull contains the origin in the interior. Bárány, Katchalski,and Pach proved the following quantitative version of Steinitz’s theorem. Let 𝑄 be a convex polytope in ℝ𝑑 containing the standard Euclidean unit ball 𝐁𝑑. Then there exist at most 2𝑑 vertices of 𝑄 whose convex hull 𝑄′ satisfies 𝑟𝐁𝑑⊂𝑄′ with 𝑟⩾𝑑−2𝑑. They conjectured that 𝑟⩾𝑐𝑑−1∕2 holds with a universal constant 𝑐>0. We prove 𝑟⩾15𝑑2, the first polynomial lower bound on 𝑟. Furthermore, we show that 𝑟 is not greater than 2/√𝑑.","lang":"eng"}],"supplementarymaterial":"no","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"month":"02","quality_controlled":"1"},{"publisher":"Elsevier","date_created":"2024-12-04T07:58:45Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"       651","article_type":"original","isi":1,"citation":{"short":"D. Beďatš, Journal of Algebra 651 (2024) 281–304.","chicago":"Beďatš, Daniel. “Separation of Variables for Scalar-Valued Polynomials in the Non-Stable Range.” <i>Journal of Algebra</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jalgebra.2024.04.013\">https://doi.org/10.1016/j.jalgebra.2024.04.013</a>.","mla":"Beďatš, Daniel. “Separation of Variables for Scalar-Valued Polynomials in the Non-Stable Range.” <i>Journal of Algebra</i>, vol. 651, Elsevier, 2024, pp. 281–304, doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2024.04.013\">10.1016/j.jalgebra.2024.04.013</a>.","ista":"Beďatš D. 2024. Separation of variables for scalar-valued polynomials in the non-stable range. Journal of Algebra. 651, 281–304.","ieee":"D. Beďatš, “Separation of variables for scalar-valued polynomials in the non-stable range,” <i>Journal of Algebra</i>, vol. 651. Elsevier, pp. 281–304, 2024.","apa":"Beďatš, D. (2024). Separation of variables for scalar-valued polynomials in the non-stable range. <i>Journal of Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jalgebra.2024.04.013\">https://doi.org/10.1016/j.jalgebra.2024.04.013</a>","ama":"Beďatš D. Separation of variables for scalar-valued polynomials in the non-stable range. <i>Journal of Algebra</i>. 2024;651:281-304. doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2024.04.013\">10.1016/j.jalgebra.2024.04.013</a>"},"fulldoi":"https://doi.org/10.1016/j.jalgebra.2024.04.013","external_id":{"isi":["001232775600001"],"arxiv":["2309.11154"]},"corr_author":"1","page":"281-304","oa":1,"arxiv":1,"ddc":["510"],"author":[{"last_name":"Beďatš","full_name":"Beďatš, Daniel","first_name":"Daniel","orcid":"0009-0004-1828-0044","id":"78ea3cc9-31e7-11ee-aa02-a6169bbfe1f1"}],"researchdata_availability":"not applicable","date_updated":"2026-10-21T13:24:58Z","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"supplementarymaterial":"no","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","dataavailabilitystatement":"No data was used for the research described in the article.\r\n","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["0021-8693"]},"month":"08","quality_controlled":"1","publication":"Journal of Algebra","file_date_updated":"2024-12-09T13:56:26Z","volume":651,"doi":"10.1016/j.jalgebra.2024.04.013","day":"01","das_tickbox":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Any complex-valued polynomial on (Rn)k decomposes into an algebraic combination of O(n)-invariant polynomials and harmonic polynomials. This decomposition, separation of variables, is granted to be unique if n≥2k−1. We prove that the condition n≥2k−1 is not only sufficient, but also necessary for uniqueness of the separation. Moreover, we describe the structure of non-uniqueness of the separation in the boundary cases when n=2k−2 and n=2k−3.\r\nFormally, we study the kernel of a multiplication map ϕ carrying out separation of variables. We devise a general algorithmic procedure for describing Ker ϕ in the restricted non-stable range k≤n<2k−1. In the full non-stable range n<2k−1, we give formulas for highest weights of generators of the kernel as well as formulas for its Hilbert series. Using the developed methods, we obtain a list of highest weight vectors generating Ker ϕ."}],"OA_type":"hybrid","scopus_import":"1","title":"Separation of variables for scalar-valued polynomials in the non-stable range","OA_place":"publisher","_id":"18617","file":[{"content_type":"application/pdf","date_created":"2024-12-09T13:56:26Z","success":1,"relation":"main_file","date_updated":"2024-12-09T13:56:26Z","checksum":"7b01c89128ba16d5334dfab389a03878","file_name":"2024_JourAlgebra_Bedats.pdf","file_id":"18638","file_size":486969,"access_level":"open_access","creator":"dernst"}],"year":"2024","acknowledgement":"The author is sincerely grateful for guidance, advice and valuable feedback from Roman Lávička.","date_published":"2024-08-01T00:00:00Z","type":"journal_article","status":"public"},{"oa":1,"arxiv":1,"author":[{"last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"},{"last_name":"Gärtner","full_name":"Gärtner, Bernd","first_name":"Bernd"},{"full_name":"Kupavskii, Andrey","first_name":"Andrey","last_name":"Kupavskii"},{"last_name":"Valtr","full_name":"Valtr, Pavel","first_name":"Pavel"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli"}],"language":[{"iso":"eng"}],"researchdata_availability":"no","department":[{"_id":"UlWa"}],"date_updated":"2026-10-21T13:25:18Z","date_created":"2023-08-06T22:01:12Z","publisher":"Springer Nature","isi":1,"article_type":"original","intvolume":"        72","external_id":{"isi":["001038546500001"],"arxiv":["1812.04911"]},"page":"831-848","fulldoi":"https://doi.org/10.1007/s00454-023-00532-x","citation":{"chicago":"Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s00454-023-00532-x\">https://doi.org/10.1007/s00454-023-00532-x</a>.","short":"R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry 72 (2024) 831–848.","mla":"Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” <i>Discrete and Computational Geometry</i>, vol. 72, Springer Nature, 2024, pp. 831–48, doi:<a href=\"https://doi.org/10.1007/s00454-023-00532-x\">10.1007/s00454-023-00532-x</a>.","ista":"Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2024. The crossing Tverberg theorem. Discrete and Computational Geometry. 72, 831–848.","ieee":"R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” <i>Discrete and Computational Geometry</i>, vol. 72. Springer Nature, pp. 831–848, 2024.","ama":"Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. <i>Discrete and Computational Geometry</i>. 2024;72:831-848. doi:<a href=\"https://doi.org/10.1007/s00454-023-00532-x\">10.1007/s00454-023-00532-x</a>","apa":"Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &#38; Wagner, U. (2024). The crossing Tverberg theorem. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-023-00532-x\">https://doi.org/10.1007/s00454-023-00532-x</a>"},"OA_type":"green","OA_place":"repository","title":"The crossing Tverberg theorem","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1812.04911"}],"year":"2024","_id":"13974","status":"public","related_material":{"record":[{"id":"6647","status":"public","relation":"earlier_version"}]},"type":"journal_article","date_published":"2024-09-01T00:00:00Z","acknowledgement":"Part of the research leading to this paper was done during the 16th Gremo Workshop on Open Problems (GWOP), Waltensburg, Switzerland, June 12–16, 2018. We thank Patrick Schnider for suggesting the problem, and Stefan Felsner, Malte Milatz, and Emo Welzl for fruitful discussions during the workshop. We also thank Stefan Felsner and Manfred Scheucher for finding, communicating the example from Sect. 3.3, and the kind permission to include their visualization of the point set. We thank Dömötör Pálvölgyi, the SoCG reviewers, and DCG reviewers for various helpful comments.\r\nR. Fulek gratefully acknowledges support from Austrian Science Fund (FWF), Project  M2281-N35. A. Kupavskii was supported by the Advanced Postdoc.Mobility Grant no. P300P2_177839 of the Swiss National Science Foundation. Research by P. Valtr was supported by the Grant no. 18-19158 S of the Czech Science Foundation (GAČR).","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"grant_number":"M02281","call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","supplementarymaterial":"no","quality_controlled":"1","month":"09","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"article_processing_charge":"No","doi":"10.1007/s00454-023-00532-x","day":"01","volume":72,"publication":"Discrete and Computational Geometry","abstract":[{"text":"The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X of at least (d+1)(r−1)+1 points in Rd, one can find a partition X=X1∪⋯∪Xr of X, such that the convex hulls of the Xi, i=1,…,r, all share a common point. In this paper, we prove a trengthening of this theorem that guarantees a partition which, in addition to the above, has the property that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections. Possible generalizations and algorithmic aspects are also discussed. As a concrete application, we show that any n points in the plane in general position span ⌊n/3⌋ vertex-disjoint triangles that are pairwise crossing, meaning that their boundaries have pairwise nonempty intersections; this number is clearly best possible. A previous result of Álvarez-Rebollar et al. guarantees ⌊n/6⌋pairwise crossing triangles. Our result generalizes to a result about simplices in Rd, d≥2.","lang":"eng"}],"oa_version":"Preprint","das_tickbox":"0"},{"author":[{"last_name":"Lopushanski","first_name":"Mariana","full_name":"Lopushanski, Mariana"},{"last_name":"Ivanov","orcid":"0000-0002-5021-3982","first_name":"Grigory","full_name":"Ivanov, Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"}],"date_updated":"2026-10-21T13:24:14Z","language":[{"iso":"eng"}],"researchdata_availability":"unclear","department":[{"_id":"UlWa"}],"publisher":"AIP Publishing","date_created":"2024-04-07T22:00:55Z","citation":{"short":"M. Lopushanski, G. Ivanov, in:, AIP Conference Proceedings, AIP Publishing, 2024.","chicago":"Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for Building Rectifiable Curves in Weakly Convex Sets.” In <i>AIP Conference Proceedings</i>, Vol. 3030. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0195908\">https://doi.org/10.1063/5.0195908</a>.","mla":"Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for Building Rectifiable Curves in Weakly Convex Sets.” <i>AIP Conference Proceedings</i>, vol. 3030, no. 1, 080002, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0195908\">10.1063/5.0195908</a>.","ista":"Lopushanski M, Ivanov G. 2024. A constructive algorithm for building rectifiable curves in weakly convex sets. AIP Conference Proceedings. ICCMSE: International Conference of Computational Methods in Sciences and Engiineering vol. 3030, 080002.","ieee":"M. Lopushanski and G. Ivanov, “A constructive algorithm for building rectifiable curves in weakly convex sets,” in <i>AIP Conference Proceedings</i>, Virtual, 2024, vol. 3030, no. 1.","ama":"Lopushanski M, Ivanov G. A constructive algorithm for building rectifiable curves in weakly convex sets. In: <i>AIP Conference Proceedings</i>. Vol 3030. AIP Publishing; 2024. doi:<a href=\"https://doi.org/10.1063/5.0195908\">10.1063/5.0195908</a>","apa":"Lopushanski, M., &#38; Ivanov, G. (2024). A constructive algorithm for building rectifiable curves in weakly convex sets. In <i>AIP Conference Proceedings</i> (Vol. 3030). Virtual: AIP Publishing. <a href=\"https://doi.org/10.1063/5.0195908\">https://doi.org/10.1063/5.0195908</a>"},"fulldoi":"https://doi.org/10.1063/5.0195908","intvolume":"      3030","scopus_import":"1","title":"A constructive algorithm for building rectifiable curves in weakly convex sets","date_published":"2024-03-14T00:00:00Z","conference":{"end_date":"2022-10-29","name":"ICCMSE: International Conference of Computational Methods in Sciences and Engiineering","location":"Virtual","start_date":"2022-10-26"},"type":"conference","status":"public","_id":"15296","article_number":"080002","year":"2024","article_processing_charge":"No","publication_identifier":{"eissn":["1551-7616"],"issn":["0094-243X"]},"month":"03","quality_controlled":"1","supplementarymaterial":"unclear","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","abstract":[{"text":"In this paper we build a constructive algorithm that returns a rectifiable curve that connects two points in a weakly convex set in a Hilbert space. We have proven that this algorithm converges and obtained an estimate on the curve’s length and compare the length of the curve obtained to known results.","lang":"eng"}],"issue":"1","publication":"AIP Conference Proceedings","volume":3030,"day":"14","doi":"10.1063/5.0195908"},{"OA_type":"gold","scopus_import":"1","OA_place":"publisher","title":"Eight-partitioning points in 3D, and efficiently too","year":"2024","file":[{"file_size":880725,"checksum":"443aa29ea5d948e917cfccd681dcf176","file_name":"2024_LIPICs_Aronov.pdf","file_id":"18918","date_updated":"2025-01-27T14:17:37Z","access_level":"open_access","creator":"dernst","date_created":"2025-01-27T14:17:37Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"_id":"18917","conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Athens, Greece","end_date":"2024-06-14","start_date":"2024-06-11"},"acknowledgement":"Aronov, Boris: Work has been supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work.","date_published":"2024-06-06T00:00:00Z","status":"public","related_material":{"record":[{"status":"public","id":"19860","relation":"later_version"}]},"type":"conference","publication_status":"published","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"isbn":["9783959773164"]},"article_processing_charge":"Yes","has_accepted_license":"1","quality_controlled":"1","month":"06","publication":"40th International Symposium on Computational Geometry","file_date_updated":"2025-01-27T14:17:37Z","volume":293,"doi":"10.4230/LIPIcs.SoCG.2024.8","day":"06","oa_version":"Published Version","das_tickbox":"0","abstract":[{"text":"An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.\r\nWe prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.\r\nMoreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2}).","lang":"eng"}],"arxiv":1,"oa":1,"ddc":["510"],"author":[{"last_name":"Aronov","first_name":"Boris","full_name":"Aronov, Boris"},{"last_name":"Basit","full_name":"Basit, Abdul","first_name":"Abdul"},{"full_name":"Ramesh, Indu","first_name":"Indu","last_name":"Ramesh"},{"id":"0433290C-AF8F-11E9-A4C7-F729E6697425","full_name":"Tasinato, Gianluca","first_name":"Gianluca","last_name":"Tasinato"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"researchdata_availability":"no","language":[{"iso":"eng"}],"date_updated":"2026-10-21T13:38:17Z","department":[{"_id":"UlWa"},{"_id":"GradSch"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2025-01-27T14:19:17Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"       293","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2024.8","citation":{"ama":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>","apa":"Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>","ieee":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.","ista":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.","mla":"Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>.","chicago":"Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In <i>40th International Symposium on Computational Geometry</i>, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>.","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15."},"page":"8:1-8:15","corr_author":"1","external_id":{"arxiv":["2403.02627"]}},{"corr_author":"1","page":"1973-2007","external_id":{"arxiv":["2306.12301"],"isi":["001329804200001"]},"citation":{"apa":"Kaloshin, V., Koudjinan, E., &#38; Zhang, K. (2024). Birkhoff conjecture for nearly centrally symmetric domains. <i>Geometric and Functional Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00039-024-00695-6\">https://doi.org/10.1007/s00039-024-00695-6</a>","ama":"Kaloshin V, Koudjinan E, Zhang K. Birkhoff conjecture for nearly centrally symmetric domains. <i>Geometric and Functional Analysis</i>. 2024;34:1973-2007. doi:<a href=\"https://doi.org/10.1007/s00039-024-00695-6\">10.1007/s00039-024-00695-6</a>","ieee":"V. Kaloshin, E. Koudjinan, and K. Zhang, “Birkhoff conjecture for nearly centrally symmetric domains,” <i>Geometric and Functional Analysis</i>, vol. 34. Springer Nature, pp. 1973–2007, 2024.","ista":"Kaloshin V, Koudjinan E, Zhang K. 2024. Birkhoff conjecture for nearly centrally symmetric domains. Geometric and Functional Analysis. 34, 1973–2007.","mla":"Kaloshin, Vadim, et al. “Birkhoff Conjecture for Nearly Centrally Symmetric Domains.” <i>Geometric and Functional Analysis</i>, vol. 34, Springer Nature, 2024, pp. 1973–2007, doi:<a href=\"https://doi.org/10.1007/s00039-024-00695-6\">10.1007/s00039-024-00695-6</a>.","chicago":"Kaloshin, Vadim, Edmond Koudjinan, and Ke Zhang. “Birkhoff Conjecture for Nearly Centrally Symmetric Domains.” <i>Geometric and Functional Analysis</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s00039-024-00695-6\">https://doi.org/10.1007/s00039-024-00695-6</a>.","short":"V. Kaloshin, E. Koudjinan, K. Zhang, Geometric and Functional Analysis 34 (2024) 1973–2007."},"fulldoi":"https://doi.org/10.1007/s00039-024-00695-6","article_type":"original","isi":1,"intvolume":"        34","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2024-10-27T23:01:45Z","publisher":"Springer Nature","language":[{"iso":"eng"}],"date_updated":"2026-10-21T13:44:48Z","department":[{"_id":"VaKa"}],"researchdata_availability":"no","author":[{"full_name":"Kaloshin, Vadim","first_name":"Vadim","orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","last_name":"Kaloshin"},{"orcid":"0000-0003-2640-4049","first_name":"Edmond","full_name":"Koudjinan, Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","last_name":"Koudjinan"},{"first_name":"Ke","full_name":"Zhang, Ke","last_name":"Zhang"}],"ddc":["510"],"ec_funded":1,"oa":1,"arxiv":1,"abstract":[{"lang":"eng","text":"In this paper we prove a perturbative version of a remarkable Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) result. They prove non perturbative Birkhoff conjecture for centrally-symmetric convex domains, namely, a centrally-symmetric convex domain with integrable billiard is ellipse. We combine techniques from Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) with a local result by Kaloshin–Sorrentino (Ann. Math. 188(1):315–380, 2018) and show that a domain close enough to a centrally symmetric one with integrable billiard is ellipse. To combine these results we derive a slight extension of Bialy–Mironov (Ann. Math. 196(1):389–413, 2022) by proving that a notion of rational integrability is equivalent to the C0-integrability condition used in their paper."}],"das_tickbox":"0","oa_version":"Published Version","day":"01","doi":"10.1007/s00039-024-00695-6","volume":34,"file_date_updated":"2025-01-13T09:14:24Z","publication":"Geometric and Functional Analysis","month":"12","quality_controlled":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["1016-443X"],"eissn":["1420-8970"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","project":[{"call_identifier":"H2020","grant_number":"885707","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","name":"Spectral rigidity and integrability for billiards and geodesic flows"}],"publication_status":"published","type":"journal_article","status":"public","date_published":"2024-12-01T00:00:00Z","acknowledgement":"We are grateful to the anonymous referee for their careful reading and valuable remarks and comments which helped to improve significantly the paper. Open access funding provided by Institute of Science and Technology (IST Austria). V.K. and C.E.K. gratefully acknowledge support from the European Research Council (ERC) through the Advanced Grant “SPERIG” (#885 707).","_id":"18483","year":"2024","file":[{"access_level":"open_access","file_id":"18833","date_updated":"2025-01-13T09:14:24Z","checksum":"e7fcd9f78beb40408c7d858ac0625e27","file_name":"2024_GeometricFunctionalAnalysis_Kaloshin.pdf","file_size":2260980,"creator":"dernst","content_type":"application/pdf","date_created":"2025-01-13T09:14:24Z","relation":"main_file","success":1}],"title":"Birkhoff conjecture for nearly centrally symmetric domains","OA_place":"publisher","scopus_import":"1","OA_type":"hybrid"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"name":"Spectral rigidity and integrability for billiards and geodesic flows","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","grant_number":"885707","call_identifier":"H2020"}],"publication_status":"published","supplementarymaterial":"no","quality_controlled":"1","month":"11","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","doi":"10.1016/j.aim.2024.109943","volume":457,"file_date_updated":"2025-01-13T08:29:27Z","publication":"Advances in Mathematics","abstract":[{"lang":"eng","text":"We establish a close connection between acceleration and dynamical degree for one-frequency quasi-periodic compact cocycles, by showing that two vectors derived separately from each coincide. Based on this, we provide a dynamical classification of one-frequency quasi-periodic  SO(3, R)-cocycles."}],"oa_version":"Published Version","das_tickbox":"0","OA_type":"hybrid","OA_place":"publisher","title":"Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles","scopus_import":"1","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_created":"2025-01-13T08:29:27Z","creator":"dernst","access_level":"open_access","file_name":"2024_AdvancesMath_Hou.pdf","checksum":"1c80b844a91d93cf4799f4a65873b18d","date_updated":"2025-01-13T08:29:27Z","file_id":"18826","file_size":713659}],"year":"2024","_id":"18065","article_number":"109943","status":"public","type":"journal_article","date_published":"2024-11-01T00:00:00Z","acknowledgement":"X. Hou is partially supported by National Natural Science Foundation of China (Grant \r\n12071083) and Funds for Distinguished Youths of Hubei Province of China (\r\n2019CFA680). Y. Pan is supported by ERC Advanced Grant (#885707). Q. Zhou is partially supported by National Key R&D Program of China (2020YFA0713300), NSFC grant (\r\n12071232) and Nankai Zhide Foundation.","date_created":"2024-09-15T22:01:39Z","publisher":"Elsevier","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"article_type":"original","intvolume":"       457","external_id":{"arxiv":["2311.17537"],"isi":["001315306500001"]},"corr_author":"1","fulldoi":"https://doi.org/10.1016/j.aim.2024.109943","citation":{"ista":"Hou X, Pan Y, Zhou Q. 2024. Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. Advances in Mathematics. 457, 109943.","ieee":"X. Hou, Y. Pan, and Q. Zhou, “Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles,” <i>Advances in Mathematics</i>, vol. 457. Elsevier, 2024.","ama":"Hou X, Pan Y, Zhou Q. Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. <i>Advances in Mathematics</i>. 2024;457. doi:<a href=\"https://doi.org/10.1016/j.aim.2024.109943\">10.1016/j.aim.2024.109943</a>","apa":"Hou, X., Pan, Y., &#38; Zhou, Q. (2024). Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2024.109943\">https://doi.org/10.1016/j.aim.2024.109943</a>","short":"X. Hou, Y. Pan, Q. Zhou, Advances in Mathematics 457 (2024).","chicago":"Hou, Xuanji, Yi Pan, and Qi Zhou. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” <i>Advances in Mathematics</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.aim.2024.109943\">https://doi.org/10.1016/j.aim.2024.109943</a>.","mla":"Hou, Xuanji, et al. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” <i>Advances in Mathematics</i>, vol. 457, 109943, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.aim.2024.109943\">10.1016/j.aim.2024.109943</a>."},"ec_funded":1,"arxiv":1,"oa":1,"author":[{"full_name":"Hou, Xuanji","first_name":"Xuanji","last_name":"Hou"},{"id":"1e21c7f7-9070-11eb-847d-8b04c7169523","full_name":"Pan, Yi","first_name":"Yi","last_name":"Pan"},{"first_name":"Qi","full_name":"Zhou, Qi","last_name":"Zhou"}],"ddc":["510"],"researchdata_availability":"no","department":[{"_id":"VaKa"}],"language":[{"iso":"eng"}],"date_updated":"2026-10-21T13:44:19Z"},{"intvolume":"        28","article_type":"original","fulldoi":"https://doi.org/10.7155/jgaa.v28i2.2988","citation":{"short":"P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, Journal of Graph Algorithms and Applications 28 (2024) 47–82.","chicago":"De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2024. <a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">https://doi.org/10.7155/jgaa.v28i2.2988</a>.","mla":"De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2, Brown University, 2024, pp. 47–82, doi:<a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">10.7155/jgaa.v28i2.2988</a>.","ista":"De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler M, Rote G. 2024. Removing popular faces in curve arrangements. Journal of Graph Algorithms and Applications. 28(2), 47–82.","ieee":"P. De Nooijer <i>et al.</i>, “Removing popular faces in curve arrangements,” <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2. Brown University, pp. 47–82, 2024.","apa":"De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., &#38; Rote, G. (2024). Removing popular faces in curve arrangements. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">https://doi.org/10.7155/jgaa.v28i2.2988</a>","ama":"De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve arrangements. <i>Journal of Graph Algorithms and Applications</i>. 2024;28(2):47-82. doi:<a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">10.7155/jgaa.v28i2.2988</a>"},"external_id":{"arxiv":["2202.12175"]},"page":"47-82","corr_author":"1","publisher":"Brown University","DOAJ_listed":"1","date_created":"2024-12-01T23:01:54Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2026-10-21T13:41:35Z","researchdata_availability":"no","arxiv":1,"oa":1,"ddc":["510"],"author":[{"first_name":"Phoebe","full_name":"De Nooijer, Phoebe","last_name":"De Nooijer"},{"first_name":"Soeren","full_name":"Terziadis, Soeren","last_name":"Terziadis"},{"last_name":"Weinberger","first_name":"Alexandra","full_name":"Weinberger, Alexandra"},{"id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","first_name":"Zuzana","last_name":"Masárová"},{"full_name":"Mchedlidze, Tamara","first_name":"Tamara","last_name":"Mchedlidze"},{"last_name":"Löffler","first_name":"Maarten","full_name":"Löffler, Maarten"},{"last_name":"Rote","first_name":"Günter","full_name":"Rote, Günter"}],"file_date_updated":"2024-12-03T09:45:00Z","publication":"Journal of Graph Algorithms and Applications","volume":28,"issue":"2","doi":"10.7155/jgaa.v28i2.2988","day":"03","oa_version":"Published Version","das_tickbox":"0","abstract":[{"text":"A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a randomized FPT-time algorithm where the parameter is the number of popular faces.","lang":"eng"}],"publication_status":"published","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["1526-1719"]},"article_processing_charge":"No","has_accepted_license":"1","quality_controlled":"1","month":"11","year":"2024","file":[{"creator":"dernst","access_level":"open_access","file_size":1582493,"date_updated":"2024-12-03T09:45:00Z","file_id":"18609","file_name":"2024_JourGraphAlgorithms_deNooijer.pdf","checksum":"be611da6f9d790dc980d6fb7283fe889","relation":"main_file","success":1,"date_created":"2024-12-03T09:45:00Z","content_type":"application/pdf"}],"_id":"18604","acknowledgement":"This work was initiated at the 16th European Research Week on Geometric Graphs in Strobl in 2019. A.W. has been supported by the Austrian Science Fund (FWF): W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035] and by the NWO Gravitation project NETWORKS under grant no. 024.002.003. Part of the work was done while A.W. was emplyed at Graz University of Technology. Preliminary versions of this work have been presented at the 38th European Workshop on Computational Geometry (EuroCG\r\n2022) in Perugia [10] and at the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023) in Isola delle Femmine [11].","date_published":"2024-11-03T00:00:00Z","status":"public","type":"journal_article","OA_type":"gold","scopus_import":"1","OA_place":"publisher","title":"Removing popular faces in curve arrangements"},{"scopus_import":"1","title":"Removing popular faces in curve arrangements","acknowledgement":"This work was initiated at the 16th European Research Week on Geometric Graphs in Strobl in 2019. A.W. is supported by the Austrian Science Fund (FWF): W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035]. A preliminary version of this work has been presented at the 38th European Workshop on Computational Geometry (EuroCG 2022) in Perugia [9]. A full version of this paper, which includes appendices but is otherwise identical, is available as a technical report [10].","date_published":"2024-01-06T00:00:00Z","conference":{"start_date":"2023-09-20","location":"Isola delle Femmine, Palermo, Italy","name":"GD: Graph Drawing and Network Visualization","end_date":"2023-09-22"},"type":"conference","status":"public","_id":"14888","year":"2024","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2202.12175"}],"article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031492747"],"eissn":["1611-3349"]},"month":"01","quality_controlled":"1","supplementarymaterial":"no","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","das_tickbox":"0","oa_version":"Preprint","abstract":[{"text":"A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a probabilistic FPT-approach in the number of popular faces.","lang":"eng"}],"volume":14466,"publication":"31st International Symposium on Graph Drawing and Network Visualization","doi":"10.1007/978-3-031-49275-4_2","day":"06","author":[{"last_name":"De Nooijer","first_name":"Phoebe","full_name":"De Nooijer, Phoebe"},{"last_name":"Terziadis","full_name":"Terziadis, Soeren","first_name":"Soeren"},{"last_name":"Weinberger","full_name":"Weinberger, Alexandra","first_name":"Alexandra"},{"last_name":"Masárová","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tamara","full_name":"Mchedlidze, Tamara","last_name":"Mchedlidze"},{"last_name":"Löffler","full_name":"Löffler, Maarten","first_name":"Maarten"},{"last_name":"Rote","full_name":"Rote, Günter","first_name":"Günter"}],"arxiv":1,"oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2026-10-21T13:41:13Z","researchdata_availability":"no","alternative_title":["LNCS"],"publisher":"Springer Nature","date_created":"2024-01-28T23:01:43Z","citation":{"apa":"De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., &#38; Rote, G. (2024). Removing popular faces in curve arrangements. In <i>31st International Symposium on Graph Drawing and Network Visualization</i> (Vol. 14466, pp. 18–33). Isola delle Femmine, Palermo, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-49275-4_2\">https://doi.org/10.1007/978-3-031-49275-4_2</a>","ama":"De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve arrangements. In: <i>31st International Symposium on Graph Drawing and Network Visualization</i>. Vol 14466. Springer Nature; 2024:18-33. doi:<a href=\"https://doi.org/10.1007/978-3-031-49275-4_2\">10.1007/978-3-031-49275-4_2</a>","ieee":"P. De Nooijer <i>et al.</i>, “Removing popular faces in curve arrangements,” in <i>31st International Symposium on Graph Drawing and Network Visualization</i>, Isola delle Femmine, Palermo, Italy, 2024, vol. 14466, pp. 18–33.","ista":"De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler M, Rote G. 2024. Removing popular faces in curve arrangements. 31st International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 14466, 18–33.","mla":"De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.” <i>31st International Symposium on Graph Drawing and Network Visualization</i>, vol. 14466, Springer Nature, 2024, pp. 18–33, doi:<a href=\"https://doi.org/10.1007/978-3-031-49275-4_2\">10.1007/978-3-031-49275-4_2</a>.","short":"P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, in:, 31st International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2024, pp. 18–33.","chicago":"De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve Arrangements.” In <i>31st International Symposium on Graph Drawing and Network Visualization</i>, 14466:18–33. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-49275-4_2\">https://doi.org/10.1007/978-3-031-49275-4_2</a>."},"fulldoi":"https://doi.org/10.1007/978-3-031-49275-4_2","page":"18-33","external_id":{"isi":["001207942000002"],"arxiv":["2202.12175"]},"intvolume":"     14466","isi":1},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"publication_status":"published","month":"11","quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"issn":["1980-0436"]},"day":"01","doi":"10.30757/ALEA.V21-70","issue":"2","volume":21,"publication":"Alea","abstract":[{"lang":"eng","text":"We prove the Central Limit Theorem and superpolynomial mixing for environment\r\nviewed from the particle process in quasi periodic Diophantine random environment. The main\r\ningredients are smoothness estimates for the solution of the Poisson equation and local limit asymptotics for certain accelerated walks."}],"das_tickbox":"0","oa_version":"Preprint","OA_type":"green","title":"The central limit theorem and rate of mixing for simple random walks on the circle","OA_place":"repository","scopus_import":"1","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2404.11700","open_access":"1"}],"_id":"18586","year":"2024","type":"journal_article","status":"public","acknowledgement":"ents. The authors are grateful to Agnieszka Zelerowicz and the anonymous referee\r\nfor useful comments. The first author is grateful to Minsung Kim for providing some references.\r\nThe first author has been supported by the European Union Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 101034413. The second author has been supported by the NSF grant DMS 2246983.","date_published":"2024-11-01T00:00:00Z","date_created":"2024-11-24T23:01:49Z","publisher":"Instituto Nacional de Matematica Pura e Aplicada","article_type":"original","isi":1,"intvolume":"        21","external_id":{"arxiv":["2404.11700"],"isi":["001440992000003"]},"page":"1853-1865","citation":{"mla":"CZUDEK, Klaudiusz S., and Dmitry Dolgopyat. “The Central Limit Theorem and Rate of Mixing for Simple Random Walks on the Circle.” <i>Alea</i>, vol. 21, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2024, pp. 1853–65, doi:<a href=\"https://doi.org/10.30757/ALEA.V21-70\">10.30757/ALEA.V21-70</a>.","chicago":"CZUDEK, Klaudiusz S, and Dmitry Dolgopyat. “The Central Limit Theorem and Rate of Mixing for Simple Random Walks on the Circle.” <i>Alea</i>. Instituto Nacional de Matematica Pura e Aplicada, 2024. <a href=\"https://doi.org/10.30757/ALEA.V21-70\">https://doi.org/10.30757/ALEA.V21-70</a>.","short":"K.S. CZUDEK, D. Dolgopyat, Alea 21 (2024) 1853–1865.","apa":"CZUDEK, K. S., &#38; Dolgopyat, D. (2024). The central limit theorem and rate of mixing for simple random walks on the circle. <i>Alea</i>. Instituto Nacional de Matematica Pura e Aplicada. <a href=\"https://doi.org/10.30757/ALEA.V21-70\">https://doi.org/10.30757/ALEA.V21-70</a>","ama":"CZUDEK KS, Dolgopyat D. The central limit theorem and rate of mixing for simple random walks on the circle. <i>Alea</i>. 2024;21(2):1853-1865. doi:<a href=\"https://doi.org/10.30757/ALEA.V21-70\">10.30757/ALEA.V21-70</a>","ista":"CZUDEK KS, Dolgopyat D. 2024. The central limit theorem and rate of mixing for simple random walks on the circle. Alea. 21(2), 1853–1865.","ieee":"K. S. CZUDEK and D. Dolgopyat, “The central limit theorem and rate of mixing for simple random walks on the circle,” <i>Alea</i>, vol. 21, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1853–1865, 2024."},"fulldoi":"https://doi.org/10.30757/ALEA.V21-70","ec_funded":1,"arxiv":1,"oa":1,"author":[{"last_name":"Czudek","id":"5c0e116e-803f-11ed-ab7e-90d572405f20","full_name":"Czudek, Klaudiusz S","first_name":"Klaudiusz S"},{"full_name":"Dolgopyat, Dmitry","first_name":"Dmitry","last_name":"Dolgopyat"}],"department":[{"_id":"VaKa"}],"language":[{"iso":"eng"}],"date_updated":"2026-10-21T13:43:04Z","researchdata_availability":"no"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","publication_status":"published","month":"11","quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"issn":["1078-0947"],"eissn":["1553-5231"]},"doi":"10.3934/dcds.2024059","day":"01","issue":"11","volume":44,"publication":"Discrete and Continuous Dynamical Systems- Series A","abstract":[{"text":"In the class of projective billiards, which contains the usual billiards, we exhibit counter-examples to Ivrii's conjecture, which states that in any planar billiard with smooth boundary the set of periodic orbits has zero measure. The counter-examples are polygons admitting a 2-parameters family of n-periodic orbits, with n being either 3 or any even integer greater than 4.","lang":"eng"}],"das_tickbox":"0","oa_version":"Published Version","OA_type":"free access","title":"Examples of projective billiards with open sets of periodic orbits","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3934/dcds.2024059"}],"_id":"17231","year":"2024","type":"journal_article","status":"public","date_published":"2024-11-01T00:00:00Z","date_created":"2024-07-14T22:01:10Z","publisher":"AIMS","article_type":"original","isi":1,"intvolume":"        44","corr_author":"1","page":"3287-3301","external_id":{"isi":["001230091000001"]},"citation":{"mla":"Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of Periodic Orbits.” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 44, no. 11, AIMS, 2024, pp. 3287–301, doi:<a href=\"https://doi.org/10.3934/dcds.2024059\">10.3934/dcds.2024059</a>.","chicago":"Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of Periodic Orbits.” <i>Discrete and Continuous Dynamical Systems- Series A</i>. AIMS, 2024. <a href=\"https://doi.org/10.3934/dcds.2024059\">https://doi.org/10.3934/dcds.2024059</a>.","short":"C. Fiorebe, Discrete and Continuous Dynamical Systems- Series A 44 (2024) 3287–3301.","ama":"Fiorebe C. Examples of projective billiards with open sets of periodic orbits. <i>Discrete and Continuous Dynamical Systems- Series A</i>. 2024;44(11):3287-3301. doi:<a href=\"https://doi.org/10.3934/dcds.2024059\">10.3934/dcds.2024059</a>","apa":"Fiorebe, C. (2024). Examples of projective billiards with open sets of periodic orbits. <i>Discrete and Continuous Dynamical Systems- Series A</i>. AIMS. <a href=\"https://doi.org/10.3934/dcds.2024059\">https://doi.org/10.3934/dcds.2024059</a>","ieee":"C. Fiorebe, “Examples of projective billiards with open sets of periodic orbits,” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 44, no. 11. AIMS, pp. 3287–3301, 2024.","ista":"Fiorebe C. 2024. Examples of projective billiards with open sets of periodic orbits. Discrete and Continuous Dynamical Systems- Series A. 44(11), 3287–3301."},"fulldoi":"https://doi.org/10.3934/dcds.2024059","oa":1,"author":[{"id":"06619f18-9070-11eb-847d-d1ee780bd88b","full_name":"Fiorebe, Corentin","first_name":"Corentin","last_name":"Fiorebe"}],"ddc":["500"],"language":[{"iso":"eng"}],"researchdata_availability":"no","date_updated":"2026-10-21T13:43:42Z","department":[{"_id":"VaKa"}]},{"ddc":["520"],"author":[{"full_name":"O’Grady, Anna J.G.","first_name":"Anna J.G.","last_name":"O’Grady"},{"full_name":"Drout, Maria R.","first_name":"Maria R.","last_name":"Drout"},{"full_name":"Neugent, Kathryn F.","first_name":"Kathryn F.","last_name":"Neugent"},{"first_name":"Bethany","full_name":"Ludwig, Bethany","last_name":"Ludwig"},{"last_name":"Götberg","orcid":"0000-0002-6960-6911","first_name":"Ylva Louise Linsdotter","full_name":"Götberg, Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d"},{"last_name":"Gaensler","first_name":"B. M.","full_name":"Gaensler, B. M."}],"arxiv":1,"oa":1,"researchdata_availability":"no","date_updated":"2026-10-21T13:51:22Z","department":[{"_id":"YlGo"}],"language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"IOP Publishing","date_created":"2024-11-10T23:01:59Z","DOAJ_listed":"1","fulldoi":"https://doi.org/10.3847/1538-4357/ad778a","citation":{"ieee":"A. J. G. O’Grady, M. R. Drout, K. F. Neugent, B. Ludwig, Y. L. L. Götberg, and B. M. Gaensler, “Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification,” <i>Astrophysical Journal</i>, vol. 975. IOP Publishing, 2024.","ista":"O’Grady AJG, Drout MR, Neugent KF, Ludwig B, Götberg YLL, Gaensler BM. 2024. Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification. Astrophysical Journal. 975, 29.","ama":"O’Grady AJG, Drout MR, Neugent KF, Ludwig B, Götberg YLL, Gaensler BM. Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification. <i>Astrophysical Journal</i>. 2024;975. doi:<a href=\"https://doi.org/10.3847/1538-4357/ad778a\">10.3847/1538-4357/ad778a</a>","apa":"O’Grady, A. J. G., Drout, M. R., Neugent, K. F., Ludwig, B., Götberg, Y. L. L., &#38; Gaensler, B. M. (2024). Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification. <i>Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ad778a\">https://doi.org/10.3847/1538-4357/ad778a</a>","short":"A.J.G. O’Grady, M.R. Drout, K.F. Neugent, B. Ludwig, Y.L.L. Götberg, B.M. Gaensler, Astrophysical Journal 975 (2024).","chicago":"O’Grady, Anna J.G., Maria R. Drout, Kathryn F. Neugent, Bethany Ludwig, Ylva Louise Linsdotter Götberg, and B. M. Gaensler. “Binary Yellow Supergiants in the Magellanic Clouds. I. Photometric Candidate Identification.” <i>Astrophysical Journal</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.3847/1538-4357/ad778a\">https://doi.org/10.3847/1538-4357/ad778a</a>.","mla":"O’Grady, Anna J. G., et al. “Binary Yellow Supergiants in the Magellanic Clouds. I. Photometric Candidate Identification.” <i>Astrophysical Journal</i>, vol. 975, 29, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.3847/1538-4357/ad778a\">10.3847/1538-4357/ad778a</a>."},"external_id":{"isi":["001339486900001"],"arxiv":["2406.17177"]},"intvolume":"       975","isi":1,"article_type":"original","scopus_import":"1","OA_place":"publisher","title":"Binary yellow supergiants in the Magellanic Clouds. I. Photometric candidate identification","OA_type":"gold","date_published":"2024-11-01T00:00:00Z","acknowledgement":"The authors thank Aaron Tohuvavohu, Katie Breivik, Marten van Kerkwijk, Jakub Klencki, Eva Laplace, and Dae-Sik Moon for helpful discussions, and Adiv Paradise for helpful edits. The authors also thank the anonymous reviewer for a helpful and constructive referee report.\r\nThe authors at the University of Toronto acknowledge that the land on which the University of Toronto operates is the traditional territory of the Huron–Wendat, the Seneca, and the Mississaugas of the Credit River. They are grateful to have the opportunity to work on this land.\r\nThe Dunlap Institute is funded through an endowment established by the David Dunlap family and the University of Toronto.\r\nA.J.G.O. is supported by a McWilliams Fellowship at Carnegie Mellon University. M.R.D. acknowledges support from the NSERC through grant RGPIN-2019-06186, the Canada Research Chairs Program, and the Dunlap Institute at the University of Toronto. B.M.G. acknowledges the support of the Natural Sciences and Engineering Research Council of Canada (NSERC) through grant RGPIN-2022-03163, and of the Canada Research Chairs program. Support for this work was provided by NASA through the NASA Hubble Fellowship Program grant Nos. HST-HF2-51457.001-A and HST-HF2-51516 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555.\r\nThis research has made use of the SIMBAD database (M. Wenger et al. 2000), operated at CDS, Strasbourg, France, and the SVO Filter Profile Service 13 supported by the Spanish MINECO through grant AYA2017-84089 (C. Rodrigo et al. 2012, 2020).\r\nThis research has made use of the following software: astropy (Astropy Collaboration et al. 2013, 2018, 2022), IRAF (D. Tody 1986, 1993), and TOPCAT (M. B. Taylor 2005).","status":"public","type":"journal_article","file":[{"creator":"dernst","file_size":34634395,"date_updated":"2024-11-11T09:20:45Z","checksum":"0e9bb88b5048ecc782ac27953c84b8ce","file_id":"18535","file_name":"2024_AstrophysicalJour_Grady.pdf","access_level":"open_access","success":1,"relation":"main_file","date_created":"2024-11-11T09:20:45Z","content_type":"application/pdf"}],"year":"2024","article_number":"29","_id":"18524","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"has_accepted_license":"1","article_processing_charge":"No","quality_controlled":"1","month":"11","publication_status":"published","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","das_tickbox":"0","abstract":[{"lang":"eng","text":"Recent works have constrained the binary fraction of evolved populations of massive stars in local galaxies such as red supergiants and Wolf–Rayet stars, but the binary fraction of yellow supergiants (YSGs) in the Hertzsprung gap remains unconstrained. Binary evolution theory predicts that the Hertzsprung gap is home to multiple populations of binary systems with varied evolutionary histories. In this paper, we develop a method to distinguish single YSGs from YSG plus O- or B-type main-sequence binaries using optical and ultraviolet photometry, and then apply this method to identify candidate YSG binaries in the Magellanic Clouds. After constructing a set of combined stellar atmosphere models, we find that optical photometry is, given typical measurement and reddening uncertainties, sufficient to discern single YSGs from YSG+OB binaries if the OB-star is at least ∼5M⊙ for Teff,YSG ∼ 4000 K, but requires a ∼20M⊙ OB star for YSGs up to Teff,YSG ∼ 9000 K. For these hotter YSG temperatures, ultraviolet photometry allows binaries with OB companions as small as ∼7M⊙ to be identified. We use color–color spaces developed from these models to search for evidence of excess blue or ultraviolet light in a set of ∼1000 YSG candidates in the Magellanic Clouds. We identify hundreds of candidate YSG binary systems and report a preliminary fraction of YSGs that show a blue/UV color excess of 20%–60%. Spectroscopic follow-up is now required to confirm the true nature of this population."}],"publication":"Astrophysical Journal","volume":975,"file_date_updated":"2024-11-11T09:20:45Z","day":"01","doi":"10.3847/1538-4357/ad778a"},{"date_created":"2024-05-12T22:01:01Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"ScienComp"}],"publisher":"Oxford University Press","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","isi":1,"intvolume":"        36","external_id":{"pmid":["38309957"],"isi":["001180817000001"]},"page":"1829-1843","corr_author":"1","citation":{"apa":"He, S., Yu, Y., Wang, L., Zhang, J., Bai, Z., Li, G., … Feng, X. (2024). Linker histone H1 drives heterochromatin condensation via phase separation in Arabidopsis. <i>The Plant Cell</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/plcell/koae034\">https://doi.org/10.1093/plcell/koae034</a>","ama":"He S, Yu Y, Wang L, et al. Linker histone H1 drives heterochromatin condensation via phase separation in Arabidopsis. <i>The Plant Cell</i>. 2024;36(5):1829-1843. doi:<a href=\"https://doi.org/10.1093/plcell/koae034\">10.1093/plcell/koae034</a>","ista":"He S, Yu Y, Wang L, Zhang J, Bai Z, Li G, Li P, Feng X. 2024. Linker histone H1 drives heterochromatin condensation via phase separation in Arabidopsis. The Plant Cell. 36(5), 1829–1843.","ieee":"S. He <i>et al.</i>, “Linker histone H1 drives heterochromatin condensation via phase separation in Arabidopsis,” <i>The Plant Cell</i>, vol. 36, no. 5. Oxford University Press, pp. 1829–1843, 2024.","mla":"He, Shengbo, et al. “Linker Histone H1 Drives Heterochromatin Condensation via Phase Separation in Arabidopsis.” <i>The Plant Cell</i>, vol. 36, no. 5, Oxford University Press, 2024, pp. 1829–43, doi:<a href=\"https://doi.org/10.1093/plcell/koae034\">10.1093/plcell/koae034</a>.","chicago":"He, Shengbo, Yiming Yu, Liang Wang, Jingyi Zhang, Zhengyong Bai, Guohong Li, Pilong Li, and Xiaoqi Feng. “Linker Histone H1 Drives Heterochromatin Condensation via Phase Separation in Arabidopsis.” <i>The Plant Cell</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/plcell/koae034\">https://doi.org/10.1093/plcell/koae034</a>.","short":"S. He, Y. Yu, L. Wang, J. Zhang, Z. Bai, G. Li, P. Li, X. Feng, The Plant Cell 36 (2024) 1829–1843."},"fulldoi":"https://doi.org/10.1093/plcell/koae034","oa":1,"author":[{"last_name":"He","first_name":"Shengbo","full_name":"He, Shengbo"},{"last_name":"Yu","id":"318e643b-8b61-11ed-b69e-aafa103ec8dd","orcid":"0000-0002-9919-7282","first_name":"Yiming","full_name":"Yu, Yiming"},{"first_name":"Liang","full_name":"Wang, Liang","last_name":"Wang"},{"last_name":"Zhang","first_name":"Jingyi","full_name":"Zhang, Jingyi"},{"last_name":"Bai","full_name":"Bai, Zhengyong","first_name":"Zhengyong"},{"first_name":"Guohong","full_name":"Li, Guohong","last_name":"Li"},{"last_name":"Li","first_name":"Pilong","full_name":"Li, Pilong"},{"id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","full_name":"Feng, Xiaoqi","last_name":"Feng"}],"ddc":["580"],"date_updated":"2026-10-21T13:47:54Z","department":[{"_id":"XiFe"}],"language":[{"iso":"eng"}],"researchdata_availability":"yes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"yes","pmid":1,"publication_status":"published","month":"05","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication_identifier":{"eissn":["1532-298X"]},"doi":"10.1093/plcell/koae034","day":"01","issue":"5","file_date_updated":"2025-04-23T07:43:12Z","publication":"The Plant Cell","volume":36,"abstract":[{"text":"In the eukaryotic nucleus, heterochromatin forms highly condensed, visible foci known as heterochromatin foci (HF). These HF are enriched with linker histone H1, a key player in heterochromatin condensation and silencing. However, it is unknown how H1 aggregates HF and condenses heterochromatin. In this study, we established that H1 facilitates heterochromatin condensation by enhancing inter- and intrachromosomal interactions between and within heterochromatic regions of the Arabidopsis (Arabidopsis thaliana) genome. We demonstrated that H1 drives HF formation via phase separation, which requires its C-terminal intrinsically disordered region (C-IDR). A truncated H1 lacking the C-IDR fails to form foci or recover HF in the h1 mutant background, whereas C-IDR with a short stretch of the globular domain (18 out of 71 amino acids) is sufficient to rescue both defects. In addition, C-IDR is essential for H1's roles in regulating nucleosome repeat length and DNA methylation in Arabidopsis, indicating that phase separation capability is required for chromatin functions of H1. Our data suggest that bacterial H1-like proteins, which have been shown to condense DNA, are intrinsically disordered and capable of mediating phase separation. Therefore, we propose that phase separation mediated by H1 or H1-like proteins may represent an ancient mechanism for condensing chromatin and DNA.","lang":"eng"}],"das_tickbox":"0","oa_version":"Published Version","OA_type":"hybrid","title":"Linker histone H1 drives heterochromatin condensation via phase separation in Arabidopsis","OA_place":"publisher","scopus_import":"1","_id":"15375","year":"2024","file":[{"creator":"dernst","access_level":"open_access","file_size":50791962,"file_id":"19611","date_updated":"2025-04-23T07:43:12Z","checksum":"eed76c848fe3d8fe9a53943181aaa53c","file_name":"2024_PlantCell_He.pdf","relation":"main_file","success":1,"date_created":"2025-04-23T07:43:12Z","content_type":"application/pdf"}],"type":"journal_article","status":"public","acknowledgement":"This work was funded by ISTA core support (Y.Y. and X.F.) and grants from the National Natural Science Foundation of China (31871443 to L.W. and P.L.; 32100417 to L.W.).\r\nWe thank the ISTA Imaging and Optics Facility for assistance with microscopy and the ISTA Scientific Computing Facility for high-performance computing resources.","date_published":"2024-05-01T00:00:00Z"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","publication_status":"published","month":"06","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication_identifier":{"isbn":["9798400704161"],"issn":["1548-6109"]},"doi":"10.1145/3626183.3659969","day":"17","publication":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","file_date_updated":"2024-07-16T06:38:08Z","abstract":[{"text":"Currently, the best known tradeoff between approximation ratio and complexity for the Sparsest Cut problem is achieved by the algorithm in [Sherman, FOCS 2009]: it computes O(√(log n)/ε)-approximation using O(nε logO(1) n) maxflows for any ε∈[Θ(1/log n),Θ(1)]. It works by solving the SDP relaxation of [Arora-Rao-Vazirani, STOC 2004] using the Multiplicative Weights Update algorithm (MW) of [Arora-Kale, JACM 2016]. To implement one MW step, Sherman approximately solves a multicommodity flow problem using another application of MW. Nested MW steps are solved via a certain \"chaining\" algorithm that combines results of multiple calls to the maxflow algorithm.\r\nWe present an alternative approach that avoids solving the multicommodity flow problem and instead computes \"violating paths\". This simplifies Sherman's algorithm by removing a need for a nested application of MW, and also allows parallelization: we show how to compute O(√(log n)/ε)-approximation via O(logO(1) n) maxflows using O(nε) processors.\r\nWe also revisit Sherman's chaining algorithm, and present a simpler version together with a new analysis.","lang":"eng"}],"das_tickbox":"0","oa_version":"Published Version","OA_type":"hybrid","title":"A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut","OA_place":"publisher","scopus_import":"1","_id":"17236","year":"2024","file":[{"access_level":"open_access","file_name":"2024_SPAA_Kolmogorov.pdf","date_updated":"2024-07-16T06:38:08Z","checksum":"6ca18ac8508719dbd5d5735f4c991af2","file_id":"17245","file_size":1116166,"creator":"dernst","content_type":"application/pdf","date_created":"2024-07-16T06:38:08Z","relation":"main_file","success":1}],"type":"conference","related_material":{"record":[{"relation":"extended_version","id":"21007","status":"public"}]},"status":"public","date_published":"2024-06-17T00:00:00Z","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","location":"Nantes, France","end_date":"2024-06-21","start_date":"2024-06-17"},"date_created":"2024-07-14T22:01:11Z","publisher":"Association for Computing Machinery","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"external_id":{"isi":["001253331900044"],"arxiv":["2307.00115"]},"corr_author":"1","page":"403-414","citation":{"ieee":"V. Kolmogorov, “A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut,” in <i>Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Nantes, France, 2024, pp. 403–414.","ista":"Kolmogorov V. 2024. A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut. Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 403–414.","ama":"Kolmogorov V. A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut. In: <i>Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2024:403-414. doi:<a href=\"https://doi.org/10.1145/3626183.3659969\">10.1145/3626183.3659969</a>","apa":"Kolmogorov, V. (2024). A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut. In <i>Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 403–414). Nantes, France: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3626183.3659969\">https://doi.org/10.1145/3626183.3659969</a>","short":"V. Kolmogorov, in:, Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2024, pp. 403–414.","chicago":"Kolmogorov, Vladimir. “A Simpler and Parallelizable O(√log n)-Approximation Algorithm for Sparsest Cut.” In <i>Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 403–14. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3626183.3659969\">https://doi.org/10.1145/3626183.3659969</a>.","mla":"Kolmogorov, Vladimir. “A Simpler and Parallelizable O(√log n)-Approximation Algorithm for Sparsest Cut.” <i>Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2024, pp. 403–14, doi:<a href=\"https://doi.org/10.1145/3626183.3659969\">10.1145/3626183.3659969</a>."},"fulldoi":"https://doi.org/10.1145/3626183.3659969","oa":1,"arxiv":1,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov"}],"ddc":["510"],"date_updated":"2026-10-21T13:45:27Z","language":[{"iso":"eng"}],"researchdata_availability":"no","department":[{"_id":"VlKo"}]},{"department":[{"_id":"XiFe"}],"researchdata_availability":"upon request","date_updated":"2026-10-21T13:47:19Z","language":[{"iso":"eng"}],"oa":1,"ddc":["570"],"author":[{"last_name":"Nagai","orcid":"0000-0003-1671-9434","full_name":"Nagai, Hiroki","first_name":"Hiroki","id":"608df3e6-e2ab-11ed-8890-c9318cec7da4"},{"last_name":"Adachi","first_name":"Yuya","full_name":"Adachi, Yuya"},{"first_name":"Tenki","full_name":"Nakasugi, Tenki","last_name":"Nakasugi"},{"first_name":"Ema","full_name":"Takigawa, Ema","last_name":"Takigawa"},{"full_name":"Ui, Junichiro","first_name":"Junichiro","last_name":"Ui"},{"first_name":"Takashi","full_name":"Makino, Takashi","last_name":"Makino"},{"last_name":"Miura","full_name":"Miura, Masayuki","first_name":"Masayuki"},{"last_name":"Nakajima","full_name":"Nakajima, Yu Ichiro","first_name":"Yu Ichiro"}],"intvolume":"        22","article_type":"original","isi":1,"citation":{"ieee":"H. NAGAI <i>et al.</i>, “Highly regenerative species-specific genes improve age-associated features in the adult Drosophila midgut,” <i>BMC Biology</i>, vol. 22. Springer Nature, 2024.","ista":"NAGAI H, Adachi Y, Nakasugi T, Takigawa E, Ui J, Makino T, Miura M, Nakajima YI. 2024. Highly regenerative species-specific genes improve age-associated features in the adult Drosophila midgut. BMC Biology. 22, 157.","ama":"NAGAI H, Adachi Y, Nakasugi T, et al. Highly regenerative species-specific genes improve age-associated features in the adult Drosophila midgut. <i>BMC Biology</i>. 2024;22. doi:<a href=\"https://doi.org/10.1186/s12915-024-01956-4\">10.1186/s12915-024-01956-4</a>","apa":"NAGAI, H., Adachi, Y., Nakasugi, T., Takigawa, E., Ui, J., Makino, T., … Nakajima, Y. I. (2024). Highly regenerative species-specific genes improve age-associated features in the adult Drosophila midgut. <i>BMC Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1186/s12915-024-01956-4\">https://doi.org/10.1186/s12915-024-01956-4</a>","short":"H. NAGAI, Y. Adachi, T. Nakasugi, E. Takigawa, J. Ui, T. Makino, M. Miura, Y.I. Nakajima, BMC Biology 22 (2024).","chicago":"NAGAI, HIROKI, Yuya Adachi, Tenki Nakasugi, Ema Takigawa, Junichiro Ui, Takashi Makino, Masayuki Miura, and Yu Ichiro Nakajima. “Highly Regenerative Species-Specific Genes Improve Age-Associated Features in the Adult Drosophila Midgut.” <i>BMC Biology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1186/s12915-024-01956-4\">https://doi.org/10.1186/s12915-024-01956-4</a>.","mla":"NAGAI, HIROKI, et al. “Highly Regenerative Species-Specific Genes Improve Age-Associated Features in the Adult Drosophila Midgut.” <i>BMC Biology</i>, vol. 22, 157, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1186/s12915-024-01956-4\">10.1186/s12915-024-01956-4</a>."},"fulldoi":"https://doi.org/10.1186/s12915-024-01956-4","external_id":{"isi":["001282893200001"],"pmid":["39090637"]},"publisher":"Springer Nature","date_created":"2024-08-11T22:01:11Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"17408","article_number":"157","year":"2024","file":[{"creator":"dernst","access_level":"open_access","file_size":3345718,"date_updated":"2024-08-12T08:14:44Z","file_name":"2024_BMCBio_Nagai.pdf","file_id":"17417","checksum":"318759626ec83b13f909c82904393ef1","relation":"main_file","success":1,"date_created":"2024-08-12T08:14:44Z","content_type":"application/pdf"}],"acknowledgement":"We thank I. Miguel-Aliaga, N. Shinoda, M. Furuse, Y. Izumi, BDSC, Kyoto Stock Center, Drosophila Genomics Resource Center (DGRC), and Developmental Studies Hybridoma Bank (DSHB) for fly stocks and reagents.\r\nThis work was supported by JSPS/MEXT KAKENHI (grant numbers JP22J01430 to H.N., JP21H04774, JP23H04766, JP24H00567 to M.M., and JP17H06332, JP22H02762, JP23K18134, JP23H04696 to Y.N.), AMED-Aging (JP21gm5010001 to M.M.), AMED-PRIME (JP22gm6110025 to Y.N.), and Sadako O. Hirai Ban Award for Young Researchers (H.N.)","date_published":"2024-08-02T00:00:00Z","type":"journal_article","status":"public","scopus_import":"1","title":"Highly regenerative species-specific genes improve age-associated features in the adult Drosophila midgut","volume":22,"publication":"BMC Biology","file_date_updated":"2024-08-12T08:14:44Z","day":"02","doi":"10.1186/s12915-024-01956-4","das_tickbox":"1","oa_version":"Published Version","abstract":[{"text":"Background: The remarkable regenerative abilities observed in planarians and cnidarians are closely linked to the active proliferation of adult stem cells and the precise differentiation of their progeny, both of which typically deteriorate during aging in low regenerative animals. While regeneration-specific genes conserved in highly regenerative organisms may confer regenerative abilities and long-term maintenance of tissue homeostasis, it remains unclear whether introducing these regenerative genes into low regenerative animals can improve their regeneration and aging processes.\r\n\r\nResults: Here, we ectopically express highly regenerative species-specific JmjC domain-encoding genes (HRJDs) in Drosophila, a widely used low regenerative model organism. Surprisingly, HRJD expression impedes tissue regeneration in the developing wing disc but extends organismal lifespan when expressed in the intestinal stem cell lineages of the adult midgut under non-regenerative conditions. Notably, HRJDs enhance the proliferative activity of intestinal stem cells while maintaining their differentiation fidelity, ameliorating age-related decline in gut barrier functions.\r\n\r\nConclusions: These findings together suggest that the introduction of highly regenerative species-specific genes can improve stem cell functions and promote a healthy lifespan when expressed in aging animals.","lang":"eng"}],"supplementarymaterial":"yes","publication_status":"published","pmid":1,"dataavailabilitystatement":"All data generated or analyzed during this study are included in this published article and its supplementary information files. Drosophila stocks used and/or analyzed during the current study are available from the corresponding author on reasonable request.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","article_processing_charge":"Yes","publication_identifier":{"eissn":["1741-7007"]},"month":"08","quality_controlled":"1"},{"date_created":"2024-09-22T22:01:42Z","DOAJ_listed":"1","publisher":"IOP Publishing","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"article_type":"original","intvolume":"       973","external_id":{"isi":["001310592900001"]},"fulldoi":"https://doi.org/10.3847/2041-8213/ad6c34","citation":{"ista":"Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. 2024. Tidal disruption events from stripped stars. Astrophysical Journal Letters. 973(1), L9.","ieee":"B. Mockler, M. Gallegos-Garcia, Y. L. L. Götberg, J. M. Miller, and E. Ramirez-Ruiz, “Tidal disruption events from stripped stars,” <i>Astrophysical Journal Letters</i>, vol. 973, no. 1. IOP Publishing, 2024.","apa":"Mockler, B., Gallegos-Garcia, M., Götberg, Y. L. L., Miller, J. M., &#38; Ramirez-Ruiz, E. (2024). Tidal disruption events from stripped stars. <i>Astrophysical Journal Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">https://doi.org/10.3847/2041-8213/ad6c34</a>","ama":"Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. Tidal disruption events from stripped stars. <i>Astrophysical Journal Letters</i>. 2024;973(1). doi:<a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">10.3847/2041-8213/ad6c34</a>","short":"B. Mockler, M. Gallegos-Garcia, Y.L.L. Götberg, J.M. Miller, E. Ramirez-Ruiz, Astrophysical Journal Letters 973 (2024).","chicago":"Mockler, Brenna, Monica Gallegos-Garcia, Ylva Louise Linsdotter Götberg, Jon M. Miller, and Enrico Ramirez-Ruiz. “Tidal Disruption Events from Stripped Stars.” <i>Astrophysical Journal Letters</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">https://doi.org/10.3847/2041-8213/ad6c34</a>.","mla":"Mockler, Brenna, et al. “Tidal Disruption Events from Stripped Stars.” <i>Astrophysical Journal Letters</i>, vol. 973, no. 1, L9, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">10.3847/2041-8213/ad6c34</a>."},"oa":1,"author":[{"full_name":"Mockler, Brenna","first_name":"Brenna","last_name":"Mockler"},{"last_name":"Gallegos-Garcia","full_name":"Gallegos-Garcia, Monica","first_name":"Monica"},{"id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","full_name":"Götberg, Ylva Louise Linsdotter","first_name":"Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","last_name":"Götberg"},{"full_name":"Miller, Jon M.","first_name":"Jon M.","last_name":"Miller"},{"first_name":"Enrico","full_name":"Ramirez-Ruiz, Enrico","last_name":"Ramirez-Ruiz"}],"ddc":["520"],"date_updated":"2026-10-21T13:50:17Z","language":[{"iso":"eng"}],"researchdata_availability":"no","department":[{"_id":"YlGo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","supplementarymaterial":"no","quality_controlled":"1","month":"09","publication_identifier":{"eissn":["2041-8213"],"issn":["2041-8205"]},"has_accepted_license":"1","article_processing_charge":"Yes","doi":"10.3847/2041-8213/ad6c34","day":"12","file_date_updated":"2024-09-30T08:54:26Z","publication":"Astrophysical Journal Letters","volume":973,"issue":"1","abstract":[{"lang":"eng","text":"Observations of tidal disruption events (TDEs) show signs of nitrogen enrichment reminiscent of other astrophysical sources such as active galactic nuclei and star-forming galaxies. Given that TDEs probe the gas from a single star, it is possible to test whether the observed enrichment is consistent with expectations from the CNO cycle by looking at the observed nitrogen/carbon (N/C) abundance ratios. Given that ≈20% of solar-mass stars (and an even larger fraction of more massive stars) live in close binaries, it is worthwhile to also consider what TDEs from stars influenced by binary evolution would look like. We show here that TDEs from stars stripped of their hydrogen-rich (and nitrogen-poor) envelopes through previous binary-induced mass loss can produce much higher observable N/C enhancements than even TDEs from massive stars. Additionally, we predict that the time dependence of the N/C abundance ratio in the mass fallback rate of stripped stars will follow the inverse behavior of main-sequence stars, enabling a more accurate characterization of the disrupted star."}],"oa_version":"Published Version","das_tickbox":"0","title":"Tidal disruption events from stripped stars","scopus_import":"1","year":"2024","file":[{"creator":"dernst","access_level":"open_access","file_size":844227,"date_updated":"2024-09-30T08:54:26Z","file_id":"18161","checksum":"050ddf873244839825714cca42b5d857","file_name":"2024_AstrophysicalJourn_Mockler.pdf","relation":"main_file","success":1,"date_created":"2024-09-30T08:54:26Z","content_type":"application/pdf"}],"_id":"18111","article_number":"L9","status":"public","type":"journal_article","acknowledgement":"This work was performed in part at Aspen Center for Physics, which is supported by National Science Foundation grant PHY-2210452. We thank the participants and organizers of the summer Aspen 2023 workshop on “Stellar Interactions and the Transients They Cause” for fruitful discussions. B.M. is grateful for support from the Carnegie Theoretical Astrophysics\r\nCenter. M.G.-G. is grateful for the support from Northwestern University’s Presidential Fellowship. E.R.-R. thanks the Heising-Simons Foundation, NSF (AST-2150255 and AST2307710), Swift (80NSSC21K1409, 80NSSC19K1391), and Chandra (22-0142) for support. ","date_published":"2024-09-12T00:00:00Z"},{"publisher":"American Physical Society","date_created":"2024-01-28T23:01:42Z","DOAJ_listed":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"         6","article_type":"original","citation":{"ieee":"D. Lorenc and Z. Alpichshev, “Dispersive effects in ultrafast nonlinear phenomena: The case of optical Kerr effect,” <i>Physical Review Research</i>, vol. 6, no. 1. American Physical Society, 2024.","ista":"Lorenc D, Alpichshev Z. 2024. Dispersive effects in ultrafast nonlinear phenomena: The case of optical Kerr effect. Physical Review Research. 6(1), 013042.","apa":"Lorenc, D., &#38; Alpichshev, Z. (2024). Dispersive effects in ultrafast nonlinear phenomena: The case of optical Kerr effect. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevResearch.6.013042\">https://doi.org/10.1103/PhysRevResearch.6.013042</a>","ama":"Lorenc D, Alpichshev Z. Dispersive effects in ultrafast nonlinear phenomena: The case of optical Kerr effect. <i>Physical Review Research</i>. 2024;6(1). doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.6.013042\">10.1103/PhysRevResearch.6.013042</a>","short":"D. Lorenc, Z. Alpichshev, Physical Review Research 6 (2024).","chicago":"Lorenc, Dusan, and Zhanybek Alpichshev. “Dispersive Effects in Ultrafast Nonlinear Phenomena: The Case of Optical Kerr Effect.” <i>Physical Review Research</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevResearch.6.013042\">https://doi.org/10.1103/PhysRevResearch.6.013042</a>.","mla":"Lorenc, Dusan, and Zhanybek Alpichshev. “Dispersive Effects in Ultrafast Nonlinear Phenomena: The Case of Optical Kerr Effect.” <i>Physical Review Research</i>, vol. 6, no. 1, 013042, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.6.013042\">10.1103/PhysRevResearch.6.013042</a>."},"fulldoi":"https://doi.org/10.1103/PhysRevResearch.6.013042","corr_author":"1","oa":1,"ddc":["530"],"author":[{"id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","first_name":"Dusan","full_name":"Lorenc, Dusan","last_name":"Lorenc"},{"id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","first_name":"Zhanybek","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev"}],"department":[{"_id":"ZhAl"}],"researchdata_availability":"no","language":[{"iso":"eng"}],"date_updated":"2026-10-21T13:52:11Z","supplementarymaterial":"yes","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes","has_accepted_license":"1","publication_identifier":{"eissn":["2643-1564"]},"month":"01","quality_controlled":"1","issue":"1","publication":"Physical Review Research","volume":6,"file_date_updated":"2024-01-31T11:59:30Z","day":"11","doi":"10.1103/PhysRevResearch.6.013042","das_tickbox":"0","oa_version":"Published Version","abstract":[{"text":"It is a basic principle that an effect cannot come before the cause. Dispersive relations that follow from this fundamental fact have proven to be an indispensable tool in physics and engineering. They are most powerful in the domain of linear response where they are known as Kramers-Kronig relations. However, when it comes to nonlinear phenomena the implications of causality are much less explored, apart from several notable exceptions. Here in this paper we demonstrate how to apply the dispersive formalism to analyze the ultrafast nonlinear response in the context of the paradigmatic nonlinear Kerr effect. We find that the requirement of causality introduces a noticeable effect even under assumption that Kerr effect is mediated by quasi-instantaneous off-resonant electronic hyperpolarizability. We confirm this by experimentally measuring the time-resolved Kerr dynamics in GaAs by means of a hybrid pump-probe Mach-Zehnder interferometer and demonstrate the presence of an intrinsic lagging between amplitude and phase responses as predicted by dispersive analysis. Our results describe a general property of the time-resolved nonlinear processes thereby highlighting the importance of accounting for dispersive effects in the nonlinear optical processes involving ultrashort pulses.","lang":"eng"}],"APC_amount":"2982,14 EUR","OA_type":"gold","scopus_import":"1","title":"Dispersive effects in ultrafast nonlinear phenomena: The case of optical Kerr effect","OA_place":"publisher","article_number":"013042","_id":"14886","file":[{"file_name":"2024_PhysicalReviewResearch_Lorenc.pdf","date_updated":"2024-01-31T11:59:30Z","file_id":"14918","checksum":"42d58f93ae74e7f2c4de058ef75ff8b2","file_size":2863627,"access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_created":"2024-01-31T11:59:30Z","success":1,"relation":"main_file"}],"year":"2024","acknowledgement":"The work was supported by the Institute of Science and Technology Austria (ISTA). We thank Prof. John M. Dudley, Dr. Ugur Sezer, and Dr. Artem Volosniev for valuable discussions.","date_published":"2024-01-11T00:00:00Z","type":"journal_article","status":"public"},{"oa":1,"author":[{"full_name":"Liu, Xuemei","first_name":"Xuemei","last_name":"Liu"},{"first_name":"Min","full_name":"Deng, Min","last_name":"Deng"},{"last_name":"Shi","first_name":"Bingxin","full_name":"Shi, Bingxin"},{"last_name":"Zhu","first_name":"Kehui","full_name":"Zhu, Kehui"},{"first_name":"Jinchao","full_name":"Chen, Jinchao","last_name":"Chen"},{"last_name":"Xu","first_name":"Shujuan","full_name":"Xu, Shujuan","id":"9724dd9d-f591-11ee-bd51-e97ed0652286"},{"first_name":"Xiaomin","full_name":"Bie, Xiaomin","last_name":"Bie"},{"full_name":"Zhang, Xiansheng","first_name":"Xiansheng","last_name":"Zhang"},{"last_name":"Lin","first_name":"Xuelei","full_name":"Lin, Xuelei"},{"full_name":"Xiao, Jun","first_name":"Jun","last_name":"Xiao"}],"department":[{"_id":"XiFe"}],"date_updated":"2026-10-21T13:50:04Z","researchdata_availability":"yes","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_created":"2024-07-21T22:01:02Z","intvolume":"        67","article_type":"original","isi":1,"citation":{"apa":"Liu, X., Deng, M., Shi, B., Zhu, K., Chen, J., Xu, S., … Xiao, J. (2024). Distinct roles of H3K27me3 and H3K36me3 in vernalization response, maintenance, and resetting in winter wheat. <i>Science China Life Sciences</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11427-024-2664-0\">https://doi.org/10.1007/s11427-024-2664-0</a>","ama":"Liu X, Deng M, Shi B, et al. Distinct roles of H3K27me3 and H3K36me3 in vernalization response, maintenance, and resetting in winter wheat. <i>Science China Life Sciences</i>. 2024;67:2251-2266. doi:<a href=\"https://doi.org/10.1007/s11427-024-2664-0\">10.1007/s11427-024-2664-0</a>","ieee":"X. Liu <i>et al.</i>, “Distinct roles of H3K27me3 and H3K36me3 in vernalization response, maintenance, and resetting in winter wheat,” <i>Science China Life Sciences</i>, vol. 67. Springer Nature, pp. 2251–2266, 2024.","ista":"Liu X, Deng M, Shi B, Zhu K, Chen J, Xu S, Bie X, Zhang X, Lin X, Xiao J. 2024. Distinct roles of H3K27me3 and H3K36me3 in vernalization response, maintenance, and resetting in winter wheat. Science China Life Sciences. 67, 2251–2266.","mla":"Liu, Xuemei, et al. “Distinct Roles of H3K27me3 and H3K36me3 in Vernalization Response, Maintenance, and Resetting in Winter Wheat.” <i>Science China Life Sciences</i>, vol. 67, Springer Nature, 2024, pp. 2251–66, doi:<a href=\"https://doi.org/10.1007/s11427-024-2664-0\">10.1007/s11427-024-2664-0</a>.","chicago":"Liu, Xuemei, Min Deng, Bingxin Shi, Kehui Zhu, Jinchao Chen, Shujuan Xu, Xiaomin Bie, Xiansheng Zhang, Xuelei Lin, and Jun Xiao. “Distinct Roles of H3K27me3 and H3K36me3 in Vernalization Response, Maintenance, and Resetting in Winter Wheat.” <i>Science China Life Sciences</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s11427-024-2664-0\">https://doi.org/10.1007/s11427-024-2664-0</a>.","short":"X. Liu, M. Deng, B. Shi, K. Zhu, J. Chen, S. Xu, X. Bie, X. Zhang, X. Lin, J. Xiao, Science China Life Sciences 67 (2024) 2251–2266."},"fulldoi":"https://doi.org/10.1007/s11427-024-2664-0","page":"2251-2266","external_id":{"isi":["001268807700002"],"pmid":["38987431"]},"OA_type":"green","scopus_import":"1","title":"Distinct roles of H3K27me3 and H3K36me3 in vernalization response, maintenance, and resetting in winter wheat","OA_place":"repository","_id":"17285","year":"2024","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2023.12.19.572364"}],"acknowledgement":"We thank Prof. Kang Chong from Institute of Botany, the Chinese Academy of Science for valuable comments, Dr. Haoran Li for the help with western blot of H3K36me3 in Tasdg8-cr lines. This research was supported by National Natural Science Foundation (31970529), Beijing Natural Science Foundation Outstanding Youth Project (JQ23026), National Key Research and Development Program of China (2021YFD1201500), and the Major Basic Research Program of Shandong Natural Science Foundation (ZR2019ZD15).","date_published":"2024-10-01T00:00:00Z","type":"journal_article","status":"public","supplementarymaterial":"yes","pmid":1,"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","dataavailabilitystatement":"The omics data at SO, S2, S3, DAP0, DAP2, DAP6 stages are reported for the first time in this paper and the raw sequence data have been deposited in the Genome Sequence Archive of the National Genomics Data Center, China National Center of Bioinformation/Beijing Institute of Genomics, Chinese Academy of Sciences (CRA014372). Other omics data were downloaded from the previous report under project number CRA008877 and PRJCA008382 (Lin et al., 2024; Zhao et al., 2023).","article_processing_charge":"No","publication_identifier":{"issn":["1674-7305"],"eissn":["1869-1889"]},"month":"10","quality_controlled":"1","volume":67,"publication":"Science China Life Sciences","doi":"10.1007/s11427-024-2664-0","day":"01","das_tickbox":"1","oa_version":"Preprint","abstract":[{"text":"Winter plants rely on vernalization, a crucial process for adapting to cold conditions and ensuring successful reproduction. However, understanding the role of histone modifications in guiding the vernalization process in winter wheat remains limited. In this study, we investigated the transcriptome and chromatin dynamics in the shoot apex throughout the life cycle of winter wheat in the field. Two core histone modifications, H3K27me3 and H3K36me3, exhibited opposite patterns on the key vernalization gene VERNALIZATION1 (VRN1), correlating with its induction during cold exposure. Moreover, the H3K36me3 level remained high at VRN1 after cold exposure, which may maintain its active state. Mutations in FERTILIZATION-INDEPENDENT ENDOSPERM (TaFIE) and SET DOMAIN GROUP 8/EARLY FLOWERING IN SHORT DAYS (TaSDG8/TaEFS), components of the writer complex for H3K27me3 and H3K36me3, respectively, affected flowering time. Intriguingly, VRN1 lost its high expression after the cold exposure memory in the absence of H3K36me3. During embryo development, VRN1 was silenced with the removal of active histone modifications in both winter and spring wheat, with selective restoration of H3K27me3 in winter wheat. The mutant of Tafie-cr-87, a component of H3K27me3 “writer” complex, did not influence the silence of VRN1 during embryo development, but rather attenuated the cold exposure requirement of winter wheat. Integrating gene expression with H3K27me3 and H3K36me3 patterns identified potential regulators of flowering. This study unveils distinct roles of H3K27me3 and H3K36me3 in controlling vernalization response, maintenance, and resetting in winter wheat.","lang":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"ZhAl"}],"date_updated":"2026-10-21T13:51:39Z","researchdata_availability":"no","author":[{"full_name":"Lorenc, Dusan","first_name":"Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","last_name":"Lorenc"},{"first_name":"Ayan","full_name":"Zhumekenov, Ayan","last_name":"Zhumekenov"},{"last_name":"Bakr","first_name":"Osman M.","full_name":"Bakr, Osman M."},{"first_name":"Zhanybek","full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev"}],"isi":1,"article_type":"original","intvolume":"         8","corr_author":"1","external_id":{"isi":["001299497800001"]},"fulldoi":"https://doi.org/10.1103/PhysRevMaterials.8.085403","citation":{"mla":"Lorenc, Dusan, et al. “No Extraordinary χ(3) in Lead-Halide Perovskites: Placing an Upper Bound on Kerr Nonlinearity by Means of Time-Resolved Interferometry.” <i>Physical Review Materials</i>, vol. 8, no. 8, 085403, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">10.1103/PhysRevMaterials.8.085403</a>.","chicago":"Lorenc, Dusan, Ayan Zhumekenov, Osman M. Bakr, and Zhanybek Alpichshev. “No Extraordinary χ(3) in Lead-Halide Perovskites: Placing an Upper Bound on Kerr Nonlinearity by Means of Time-Resolved Interferometry.” <i>Physical Review Materials</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">https://doi.org/10.1103/PhysRevMaterials.8.085403</a>.","short":"D. Lorenc, A. Zhumekenov, O.M. Bakr, Z. Alpichshev, Physical Review Materials 8 (2024).","ama":"Lorenc D, Zhumekenov A, Bakr OM, Alpichshev Z. No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry. <i>Physical Review Materials</i>. 2024;8(8). doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">10.1103/PhysRevMaterials.8.085403</a>","apa":"Lorenc, D., Zhumekenov, A., Bakr, O. M., &#38; Alpichshev, Z. (2024). No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry. <i>Physical Review Materials</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">https://doi.org/10.1103/PhysRevMaterials.8.085403</a>","ieee":"D. Lorenc, A. Zhumekenov, O. M. Bakr, and Z. Alpichshev, “No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry,” <i>Physical Review Materials</i>, vol. 8, no. 8. American Physical Society, 2024.","ista":"Lorenc D, Zhumekenov A, Bakr OM, Alpichshev Z. 2024. No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry. Physical Review Materials. 8(8), 085403."},"date_created":"2024-09-01T22:01:08Z","publisher":"American Physical Society","year":"2024","_id":"17476","article_number":"085403","status":"public","type":"journal_article","acknowledgement":"We gratefully acknowledge the assistance of Prof. John\r\nDudley.","date_published":"2024-08-23T00:00:00Z","title":"No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry","scopus_import":"1","day":"23","doi":"10.1103/PhysRevMaterials.8.085403","volume":8,"publication":"Physical Review Materials","issue":"8","abstract":[{"text":"Lead halide perovskites have recently been reported to demonstrate an exceptionally high nonlinear (Kerr) refractive index n2 of up to 10−8cm2/W in CH3⁢NH3⁢PbBr3. Other researchers, however, observe different, substantially more conservative numbers. In order to resolve this disagreement, the nonlinear Kerr index of a bulk sample of lead halide perovskite was measured directly by means of an interferometer. This approach has many advantages as compared to the more standard z-scan technique. In particular, this method allows studying the induced changes to the refractive index in a time-resolved manner, thus enabling to separate the different contributions to 𝑛2. The extracted 𝑛2 values for CsPbBr3 and MAPbBr3 at 𝜆≈1µ⁢m are 𝑛2=+2.1×10−14cm2/W and 𝑛2=+6×10−15cm2/W, respectively. Hence, these values are substantially lower than what has been indicated in most of the previous reports, implying the latter one should be regarded with great care.","lang":"eng"}],"oa_version":"None","das_tickbox":"0","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","supplementarymaterial":"yes","quality_controlled":"1","month":"08","publication_identifier":{"eissn":["2475-9953"]},"article_processing_charge":"No"}]