arXiv (All)
open access
A hypercontractive proof of the sharp bound for cancellative pairs
Fang and Huang proved that every cancellative pair $(\mathcal{A},\mathcal{B})$ of families of subsets of $[n]$ satisfies $|\mathcal{A}|\cdot|\mathcal{B}|\leq(\frac{9}{4})^n$. Their proof uses entropy. We give a Fourier-analytic proof based on Lifshitz's one-sided noise operator $\mathrm{T}^{1/4\to1/
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
- Turán type inequalities for oscillatory special functions#1143975
- From Sidelnikov-Welch bounds to projection constants#1077351
- A note on the quantum Wielandt inequality#139157
- Extensions of the Furstenberg-Sárközy theorem via the arithmetic level-$d$ inequality#785164
- Extensions of the Furstenberg-Sárközy theorem via the arithmetic level-$d$ inequality#783574
Record · ID 986708
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