arXiv (All)
open access
Sharp $p/\log p$ Bounds for Metric $X_p$ Inequalities and Arbitrary Rademacher Chaos
Naor proved that $L_p$ satisfies the metric $X_p$ inequality with the sharp scaling parameter and asked for the optimal dependence of its constant on $p$. The best previously known upper bound was $O(p^4/\log p)$, while first-degree chaos gives a lower bound of order $p/\log p$. We prove the matchin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lower Bounds for Moments of $L$-functions#927459
- Harnack Inequality for Parabolic Fractional $p$-Laplace Equations#1109669
- Almost sure upper bound for sums of random multiplicative functions and critical chaos#1063992
- Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture#1105447
- Sharp Poincaré interpolation along Wasserstein geodesics#820548
Record · ID 1062186
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive