发表机构
Universidade Federal do Piauí（皮奥伊联邦大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究在$\boldsymbol{\text{R}}^2$上针对BO-ZK方程的柯西问题，通过改进的估计与方法将其局部适定性阈值从$s>5/4$降至$s>19/16$，并建立了解的存在性、唯一性与连续依赖性。
AI 中文摘要
我们在$\boldsymbol{\text{R}}^2$上研究Benjamin-Ono-Zakharov-Kuznetsov（BO-ZK）方程的柯西问题。遵循Kenig和Ziesler的策略，我们建立了适配BO-ZK方程的新极大函数估计，并利用这些估计实现了Kenig-Koenig方法。结果，我们改进了Nascimento（2020）此前已知的最佳各向同性结果，将局部适定性阈值从$s>5/4$降至$s>19/16$。在BO-ZK端点处，所得的各向同性数据类还包含了先前理论中的各向异性$E^{5/4+}$类。在$H^s(\boldsymbol{\text{R}}^2)$的有界子集上，解的寿命可选取为满足$T\bigl(1+\norm{u_0}_{H^s}\bigr)^{-8}$。该证明结合了精确的二进混合极大函数估计与各向异性局部光滑机制，该机制利用了纵向和横向群速度的互补行为。特别地，横向色散补偿了特征区域附近纵向光滑性的退化。结合改进的短时Strichartz估计和修正的能量论证，这些要素在所述正则性下完成了非线性估计的封闭。随后在相应的解类中建立了解的存在性、唯一性以及对初始数据的连续依赖性。所得阈值反映了当前方法的优化，并不要求为最优。
英文摘要
We study the Cauchy problem for the Benjamin--Ono--Zakharov--Kuznetsov equation on $\mathbb R^2$. Following the strategy of Kenig and Ziesler, we establish new maximal-function estimates adapted to the BO--ZK equation and use them to implement the Kenig--Koenig method. As a result, we improve the best previously known isotropic result of Nascimento (2020), lowering the local well-posedness threshold from $s>5/4$ to $s>19/16$. At the BO--ZK endpoint, the resulting isotropic data class also contains the anisotropic $E^{5/4+}$ class of the preceding theory. On bounded subsets of $H^s(\mathbb R^2)$, the lifespan may be chosen so that $ T\gtrsim_s \bigl(1+\norm{u_0}_{H^s}\bigr)^{-8}. $ The proof combines a sharp dyadic mixed maximal-function estimate with an anisotropic local-smoothing mechanism that exploits the complementary behavior of the longitudinal and transverse group velocities. In particular, transverse dispersion compensates for the degeneration of longitudinal smoothing near the characteristic region. Together with refined short-time Strichartz estimates and a modified energy argument, these ingredients close the nonlinear estimates at the stated regularity. Existence, uniqueness, and continuous dependence on the initial data are then established in the corresponding solution class. The resulting threshold reflects the present optimization of the method and is not claimed to be sharp.
