Pith. sign in

REVIEW 2 cited by

Pointwise convergence problem of Ostrovsky equation with rough data and random data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.15981 v3 pith:BODB3UH3 submitted 2020-06-24 math.AP

Pointwise convergence problem of Ostrovsky equation with rough data and random data

classification math.AP
keywords dataequationostrovskyfreeconvergencepointwiserandommathbb
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we consider the pointwise convergence problem of free Ostrovsky equation with rough data and random data. Firstly, we show the almost everywhere pointwise convergence of free Ostrovsky equation in $H^{s}(\mathbb{R})$ with $s\geq \frac{1}{4}$ with rough data. Secondly, we present counterexamples showing that the maximal function estimate related to the free Ostrovsky equation can fail if $s<\frac{1}{4}$. Finally, for every $x\in \mathbb{R}$, we show the almost surely pointwise convergence of free Ostrovsky equation in $L^{2}(\mathbb{R})$ with random data. The main tools are the density theorem, high-low frequency idea, Wiener decomposition and Lemmas 2.1-2.6 as well as the probabilistic estimates of some random series which are just Lemmas 3.2-3.4 in this paper. The main difficulty is that zero is the singular point of the phase functions of free Ostrovsky equation. We use high-low frequency idea to conquer the difficulties.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ML for the hKLM at the 2nd Detector

    physics.ins-det 2026-04 unverdicted novelty 6.0

    Graph neural networks trained on simulated hits outperform classical methods for energy resolution, timing, and particle identification in an iron-scintillator sampling calorimeter, with an integrated multi-objective ...

  2. ML for the hKLM at the 2nd Detector

    physics.ins-det 2026-04 unverdicted novelty 4.5

    GNNs on hit graphs outperform classical methods for neutral-hadron energy and muon/hadron ID in a proposed EIC hKLM calorimeter, with a 20x faster optical simulation and multi-objective design tradeoff analysis.