OpenAI reports the symmetric maximal triangular Hilbert estimate

For arbitrary complex F,G in L3(R²), the supremum of the triangular Hilbert transform over both finite hard-truncation endpoints is bounded in L^(3/2)(R²) by C times the two L3 norms.

Curated contributions 1

Understand the problem ↓

Understanding the problem

Read the background

For arbitrary complex F,G in L3(R²), the supremum of the triangular Hilbert transform over both finite hard-truncation endpoints is bounded in L^(3/2)(R²) by C times the two L3 norms.

Why it matters

If correct, gives a scale-uniform pointwise maximal estimate at the symmetric triangular Hilbert exponent.

What counts as progress

Can the triangular Hilbert transform be bounded uniformly when both truncation endpoints vary pointwise?

Website timeline

Publication dates and editorial changes.