arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.06717cs.CCmath.PR
收藏

(离散)时间内测量热量的近对数凸性及其后果

Near log-convexity of measured heat in (discrete) time and consequences

Mert Sağlam

摘要:

设$u,v \in \mathbb{R}^Ω_+$为正单位向量,$S\in\mathbb{R}^{Ω\timesΩ}_+$为对称次随机矩阵.对于整数$t\ge 0$,设$m_t = \smash{\left\langle v,S^tu\right\rangle}$,我们将其视为在初始热配置$u$根据$S$扩散$t$时间步后由$v$测量的热量。由于$S$是熵改进的,因此人们可以直觉地认为$m_t$不应该随时间变化得太快。我们给出这种直觉的以下形式化。证明了$m_{t+2} \ge m_t^{1+2/t}\!,$是Blakley和Dixon(也是Erdens和Simonovits)对$u=v$研究的一个不等式,并在限制$m_t\ge e^{-4t}$下为真.此外,我们证明了,对于任何$ε>0$,一个更强的不等式$m_{t+2} \ge t^{1-ε}\cdot \smash{m_t^{1+2/t}}$成立,除非$m_{t+2}m_{t-2}\ge δm_t^2$的一些$δ$,只依赖于$ε$。换句话说,$\forall ε> 0, \exists δ> 0$使得$\forall S,u,v$ \begin{equation*} \frac{m_{t+2}}{m_{t}^{1+2/t}}\ge \min\left\{t^{1-ε}, δ\frac{m_t^{1-2/t}}{m_{t-2}}\right\}, \quad \forall t \ge 2, \end{equation*}可以被视为截断对数凸性语句。使用这个不等式,我们回答了两个相关的开放问题的复杂性理论:任何属性测试$k$ -线性需要$Ω(k\log k)$查询和随机通信的复杂性的$k$ -汉明距离问题是$Ω(k\log k)$。进一步我们证明了任何计算$k$-Hamming权重的随机奇偶决策树都有大小$\exp\left(Ω(k\log k)\right)$ .

英文摘要:

Let $u,v \in \mathbb{R}^Ω_+$ be positive unit vectors and $S\in\mathbb{R}^{Ω\timesΩ}_+$ be a symmetric substochastic matrix. For an integer $t\ge 0$, let $m_t = \smash{\left\langle v,S^tu\right\rangle}$, which we view as the heat measured by $v$ after an initial heat configuration $u$ is let to diffuse for $t$ time steps according to $S$. Since $S$ is entropy improving, one may intuit that $m_t$ should not change too rapidly over time. We give the following formalizations of this intuition. We prove that $m_{t+2} \ge m_t^{1+2/t}\!,$ an inequality studied earlier by Blakley and Dixon (also Erdős and Simonovits) for $u=v$ and shown true under the restriction $m_t\ge e^{-4t}$. Moreover we prove that for any $ε>0$, a stronger inequality $m_{t+2} \ge t^{1-ε}\cdot \smash{m_t^{1+2/t}}$ holds unless $m_{t+2}m_{t-2}\ge δm_t^2$ for some $δ$ that depends on $ε$ only. Phrased differently, $\forall ε> 0, \exists δ> 0$ such that $\forall S,u,v$ \begin{equation*} \frac{m_{t+2}}{m_{t}^{1+2/t}}\ge \min\left\{t^{1-ε}, δ\frac{m_t^{1-2/t}}{m_{t-2}}\right\}, \quad \forall t \ge 2, \end{equation*} which can be viewed as a truncated log-convexity statement. Using this inequality, we answer two related open questions in complexity theory: Any property tester for $k$-linearity requires $Ω(k\log k)$ queries and the randomized communication complexity of the $k$-Hamming distance problem is $Ω(k\log k)$. Further we show that any randomized parity decision tree computing $k$-Hamming weight has size $\exp\left(Ω(k\log k)\right)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑