More Like this

1. Asymptotic stability of solitary waves of the 3D quadratic Zakharov-Kuznetsov equation

   https://doi.org/10.1353/ajm.2023.a913295  

   Farah, Luiz Gustavo; Holmer, Justin; Roudenko, Svetlana; Yang, Kai (December 2023, American Journal of Mathematics)

   Abstract: We consider the quadratic Zakharov-Kuznetsov equation $$\partial_t u + \partial_x \Delta u + \partial_x u^2=0$$ on $$\Bbb{R}^3$$. A solitary wave solution is given by $Q(x-t,y,z)$, where $$Q$$ is the ground state solution to $$-Q+\Delta Q+Q^2=0$$. We prove the asymptotic stability of these solitary wave solutions. Specifically, we show that initial data close to $$Q$$ in the energy space, evolves to a solution that, as $$t\to\infty$$, converges to a rescaling and shift of $Q(x-t,y,z)$ in $L^2$ in a rightward shifting region $$x>\delta t-\tan\theta\sqrt{y^2+z^2}$$ for $$0\leq\theta\leq{\pi\over 3}-\delta$$. 

   more » « less
2. Singularity formation in the harmonic map flow with free boundary

   https://doi.org/10.1353/ajm.2023.a902958  

   Sire, Yannick; Wei, Juncheng; Zheng, Youquan (August 2023, American Journal of Mathematics)

   abstract: In the past years, there has been a new light shed on the harmonic map problem with free boundary in view of its connection with nonlocal equations. Here we fully exploit this link, considering the harmonic map flow with free boundary $$ (0.1)\hskip77pt\cases{u_t=\Delta u& in $$\Bbb{R}^2_+\times (0,T)$$,\cr u(x,0,t)\in\Bbb{S}^1& for all $$(x,0,t)\in\partial\Bbb{R}^2_+\times (0,T)$$,\cr {du\over dy}(x,0,t)\perp T_{u(x,0,t)}\Bbb{S}^1& for all $$(x,0,t)\in\partial\Bbb{R}^2_+\times (0,T)$$,\cr u(\cdot, 0)=u_0& in $$\Bbb{R}^2_+$} $$ for a function $$u:\Bbb{R}^2_+\times [0,T)\to\Bbb{R}^2$$. Here $$u_0 :\Bbb{R}^2_+\to\Bbb{R}^2$$ is a given smooth map and $$\perp$$ stands for orthogonality. We prove the existence of initial data $$u_0$$ such that (0.1) blows up at finite time with a profile being the half-harmonic map. This answers a question raised by Chen and Lin. 

   more » « less
3. Large-time behavior of solutions of parabolic equations on the real line with convergent initial data III: unstable limit at infinity

   Pauthier, Antoine; Poláčik, Peter (August 2022, Partial Differential Equations and Applications)

   Abstract This is a continuation, and conclusion, of our study of bounded solutions u of the semilinear parabolic equation $$u_t=u_{xx}+f(u)$$ u t = u xx + f ( u ) on the real line whose initial data $$u_0=u(\cdot ,0)$$ u 0 = u ( · , 0 ) have finite limits $$\theta ^\pm $$ θ ± as $$x\rightarrow \pm \infty $$ x → ± ∞ . We assume that f is a locally Lipschitz function on $$\mathbb {R}$$ R satisfying minor nondegeneracy conditions. Our goal is to describe the asymptotic behavior of u ( x ,  t ) as $$t\rightarrow \infty $$ t → ∞ . In the first two parts of this series we mainly considered the cases where either $$\theta ^-\ne \theta ^+$$ θ - ≠ θ + ; or $$\theta ^\pm =\theta _0$$ θ ± = θ 0 and $$f(\theta _0)\ne 0$$ f ( θ 0 ) ≠ 0 ; or else $$\theta ^\pm =\theta _0$$ θ ± = θ 0 , $$f(\theta _0)=0$$ f ( θ 0 ) = 0 , and $$\theta _0$$ θ 0 is a stable equilibrium of the equation $${{\dot{\xi }}}=f(\xi )$$ ξ ˙ = f ( ξ ) . In all these cases we proved that the corresponding solution u is quasiconvergent—if bounded—which is to say that all limit profiles of $$u(\cdot ,t)$$ u ( · , t ) as $$t\rightarrow \infty $$ t → ∞ are steady states. The limit profiles, or accumulation points, are taken in $$L^\infty _{loc}(\mathbb {R})$$ L loc ∞ ( R ) . In the present paper, we take on the case that $$\theta ^\pm =\theta _0$$ θ ± = θ 0 , $$f(\theta _0)=0$$ f ( θ 0 ) = 0 , and $$\theta _0$$ θ 0 is an unstable equilibrium of the equation $${{\dot{\xi }}}=f(\xi )$$ ξ ˙ = f ( ξ ) . Our earlier quasiconvergence theorem in this case involved some restrictive technical conditions on the solution, which we now remove. Our sole condition on $$u(\cdot ,t)$$ u ( · , t ) is that it is nonoscillatory (has only finitely many critical points) at some $$t\ge 0$$ t ≥ 0 . Since it is known that oscillatory bounded solutions are not always quasiconvergent, our result is nearly optimal. 

   more » « less
4. Online Spanners in Metric Spaces

   Bhore, Sujoy; Filtser, Arnold; Khodabandeh, Hadi; Toth, Csaba D. (September 2022, 30th Annual European Symposium on Algorithms (ESA 2022))

   Given a metric space ℳ = (X,δ), a weighted graph G over X is a metric t-spanner of ℳ if for every u,v ∈ X, δ(u,v) ≤ δ_G(u,v) ≤ t⋅ δ(u,v), where δ_G is the shortest path metric in G. In this paper, we construct spanners for finite sets in metric spaces in the online setting. Here, we are given a sequence of points (s₁, …, s_n), where the points are presented one at a time (i.e., after i steps, we have seen S_i = {s₁, … , s_i}). The algorithm is allowed to add edges to the spanner when a new point arrives, however, it is not allowed to remove any edge from the spanner. The goal is to maintain a t-spanner G_i for S_i for all i, while minimizing the number of edges, and their total weight. Under the L₂-norm in ℝ^d for arbitrary constant d ∈ ℕ, we present an online (1+ε)-spanner algorithm with competitive ratio O_d(ε^{-d} log n), improving the previous bound of O_d(ε^{-(d+1)}log n). Moreover, the spanner maintained by the algorithm has O_d(ε^{1-d}log ε^{-1})⋅ n edges, almost matching the (offline) optimal bound of O_d(ε^{1-d})⋅ n. In the plane, a tighter analysis of the same algorithm provides an almost quadratic improvement of the competitive ratio to O(ε^{-3/2}logε^{-1}log n), by comparing the online spanner with an instance-optimal spanner directly, bypassing the comparison to an MST (i.e., lightness). As a counterpart, we design a sequence of points that yields a Ω_d(ε^{-d}) lower bound for the competitive ratio for online (1+ε)-spanner algorithms in ℝ^d under the L₁-norm. Then we turn our attention to online spanners in general metrics. Note that, it is not possible to obtain a spanner with stretch less than 3 with a subquadratic number of edges, even in the offline setting, for general metrics. We analyze an online version of the celebrated greedy spanner algorithm, dubbed ordered greedy. With stretch factor t = (2k-1)(1+ε) for k ≥ 2 and ε ∈ (0,1), we show that it maintains a spanner with O(ε^{-1}logε^{-1})⋅ n^{1+1/k} edges and O(ε^{-1}n^{1/k}log² n) lightness for a sequence of n points in a metric space. We show that these bounds cannot be significantly improved, by introducing an instance that achieves an Ω(1/k⋅ n^{1/k}) competitive ratio on both sparsity and lightness. Furthermore, we establish the trade-off among stretch, number of edges and lightness for points in ultrametrics, showing that one can maintain a (2+ε)-spanner for ultrametrics with O(ε^{-1}logε^{-1})⋅ n edges and O(ε^{-2}) lightness. 

   more » « less
5. Online Spanners in Metric Spaces

   Bhore, Sujoy; Filtser, Arnold; Khodabandeh, Hadi; Toth, Csaba D. (September 2022, Proc. 30th Annual European Symposium on Algorithms (ESA))

   Given a metric space ℳ = (X,δ), a weighted graph G over X is a metric t-spanner of ℳ if for every u,v ∈ X, δ(u,v) ≤ δ_G(u,v) ≤ t⋅ δ(u,v), where δ_G is the shortest path metric in G. In this paper, we construct spanners for finite sets in metric spaces in the online setting. Here, we are given a sequence of points (s₁, …, s_n), where the points are presented one at a time (i.e., after i steps, we have seen S_i = {s₁, … , s_i}). The algorithm is allowed to add edges to the spanner when a new point arrives, however, it is not allowed to remove any edge from the spanner. The goal is to maintain a t-spanner G_i for S_i for all i, while minimizing the number of edges, and their total weight. Under the L₂-norm in ℝ^d for arbitrary constant d ∈ ℕ, we present an online (1+ε)-spanner algorithm with competitive ratio O_d(ε^{-d} log n), improving the previous bound of O_d(ε^{-(d+1)}log n). Moreover, the spanner maintained by the algorithm has O_d(ε^{1-d}log ε^{-1})⋅ n edges, almost matching the (offline) optimal bound of O_d(ε^{1-d})⋅ n. In the plane, a tighter analysis of the same algorithm provides an almost quadratic improvement of the competitive ratio to O(ε^{-3/2}logε^{-1}log n), by comparing the online spanner with an instance-optimal spanner directly, bypassing the comparison to an MST (i.e., lightness). As a counterpart, we design a sequence of points that yields a Ω_d(ε^{-d}) lower bound for the competitive ratio for online (1+ε)-spanner algorithms in ℝ^d under the L₁-norm. Then we turn our attention to online spanners in general metrics. Note that, it is not possible to obtain a spanner with stretch less than 3 with a subquadratic number of edges, even in the offline setting, for general metrics. We analyze an online version of the celebrated greedy spanner algorithm, dubbed ordered greedy. With stretch factor t = (2k-1)(1+ε) for k ≥ 2 and ε ∈ (0,1), we show that it maintains a spanner with O(ε^{-1}logε^{-1})⋅ n^{1+1/k} edges and O(ε^{-1}n^{1/k}log² n) lightness for a sequence of n points in a metric space. We show that these bounds cannot be significantly improved, by introducing an instance that achieves an Ω(1/k⋅ n^{1/k}) competitive ratio on both sparsity and lightness. Furthermore, we establish the trade-off among stretch, number of edges and lightness for points in ultrametrics, showing that one can maintain a (2+ε)-spanner for ultrametrics with O(ε^{-1}logε^{-1})⋅ n edges and O(ε^{-2}) lightness. 

   more » « less