arXiv (All)
open access
On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
We study the maximum level-$1$ Fourier weight of Boolean functions, which is equivalent to the minimum average-distance problem on the hypercube. We first determine the dimension-free optimum at sufficiently small densities: there exists a universal $a_{0}>0$ such that the maximum level-$1$ Fourie
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
- Chromatic Extremal Thresholds and the Multipartite $K_4$-Free Problem#1064047
- A counterexample to the quantum Hedetniemi conjecture#1034490
- Efficient allocation with ordinal preference intensities#144160
- On Edge Coloring of Multigraphs#1082904
- Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs#625474
Record · ID 1105901
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