@article{53315,
  abstract     = {{<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
<jats:disp-formula />is shown to hold for any positive  fulfilling
<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>}},
  author       = {{Wang, Yulan and Winkler, Michael}},
  issn         = {{0024-6107}},
  journal      = {{Journal of the London Mathematical Society}},
  keywords     = {{General Mathematics}},
  number       = {{3}},
  publisher    = {{Wiley}},
  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}},
  volume       = {{109}},
  year         = {{2024}},
}

@article{45971,
  abstract     = {{<jats:title>Abstract</jats:title>
               <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>}},
  author       = {{Bartels, Sören and Kovács, Balázs and Wang, Zhangxian}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Error analysis for the numerical approximation of the harmonic map heat flow with nodal constraints}}},
  doi          = {{10.1093/imanum/drad037}},
  year         = {{2023}},
}

@article{53326,
  author       = {{Li, Genglin and Winkler, Michael}},
  issn         = {{1539-6746}},
  journal      = {{Communications in Mathematical Sciences}},
  keywords     = {{Applied Mathematics, General Mathematics}},
  number       = {{2}},
  pages        = {{299--322}},
  publisher    = {{International Press of Boston}},
  title        = {{{Relaxation in a Keller-Segel-consumption system involving signal-dependent motilities}}},
  doi          = {{10.4310/cms.2023.v21.n2.a1}},
  volume       = {{21}},
  year         = {{2023}},
}

@article{53343,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>The Cauchy problem in <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_001.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:msup>
                              <m:mrow>
                                 <m:mi mathvariant="double-struck">R</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>n</m:mi>
                              </m:mrow>
                           </m:msup>
                        </m:math>
                        <jats:tex-math>{{\mathbb{R}}}^{n}</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>, <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_002.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi>n</m:mi>
                           <m:mo>≥</m:mo>
                           <m:mn>2</m:mn>
                        </m:math>
                        <jats:tex-math>n\ge 2</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>, for <jats:disp-formula id="j_math-2022-0578_eq_001">
                     <jats:alternatives>
                        <jats:graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_003.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block">
                           <m:mtable displaystyle="true">
                              <m:mtr>
                                 <m:mtd columnalign="right">
                                    <m:mfenced open="{" close="">
                                       <m:mrow>
                                          <m:mspace depth="1.25em" />
                                          <m:mtable displaystyle="true">
                                             <m:mtr>
                                                <m:mtd columnalign="left">
                                                   <m:msub>
                                                      <m:mrow>
                                                         <m:mi>u</m:mi>
                                                      </m:mrow>
                                                      <m:mrow>
                                                         <m:mi>t</m:mi>
                                                      </m:mrow>
                                                   </m:msub>
                                                   <m:mo>=</m:mo>
                                                   <m:mi mathvariant="normal">Δ</m:mi>
                                                   <m:mi>u</m:mi>
                                                   <m:mo>−</m:mo>
                                                   <m:mrow>
                                                      <m:mo>∇</m:mo>
                                                   </m:mrow>
                                                   <m:mo>⋅</m:mo>
                                                   <m:mrow>
                                                      <m:mo>(</m:mo>
                                                      <m:mrow>
                                                         <m:mi>u</m:mi>
                                                         <m:mi>S</m:mi>
                                                         <m:mo>⋅</m:mo>
                                                         <m:mrow>
                                                            <m:mo>∇</m:mo>
                                                         </m:mrow>
                                                         <m:mi>v</m:mi>
                                                      </m:mrow>
                                                      <m:mo>)</m:mo>
                                                   </m:mrow>
                                                   <m:mo>,</m:mo>
                                                </m:mtd>
                                             </m:mtr>
                                             <m:mtr>
                                                <m:mtd columnalign="left">
                                                   <m:mn>0</m:mn>
                                                   <m:mo>=</m:mo>
                                                   <m:mi mathvariant="normal">Δ</m:mi>
                                                   <m:mi>v</m:mi>
                                                   <m:mo>+</m:mo>
                                                   <m:mi>u</m:mi>
                                                   <m:mo>,</m:mo>
                                                </m:mtd>
                                             </m:mtr>
                                          </m:mtable>
                                       </m:mrow>
                                    </m:mfenced>
                                    <m:mspace width="2.0em" />
                                    <m:mspace width="2.0em" />
                                    <m:mspace width="2.0em" />
                                    <m:mrow>
                                       <m:mo>(</m:mo>
                                       <m:mrow>
                                          <m:mo>⋆</m:mo>
                                       </m:mrow>
                                       <m:mo>)</m:mo>
                                    </m:mrow>
                                 </m:mtd>
                              </m:mtr>
                           </m:mtable>
                        </m:math>
                        <jats:tex-math>\begin{array}{r}\left\{\phantom{\rule[-1.25em]{}{0ex}}\begin{array}{l}{u}_{t}=\Delta u-\nabla \cdot \left(uS\cdot \nabla v),\\ 0=\Delta v+u,\end{array}\right.\hspace{2.0em}\hspace{2.0em}\hspace{2.0em}\left(\star )\end{array}</jats:tex-math>
                     </jats:alternatives>
                  </jats:disp-formula> is considered for general matrices <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_004.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi>S</m:mi>
                           <m:mo>∈</m:mo>
                           <m:msup>
                              <m:mrow>
                                 <m:mi mathvariant="double-struck">R</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>n</m:mi>
                                 <m:mo>×</m:mo>
                                 <m:mi>n</m:mi>
                              </m:mrow>
                           </m:msup>
                        </m:math>
                        <jats:tex-math>S\in {{\mathbb{R}}}^{n\times n}</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>. A theory of local-in-time classical existence and extensibility is developed in a framework that differs from those considered in large parts of the literature by involving bounded classical solutions. Specifically, it is shown that for all non-negative initial data belonging to <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_005.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi mathvariant="normal">BUC</m:mi>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:msup>
                                    <m:mrow>
                                       <m:mi mathvariant="double-struck">R</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>n</m:mi>
                                    </m:mrow>
                                 </m:msup>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                           <m:mo>∩</m:mo>
                           <m:msup>
                              <m:mrow>
                                 <m:mi>L</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>p</m:mi>
                              </m:mrow>
                           </m:msup>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:msup>
                                    <m:mrow>
                                       <m:mi mathvariant="double-struck">R</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>n</m:mi>
                                    </m:mrow>
                                 </m:msup>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>{\rm{BUC}}\left({{\mathbb{R}}}^{n})\cap {L}^{p}\left({{\mathbb{R}}}^{n})</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula> with some <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_006.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi>p</m:mi>
                           <m:mo>∈</m:mo>
                           <m:mrow>
                              <m:mo>[</m:mo>
                              <m:mrow>
                                 <m:mn>1</m:mn>
                                 <m:mo>,</m:mo>
                                 <m:mi>n</m:mi>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>p\in \left[1,n)</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>, there exist <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_007.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:msub>
                              <m:mrow>
                                 <m:mi>T</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>max</m:mi>
                              </m:mrow>
                           </m:msub>
                           <m:mo>∈</m:mo>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:mn>0</m:mn>
                                 <m:mo>,</m:mo>
                                 <m:mi>∞</m:mi>
                              </m:mrow>
                              <m:mo>]</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>{T}_{\max }\in \left(0,\infty ]</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula> and a uniquely determined <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_008.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi>u</m:mi>
                           <m:mo>∈</m:mo>
                           <m:msup>
                              <m:mrow>
                                 <m:mi>C</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mn>0</m:mn>
                              </m:mrow>
                           </m:msup>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:mrow>
                                    <m:mo>[</m:mo>
                                    <m:mrow>
                                       <m:mn>0</m:mn>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mrow>
                                             <m:mi>T</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>max</m:mi>
                                          </m:mrow>
                                       </m:msub>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                                 <m:mo>;</m:mo>
                                 <m:mspace width="0.33em" />
                                 <m:mi mathvariant="normal">BUC</m:mi>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:msup>
                                          <m:mrow>
                                             <m:mi mathvariant="double-struck">R</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>n</m:mi>
                                          </m:mrow>
                                       </m:msup>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                           <m:mo>∩</m:mo>
                           <m:msup>
                              <m:mrow>
                                 <m:mi>C</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mn>0</m:mn>
                              </m:mrow>
                           </m:msup>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:mrow>
                                    <m:mo>[</m:mo>
                                    <m:mrow>
                                       <m:mn>0</m:mn>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mrow>
                                             <m:mi>T</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>max</m:mi>
                                          </m:mrow>
                                       </m:msub>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                                 <m:mo>;</m:mo>
                                 <m:mspace width="0.33em" />
                                 <m:msup>
                                    <m:mrow>
                                       <m:mi>L</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>p</m:mi>
                                    </m:mrow>
                                 </m:msup>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:msup>
                                          <m:mrow>
                                             <m:mi mathvariant="double-struck">R</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>n</m:mi>
                                          </m:mrow>
                                       </m:msup>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                           <m:mo>∩</m:mo>
                           <m:msup>
                              <m:mrow>
                                 <m:mi>C</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>∞</m:mi>
                              </m:mrow>
                           </m:msup>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:msup>
                                    <m:mrow>
                                       <m:mi mathvariant="double-struck">R</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>n</m:mi>
                                    </m:mrow>
                                 </m:msup>
                                 <m:mo>×</m:mo>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:mn>0</m:mn>
                                       <m:mo>,</m:mo>
                                       <m:msub>
                                          <m:mrow>
                                             <m:mi>T</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>max</m:mi>
                                          </m:mrow>
                                       </m:msub>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>u\in {C}^{0}\left(\left[0,{T}_{\max });\hspace{0.33em}{\rm{BUC}}\left({{\mathbb{R}}}^{n}))\cap {C}^{0}\left(\left[0,{T}_{\max });\hspace{0.33em}{L}^{p}\left({{\mathbb{R}}}^{n}))\cap {C}^{\infty }\left({{\mathbb{R}}}^{n}\times \left(0,{T}_{\max }))</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula> such that with <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_009.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi>v</m:mi>
                           <m:mo>≔</m:mo>
                           <m:mi mathvariant="normal">Γ</m:mi>
                           <m:mo>⋆</m:mo>
                           <m:mi>u</m:mi>
                        </m:math>
                        <jats:tex-math>v:= \Gamma \star u</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>, and with <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_010.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mi mathvariant="normal">Γ</m:mi>
                        </m:math>
                        <jats:tex-math>\Gamma </jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula> denoting the Newtonian kernel on <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_011.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:msup>
                              <m:mrow>
                                 <m:mi mathvariant="double-struck">R</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>n</m:mi>
                              </m:mrow>
                           </m:msup>
                        </m:math>
                        <jats:tex-math>{{\mathbb{R}}}^{n}</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>, the pair <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_012.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:mi>u</m:mi>
                                 <m:mo>,</m:mo>
                                 <m:mi>v</m:mi>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>\left(u,v)</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula> forms a classical solution of (<jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_013.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mo>⋆</m:mo>
                        </m:math>
                        <jats:tex-math>\star </jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>) in <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_014.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:msup>
                              <m:mrow>
                                 <m:mi mathvariant="double-struck">R</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>n</m:mi>
                              </m:mrow>
                           </m:msup>
                           <m:mo>×</m:mo>
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:mn>0</m:mn>
                                 <m:mo>,</m:mo>
                                 <m:msub>
                                    <m:mrow>
                                       <m:mi>T</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>max</m:mi>
                                    </m:mrow>
                                 </m:msub>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>{{\mathbb{R}}}^{n}\times \left(0,{T}_{\max })</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>, which has the property that <jats:disp-formula id="j_math-2022-0578_eq_002">
                     <jats:alternatives>
                        <jats:graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_015.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block">
                           <m:mspace width="0.1em" />
                           <m:mtext>if</m:mtext>
                           <m:mspace width="0.1em" />
                           <m:mspace width="0.33em" />
                           <m:msub>
                              <m:mrow>
                                 <m:mi>T</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>max</m:mi>
                              </m:mrow>
                           </m:msub>
                           <m:mo>&lt;</m:mo>
                           <m:mi>∞</m:mi>
                           <m:mo>,</m:mo>
                           <m:mspace width="1.0em" />
                           <m:mstyle>
                              <m:mspace width="0.1em" />
                              <m:mtext>then both</m:mtext>
                              <m:mspace width="0.1em" />
                           </m:mstyle>
                           <m:mspace width="0.33em" />
                           <m:munder>
                              <m:mrow>
                                 <m:mi>limsup</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>t</m:mi>
                                 <m:mo>↗</m:mo>
                                 <m:msub>
                                    <m:mrow>
                                       <m:mi>T</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>max</m:mi>
                                    </m:mrow>
                                 </m:msub>
                              </m:mrow>
                           </m:munder>
                           <m:msub>
                              <m:mrow>
                                 <m:mo>‖</m:mo>
                                 <m:mi>u</m:mi>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:mo>⋅</m:mo>
                                       <m:mo>,</m:mo>
                                       <m:mi>t</m:mi>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                                 <m:mo>‖</m:mo>
                              </m:mrow>
                              <m:mrow>
                                 <m:msup>
                                    <m:mrow>
                                       <m:mi>L</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>∞</m:mi>
                                    </m:mrow>
                                 </m:msup>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:msup>
                                          <m:mrow>
                                             <m:mi mathvariant="double-struck">R</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>n</m:mi>
                                          </m:mrow>
                                       </m:msup>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                              </m:mrow>
                           </m:msub>
                           <m:mo>=</m:mo>
                           <m:mi>∞</m:mi>
                           <m:mspace width="1.0em" />
                           <m:mspace width="0.1em" />
                           <m:mtext>and</m:mtext>
                           <m:mspace width="0.1em" />
                           <m:mspace width="1.0em" />
                           <m:munder>
                              <m:mrow>
                                 <m:mi>limsup</m:mi>
                              </m:mrow>
                              <m:mrow>
                                 <m:mi>t</m:mi>
                                 <m:mo>↗</m:mo>
                                 <m:msub>
                                    <m:mrow>
                                       <m:mi>T</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>max</m:mi>
                                    </m:mrow>
                                 </m:msub>
                              </m:mrow>
                           </m:munder>
                           <m:msub>
                              <m:mrow>
                                 <m:mo>‖</m:mo>
                                 <m:mrow>
                                    <m:mo>∇</m:mo>
                                 </m:mrow>
                                 <m:mi>v</m:mi>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:mo>⋅</m:mo>
                                       <m:mo>,</m:mo>
                                       <m:mi>t</m:mi>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                                 <m:mo>‖</m:mo>
                              </m:mrow>
                              <m:mrow>
                                 <m:msup>
                                    <m:mrow>
                                       <m:mi>L</m:mi>
                                    </m:mrow>
                                    <m:mrow>
                                       <m:mi>∞</m:mi>
                                    </m:mrow>
                                 </m:msup>
                                 <m:mrow>
                                    <m:mo>(</m:mo>
                                    <m:mrow>
                                       <m:msup>
                                          <m:mrow>
                                             <m:mi mathvariant="double-struck">R</m:mi>
                                          </m:mrow>
                                          <m:mrow>
                                             <m:mi>n</m:mi>
                                          </m:mrow>
                                       </m:msup>
                                    </m:mrow>
                                    <m:mo>)</m:mo>
                                 </m:mrow>
                              </m:mrow>
                           </m:msub>
                           <m:mo>=</m:mo>
                           <m:mi>∞</m:mi>
                           <m:mo>.</m:mo>
                        </m:math>
                        <jats:tex-math>\hspace{0.1em}\text{if}\hspace{0.1em}\hspace{0.33em}{T}_{\max }\lt \infty ,\hspace{1.0em}\hspace{0.1em}\text{then both}\hspace{0.1em}\hspace{0.33em}\mathop{\mathrm{limsup}}\limits_{t\nearrow {T}_{\max }}\Vert u\left(\cdot ,t){\Vert }_{{L}^{\infty }\left({{\mathbb{R}}}^{n})}=\infty \hspace{1.0em}\hspace{0.1em}\text{and}\hspace{0.1em}\hspace{1.0em}\mathop{\mathrm{limsup}}\limits_{t\nearrow {T}_{\max }}\Vert \nabla v\left(\cdot ,t){\Vert }_{{L}^{\infty }\left({{\mathbb{R}}}^{n})}=\infty .</jats:tex-math>
                     </jats:alternatives>
                  </jats:disp-formula> An exemplary application of this provides a result on global classical solvability in cases when <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_016.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mo>∣</m:mo>
                           <m:mi>S</m:mi>
                           <m:mo>+</m:mo>
                           <m:mn mathvariant="bold">1</m:mn>
                           <m:mo>∣</m:mo>
                        </m:math>
                        <jats:tex-math>| S+{\bf{1}}| </jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula> is sufficiently small, where <jats:inline-formula>
                     <jats:alternatives>
                        <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2022-0578_eq_017.png" />
                        <m:math xmlns:m="http://www.w3.org/1998/Math/MathML">
                           <m:mn mathvariant="bold">1</m:mn>
                           <m:mo>=</m:mo>
                           <m:mi mathvariant="normal">diag</m:mi>
                           <m:mspace width="0.33em" />
                           <m:mrow>
                              <m:mo>(</m:mo>
                              <m:mrow>
                                 <m:mn>1</m:mn>
                                 <m:mo>,</m:mo>
                                 <m:mrow>
                                    <m:mo>…</m:mo>
                                 </m:mrow>
                                 <m:mo>,</m:mo>
                                 <m:mn>1</m:mn>
                              </m:mrow>
                              <m:mo>)</m:mo>
                           </m:mrow>
                        </m:math>
                        <jats:tex-math>{\bf{1}}={\rm{diag}}\hspace{0.33em}\left(1,\ldots ,1)</jats:tex-math>
                     </jats:alternatives>
                  </jats:inline-formula>.</jats:p>}},
  author       = {{Winkler, Michael}},
  issn         = {{2391-5455}},
  journal      = {{Open Mathematics}},
  keywords     = {{General Mathematics}},
  number       = {{1}},
  publisher    = {{Walter de Gruyter GmbH}},
  title        = {{{Classical solutions to Cauchy problems for parabolic–elliptic systems of Keller-Segel type}}},
  doi          = {{10.1515/math-2022-0578}},
  volume       = {{21}},
  year         = {{2023}},
}

@article{53339,
  abstract     = {{<jats:p>The chemotaxis‐Stokes system 
<jats:disp-formula>

</jats:disp-formula>is considered along with homogeneous boundary conditions of no‐flux type for 
 and 
, and of Dirichlet type for 
, in a smoothly bounded domain 
. Under the assumption that 
, that 
 is bounded on each of the intervals 
 with arbitrary 
, and that with some 
 and 
, we have 
<jats:disp-formula>

</jats:disp-formula>It is shown that for any suitably regular initial data, an associated initial‐boundary value problem admits a global very weak solution.</jats:p>}},
  author       = {{Tian, Yu and Winkler, Michael}},
  issn         = {{0170-4214}},
  journal      = {{Mathematical Methods in the Applied Sciences}},
  keywords     = {{General Engineering, General Mathematics}},
  number       = {{14}},
  pages        = {{15667--15683}},
  publisher    = {{Wiley}},
  title        = {{{Keller–Segel–Stokes interaction involving signal‐dependent motilities}}},
  doi          = {{10.1002/mma.9419}},
  volume       = {{46}},
  year         = {{2023}},
}

@article{53538,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We study harmonic maps from a subset of the complex plane to a subset of the hyperbolic plane. In Fotiadis and Daskaloyannis (Nonlinear Anal 214, 112546, 2022), harmonic maps are related to the sinh-Gordon equation and a Bäcklund transformation is introduced, which connects solutions of the sinh-Gordon and sine-Gordon equation. We develop this machinery in order to construct new harmonic maps to the hyperbolic plane.</jats:p>}},
  author       = {{Polychrou, G. and Papageorgiou, Efthymia and Fotiadis, A. and Daskaloyannis, C.}},
  issn         = {{1139-1138}},
  journal      = {{Revista Matemática Complutense}},
  keywords     = {{General Mathematics}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{New examples of harmonic maps to the hyperbolic plane via Bäcklund transformation}}},
  doi          = {{10.1007/s13163-023-00476-z}},
  year         = {{2023}},
}

@article{45786,
  abstract     = {{Intending to counteract Klein’s second discontinuity in teacher education, we explored and applied the innovation of “interface ePortfolio” in the context of a geometry course for preservice teachers (PSTs). The tool offers the possibility of implementing the design principle of profession orientation. In the article, we theoretically clarify what we understand by this principle and locate our innovative concept against this theoretical background. We empirically investigate the extent to which counteraction against the second discontinuity is successful by analyzing reflection texts created in the interface ePortfolio, focusing on PSTs’ perspectives. Our qualitative content analysis shows that most of them perceive the innovation as helpful in the intended sense and indicates that the course concept, in general, and the interface ePortfolio, in particular, have helped establish relevant links between the course content and their later work as teachers.}},
  author       = {{Hoffmann, Max and Biehler, Rolf}},
  issn         = {{1863-9690}},
  journal      = {{ZDM – Mathematics Education}},
  keywords     = {{General Mathematics, Education}},
  publisher    = {{Springer}},
  title        = {{{Implementing profession orientation as a design principle for overcoming Klein’s second discontinuity – preservice teacher’s perspectives on interface activities in the context of a geometry course}}},
  doi          = {{10.1007/s11858-023-01505-3}},
  year         = {{2023}},
}

@article{46569,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>External visualization (i.e., physically embodied visualization) is central to the teaching and learning of mathematics. As external visualization is an important part of mathematics at all levels of education, it is diverse, and research on external visualization has become a wide and complex field. The aim of this scoping review is to characterize external visualizations in recent mathematics education research in order to develop a common ground and guide future research. A qualitative content analysis of the full texts of 130 studies published between 2018 and 2022 applied a deductive-inductive coding procedure to assess four dimensions: visualization product or process, type of visualization, media, and purpose. The analysis revealed different types of external visualizations including visualizations with physical resemblance ranging from pictorial to abstract visualizations as well as three types of visualizations with structural resemblance: length, area, and relational visualizations. Future research should include measures of visualization products or processes to help explain the demands and affordances that different types of visualizations present to learners and teachers.</jats:p>}},
  author       = {{Schoenherr, Johanna and Schukajlow, Stanislaw}},
  issn         = {{1863-9690}},
  journal      = {{ZDM – Mathematics Education}},
  keywords     = {{General Mathematics, Education}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Characterizing external visualization in mathematics education research: a scoping review}}},
  doi          = {{10.1007/s11858-023-01494-3}},
  year         = {{2023}},
}

@article{53533,
  author       = {{Ernst, Alena and Schmidt, Kai-Uwe}},
  issn         = {{0305-0041}},
  journal      = {{Mathematical Proceedings of the Cambridge Philosophical Society}},
  keywords     = {{General Mathematics}},
  number       = {{1}},
  pages        = {{129--160}},
  publisher    = {{Cambridge University Press (CUP)}},
  title        = {{{Intersection theorems for finite general linear groups}}},
  doi          = {{10.1017/s0305004123000075}},
  volume       = {{175}},
  year         = {{2023}},
}

@article{46256,
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0895-4801}},
  journal      = {{SIAM Journal on Discrete Mathematics}},
  keywords     = {{General Mathematics}},
  number       = {{3}},
  pages        = {{1548--1565}},
  publisher    = {{Society for Industrial & Applied Mathematics (SIAM)}},
  title        = {{{Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs}}},
  doi          = {{10.1137/22m1500654}},
  volume       = {{37}},
  year         = {{2023}},
}

@article{40607,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Teachers’ in-depth diagnostic thinking has been shown to be crucial for student-centered teaching as they need to perceive and interpret students’ understanding for well-informed decision-making on adaptive teaching practices. The paper presents a content-related approach to analyzing diagnostic thinking processes with respect to the mathematical knowledge elements that prospective teachers identify as students’ resources and obstacles. Prospective teachers’ challenge is that some relevant knowledge elements first have to be unpacked, because compact concepts (such as the place value concept) or procedures (such as for multi-digit multiplication) comprise several smaller knowledge elements (such as the positional property) that have to be made explicit for students to foster their learning processes adequately. Our study examines what knowledge elements prospective teachers perceive and interpret in a transcript vignettes on multi-digit multiplication (of decimal and natural numbers) and its underlying basic arithmetic concepts (place value understanding and meaning of multiplication) in written diagnostic judgments on students’ resources and obstacles (<jats:italic>N</jats:italic> = 196). A comparative design within the vignette is used to investigate how far the process of perceiving can be supported by thematic cues. The analysis reveals that those knowledge elements cued in the vignette by being already unpacked and explicitly addressed are perceived and interpreted more often (but with lower correctness) than those that are uncued and therefore have to be unpacked by the prospective teachers themselves. This confirms the need to prepare prospective teachers for unpacking mathematical concepts themselves.</jats:p>}},
  author       = {{Dröse, Jennifer and Prediger, Susanne}},
  issn         = {{0173-5322}},
  journal      = {{Journal für Mathematik-Didaktik}},
  keywords     = {{Education, General Mathematics}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Prospective Teachers’ Diagnostic Thinking on Students’ Understanding of Multi-Digit Multiplication: A Content-Related Analysis on Unpacking of Knowledge Elements}}},
  doi          = {{10.1007/s13138-022-00214-w}},
  year         = {{2023}},
}

@article{50271,
  author       = {{Gharibian, Sevag and Le Gall, François}},
  issn         = {{0097-5397}},
  journal      = {{SIAM Journal on Computing}},
  keywords     = {{General Mathematics, General Computer Science}},
  number       = {{4}},
  pages        = {{1009--1038}},
  publisher    = {{Society for Industrial & Applied Mathematics (SIAM)}},
  title        = {{{Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture}}},
  doi          = {{10.1137/22m1513721}},
  volume       = {{52}},
  year         = {{2023}},
}

@article{31982,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We show that for a generic conformal metric perturbation of a compact hyperbolic 3-manifold <jats:inline-formula><jats:alternatives><jats:tex-math>$$\Sigma $$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mi>Σ</mml:mi>
                </mml:math></jats:alternatives></jats:inline-formula> with Betti number <jats:inline-formula><jats:alternatives><jats:tex-math>$$b_1$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:math></jats:alternatives></jats:inline-formula>, the order of vanishing of the Ruelle zeta function at zero equals <jats:inline-formula><jats:alternatives><jats:tex-math>$$4-b_1$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mn>4</mml:mn>
                    <mml:mo>-</mml:mo>
                    <mml:msub>
                      <mml:mi>b</mml:mi>
                      <mml:mn>1</mml:mn>
                    </mml:msub>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, while in the hyperbolic case it is equal to <jats:inline-formula><jats:alternatives><jats:tex-math>$$4-2b_1$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mn>4</mml:mn>
                    <mml:mo>-</mml:mo>
                    <mml:mn>2</mml:mn>
                    <mml:msub>
                      <mml:mi>b</mml:mi>
                      <mml:mn>1</mml:mn>
                    </mml:msub>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>. This is in contrast to the 2-dimensional case where the order of vanishing is a topological invariant. The proof uses the microlocal approach to dynamical zeta functions, giving a geometric description of generalized Pollicott–Ruelle resonant differential forms at 0 in the hyperbolic case and using first variation for the perturbation. To show that the first variation is generically nonzero we introduce a new identity relating pushforwards of products of resonant and coresonant 2-forms on the sphere bundle <jats:inline-formula><jats:alternatives><jats:tex-math>$$S\Sigma $$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>S</mml:mi>
                    <mml:mi>Σ</mml:mi>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> with harmonic 1-forms on <jats:inline-formula><jats:alternatives><jats:tex-math>$$\Sigma $$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mi>Σ</mml:mi>
                </mml:math></jats:alternatives></jats:inline-formula>.</jats:p>}},
  author       = {{Cekić, Mihajlo and Delarue, Benjamin and Dyatlov, Semyon and Paternain, Gabriel P.}},
  issn         = {{0020-9910}},
  journal      = {{Inventiones mathematicae}},
  keywords     = {{General Mathematics}},
  number       = {{1}},
  pages        = {{303--394}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{The Ruelle zeta function at zero for nearly hyperbolic 3-manifolds}}},
  doi          = {{10.1007/s00222-022-01108-x}},
  volume       = {{229}},
  year         = {{2022}},
}

@article{34261,
  abstract     = {{Mechanical clinching is used to create lightweight hybrid structures. In order to estimate the service life of clinched components, its fatigue properties need to be known under different mechanical loading conditions. In addition to fatigue, corrosion is another factor that affects the fatigue life of clinched joints. In the literature, many corrosion and high-cycle fatigue damage models exist. However, little is known about how both phenomena interact in clinched joints. In this article, the influence of galvanic corrosion on clinched EN AW-6014/HCT590X + Z sheets on the fatigue life is investigated by means of numerical simulations and experimental results. An accurate prediction of the Wöhler lines of non-corroded and pre-corroded clinched specimens is shown.}},
  author       = {{Harzheim, Sven and Hofmann, Martin and Wallmersperger, Thomas}},
  issn         = {{1537-6494}},
  journal      = {{Mechanics of Advanced Materials and Structures}},
  keywords     = {{Mechanical Engineering, Mechanics of Materials, General Materials Science, General Mathematics, Civil and Structural Engineering}},
  pages        = {{1--6}},
  publisher    = {{Informa UK Limited}},
  title        = {{{Numerical fatigue life prediction of corroded and non-corroded clinched joints}}},
  doi          = {{10.1080/15376494.2022.2140233}},
  year         = {{2022}},
}

@article{35306,
  author       = {{Guedes Bonthonneau, Yannick and Weich, Tobias}},
  issn         = {{1435-9855}},
  journal      = {{Journal of the European Mathematical Society}},
  keywords     = {{Applied Mathematics, General Mathematics}},
  number       = {{3}},
  pages        = {{851--923}},
  publisher    = {{European Mathematical Society - EMS - Publishing House GmbH}},
  title        = {{{Ruelle–Pollicott resonances for manifolds with hyperbolic cusps}}},
  doi          = {{10.4171/jems/1103}},
  volume       = {{24}},
  year         = {{2022}},
}

@article{45964,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>Maximal parabolic $L^p$-regularity of linear parabolic equations on an evolving surface is shown by pulling back the problem to the initial surface and studying the maximal $L^p$-regularity on a fixed surface. By freezing the coefficients in the parabolic equations at a fixed time and utilizing a perturbation argument around the freezed time, it is shown that backward difference time discretizations of linear parabolic equations on an evolving surface along characteristic trajectories can preserve maximal $L^p$-regularity in the discrete setting. The result is applied to prove the stability and convergence of time discretizations of nonlinear parabolic equations on an evolving surface, with linearly implicit backward differentiation formulae characteristic trajectories of the surface, for general locally Lipschitz nonlinearities. The discrete maximal $L^p$-regularity is used to prove the boundedness and stability of numerical solutions in the $L^\infty (0,T;W^{1,\infty })$ norm, which is used to bound the nonlinear terms in the stability analysis. Optimal-order error estimates of time discretizations in the $L^\infty (0,T;W^{1,\infty })$ norm is obtained by combining the stability analysis with the consistency estimates.</jats:p>}},
  author       = {{Kovács, Balázs and Li, Buyang}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Maximal regularity of backward difference time discretization for evolving surface PDEs and its application to nonlinear problems}}},
  doi          = {{10.1093/imanum/drac033}},
  year         = {{2022}},
}

@article{45966,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>This paper studies bulk–surface splitting methods of first order for (semilinear) parabolic partial differential equations with dynamic boundary conditions. The proposed Lie splitting scheme is based on a reformulation of the problem as a coupled partial differential–algebraic equation system, i.e., the boundary conditions are considered as a second dynamic equation that is coupled to the bulk problem. The splitting approach is combined with bulk–surface finite elements and an implicit Euler discretization of the two subsystems. We prove first-order convergence of the resulting fully discrete scheme in the presence of a weak CFL condition of the form $\tau \leqslant c h$ for some constant $c&amp;gt;0$. The convergence is also illustrated numerically using dynamic boundary conditions of Allen–Cahn type.</jats:p>}},
  author       = {{Altmann, Robert and Kovács, Balázs and Zimmer, Christoph}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  number       = {{2}},
  pages        = {{950--975}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Bulk–surface Lie splitting for parabolic problems with dynamic boundary conditions}}},
  doi          = {{10.1093/imanum/drac002}},
  volume       = {{43}},
  year         = {{2022}},
}

@article{45968,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>We derive a numerical method, based on operator splitting, to abstract parabolic semilinear boundary coupled systems. The method decouples the linear components that describe the coupling and the dynamics in the abstract bulk- and surface-spaces, and treats the nonlinear terms similarly to an exponential integrator. The convergence proof is based on estimates for a recursive formulation of the error, using the parabolic smoothing property of analytic semigroups, and a careful comparison of the exact and approximate flows. This analysis also requires a deep understanding of the effects of the Dirichlet operator (the abstract version of the harmonic extension operator), which is essential for the stable coupling in our method. Numerical experiments, including problems with dynamic boundary conditions, reporting on convergence rates are presented.</jats:p>}},
  author       = {{Csomós, Petra and Farkas, Bálint and Kovács, Balázs}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Error estimates for a splitting integrator for abstract semilinear boundary coupled systems}}},
  doi          = {{10.1093/imanum/drac079}},
  year         = {{2022}},
}

@article{53319,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>The Neumann problem for (0.1)$$ \begin{align}&amp; V_t = \Delta V-aV+f(x,t) \end{align}$$is considered in bounded domains $\Omega \subset {\mathbb {R}}^n$ with smooth boundary, where $n\ge 1$ and $a\in {\mathbb {R}}$. By means of a variational approach, a statement on boundedness of the quantities $$ \begin{eqnarray*} \sup_{t\in (0,T)} \int_\Omega \big|\nabla V(\cdot,t)\big|^p L^{\frac{n+p}{n+2}} \Big( \big|\nabla V(\cdot,t)\big| \Big) \end{eqnarray*}$$in dependence on the expressions (0.2)$$ \begin{align}&amp; \sup_{t\in (0,T-\tau)} \int_t^{t+\tau} \int_\Omega |f|^{\frac{(n+2)p}{n+p}} L\big( |f|\big) \end{align}$$is derived for $p\ge 2$, $\tau&amp;gt;0$, and $T\ge 2\tau $, provided that $L\in C^0([0,\infty ))$ is positive, strictly increasing, unbounded, and slowly growing in the sense that $\limsup _{s\to \infty } \frac {L(s^{\lambda _0})}{L(s)} &amp;lt;\infty $ for some $\lambda _0&amp;gt;1$. In the particular case when $p=n\ge 2$, an additional condition on growth of $L$, particularly satisfied by $L(\xi ):=\ln ^\alpha (\xi +b)$ whenever $b&amp;gt;0$ and $\alpha&amp;gt;\frac {(n+2)(n-1)}{2n}$, is identified as sufficient to ensure that as a consequence of the above, bounds for theintegrals in (0.2) even imply estimates for the spatio-temporal modulus of continuity of solutions to (0.1). A subsequent application to the Keller–Segel system $$ \begin{eqnarray*} \left\{ \begin{array}{l} u_t = \nabla \cdot \big( D(v)\nabla u\big) - \nabla \cdot \big( uS(v)\nabla v\big) + ru - \mu u^2, \\[1mm] v_t = \Delta v-v+u, \end{array} \right. \end{eqnarray*}$$shows that when $n=2$, $r\in {\mathbb {R}}$, $0&amp;lt;D\in C^2([0,\infty ))$, and $S\in C^2([0,\infty )) \cap W^{1,\infty }((0,\infty ))$ and thus especially in the presence of arbitrarily strong diffusion degeneracies implied by rapid decay of $D$, any choice of $\mu&amp;gt;0$ excludes blowup in the sense that for all suitably regular nonnegative initial data, an associated initial-boundary value problem admits a global bounded classical solution.</jats:p>}},
  author       = {{Winkler, Michael}},
  issn         = {{1073-7928}},
  journal      = {{International Mathematics Research Notices}},
  keywords     = {{General Mathematics}},
  number       = {{19}},
  pages        = {{16336--16393}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{A Result on Parabolic Gradient Regularity in Orlicz Spaces and Application to Absorption-Induced Blow-Up Prevention in a Keller–Segel-Type Cross-Diffusion System}}},
  doi          = {{10.1093/imrn/rnac286}},
  volume       = {{2023}},
  year         = {{2022}},
}

@article{53321,
  abstract     = {{<jats:p> The chemotaxis system [Formula: see text] is considered in a ball [Formula: see text], [Formula: see text], where the positive function [Formula: see text] reflects suitably weak diffusion by satisfying [Formula: see text] for some [Formula: see text]. It is shown that whenever [Formula: see text] is positive and satisfies [Formula: see text] as [Formula: see text], one can find a suitably regular nonlinearity [Formula: see text] with the property that at each sufficiently large mass level [Formula: see text] there exists a globally defined radially symmetric classical solution to a Neumann-type boundary value problem for (⋆) which satisfies [Formula: see text] </jats:p>}},
  author       = {{Winkler, Michael}},
  issn         = {{0219-1997}},
  journal      = {{Communications in Contemporary Mathematics}},
  keywords     = {{Applied Mathematics, General Mathematics}},
  number       = {{10}},
  publisher    = {{World Scientific Pub Co Pte Ltd}},
  title        = {{{Arbitrarily fast grow-up rates in quasilinear Keller–Segel systems}}},
  doi          = {{10.1142/s0219199722500626}},
  volume       = {{25}},
  year         = {{2022}},
}

