Aram W. Harrow, Alexandra Kolla, Leonard J. Schulman
We establish the result of the title. In combinatorial terms this has the implication that for sufficiently small eps > 0, for all n, any marking of an eps fraction of the vertices of the n-dimensional hypercube necessarily leaves a vertex x such that marked vertices are a minority of every sphere centered at x.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Optimal Young's convolutions inequality and its reverse form on the hypercube
本文在离散超立方体上建立了对角情形下 Young 卷积不等式及其反向的精确形式，并应用于加性能量和和集，同时探讨了非对角情形的必要条件与部分结果。
We extend the main result of Harrow, Kolla, and Schulman -- the existence of dimension-free $L^2$-bounds for the spherical maximal function in the hypercube -- to all $L^p, p > 1$. Our approach is motivated by the spectral technique developed by Stein and Nevo and Stein in the context of pointwise ergodic theorems on general groups. We provide an example which demonstrates that no dimension-free weak-type (1-1) bound exists at the endpoint.
We prove a vertex isoperimetric inequality for the $n$-dimensional Hamming ball $\mathcal{B}_n(R)$ of radius $R$. The isoperimetric inequality is sharp up to a constant factor for sets that are comparable to $\mathcal{B}_n(R)$ in size. A key step in the proof is a local expansion phenomenon in hypercubes.
The expansion of a graph is typically associated with its spectral properties - testing whether a graph is an expander is usually done using Cheeger's inequality. One can also use multiple eigenvalues in a higher-order Cheeger's inequality to test a deeper set of properties on the graph. However Cheeger's inquality, and the higher-order Cheeger's inequality, can be imprecise tools. Recently Lee, Gharan, and Trevisan constructed the Noisy Hypercube to prove the sharpness of the gap between spectral expansion and edge expansion in the higher-order Cheeger's inequality. We are concerned with the …
On the Log-submodularity for zonoids: from Mixed Volume inequalities to the Hypercube
该研究证明了四维带状体的对数次模型不等式，扩展了三维相关结果，提出任意维度带状体的该类不等式猜想，归约后揭示了带状体混合体积、拟阵理论与实代数几何的关联。
For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$ apart. We study edge isoperimetric inequalities for this graph. Harper, Bernstein, Lindsey and Hart proved a best-possible edge isoperimetric inequality for this graph in the case $r=1$. For each $r \geq 2$, we obtain an edge isoperimetric inequality for $Q_n^r$; our inequality is tight up to a constant factor depending only upon $r$. Our techniques also yi…
We prove the sharp isoperimetric inequality $$ \mathbb{E} \,h_{A}^{\log_{2}(3/2)} \geq μ(A)^{*} (\log_{2}(1/μ(A)^{*}))^{\log_{2}(3/2)} $$ for all sets $A \subseteq \{0,1\}^n$, where $μ$ denotes the uniform probability measure, $μ(A)^{*}=\min\{μ(A), 1-μ(A)\}$, $h_A$ is supported on $A$ and to each vertex $x$ assigns the number of neighbour vertices in the complement of $A$. The inequality becomes equality for any subcube. Moreover, we provide lower bounds on $\mathbb{E} h_{A}^β$ in terms of $μ(A)$ for all $β\in [1/2,1]$, improving, and in some cases tightening, previously known results. In part…
Functional inequalities and random walks on increasing subsets of the hypercube
该研究针对超立方体递增子集，通过限制归纳法证明两个离散函数不等式，改进删失随机游走混合时间上界，建立$p$-偏置边等周不等式并给出概率解释。
Sharp Lower Bounds for Sumsets in Hypercubes
通过混合体积表示和单变量函数不等式，证明了超立方体中子集和基数的最优下界，解决了Becker等人提出的猜想。
We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that $$\int_{\left\{ -1,1\right\} ^{n}}\sqrt{h_{f}\left(x\right)}dμ\geq C\cdot\mathrm{var}\left(f\right)\cdot\left(\log\left(\frac{1}{\sum\mathrm{Inf}_{i}^{2}\left(f\right)}\right)\right)^{1/2},$$ where $h_{f}\left(x\right)$ is the number of edges at $x$ along which $f$ changes its value, and $\mathrm{Inf}_{i}\left(f\right)$ is the influence of the $i$-th coordinate. 2. Strengthen se…
In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $\mathbb{R}^n$, such that all the vertices of $\{0, 1\}^n \setminus \{\vec{0}\}$ are covered at least $k$ times, and $\vec{0}$ is uncovered? The $k=1$ case is the well-known Alon-Füredi theorem which says a minimum of $n$ affine hyperplanes is required, proved by the Combinatorial Nullstellensatz. We develop an analogue of the Lubell-Yamamoto-Meshalkin inequality for subset sums, and completely solve the fractional version of this problem, which also provides an asymptotic answer to the integr…
In this paper, we study the following two hypercube coloring problems: Given $n$ and $d$, find the minimum number of colors, denoted as $χ'_{d}(n)$ (resp. $χ_{d}(n)$), needed to color the vertices of the $n$-cube such that any two vertices with Hamming distance at most $d$ (resp. exactly $d$) have different colors. These problems originally arose in the study of the scalability of optical networks. Using methods in coding theory, we show that $χ'_{4}(2^{r+1}-1)=2^{2r+1}$, $χ'_{5}(2^{r+1})=4^{r+1}$ for any odd number $r\geq3$, and give two upper bounds on $χ_{d}(n)$. The first upper bound impro…
Jackson's inequality on the hypercube
本文研究超立方体上以敏感度控制低次多项式一致逼近误差的最佳 Jackson 常数，证明其在近半数维度处有正常数下界，并给出逆 Bernstein 不等式、近似次数、对称函数及子空间逼近应用。
This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform distribution on the vertex set, we treat $f$ as a random variable. We investigate the link between the isoperimetric function of $G$ and the functions $f$ that have maximum variance or meet the bound established by the subgaussian inequality. We present several results describing the extremal functions, and use those results to resolve: (A) a conjecture by Bobkov, Ho…
In this paper, a simplified second-order Gaussian Poincaré inequality for normal approximation of functionals over infinitely many Rademacher random variables is derived. It is based on a new bound for the Kolmogorov distance between a general Rademacher functional and a Gaussian random variable, which is established by means of the discrete Malliavin-Stein method and is of independent interest. As an application, the number of vertices with prescribed degree and the subgraph counting statistic in the Erdös-Rényi random graph are discussed. The number of vertices of fixed degree is also studie…
We establish a precise relationship between spherical harmonics and Fourier basis functions over a hypercube randomly embedded in the sphere. In particular, we give a bound on the expected Boolean noise sensitivity of a randomly rotated function in terms of its "spherical sensitivity," which we define according to its evolution under the spherical heat equation. As an application, we prove an average case of the Gotsman-Linial conjecture, bounding the sensitivity of polynomial threshold functions subjected to a random rotation.
On binomial sums, additive energies, and lazy random walks
本研究证明了关于离散超立方体子集k-加性能量猜想所需的实数初等不等式（此前仅验证k≤100的情况），完成了推广Kane-Tao结果的证明，并给出该不等式的非对称懒惰随机游走解释。
C4-Free Subgraphs of the Hypercubes Q6, Q7, and Q8: Odd Squares, Fully Frustrated Models, and Computational Structure
本文通过构造和计算方法，为Q6、Q7和Q8超立方体中不含C4子图的最大边数提供了新的下界，并给出了相关构造和验证方法。
We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal $τ\in [0,1]$ for which there exists an arrangement of $M$ balls of relative Hamming radius $τ$ in the binary hypercube (of arbitrary dimension) with the property that no point of the latter is covered by $L$ or more of them. As $M\to \infty$ the maximal $τ$ decreases to a well-known critical value $τ_L$. In this work, we prove several results on the rate of this convergence. For the binary case, we show that the rate is $Θ(M^{-1})$ …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。