[{"status":"public","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Approximation of subdifferentials is one of the main tasks when computing descent directions for nonsmooth optimization problems. In this article, we propose a bisection method for weakly lower semismooth functions which is able to compute new subgradients that improve a given approximation in case a direction with insufficient descent was computed. Combined with a recently proposed deterministic gradient sampling approach, this yields a deterministic and provably convergent way to approximate subdifferentials for computing descent directions.</jats:p>"}],"type":"journal_article","publication":"Computational Optimization and Applications","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","Control and Optimization"],"user_id":"32643","department":[{"_id":"101"}],"_id":"51208","citation":{"ama":"Gebken B. A note on the convergence of deterministic gradient sampling in nonsmooth optimization. <i>Computational Optimization and Applications</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>","ieee":"B. Gebken, “A note on the convergence of deterministic gradient sampling in nonsmooth optimization,” <i>Computational Optimization and Applications</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>.","chicago":"Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.” <i>Computational Optimization and Applications</i>, 2024. <a href=\"https://doi.org/10.1007/s10589-024-00552-0\">https://doi.org/10.1007/s10589-024-00552-0</a>.","bibtex":"@article{Gebken_2024, title={A note on the convergence of deterministic gradient sampling in nonsmooth optimization}, DOI={<a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>}, journal={Computational Optimization and Applications}, publisher={Springer Science and Business Media LLC}, author={Gebken, Bennet}, year={2024} }","short":"B. Gebken, Computational Optimization and Applications (2024).","mla":"Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.” <i>Computational Optimization and Applications</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s10589-024-00552-0\">10.1007/s10589-024-00552-0</a>.","apa":"Gebken, B. (2024). A note on the convergence of deterministic gradient sampling in nonsmooth optimization. <i>Computational Optimization and Applications</i>. <a href=\"https://doi.org/10.1007/s10589-024-00552-0\">https://doi.org/10.1007/s10589-024-00552-0</a>"},"year":"2024","publication_status":"published","publication_identifier":{"issn":["0926-6003","1573-2894"]},"doi":"10.1007/s10589-024-00552-0","title":"A note on the convergence of deterministic gradient sampling in nonsmooth optimization","author":[{"id":"32643","full_name":"Gebken, Bennet","last_name":"Gebken","first_name":"Bennet"}],"date_created":"2024-02-07T07:23:23Z","date_updated":"2024-02-08T08:05:54Z","publisher":"Springer Science and Business Media LLC"},{"year":"2024","quality_controlled":"1","title":"Multiscale simulation of polymer curing of composites combined mean-field homogenisation methods at large strains","date_created":"2024-02-29T13:57:56Z","publisher":"Elsevier BV","publication":"International Journal of Solids and Structures","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Mechanical Engineering","Mechanics of Materials","Condensed Matter Physics","General Materials Science","Modeling and Simulation"],"intvolume":"       290","citation":{"apa":"Lenz, P., &#38; Mahnken, R. (2024). Multiscale simulation of polymer curing of composites combined mean-field homogenisation methods at large strains. <i>International Journal of Solids and Structures</i>, <i>290</i>, Article 112642. <a href=\"https://doi.org/10.1016/j.ijsolstr.2023.112642\">https://doi.org/10.1016/j.ijsolstr.2023.112642</a>","bibtex":"@article{Lenz_Mahnken_2024, title={Multiscale simulation of polymer curing of composites combined mean-field homogenisation methods at large strains}, volume={290}, DOI={<a href=\"https://doi.org/10.1016/j.ijsolstr.2023.112642\">10.1016/j.ijsolstr.2023.112642</a>}, number={112642}, journal={International Journal of Solids and Structures}, publisher={Elsevier BV}, author={Lenz, Peter and Mahnken, Rolf}, year={2024} }","mla":"Lenz, Peter, and Rolf Mahnken. “Multiscale Simulation of Polymer Curing of Composites Combined Mean-Field Homogenisation Methods at Large Strains.” <i>International Journal of Solids and Structures</i>, vol. 290, 112642, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.ijsolstr.2023.112642\">10.1016/j.ijsolstr.2023.112642</a>.","short":"P. Lenz, R. Mahnken, International Journal of Solids and Structures 290 (2024).","chicago":"Lenz, Peter, and Rolf Mahnken. “Multiscale Simulation of Polymer Curing of Composites Combined Mean-Field Homogenisation Methods at Large Strains.” <i>International Journal of Solids and Structures</i> 290 (2024). <a href=\"https://doi.org/10.1016/j.ijsolstr.2023.112642\">https://doi.org/10.1016/j.ijsolstr.2023.112642</a>.","ieee":"P. Lenz and R. Mahnken, “Multiscale simulation of polymer curing of composites combined mean-field homogenisation methods at large strains,” <i>International Journal of Solids and Structures</i>, vol. 290, Art. no. 112642, 2024, doi: <a href=\"https://doi.org/10.1016/j.ijsolstr.2023.112642\">10.1016/j.ijsolstr.2023.112642</a>.","ama":"Lenz P, Mahnken R. Multiscale simulation of polymer curing of composites combined mean-field homogenisation methods at large strains. <i>International Journal of Solids and Structures</i>. 2024;290. doi:<a href=\"https://doi.org/10.1016/j.ijsolstr.2023.112642\">10.1016/j.ijsolstr.2023.112642</a>"},"publication_identifier":{"issn":["0020-7683"]},"publication_status":"published","doi":"10.1016/j.ijsolstr.2023.112642","volume":290,"author":[{"full_name":"Lenz, Peter","last_name":"Lenz","first_name":"Peter"},{"id":"335","full_name":"Mahnken, Rolf","last_name":"Mahnken","first_name":"Rolf"}],"date_updated":"2024-02-29T13:58:14Z","status":"public","type":"journal_article","article_number":"112642","department":[{"_id":"9"},{"_id":"154"},{"_id":"321"}],"user_id":"335","_id":"52218"},{"department":[{"_id":"154"},{"_id":"321"}],"user_id":"335","_id":"52233","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"publication":"Computational Mechanics","type":"journal_article","status":"public","abstract":[{"text":"ELDIRK methods are defined to have an <jats:italic>Explicit Last</jats:italic> stage in the general Butcher array of <jats:italic>Diagonal Implicit Runge-Kutta</jats:italic> methods, with the consequence, that no additional system of equations must be solved, compared to the embedded RK method. Two general formulations for second- and third-order ELDIRK methods have been obtained recently in Mahnken [21] with specific schemes,  e.g. for the embedded implicit Euler method, the embedded trapezoidal-rule and the embedded Ellsiepen method. In the first part of this paper, we investigate some general stability characteristics of ELDIRK methods, and it will be shown that the above specific RK schemes are not A-stable. Therefore, in the second part, the above-mentioned general formulations are used for further stability investigations, with the aim to construct new second- and third-order ELDIRK methods which simultaneously are A-stable. Two numerical examples are concerned with the curing for a thermosetting material and phase-field RVE modeling for crystallinity and orientation. The numerical results confirm the theoretical results on convergence order and stability.","lang":"eng"}],"author":[{"first_name":"Rolf","last_name":"Mahnken","full_name":"Mahnken, Rolf","id":"335"},{"first_name":"Hendrik","id":"60816","full_name":"Westermann, Hendrik","orcid":"0000-0002-5034-9708","last_name":"Westermann"}],"date_created":"2024-03-03T13:23:28Z","publisher":"Springer Science and Business Media LLC","date_updated":"2024-03-19T12:14:07Z","doi":"10.1007/s00466-024-02442-y","title":"Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods","quality_controlled":"1","publication_identifier":{"issn":["0178-7675","1432-0924"]},"publication_status":"published","citation":{"ama":"Mahnken R, Westermann H. Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods. <i>Computational Mechanics</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>","ieee":"R. Mahnken and H. Westermann, “Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods,” <i>Computational Mechanics</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>.","chicago":"Mahnken, Rolf, and Hendrik Westermann. “Construction of A-Stable Explicit Last-Stage Diagonal Implicit Runge–Kutta (ELDIRK) Methods.” <i>Computational Mechanics</i>, 2024. <a href=\"https://doi.org/10.1007/s00466-024-02442-y\">https://doi.org/10.1007/s00466-024-02442-y</a>.","apa":"Mahnken, R., &#38; Westermann, H. (2024). Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods. <i>Computational Mechanics</i>. <a href=\"https://doi.org/10.1007/s00466-024-02442-y\">https://doi.org/10.1007/s00466-024-02442-y</a>","mla":"Mahnken, Rolf, and Hendrik Westermann. “Construction of A-Stable Explicit Last-Stage Diagonal Implicit Runge–Kutta (ELDIRK) Methods.” <i>Computational Mechanics</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>.","bibtex":"@article{Mahnken_Westermann_2024, title={Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods}, DOI={<a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Mahnken, Rolf and Westermann, Hendrik}, year={2024} }","short":"R. Mahnken, H. Westermann, Computational Mechanics (2024)."},"year":"2024"},{"volume":12,"author":[{"last_name":"Bick","full_name":"Bick, Christian","first_name":"Christian"},{"first_name":"Sören","full_name":"von der Gracht, Sören","id":"97359","last_name":"von der Gracht","orcid":"0000-0002-8054-2058"}],"oa":"1","date_updated":"2024-03-22T09:11:53Z","doi":"10.1093/comnet/cnae009","main_file_link":[{"url":"https://academic.oup.com/comnet/article-pdf/12/2/cnae009/56832119/cnae009.pdf","open_access":"1"}],"has_accepted_license":"1","publication_identifier":{"issn":["2051-1329"]},"publication_status":"published","intvolume":"        12","citation":{"chicago":"Bick, Christian, and Sören von der Gracht. “Heteroclinic Dynamics in Network Dynamical Systems with Higher-Order Interactions.” <i>Journal of Complex Networks</i> 12, no. 2 (2024). <a href=\"https://doi.org/10.1093/comnet/cnae009\">https://doi.org/10.1093/comnet/cnae009</a>.","ieee":"C. Bick and S. von der Gracht, “Heteroclinic dynamics in network dynamical systems with higher-order interactions,” <i>Journal of Complex Networks</i>, vol. 12, no. 2, 2024, doi: <a href=\"https://doi.org/10.1093/comnet/cnae009\">10.1093/comnet/cnae009</a>.","ama":"Bick C, von der Gracht S. Heteroclinic dynamics in network dynamical systems with higher-order interactions. <i>Journal of Complex Networks</i>. 2024;12(2). doi:<a href=\"https://doi.org/10.1093/comnet/cnae009\">10.1093/comnet/cnae009</a>","apa":"Bick, C., &#38; von der Gracht, S. (2024). Heteroclinic dynamics in network dynamical systems with higher-order interactions. <i>Journal of Complex Networks</i>, <i>12</i>(2). <a href=\"https://doi.org/10.1093/comnet/cnae009\">https://doi.org/10.1093/comnet/cnae009</a>","bibtex":"@article{Bick_von der Gracht_2024, title={Heteroclinic dynamics in network dynamical systems with higher-order interactions}, volume={12}, DOI={<a href=\"https://doi.org/10.1093/comnet/cnae009\">10.1093/comnet/cnae009</a>}, number={2}, journal={Journal of Complex Networks}, publisher={Oxford University Press (OUP)}, author={Bick, Christian and von der Gracht, Sören}, year={2024} }","mla":"Bick, Christian, and Sören von der Gracht. “Heteroclinic Dynamics in Network Dynamical Systems with Higher-Order Interactions.” <i>Journal of Complex Networks</i>, vol. 12, no. 2, Oxford University Press (OUP), 2024, doi:<a href=\"https://doi.org/10.1093/comnet/cnae009\">10.1093/comnet/cnae009</a>.","short":"C. Bick, S. von der Gracht, Journal of Complex Networks 12 (2024)."},"department":[{"_id":"101"}],"user_id":"97359","_id":"52726","file_date_updated":"2024-03-22T09:06:07Z","article_type":"original","type":"journal_article","status":"public","date_created":"2024-03-22T09:04:57Z","publisher":"Oxford University Press (OUP)","title":"Heteroclinic dynamics in network dynamical systems with higher-order interactions","issue":"2","year":"2024","external_id":{"arxiv":["2309.02006"]},"language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","Control and Optimization","Management Science and Operations Research","Computer Networks and Communications"],"ddc":["510"],"publication":"Journal of Complex Networks","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":649155,"file_id":"52728","access_level":"closed","file_name":"heteroclinic-dynamics-in-network-dynamical-systems-with-higher-order-interactions.pdf","date_updated":"2024-03-22T09:06:07Z","date_created":"2024-03-22T09:06:07Z","creator":"svdg"}],"abstract":[{"lang":"eng","text":"Heteroclinic structures organize global features of dynamical systems. We analyse whether heteroclinic structures can arise in network dynamics with higher-order interactions which describe the nonlinear interactions between three or more units. We find that while commonly analysed model equations such as network dynamics on undirected hypergraphs may be useful to describe local dynamics such as cluster synchronization, they give rise to obstructions that allow to design of heteroclinic structures in phase space. By contrast, directed hypergraphs break the homogeneity and lead to vector fields that support heteroclinic structures."}]},{"keyword":["Computational Mathematics","Discrete Mathematics and Combinatorics"],"language":[{"iso":"eng"}],"_id":"49905","user_id":"15540","department":[{"_id":"542"}],"abstract":[{"text":"For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m(3, 3) = m(4, r) = 1, and m(t, r) ≤ r − 2 for all t \u0003 = 5,\r\nand m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.","lang":"eng"}],"status":"public","type":"journal_article","publication":"Combinatorica","title":"Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs","doi":"10.1007/s00493-023-00078-9","date_updated":"2024-03-22T12:11:35Z","publisher":"Springer Science and Business Media LLC","author":[{"full_name":"Ma, Yulai","id":"92748","last_name":"Ma","first_name":"Yulai"},{"last_name":"Mattiolo","full_name":"Mattiolo, Davide","first_name":"Davide"},{"first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548","last_name":"Steffen","orcid":"0000-0002-9808-7401"},{"last_name":"Wolf","id":"88145","full_name":"Wolf, Isaak Hieronymus","first_name":"Isaak Hieronymus"}],"date_created":"2023-12-20T10:31:27Z","volume":44,"year":"2024","citation":{"apa":"Ma, Y., Mattiolo, D., Steffen, E., &#38; Wolf, I. H. (2024). Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. <i>Combinatorica</i>, <i>44</i>, 429–440. <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">https://doi.org/10.1007/s00493-023-00078-9</a>","bibtex":"@article{Ma_Mattiolo_Steffen_Wolf_2024, title={Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}, volume={44}, DOI={<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>}, journal={Combinatorica}, publisher={Springer Science and Business Media LLC}, author={Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2024}, pages={429–440} }","short":"Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.","mla":"Ma, Yulai, et al. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” <i>Combinatorica</i>, vol. 44, Springer Science and Business Media LLC, 2024, pp. 429–40, doi:<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>.","ama":"Ma Y, Mattiolo D, Steffen E, Wolf IH. Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. <i>Combinatorica</i>. 2024;44:429-440. doi:<a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>","chicago":"Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” <i>Combinatorica</i> 44 (2024): 429–40. <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">https://doi.org/10.1007/s00493-023-00078-9</a>.","ieee":"Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs,” <i>Combinatorica</i>, vol. 44, pp. 429–440, 2024, doi: <a href=\"https://doi.org/10.1007/s00493-023-00078-9\">10.1007/s00493-023-00078-9</a>."},"intvolume":"        44","page":"429-440","publication_status":"published","publication_identifier":{"issn":["0209-9683","1439-6912"]}},{"issue":"2","publication_status":"published","publication_identifier":{"issn":["1424-3199","1424-3202"]},"citation":{"chicago":"Stinner, Christian, and Michael Winkler. “A Critical Exponent in a Quasilinear Keller–Segel System with Arbitrarily Fast Decaying Diffusivities Accounting for Volume-Filling Effects.” <i>Journal of Evolution Equations</i> 24, no. 2 (2024). <a href=\"https://doi.org/10.1007/s00028-024-00954-x\">https://doi.org/10.1007/s00028-024-00954-x</a>.","ieee":"C. Stinner and M. Winkler, “A critical exponent in a quasilinear Keller–Segel system with arbitrarily fast decaying diffusivities accounting for volume-filling effects,” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, Art. no. 26, 2024, doi: <a href=\"https://doi.org/10.1007/s00028-024-00954-x\">10.1007/s00028-024-00954-x</a>.","ama":"Stinner C, Winkler M. A critical exponent in a quasilinear Keller–Segel system with arbitrarily fast decaying diffusivities accounting for volume-filling effects. <i>Journal of Evolution Equations</i>. 2024;24(2). doi:<a href=\"https://doi.org/10.1007/s00028-024-00954-x\">10.1007/s00028-024-00954-x</a>","apa":"Stinner, C., &#38; Winkler, M. (2024). A critical exponent in a quasilinear Keller–Segel system with arbitrarily fast decaying diffusivities accounting for volume-filling effects. <i>Journal of Evolution Equations</i>, <i>24</i>(2), Article 26. <a href=\"https://doi.org/10.1007/s00028-024-00954-x\">https://doi.org/10.1007/s00028-024-00954-x</a>","short":"C. Stinner, M. Winkler, Journal of Evolution Equations 24 (2024).","mla":"Stinner, Christian, and Michael Winkler. “A Critical Exponent in a Quasilinear Keller–Segel System with Arbitrarily Fast Decaying Diffusivities Accounting for Volume-Filling Effects.” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, 26, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s00028-024-00954-x\">10.1007/s00028-024-00954-x</a>.","bibtex":"@article{Stinner_Winkler_2024, title={A critical exponent in a quasilinear Keller–Segel system with arbitrarily fast decaying diffusivities accounting for volume-filling effects}, volume={24}, DOI={<a href=\"https://doi.org/10.1007/s00028-024-00954-x\">10.1007/s00028-024-00954-x</a>}, number={226}, journal={Journal of Evolution Equations}, publisher={Springer Science and Business Media LLC}, author={Stinner, Christian and Winkler, Michael}, year={2024} }"},"intvolume":"        24","year":"2024","date_created":"2024-04-07T12:29:25Z","author":[{"first_name":"Christian","last_name":"Stinner","full_name":"Stinner, Christian"},{"first_name":"Michael","last_name":"Winkler","full_name":"Winkler, Michael"}],"volume":24,"publisher":"Springer Science and Business Media LLC","date_updated":"2024-04-07T12:36:21Z","doi":"10.1007/s00028-024-00954-x","title":"A critical exponent in a quasilinear Keller–Segel system with arbitrarily fast decaying diffusivities accounting for volume-filling effects","type":"journal_article","publication":"Journal of Evolution Equations","status":"public","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>The quasilinear Keller–Segel system <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\left\\{ \\begin{array}{l} u_t=\\nabla \\cdot (D(u)\\nabla u) - \\nabla \\cdot (S(u)\\nabla v), \\\\ v_t=\\Delta v-v+u, \\end{array}\\right. \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mtable>\r\n                      <mml:mtr>\r\n                        <mml:mtd>\r\n                          <mml:mfenced>\r\n                            <mml:mrow>\r\n                              <mml:mtable>\r\n                                <mml:mtr>\r\n                                  <mml:mtd>\r\n                                    <mml:mrow>\r\n                                      <mml:msub>\r\n                                        <mml:mi>u</mml:mi>\r\n                                        <mml:mi>t</mml:mi>\r\n                                      </mml:msub>\r\n                                      <mml:mo>=</mml:mo>\r\n                                      <mml:mi>∇</mml:mi>\r\n                                      <mml:mo>·</mml:mo>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                        <mml:mi>D</mml:mi>\r\n                                        <mml:mrow>\r\n                                          <mml:mo>(</mml:mo>\r\n                                          <mml:mi>u</mml:mi>\r\n                                          <mml:mo>)</mml:mo>\r\n                                        </mml:mrow>\r\n                                        <mml:mi>∇</mml:mi>\r\n                                        <mml:mi>u</mml:mi>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mo>-</mml:mo>\r\n                                      <mml:mi>∇</mml:mi>\r\n                                      <mml:mo>·</mml:mo>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                        <mml:mi>S</mml:mi>\r\n                                        <mml:mrow>\r\n                                          <mml:mo>(</mml:mo>\r\n                                          <mml:mi>u</mml:mi>\r\n                                          <mml:mo>)</mml:mo>\r\n                                        </mml:mrow>\r\n                                        <mml:mi>∇</mml:mi>\r\n                                        <mml:mi>v</mml:mi>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mo>,</mml:mo>\r\n                                    </mml:mrow>\r\n                                  </mml:mtd>\r\n                                </mml:mtr>\r\n                                <mml:mtr>\r\n                                  <mml:mtd>\r\n                                    <mml:mrow>\r\n                                      <mml:mrow />\r\n                                      <mml:msub>\r\n                                        <mml:mi>v</mml:mi>\r\n                                        <mml:mi>t</mml:mi>\r\n                                      </mml:msub>\r\n                                      <mml:mo>=</mml:mo>\r\n                                      <mml:mi>Δ</mml:mi>\r\n                                      <mml:mi>v</mml:mi>\r\n                                      <mml:mo>-</mml:mo>\r\n                                      <mml:mi>v</mml:mi>\r\n                                      <mml:mo>+</mml:mo>\r\n                                      <mml:mi>u</mml:mi>\r\n                                      <mml:mo>,</mml:mo>\r\n                                    </mml:mrow>\r\n                                  </mml:mtd>\r\n                                </mml:mtr>\r\n                              </mml:mtable>\r\n                            </mml:mrow>\r\n                          </mml:mfenced>\r\n                        </mml:mtd>\r\n                      </mml:mtr>\r\n                    </mml:mtable>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:disp-formula>endowed with homogeneous Neumann boundary conditions is considered in a bounded domain <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Omega \\subset {\\mathbb {R}}^n$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>Ω</mml:mi>\r\n                    <mml:mo>⊂</mml:mo>\r\n                    <mml:msup>\r\n                      <mml:mrow>\r\n                        <mml:mi>R</mml:mi>\r\n                      </mml:mrow>\r\n                      <mml:mi>n</mml:mi>\r\n                    </mml:msup>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$n \\ge 3$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>n</mml:mi>\r\n                    <mml:mo>≥</mml:mo>\r\n                    <mml:mn>3</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, with smooth boundary for sufficiently regular functions <jats:italic>D</jats:italic> and <jats:italic>S</jats:italic> satisfying <jats:inline-formula><jats:alternatives><jats:tex-math>$$D&gt;0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>D</mml:mi>\r\n                    <mml:mo>&gt;</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula> on <jats:inline-formula><jats:alternatives><jats:tex-math>$$[0,\\infty )$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mo>[</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                    <mml:mo>,</mml:mo>\r\n                    <mml:mi>∞</mml:mi>\r\n                    <mml:mo>)</mml:mo>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$S&gt;0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>S</mml:mi>\r\n                    <mml:mo>&gt;</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula> on <jats:inline-formula><jats:alternatives><jats:tex-math>$$(0,\\infty )$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mo>(</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                    <mml:mo>,</mml:mo>\r\n                    <mml:mi>∞</mml:mi>\r\n                    <mml:mo>)</mml:mo>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$S(0)=0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>S</mml:mi>\r\n                    <mml:mo>(</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                    <mml:mo>)</mml:mo>\r\n                    <mml:mo>=</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>. On the one hand, it is shown that if <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\frac{S}{D}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mfrac>\r\n                    <mml:mi>S</mml:mi>\r\n                    <mml:mi>D</mml:mi>\r\n                  </mml:mfrac>\r\n                </mml:math></jats:alternatives></jats:inline-formula> satisfies the subcritical growth condition <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\frac{S(s)}{D(s)} \\le C s^\\alpha \\qquad \\text{ for } \\text{ all } s\\ge 1 \\qquad \\text{ with } \\text{ some } \\alpha &lt; \\frac{2}{n} \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mtable>\r\n                      <mml:mtr>\r\n                        <mml:mtd>\r\n                          <mml:mrow>\r\n                            <mml:mfrac>\r\n                              <mml:mrow>\r\n                                <mml:mi>S</mml:mi>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>s</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mrow>\r\n                                <mml:mi>D</mml:mi>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>s</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                            </mml:mfrac>\r\n                            <mml:mo>≤</mml:mo>\r\n                            <mml:mi>C</mml:mi>\r\n                            <mml:msup>\r\n                              <mml:mi>s</mml:mi>\r\n                              <mml:mi>α</mml:mi>\r\n                            </mml:msup>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>for</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>all</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mi>s</mml:mi>\r\n                            <mml:mo>≥</mml:mo>\r\n                            <mml:mn>1</mml:mn>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>with</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>some</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mi>α</mml:mi>\r\n                            <mml:mo>&lt;</mml:mo>\r\n                            <mml:mfrac>\r\n                              <mml:mn>2</mml:mn>\r\n                              <mml:mi>n</mml:mi>\r\n                            </mml:mfrac>\r\n                          </mml:mrow>\r\n                        </mml:mtd>\r\n                      </mml:mtr>\r\n                    </mml:mtable>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:disp-formula>and <jats:inline-formula><jats:alternatives><jats:tex-math>$$C&gt;0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>C</mml:mi>\r\n                    <mml:mo>&gt;</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, then for any sufficiently regular initial data there exists a global weak energy solution such that <jats:inline-formula><jats:alternatives><jats:tex-math>$${ \\mathrm{{ess}}} \\sup _{t&gt;0} \\Vert u(t) \\Vert _{L^p(\\Omega )}&lt;\\infty $$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>ess</mml:mi>\r\n                    <mml:msub>\r\n                      <mml:mo>sup</mml:mo>\r\n                      <mml:mrow>\r\n                        <mml:mi>t</mml:mi>\r\n                        <mml:mo>&gt;</mml:mo>\r\n                        <mml:mn>0</mml:mn>\r\n                      </mml:mrow>\r\n                    </mml:msub>\r\n                    <mml:msub>\r\n                      <mml:mrow>\r\n                        <mml:mo>‖</mml:mo>\r\n                        <mml:mi>u</mml:mi>\r\n                        <mml:mrow>\r\n                          <mml:mo>(</mml:mo>\r\n                          <mml:mi>t</mml:mi>\r\n                          <mml:mo>)</mml:mo>\r\n                        </mml:mrow>\r\n                        <mml:mo>‖</mml:mo>\r\n                      </mml:mrow>\r\n                      <mml:mrow>\r\n                        <mml:msup>\r\n                          <mml:mi>L</mml:mi>\r\n                          <mml:mi>p</mml:mi>\r\n                        </mml:msup>\r\n                        <mml:mrow>\r\n                          <mml:mo>(</mml:mo>\r\n                          <mml:mi>Ω</mml:mi>\r\n                          <mml:mo>)</mml:mo>\r\n                        </mml:mrow>\r\n                      </mml:mrow>\r\n                    </mml:msub>\r\n                    <mml:mo>&lt;</mml:mo>\r\n                    <mml:mi>∞</mml:mi>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula> for some <jats:inline-formula><jats:alternatives><jats:tex-math>$$p &gt; \\frac{2n}{n+2}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>p</mml:mi>\r\n                    <mml:mo>&gt;</mml:mo>\r\n                    <mml:mfrac>\r\n                      <mml:mrow>\r\n                        <mml:mn>2</mml:mn>\r\n                        <mml:mi>n</mml:mi>\r\n                      </mml:mrow>\r\n                      <mml:mrow>\r\n                        <mml:mi>n</mml:mi>\r\n                        <mml:mo>+</mml:mo>\r\n                        <mml:mn>2</mml:mn>\r\n                      </mml:mrow>\r\n                    </mml:mfrac>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>. On the other hand, if <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\frac{S}{D}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mfrac>\r\n                    <mml:mi>S</mml:mi>\r\n                    <mml:mi>D</mml:mi>\r\n                  </mml:mfrac>\r\n                </mml:math></jats:alternatives></jats:inline-formula> satisfies the supercritical growth condition <jats:disp-formula><jats:alternatives><jats:tex-math>$$\\begin{aligned} \\frac{S(s)}{D(s)} \\ge c s^\\alpha \\qquad \\text{ for } \\text{ all } s\\ge 1 \\qquad \\text{ with } \\text{ some } \\alpha &gt; \\frac{2}{n} \\end{aligned}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mtable>\r\n                      <mml:mtr>\r\n                        <mml:mtd>\r\n                          <mml:mrow>\r\n                            <mml:mfrac>\r\n                              <mml:mrow>\r\n                                <mml:mi>S</mml:mi>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>s</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mrow>\r\n                                <mml:mi>D</mml:mi>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>s</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                            </mml:mfrac>\r\n                            <mml:mo>≥</mml:mo>\r\n                            <mml:mi>c</mml:mi>\r\n                            <mml:msup>\r\n                              <mml:mi>s</mml:mi>\r\n                              <mml:mi>α</mml:mi>\r\n                            </mml:msup>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>for</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>all</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mi>s</mml:mi>\r\n                            <mml:mo>≥</mml:mo>\r\n                            <mml:mn>1</mml:mn>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>with</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mspace />\r\n                            <mml:mtext>some</mml:mtext>\r\n                            <mml:mspace />\r\n                            <mml:mi>α</mml:mi>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mfrac>\r\n                              <mml:mn>2</mml:mn>\r\n                              <mml:mi>n</mml:mi>\r\n                            </mml:mfrac>\r\n                          </mml:mrow>\r\n                        </mml:mtd>\r\n                      </mml:mtr>\r\n                    </mml:mtable>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:disp-formula>and <jats:inline-formula><jats:alternatives><jats:tex-math>$$c&gt;0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>c</mml:mi>\r\n                    <mml:mo>&gt;</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, then the nonexistence of a global weak energy solution having the boundedness property stated above is shown for some initial data in the radial setting. This establishes some criticality of the value <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\alpha = \\frac{2}{n}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>α</mml:mi>\r\n                    <mml:mo>=</mml:mo>\r\n                    <mml:mfrac>\r\n                      <mml:mn>2</mml:mn>\r\n                      <mml:mi>n</mml:mi>\r\n                    </mml:mfrac>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula> for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n \\ge 3$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>n</mml:mi>\r\n                    <mml:mo>≥</mml:mo>\r\n                    <mml:mn>3</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, without any additional assumption on the behavior of <jats:italic>D</jats:italic>(<jats:italic>s</jats:italic>) as <jats:inline-formula><jats:alternatives><jats:tex-math>$$s \\rightarrow \\infty $$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>s</mml:mi>\r\n                    <mml:mo>→</mml:mo>\r\n                    <mml:mi>∞</mml:mi>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, in particular without requiring any algebraic lower bound for <jats:italic>D</jats:italic>. When applied to the Keller–Segel system with volume-filling effect for probability distribution functions of the type <jats:inline-formula><jats:alternatives><jats:tex-math>$$Q(s) = \\exp (-s^\\beta )$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>Q</mml:mi>\r\n                    <mml:mrow>\r\n                      <mml:mo>(</mml:mo>\r\n                      <mml:mi>s</mml:mi>\r\n                      <mml:mo>)</mml:mo>\r\n                    </mml:mrow>\r\n                    <mml:mo>=</mml:mo>\r\n                    <mml:mo>exp</mml:mo>\r\n                    <mml:mrow>\r\n                      <mml:mo>(</mml:mo>\r\n                      <mml:mo>-</mml:mo>\r\n                      <mml:msup>\r\n                        <mml:mi>s</mml:mi>\r\n                        <mml:mi>β</mml:mi>\r\n                      </mml:msup>\r\n                      <mml:mo>)</mml:mo>\r\n                    </mml:mrow>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$s \\ge 0$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>s</mml:mi>\r\n                    <mml:mo>≥</mml:mo>\r\n                    <mml:mn>0</mml:mn>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula>, for global solvability the exponent <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\beta = \\frac{n-2}{n}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:mrow>\r\n                    <mml:mi>β</mml:mi>\r\n                    <mml:mo>=</mml:mo>\r\n                    <mml:mfrac>\r\n                      <mml:mrow>\r\n                        <mml:mi>n</mml:mi>\r\n                        <mml:mo>-</mml:mo>\r\n                        <mml:mn>2</mml:mn>\r\n                      </mml:mrow>\r\n                      <mml:mi>n</mml:mi>\r\n                    </mml:mfrac>\r\n                  </mml:mrow>\r\n                </mml:math></jats:alternatives></jats:inline-formula> is seen to be critical.\r\n</jats:p>","lang":"eng"}],"user_id":"31496","_id":"53316","language":[{"iso":"eng"}],"article_number":"26","keyword":["Mathematics (miscellaneous)"]},{"year":"2024","intvolume":"       109","citation":{"ama":"Wang Y, Winkler M. An interpolation inequality involving $L\\log L$ spaces and application to the characterization of blow‐up behavior in a two‐dimensional Keller–Segel–Navier–Stokes system. <i>Journal of the London Mathematical Society</i>. 2024;109(3). doi:<a href=\"https://doi.org/10.1112/jlms.12885\">10.1112/jlms.12885</a>","chicago":"Wang, Yulan, and Michael Winkler. “An Interpolation Inequality Involving $L\\log L$ Spaces and Application to the Characterization of Blow‐up Behavior in a Two‐dimensional Keller–Segel–Navier–Stokes System.” <i>Journal of the London Mathematical Society</i> 109, no. 3 (2024). <a href=\"https://doi.org/10.1112/jlms.12885\">https://doi.org/10.1112/jlms.12885</a>.","ieee":"Y. Wang and M. Winkler, “An interpolation inequality involving $L\\log L$ spaces and application to the characterization of blow‐up behavior in a two‐dimensional Keller–Segel–Navier–Stokes system,” <i>Journal of the London Mathematical Society</i>, vol. 109, no. 3, 2024, doi: <a href=\"https://doi.org/10.1112/jlms.12885\">10.1112/jlms.12885</a>.","mla":"Wang, Yulan, and Michael Winkler. “An Interpolation Inequality Involving $L\\log L$ Spaces and Application to the Characterization of Blow‐up Behavior in a Two‐dimensional Keller–Segel–Navier–Stokes System.” <i>Journal of the London Mathematical Society</i>, vol. 109, no. 3, Wiley, 2024, doi:<a href=\"https://doi.org/10.1112/jlms.12885\">10.1112/jlms.12885</a>.","bibtex":"@article{Wang_Winkler_2024, title={An interpolation inequality involving $L\\log L$ spaces and application to the characterization of blow‐up behavior in a two‐dimensional Keller–Segel–Navier–Stokes system}, volume={109}, DOI={<a href=\"https://doi.org/10.1112/jlms.12885\">10.1112/jlms.12885</a>}, number={3}, journal={Journal of the London Mathematical Society}, publisher={Wiley}, author={Wang, Yulan and Winkler, Michael}, year={2024} }","short":"Y. Wang, M. Winkler, Journal of the London Mathematical Society 109 (2024).","apa":"Wang, Y., &#38; Winkler, M. (2024). An interpolation inequality involving $L\\log L$ spaces and application to the characterization of blow‐up behavior in a two‐dimensional Keller–Segel–Navier–Stokes system. <i>Journal of the London Mathematical Society</i>, <i>109</i>(3). <a href=\"https://doi.org/10.1112/jlms.12885\">https://doi.org/10.1112/jlms.12885</a>"},"publication_identifier":{"issn":["0024-6107","1469-7750"]},"publication_status":"published","issue":"3","title":"An interpolation inequality involving $L\\log L$ spaces and application to the characterization of blow‐up behavior in a two‐dimensional Keller–Segel–Navier–Stokes system","doi":"10.1112/jlms.12885","date_updated":"2024-04-07T12:36:25Z","publisher":"Wiley","volume":109,"author":[{"first_name":"Yulan","full_name":"Wang, Yulan","last_name":"Wang"},{"first_name":"Michael","last_name":"Winkler","full_name":"Winkler, Michael"}],"date_created":"2024-04-07T12:27:28Z","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>In a smoothly bounded two‐dimensional domain  and for a given nondecreasing positive unbounded , for each  and  the inequality\r\n<jats:disp-formula />is shown to hold for any positive  fulfilling\r\n<jats:disp-formula />This is thereafter applied to nonglobal solutions of the Keller–Segel system coupled to the incompressible Navier–Stokes equations through transport and buoyancy, and it is seen that in any such blow‐up event the corresponding population density cannot remain uniformly integrable over  near its explosion time.</jats:p>","lang":"eng"}],"status":"public","publication":"Journal of the London Mathematical Society","type":"journal_article","keyword":["General Mathematics"],"language":[{"iso":"eng"}],"_id":"53315","user_id":"31496"},{"language":[{"iso":"eng"}],"keyword":["Mathematics (miscellaneous)"],"publication":"Journal of Evolution Equations","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>This work deals with the extension problem for the fractional Laplacian on Riemannian symmetric spaces <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic> of noncompact type and of general rank, which gives rise to a family of convolution operators, including the Poisson operator. More precisely, motivated by Euclidean results for the Poisson semigroup, we study the long-time asymptotic behavior of solutions to the extension problem for <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:msup>\r\n                    <mml:mi>L</mml:mi>\r\n                    <mml:mn>1</mml:mn>\r\n                  </mml:msup>\r\n                </mml:math></jats:alternatives></jats:inline-formula> initial data. In the case of the Laplace–Beltrami operator, we show that if the initial data are bi-<jats:italic>K</jats:italic>-invariant, then the solution to the extension problem behaves asymptotically as the mass times the fundamental solution, but this convergence may break down in the non-bi-<jats:italic>K</jats:italic>-invariant case. In the second part, we investigate the long-time asymptotic behavior of the extension problem associated with the so-called distinguished Laplacian on <jats:italic>G</jats:italic>/<jats:italic>K</jats:italic>. In this case, we observe phenomena which are similar to the Euclidean setting for the Poisson semigroup, such as <jats:inline-formula><jats:alternatives><jats:tex-math>$$L^1$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                  <mml:msup>\r\n                    <mml:mi>L</mml:mi>\r\n                    <mml:mn>1</mml:mn>\r\n                  </mml:msup>\r\n                </mml:math></jats:alternatives></jats:inline-formula> asymptotic convergence without the assumption of bi-<jats:italic>K</jats:italic>-invariance.</jats:p>"}],"date_created":"2024-04-17T13:18:30Z","publisher":"Springer Science and Business Media LLC","title":"Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces","issue":"2","year":"2024","user_id":"100325","department":[{"_id":"555"}],"_id":"53542","article_number":"34","type":"journal_article","status":"public","author":[{"first_name":"Efthymia","full_name":"Papageorgiou, Efthymia","id":"100325","last_name":"Papageorgiou"}],"volume":24,"date_updated":"2024-04-17T13:20:29Z","doi":"10.1007/s00028-024-00959-6","publication_status":"published","publication_identifier":{"issn":["1424-3199","1424-3202"]},"citation":{"apa":"Papageorgiou, E. (2024). Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces. <i>Journal of Evolution Equations</i>, <i>24</i>(2), Article 34. <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">https://doi.org/10.1007/s00028-024-00959-6</a>","short":"E. Papageorgiou, Journal of Evolution Equations 24 (2024).","mla":"Papageorgiou, Efthymia. “Asymptotic Behavior of Solutions to the Extension Problem for the Fractional Laplacian on Noncompact Symmetric Spaces.” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, 34, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>.","bibtex":"@article{Papageorgiou_2024, title={Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces}, volume={24}, DOI={<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>}, number={234}, journal={Journal of Evolution Equations}, publisher={Springer Science and Business Media LLC}, author={Papageorgiou, Efthymia}, year={2024} }","chicago":"Papageorgiou, Efthymia. “Asymptotic Behavior of Solutions to the Extension Problem for the Fractional Laplacian on Noncompact Symmetric Spaces.” <i>Journal of Evolution Equations</i> 24, no. 2 (2024). <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">https://doi.org/10.1007/s00028-024-00959-6</a>.","ieee":"E. Papageorgiou, “Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces,” <i>Journal of Evolution Equations</i>, vol. 24, no. 2, Art. no. 34, 2024, doi: <a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>.","ama":"Papageorgiou E. Asymptotic behavior of solutions to the extension problem for the fractional Laplacian on noncompact symmetric spaces. <i>Journal of Evolution Equations</i>. 2024;24(2). doi:<a href=\"https://doi.org/10.1007/s00028-024-00959-6\">10.1007/s00028-024-00959-6</a>"},"intvolume":"        24"},{"department":[{"_id":"360"}],"user_id":"31132","_id":"55191","language":[{"iso":"eng"}],"keyword":["Mathematics","Mathematik","Textbook","Curriculum Resources","Schulbuch"],"publication":"Proceedings of the 14th International Congress on Mathematical Education","type":"conference","status":"public","volume":1,"date_created":"2024-07-12T06:58:06Z","author":[{"full_name":"Rezat, Sebastian","id":"31132","last_name":"Rezat","first_name":"Sebastian"},{"first_name":"Jana","full_name":"Visnovska, Jana","last_name":"Visnovska"},{"first_name":"Guorui","full_name":"Yan, Guorui","last_name":"Yan"},{"first_name":"Moneoang","last_name":"Leshota","full_name":"Leshota, Moneoang"},{"first_name":"Hussein","last_name":"Sabra","full_name":"Sabra, Hussein"}],"publisher":"World Scientific","date_updated":"2024-07-12T07:02:20Z","doi":"10.1142/9789811287152_0065","title":"Topic Study Group 41: Research and development on textbooks and resources for learning and teaching mathematics","publication_status":"published","intvolume":"         1","page":"537–545","citation":{"apa":"Rezat, S., Visnovska, J., Yan, G., Leshota, M., &#38; Sabra, H. (2024). Topic Study Group 41: Research and development on textbooks and resources for learning and teaching mathematics. <i>Proceedings of the 14th International Congress on Mathematical Education</i>, <i>1</i>, 537–545. <a href=\"https://doi.org/10.1142/9789811287152_0065\">https://doi.org/10.1142/9789811287152_0065</a>","mla":"Rezat, Sebastian, et al. “Topic Study Group 41: Research and Development on Textbooks and Resources for Learning and Teaching Mathematics.” <i>Proceedings of the 14th International Congress on Mathematical Education</i>, vol. 1, World Scientific, 2024, pp. 537–545, doi:<a href=\"https://doi.org/10.1142/9789811287152_0065\">10.1142/9789811287152_0065</a>.","bibtex":"@inproceedings{Rezat_Visnovska_Yan_Leshota_Sabra_2024, place={Shanghai, China}, title={Topic Study Group 41: Research and development on textbooks and resources for learning and teaching mathematics}, volume={1}, DOI={<a href=\"https://doi.org/10.1142/9789811287152_0065\">10.1142/9789811287152_0065</a>}, booktitle={Proceedings of the 14th International Congress on Mathematical Education}, publisher={World Scientific}, author={Rezat, Sebastian and Visnovska, Jana and Yan, Guorui and Leshota, Moneoang and Sabra, Hussein}, year={2024}, pages={537–545} }","short":"S. Rezat, J. Visnovska, G. Yan, M. Leshota, H. Sabra, in: Proceedings of the 14th International Congress on Mathematical Education, World Scientific, Shanghai, China, 2024, pp. 537–545.","ama":"Rezat S, Visnovska J, Yan G, Leshota M, Sabra H. Topic Study Group 41: Research and development on textbooks and resources for learning and teaching mathematics. In: <i>Proceedings of the 14th International Congress on Mathematical Education</i>. Vol 1. World Scientific; 2024:537–545. doi:<a href=\"https://doi.org/10.1142/9789811287152_0065\">10.1142/9789811287152_0065</a>","ieee":"S. Rezat, J. Visnovska, G. Yan, M. Leshota, and H. Sabra, “Topic Study Group 41: Research and development on textbooks and resources for learning and teaching mathematics,” in <i>Proceedings of the 14th International Congress on Mathematical Education</i>, 2024, vol. 1, pp. 537–545, doi: <a href=\"https://doi.org/10.1142/9789811287152_0065\">10.1142/9789811287152_0065</a>.","chicago":"Rezat, Sebastian, Jana Visnovska, Guorui Yan, Moneoang Leshota, and Hussein Sabra. “Topic Study Group 41: Research and Development on Textbooks and Resources for Learning and Teaching Mathematics.” In <i>Proceedings of the 14th International Congress on Mathematical Education</i>, 1:537–545. Shanghai, China: World Scientific, 2024. <a href=\"https://doi.org/10.1142/9789811287152_0065\">https://doi.org/10.1142/9789811287152_0065</a>."},"year":"2024","place":"Shanghai, China"},{"_id":"53300","user_id":"55911","department":[{"_id":"555"}],"article_number":"128125","keyword":["Applied Mathematics","Analysis"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Journal of Mathematical Analysis and Applications","status":"public","date_updated":"2024-09-03T14:40:46Z","publisher":"Elsevier BV","author":[{"first_name":"Dominik","id":"55911","full_name":"Brennecken, Dominik","last_name":"Brennecken"}],"date_created":"2024-04-05T13:55:33Z","volume":535,"title":"Hankel transform, K-Bessel functions and zeta distributions in the Dunkl setting","doi":"10.1016/j.jmaa.2024.128125","publication_status":"published","publication_identifier":{"issn":["0022-247X"]},"issue":"2","year":"2024","citation":{"short":"D. Brennecken, Journal of Mathematical Analysis and Applications 535 (2024).","mla":"Brennecken, Dominik. “Hankel Transform, K-Bessel Functions and Zeta Distributions in the Dunkl Setting.” <i>Journal of Mathematical Analysis and Applications</i>, vol. 535, no. 2, 128125, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.jmaa.2024.128125\">10.1016/j.jmaa.2024.128125</a>.","bibtex":"@article{Brennecken_2024, title={Hankel transform, K-Bessel functions and zeta distributions in the Dunkl setting}, volume={535}, DOI={<a href=\"https://doi.org/10.1016/j.jmaa.2024.128125\">10.1016/j.jmaa.2024.128125</a>}, number={2128125}, journal={Journal of Mathematical Analysis and Applications}, publisher={Elsevier BV}, author={Brennecken, Dominik}, year={2024} }","apa":"Brennecken, D. (2024). Hankel transform, K-Bessel functions and zeta distributions in the Dunkl setting. <i>Journal of Mathematical Analysis and Applications</i>, <i>535</i>(2), Article 128125. <a href=\"https://doi.org/10.1016/j.jmaa.2024.128125\">https://doi.org/10.1016/j.jmaa.2024.128125</a>","chicago":"Brennecken, Dominik. “Hankel Transform, K-Bessel Functions and Zeta Distributions in the Dunkl Setting.” <i>Journal of Mathematical Analysis and Applications</i> 535, no. 2 (2024). <a href=\"https://doi.org/10.1016/j.jmaa.2024.128125\">https://doi.org/10.1016/j.jmaa.2024.128125</a>.","ieee":"D. Brennecken, “Hankel transform, K-Bessel functions and zeta distributions in the Dunkl setting,” <i>Journal of Mathematical Analysis and Applications</i>, vol. 535, no. 2, Art. no. 128125, 2024, doi: <a href=\"https://doi.org/10.1016/j.jmaa.2024.128125\">10.1016/j.jmaa.2024.128125</a>.","ama":"Brennecken D. Hankel transform, K-Bessel functions and zeta distributions in the Dunkl setting. <i>Journal of Mathematical Analysis and Applications</i>. 2024;535(2). doi:<a href=\"https://doi.org/10.1016/j.jmaa.2024.128125\">10.1016/j.jmaa.2024.128125</a>"},"intvolume":"       535"},{"type":"journal_article","publication":"Numerical Algorithms","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Image restoration via alternating direction method of multipliers (ADMM) has gained large interest within the last decade. Solving standard problems of Gaussian and Poisson noise, the set of “Total Variation” (TV)-based regularizers proved to be efficient and versatile. In the last few years, the “Total Generalized Variation” (TGV) approach combined TV regularizers of different orders adaptively to better suit local regions in the image. This improved the technique significantly. The approach solved the staircase problem inherent of the first-order TV while keeping the beneficial edge preservation. The iterative minimization for the augmented Lagrangian of TGV problems requires four important parameters: two penalty parameters <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\rho }$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:mi>ρ</mml:mi>\n              </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\eta }$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:mi>η</mml:mi>\n              </mml:math></jats:alternatives></jats:inline-formula> and two regularization parameters <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\lambda _{0}}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:msub>\n                  <mml:mi>λ</mml:mi>\n                  <mml:mn>0</mml:mn>\n                </mml:msub>\n              </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\lambda _{1}}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:msub>\n                  <mml:mi>λ</mml:mi>\n                  <mml:mn>1</mml:mn>\n                </mml:msub>\n              </mml:math></jats:alternatives></jats:inline-formula>. The choice of penalty parameters decides on the convergence speed, and the regularization parameters decide on the impact of the respective regularizer and are determined by the noise level in the image. For scientific applications of such algorithms, an automated and thus objective method to determine these parameters is essential to receive unbiased results independent of the user. Obviously, both sets of parameters are to be well chosen to achieve optimal results, too. In this paper, a method is proposed to adaptively choose optimal <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\rho }$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:mi>ρ</mml:mi>\n              </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\eta }$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:mi>η</mml:mi>\n              </mml:math></jats:alternatives></jats:inline-formula> values for the iteration to converge faster, based on the primal and dual residuals arising from the optimality conditions of the augmented Lagrangian. Further, we show how to choose <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\lambda _{0}}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:msub>\n                  <mml:mi>λ</mml:mi>\n                  <mml:mn>0</mml:mn>\n                </mml:msub>\n              </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\lambda _{1}}$$</jats:tex-math><mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\n                <mml:msub>\n                  <mml:mi>λ</mml:mi>\n                  <mml:mn>1</mml:mn>\n                </mml:msub>\n              </mml:math></jats:alternatives></jats:inline-formula> based on the inherent noise in the image.</jats:p>","lang":"eng"}],"status":"public","_id":"52089","user_id":"77496","department":[{"_id":"286"},{"_id":"15"}],"keyword":["Applied Mathematics"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1017-1398","1572-9265"]},"year":"2024","citation":{"apa":"Zietlow, C., &#38; Lindner, J. K. N. (2024). ADMM-TGV image restoration for scientific applications with unbiased parameter choice. <i>Numerical Algorithms</i>. <a href=\"https://doi.org/10.1007/s11075-024-01759-2\">https://doi.org/10.1007/s11075-024-01759-2</a>","mla":"Zietlow, Christian, and Jörg K. N. Lindner. “ADMM-TGV Image Restoration for Scientific Applications with Unbiased Parameter Choice.” <i>Numerical Algorithms</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s11075-024-01759-2\">10.1007/s11075-024-01759-2</a>.","short":"C. Zietlow, J.K.N. Lindner, Numerical Algorithms (2024).","bibtex":"@article{Zietlow_Lindner_2024, title={ADMM-TGV image restoration for scientific applications with unbiased parameter choice}, DOI={<a href=\"https://doi.org/10.1007/s11075-024-01759-2\">10.1007/s11075-024-01759-2</a>}, journal={Numerical Algorithms}, publisher={Springer Science and Business Media LLC}, author={Zietlow, Christian and Lindner, Jörg K. N.}, year={2024} }","ama":"Zietlow C, Lindner JKN. ADMM-TGV image restoration for scientific applications with unbiased parameter choice. <i>Numerical Algorithms</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s11075-024-01759-2\">10.1007/s11075-024-01759-2</a>","ieee":"C. Zietlow and J. K. N. Lindner, “ADMM-TGV image restoration for scientific applications with unbiased parameter choice,” <i>Numerical Algorithms</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s11075-024-01759-2\">10.1007/s11075-024-01759-2</a>.","chicago":"Zietlow, Christian, and Jörg K. N. Lindner. “ADMM-TGV Image Restoration for Scientific Applications with Unbiased Parameter Choice.” <i>Numerical Algorithms</i>, 2024. <a href=\"https://doi.org/10.1007/s11075-024-01759-2\">https://doi.org/10.1007/s11075-024-01759-2</a>."},"publisher":"Springer Science and Business Media LLC","date_updated":"2025-01-22T09:06:50Z","author":[{"first_name":"Christian","full_name":"Zietlow, Christian","last_name":"Zietlow"},{"last_name":"Lindner","full_name":"Lindner, Jörg K. N.","first_name":"Jörg K. N."}],"date_created":"2024-02-27T07:35:36Z","title":"ADMM-TGV image restoration for scientific applications with unbiased parameter choice","doi":"10.1007/s11075-024-01759-2"},{"page":"1185-1197","intvolume":"        32","citation":{"ama":"Boeddeker C, Subramanian AS, Wichern G, Haeb-Umbach R, Le Roux J. TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>. 2024;32:1185-1197. doi:<a href=\"https://doi.org/10.1109/taslp.2024.3350887\">10.1109/taslp.2024.3350887</a>","chicago":"Boeddeker, Christoph, Aswin Shanmugam Subramanian, Gordon Wichern, Reinhold Haeb-Umbach, and Jonathan Le Roux. “TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings.” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i> 32 (2024): 1185–97. <a href=\"https://doi.org/10.1109/taslp.2024.3350887\">https://doi.org/10.1109/taslp.2024.3350887</a>.","ieee":"C. Boeddeker, A. S. Subramanian, G. Wichern, R. Haeb-Umbach, and J. Le Roux, “TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings,” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, vol. 32, pp. 1185–1197, 2024, doi: <a href=\"https://doi.org/10.1109/taslp.2024.3350887\">10.1109/taslp.2024.3350887</a>.","bibtex":"@article{Boeddeker_Subramanian_Wichern_Haeb-Umbach_Le Roux_2024, title={TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings}, volume={32}, DOI={<a href=\"https://doi.org/10.1109/taslp.2024.3350887\">10.1109/taslp.2024.3350887</a>}, journal={IEEE/ACM Transactions on Audio, Speech, and Language Processing}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Boeddeker, Christoph and Subramanian, Aswin Shanmugam and Wichern, Gordon and Haeb-Umbach, Reinhold and Le Roux, Jonathan}, year={2024}, pages={1185–1197} }","mla":"Boeddeker, Christoph, et al. “TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings.” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, vol. 32, Institute of Electrical and Electronics Engineers (IEEE), 2024, pp. 1185–97, doi:<a href=\"https://doi.org/10.1109/taslp.2024.3350887\">10.1109/taslp.2024.3350887</a>.","short":"C. Boeddeker, A.S. Subramanian, G. Wichern, R. Haeb-Umbach, J. Le Roux, IEEE/ACM Transactions on Audio, Speech, and Language Processing 32 (2024) 1185–1197.","apa":"Boeddeker, C., Subramanian, A. S., Wichern, G., Haeb-Umbach, R., &#38; Le Roux, J. (2024). TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, <i>32</i>, 1185–1197. <a href=\"https://doi.org/10.1109/taslp.2024.3350887\">https://doi.org/10.1109/taslp.2024.3350887</a>"},"has_accepted_license":"1","publication_identifier":{"issn":["2329-9290","2329-9304"]},"publication_status":"published","doi":"10.1109/taslp.2024.3350887","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.03849"}],"date_updated":"2025-04-16T10:21:45Z","oa":"1","volume":32,"author":[{"full_name":"Boeddeker, Christoph","id":"40767","last_name":"Boeddeker","first_name":"Christoph"},{"first_name":"Aswin Shanmugam","last_name":"Subramanian","full_name":"Subramanian, Aswin Shanmugam"},{"last_name":"Wichern","full_name":"Wichern, Gordon","first_name":"Gordon"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"},{"last_name":"Le Roux","full_name":"Le Roux, Jonathan","first_name":"Jonathan"}],"status":"public","type":"journal_article","file_date_updated":"2025-04-16T10:21:45Z","_id":"52958","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"508","name":"Automatische Transkription von Gesprächssituationen","grant_number":"448568305"}],"department":[{"_id":"54"}],"user_id":"40767","year":"2024","title":"TS-SEP: Joint Diarization and Separation Conditioned on Estimated Speaker Embeddings","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2024-03-26T16:11:54Z","file":[{"relation":"main_file","content_type":"application/pdf","file_size":3432879,"file_name":"main.pdf","file_id":"59602","access_level":"open_access","date_updated":"2025-04-16T10:21:45Z","date_created":"2025-04-16T10:14:47Z","creator":"cbj"},{"date_updated":"2025-04-16T10:21:45Z","date_created":"2025-04-16T10:15:08Z","creator":"cbj","file_size":2838635,"access_level":"open_access","file_id":"59603","file_name":"slides.pdf","content_type":"application/pdf","relation":"main_file"},{"content_type":"application/pdf","relation":"main_file","date_created":"2025-04-16T10:15:22Z","creator":"cbj","date_updated":"2025-04-16T10:21:45Z","file_name":"poster.pdf","access_level":"open_access","file_id":"59604","file_size":2038741}],"publication":"IEEE/ACM Transactions on Audio, Speech, and Language Processing","keyword":["Electrical and Electronic Engineering","Acoustics and Ultrasonics","Computer Science (miscellaneous)","Computational Mathematics"],"ddc":["000"],"language":[{"iso":"eng"}]},{"department":[{"_id":"97"},{"_id":"643"}],"user_id":"32202","_id":"57895","file_date_updated":"2025-01-02T10:42:21Z","type":"conference","status":"public","editor":[{"full_name":"González-Martín, Alejandro S.","last_name":"González-Martín","first_name":"Alejandro S."},{"first_name":"Ghislaine","last_name":"Gueudet","full_name":"Gueudet, Ghislaine"},{"full_name":"Florensa, Ignasi","last_name":"Florensa","first_name":"Ignasi"},{"last_name":"Lombard","full_name":"Lombard, Nathan","first_name":"Nathan"}],"author":[{"first_name":"Max","orcid":"0000-0002-6964-7123","last_name":"Hoffmann","full_name":"Hoffmann, Max","id":"32202"},{"last_name":"Schlüter","full_name":"Schlüter, Sarah","first_name":"Sarah"}],"oa":"1","date_updated":"2025-01-02T10:45:59Z","main_file_link":[{"url":"https://indrum2024.sciencesconf.org/data/pages/Proceedings_INDRUM2024.pdf","open_access":"1"}],"has_accepted_license":"1","publication_status":"published","citation":{"ieee":"M. Hoffmann and S. Schlüter, “How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals?,” in <i>Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)</i>, 2024.","chicago":"Hoffmann, Max, and Sarah Schlüter. “How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals?” In <i>Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)</i>, edited by Alejandro S. González-Martín, Ghislaine Gueudet, Ignasi Florensa, and Nathan Lombard. Barcelona: Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM, 2024.","short":"M. Hoffmann, S. Schlüter, in: A.S. González-Martín, G. Gueudet, I. Florensa, N. Lombard (Eds.), Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024), Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM, Barcelona, 2024.","bibtex":"@inproceedings{Hoffmann_Schlüter_2024, place={Barcelona}, title={How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals?}, booktitle={Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)}, publisher={Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM}, author={Hoffmann, Max and Schlüter, Sarah}, editor={González-Martín, Alejandro S. and Gueudet, Ghislaine and Florensa, Ignasi and Lombard, Nathan}, year={2024} }","mla":"Hoffmann, Max, and Sarah Schlüter. “How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals?” <i>Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)</i>, edited by Alejandro S. González-Martín et al., Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM, 2024.","ama":"Hoffmann M, Schlüter S. How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals? In: González-Martín AS, Gueudet G, Florensa I, Lombard N, eds. <i>Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)</i>. Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM; 2024.","apa":"Hoffmann, M., &#38; Schlüter, S. (2024). How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals? In A. S. González-Martín, G. Gueudet, I. Florensa, &#38; N. Lombard (Eds.), <i>Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)</i>. Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM."},"place":"Barcelona","language":[{"iso":"eng"}],"keyword":["Teachers’ and students’ practices at university level","Transition to","across and from university mathematics","Teaching and learning of specific topics in university mathematics","Congruence","Quadrilaterals"],"ddc":["370","510"],"publication":"Proceedings of the Fifth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2024, 10-14 June 2024)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"maxh","date_created":"2025-01-02T10:42:21Z","date_updated":"2025-01-02T10:42:21Z","file_name":"2024_Hoffmann_Schlueter_CongruenceQuadrilaterals.pdf","file_id":"57896","access_level":"closed","file_size":315111}],"abstract":[{"text":"In our paper, we present a study in which we investigate which strategies pre-service teachers (PSTs) use to find and, if necessary, reject possible candidates for congruence theorems for quadrilaterals. This study was conducted before the PTSs attended a university geometry course. In this way, statements about learning prerequisites can be made. For the study, we analyzed group discussions of PSTs to identify typical approaches and evaluate them from a mathematical perspective. The results can be considered for the further development of courses for PSTs and generate hypotheses\r\nfor further research.","lang":"eng"}],"date_created":"2025-01-02T10:45:53Z","publisher":"Escola Univerist`aria Salesiana de Sarri`a – Univ. Aut`onoma de Barcelona and INDRUM","title":"How Do Advanced Pre-Service Teachers Develop Congruence Theorems for Quadrilaterals?","quality_controlled":"1","year":"2024"},{"doi":"10.1137/23m1561075","date_updated":"2023-11-29T10:52:23Z","volume":83,"author":[{"orcid":"0000-0002-8054-2058","last_name":"von der Gracht","id":"97359","full_name":"von der Gracht, Sören","first_name":"Sören"},{"first_name":"Eddie","full_name":"Nijholt, Eddie","last_name":"Nijholt"},{"full_name":"Rink, Bob","last_name":"Rink","first_name":"Bob"}],"page":"2329-2353","intvolume":"        83","citation":{"ama":"von der Gracht S, Nijholt E, Rink B. Hypernetworks: Cluster Synchronization Is a Higher-Order Effect. <i>SIAM Journal on Applied Mathematics</i>. 2023;83(6):2329-2353. doi:<a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>","chicago":"Gracht, Sören von der, Eddie Nijholt, and Bob Rink. “Hypernetworks: Cluster Synchronization Is a Higher-Order Effect.” <i>SIAM Journal on Applied Mathematics</i> 83, no. 6 (2023): 2329–53. <a href=\"https://doi.org/10.1137/23m1561075\">https://doi.org/10.1137/23m1561075</a>.","ieee":"S. von der Gracht, E. Nijholt, and B. Rink, “Hypernetworks: Cluster Synchronization Is a Higher-Order Effect,” <i>SIAM Journal on Applied Mathematics</i>, vol. 83, no. 6, pp. 2329–2353, 2023, doi: <a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>.","apa":"von der Gracht, S., Nijholt, E., &#38; Rink, B. (2023). Hypernetworks: Cluster Synchronization Is a Higher-Order Effect. <i>SIAM Journal on Applied Mathematics</i>, <i>83</i>(6), 2329–2353. <a href=\"https://doi.org/10.1137/23m1561075\">https://doi.org/10.1137/23m1561075</a>","short":"S. von der Gracht, E. Nijholt, B. Rink, SIAM Journal on Applied Mathematics 83 (2023) 2329–2353.","mla":"von der Gracht, Sören, et al. “Hypernetworks: Cluster Synchronization Is a Higher-Order Effect.” <i>SIAM Journal on Applied Mathematics</i>, vol. 83, no. 6, Society for Industrial &#38; Applied Mathematics (SIAM), 2023, pp. 2329–53, doi:<a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>.","bibtex":"@article{von der Gracht_Nijholt_Rink_2023, title={Hypernetworks: Cluster Synchronization Is a Higher-Order Effect}, volume={83}, DOI={<a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>}, number={6}, journal={SIAM Journal on Applied Mathematics}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}, year={2023}, pages={2329–2353} }"},"publication_identifier":{"issn":["0036-1399","1095-712X"]},"publication_status":"published","_id":"49326","department":[{"_id":"101"}],"user_id":"97359","status":"public","type":"journal_article","title":"Hypernetworks: Cluster Synchronization Is a Higher-Order Effect","publisher":"Society for Industrial & Applied Mathematics (SIAM)","date_created":"2023-11-29T10:50:05Z","year":"2023","issue":"6","keyword":["Applied Mathematics"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2302.08974"]},"abstract":[{"lang":"eng","text":"Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by defining a class of admissible maps for every such hypernetwork. We explain how to classify robust cluster synchronization patterns on hypernetworks by finding balanced partitions, and we generalize the concept of a graph fibration to the hypernetwork context. We also show that robust synchronization patterns are only fully determined by polynomial admissible maps of high order. This means that, unlike in dyadic networks, cluster synchronization on hypernetworks is a higher-order, i.e., nonlinear, effect. We give a formula, in terms of the order of the hypernetwork, for the degree of the polynomial admissible maps that determine robust synchronization patterns. We also demonstrate that this degree is optimal by investigating a class of examples. We conclude by demonstrating how this effect may cause remarkable synchrony breaking bifurcations that occur at high polynomial degree."}],"publication":"SIAM Journal on Applied Mathematics"},{"citation":{"chicago":"Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.” <i>SIAM Journal on Computing</i> 52, no. 4 (2023): 1009–38. <a href=\"https://doi.org/10.1137/22m1513721\">https://doi.org/10.1137/22m1513721</a>.","ieee":"S. Gharibian and F. Le Gall, “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture,” <i>SIAM Journal on Computing</i>, vol. 52, no. 4, pp. 1009–1038, 2023, doi: <a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>.","ama":"Gharibian S, Le Gall F. Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. <i>SIAM Journal on Computing</i>. 2023;52(4):1009-1038. doi:<a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>","apa":"Gharibian, S., &#38; Le Gall, F. (2023). Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. <i>SIAM Journal on Computing</i>, <i>52</i>(4), 1009–1038. <a href=\"https://doi.org/10.1137/22m1513721\">https://doi.org/10.1137/22m1513721</a>","short":"S. Gharibian, F. Le Gall, SIAM Journal on Computing 52 (2023) 1009–1038.","mla":"Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.” <i>SIAM Journal on Computing</i>, vol. 52, no. 4, Society for Industrial &#38; Applied Mathematics (SIAM), 2023, pp. 1009–38, doi:<a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>.","bibtex":"@article{Gharibian_Le Gall_2023, title={Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture}, volume={52}, DOI={<a href=\"https://doi.org/10.1137/22m1513721\">10.1137/22m1513721</a>}, number={4}, journal={SIAM Journal on Computing}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={Gharibian, Sevag and Le Gall, François}, year={2023}, pages={1009–1038} }"},"intvolume":"        52","page":"1009-1038","year":"2023","issue":"4","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"doi":"10.1137/22m1513721","title":"Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture","author":[{"first_name":"Sevag","id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian"},{"first_name":"François","last_name":"Le Gall","full_name":"Le Gall, François"}],"date_created":"2024-01-07T18:19:42Z","volume":52,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","date_updated":"2024-01-07T18:20:37Z","status":"public","type":"journal_article","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}],"keyword":["General Mathematics","General Computer Science"],"user_id":"71541","_id":"50271"},{"department":[{"_id":"63"}],"user_id":"44428","_id":"50458","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"extern":"1","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"publication":"Algorithmica","type":"journal_article","status":"public","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.</jats:p>"}],"author":[{"id":"88252","full_name":"Maack, Marten","last_name":"Maack","first_name":"Marten"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"}],"date_created":"2024-01-11T11:10:53Z","date_updated":"2024-01-11T11:19:33Z","publisher":"Springer Science and Business Media LLC","doi":"10.1007/s00453-023-01189-x","title":"Server Cloud Scheduling","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","citation":{"chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” <i>Algorithmica</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>"},"year":"2023"},{"status":"public","publication":"Discrete Applied Mathematics","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"department":[{"_id":"542"}],"user_id":"15540","_id":"51351","intvolume":"       337","page":"185-189","citation":{"ieee":"E. Steffen and I. H. Wolf, “Bounds for the chromatic index of signed multigraphs,” <i>Discrete Applied Mathematics</i>, vol. 337, pp. 185–189, 2023, doi: <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>.","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.” <i>Discrete Applied Mathematics</i> 337 (2023): 185–89. <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">https://doi.org/10.1016/j.dam.2023.05.008</a>.","ama":"Steffen E, Wolf IH. Bounds for the chromatic index of signed multigraphs. <i>Discrete Applied Mathematics</i>. 2023;337:185-189. doi:<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Bounds for the chromatic index of signed multigraphs. <i>Discrete Applied Mathematics</i>, <i>337</i>, 185–189. <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">https://doi.org/10.1016/j.dam.2023.05.008</a>","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.” <i>Discrete Applied Mathematics</i>, vol. 337, Elsevier BV, 2023, pp. 185–89, doi:<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>.","short":"E. Steffen, I.H. Wolf, Discrete Applied Mathematics 337 (2023) 185–189.","bibtex":"@article{Steffen_Wolf_2023, title={Bounds for the chromatic index of signed multigraphs}, volume={337}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>}, journal={Discrete Applied Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023}, pages={185–189} }"},"year":"2023","publication_identifier":{"issn":["0166-218X"]},"publication_status":"published","doi":"10.1016/j.dam.2023.05.008","title":"Bounds for the chromatic index of signed multigraphs","volume":337,"date_created":"2024-02-14T17:33:29Z","author":[{"orcid":"0000-0002-9808-7401","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548","first_name":"Eckhard"},{"full_name":"Wolf, Isaak Hieronymus","id":"88145","last_name":"Wolf","first_name":"Isaak Hieronymus"}],"date_updated":"2024-02-14T17:33:59Z","publisher":"Elsevier BV"},{"title":"Rotation r-graphs","doi":"10.1016/j.disc.2023.113457","date_updated":"2024-02-16T08:45:10Z","publisher":"Elsevier BV","author":[{"id":"15548","full_name":"Steffen, Eckhard","orcid":"0000-0002-9808-7401","last_name":"Steffen","first_name":"Eckhard"},{"first_name":"Isaak Hieronymus","full_name":"Wolf, Isaak Hieronymus","id":"88145","last_name":"Wolf"}],"date_created":"2024-02-16T08:44:50Z","year":"2023","citation":{"bibtex":"@article{Steffen_Wolf_2023, title={Rotation r-graphs}, DOI={<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>}, number={113457}, journal={Discrete Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023} }","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 113457, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>.","short":"E. Steffen, I.H. Wolf, Discrete Mathematics (2023).","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Rotation r-graphs. <i>Discrete Mathematics</i>, Article 113457. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 2023. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>.","ieee":"E. Steffen and I. H. Wolf, “Rotation r-graphs,” <i>Discrete Mathematics</i>, Art. no. 113457, 2023, doi: <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>.","ama":"Steffen E, Wolf IH. Rotation r-graphs. <i>Discrete Mathematics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>"},"publication_identifier":{"issn":["0012-365X"]},"publication_status":"published","keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"article_number":"113457","language":[{"iso":"eng"}],"_id":"51357","department":[{"_id":"542"}],"user_id":"15540","status":"public","publication":"Discrete Mathematics","type":"journal_article"},{"citation":{"apa":"Gilbert, H., Schürmann, M., Liebendörfer, M., Lawson, D., &#38; Hodds, M. (2023). Post-pandemic online mathematics and statistics support: Practitioners’ opinions in Germany and Great Britain &#38;amp; Ireland. <i>International Journal of Mathematical Education in Science and Technology</i>, 1–26. <a href=\"https://doi.org/10.1080/0020739x.2023.2184282\">https://doi.org/10.1080/0020739x.2023.2184282</a>","bibtex":"@article{Gilbert_Schürmann_Liebendörfer_Lawson_Hodds_2023, title={Post-pandemic online mathematics and statistics support: Practitioners’ opinions in Germany and Great Britain &#38;amp; Ireland}, DOI={<a href=\"https://doi.org/10.1080/0020739x.2023.2184282\">10.1080/0020739x.2023.2184282</a>}, journal={International Journal of Mathematical Education in Science and Technology}, publisher={Informa UK Limited}, author={Gilbert, H. and Schürmann, M. and Liebendörfer, M. and Lawson, D. and Hodds, M.}, year={2023}, pages={1–26} }","short":"H. Gilbert, M. Schürmann, M. Liebendörfer, D. Lawson, M. Hodds, International Journal of Mathematical Education in Science and Technology (2023) 1–26.","mla":"Gilbert, H., et al. “Post-Pandemic Online Mathematics and Statistics Support: Practitioners’ Opinions in Germany and Great Britain &#38;amp; Ireland.” <i>International Journal of Mathematical Education in Science and Technology</i>, Informa UK Limited, 2023, pp. 1–26, doi:<a href=\"https://doi.org/10.1080/0020739x.2023.2184282\">10.1080/0020739x.2023.2184282</a>.","ieee":"H. Gilbert, M. Schürmann, M. Liebendörfer, D. Lawson, and M. Hodds, “Post-pandemic online mathematics and statistics support: Practitioners’ opinions in Germany and Great Britain &#38;amp; Ireland,” <i>International Journal of Mathematical Education in Science and Technology</i>, pp. 1–26, 2023, doi: <a href=\"https://doi.org/10.1080/0020739x.2023.2184282\">10.1080/0020739x.2023.2184282</a>.","chicago":"Gilbert, H., M. Schürmann, M. Liebendörfer, D. Lawson, and M. Hodds. “Post-Pandemic Online Mathematics and Statistics Support: Practitioners’ Opinions in Germany and Great Britain &#38;amp; Ireland.” <i>International Journal of Mathematical Education in Science and Technology</i>, 2023, 1–26. <a href=\"https://doi.org/10.1080/0020739x.2023.2184282\">https://doi.org/10.1080/0020739x.2023.2184282</a>.","ama":"Gilbert H, Schürmann M, Liebendörfer M, Lawson D, Hodds M. Post-pandemic online mathematics and statistics support: Practitioners’ opinions in Germany and Great Britain &#38;amp; Ireland. <i>International Journal of Mathematical Education in Science and Technology</i>. Published online 2023:1-26. doi:<a href=\"https://doi.org/10.1080/0020739x.2023.2184282\">10.1080/0020739x.2023.2184282</a>"},"page":"1-26","year":"2023","publication_status":"published","publication_identifier":{"issn":["0020-739X","1464-5211"]},"doi":"10.1080/0020739x.2023.2184282","title":"Post-pandemic online mathematics and statistics support: Practitioners’ opinions in Germany and Great Britain &amp; Ireland","author":[{"last_name":"Gilbert","full_name":"Gilbert, H.","first_name":"H."},{"last_name":"Schürmann","full_name":"Schürmann, M.","first_name":"M."},{"full_name":"Liebendörfer, M.","last_name":"Liebendörfer","first_name":"M."},{"first_name":"D.","full_name":"Lawson, D.","last_name":"Lawson"},{"first_name":"M.","last_name":"Hodds","full_name":"Hodds, M."}],"date_created":"2024-03-25T10:02:09Z","publisher":"Informa UK Limited","date_updated":"2024-03-25T10:09:21Z","status":"public","type":"journal_article","publication":"International Journal of Mathematical Education in Science and Technology","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Education","Mathematics (miscellaneous)"],"user_id":"30933","department":[{"_id":"10"},{"_id":"625"},{"_id":"34"},{"_id":"97"},{"_id":"98"}],"_id":"52806"},{"date_created":"2023-07-10T12:32:10Z","author":[{"last_name":"Bartels","full_name":"Bartels, Sören","first_name":"Sören"},{"first_name":"Balázs","last_name":"Kovács","orcid":"0000-0001-9872-3474","full_name":"Kovács, Balázs","id":"100441"},{"first_name":"Zhangxian","full_name":"Wang, Zhangxian","last_name":"Wang"}],"publisher":"Oxford University Press (OUP)","date_updated":"2024-04-03T09:15:27Z","doi":"10.1093/imanum/drad037","title":"Error analysis for the numerical approximation of the harmonic map heat flow with nodal constraints","publication_identifier":{"issn":["0272-4979","1464-3642"]},"publication_status":"published","citation":{"mla":"Bartels, Sören, et al. “Error Analysis for the Numerical Approximation of the Harmonic Map Heat Flow with Nodal Constraints.” <i>IMA Journal of Numerical Analysis</i>, Oxford University Press (OUP), 2023, doi:<a href=\"https://doi.org/10.1093/imanum/drad037\">10.1093/imanum/drad037</a>.","short":"S. Bartels, B. Kovács, Z. Wang, IMA Journal of Numerical Analysis (2023).","bibtex":"@article{Bartels_Kovács_Wang_2023, title={Error analysis for the numerical approximation of the harmonic map heat flow with nodal constraints}, DOI={<a href=\"https://doi.org/10.1093/imanum/drad037\">10.1093/imanum/drad037</a>}, journal={IMA Journal of Numerical Analysis}, publisher={Oxford University Press (OUP)}, author={Bartels, Sören and Kovács, Balázs and Wang, Zhangxian}, year={2023} }","apa":"Bartels, S., Kovács, B., &#38; Wang, Z. (2023). Error analysis for the numerical approximation of the harmonic map heat flow with nodal constraints. <i>IMA Journal of Numerical Analysis</i>. <a href=\"https://doi.org/10.1093/imanum/drad037\">https://doi.org/10.1093/imanum/drad037</a>","chicago":"Bartels, Sören, Balázs Kovács, and Zhangxian Wang. “Error Analysis for the Numerical Approximation of the Harmonic Map Heat Flow with Nodal Constraints.” <i>IMA Journal of Numerical Analysis</i>, 2023. <a href=\"https://doi.org/10.1093/imanum/drad037\">https://doi.org/10.1093/imanum/drad037</a>.","ieee":"S. Bartels, B. Kovács, and Z. Wang, “Error analysis for the numerical approximation of the harmonic map heat flow with nodal constraints,” <i>IMA Journal of Numerical Analysis</i>, 2023, doi: <a href=\"https://doi.org/10.1093/imanum/drad037\">10.1093/imanum/drad037</a>.","ama":"Bartels S, Kovács B, Wang Z. Error analysis for the numerical approximation of the harmonic map heat flow with nodal constraints. <i>IMA Journal of Numerical Analysis</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1093/imanum/drad037\">10.1093/imanum/drad037</a>"},"year":"2023","department":[{"_id":"841"}],"user_id":"100441","_id":"45971","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computational Mathematics","General Mathematics"],"publication":"IMA Journal of Numerical Analysis","type":"journal_article","status":"public","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>An error estimate for a canonical discretization of the harmonic map heat flow into spheres is derived. The numerical scheme uses standard finite elements with a nodal treatment of linearized unit-length constraints. The analysis is based on elementary approximation results and only uses the discrete weak formulation.</jats:p>"}]}]
