陶哲轩博客写数学问题时，通常先把对象定义清楚，再给直觉、反例和证明轮廓。把「A sharp inverse Littlewood-Offord theorem」改写成可阅读的中文笔记，重点是：问题在问什么、已知到哪一步、下一步最容易走偏在哪。原站广告、分享条和导航已去掉。

问题在问什么

Van Vu and I have just uploaded to the arXiv our preprint “ A sharp inverse Littlewood-Offord theorem “, which we have submitted to Random Structures and Algorithms . This paper gives a solution to the (inverse) Littlewood-Offord problem of understanding when random walks are concentrated in the case when the concentration is of polynomial size in the length of the walk; our description is sharp up to epsilon powers of . The theory of inverse Littlewood-Offord problems and re

For simplicity I will restrict attention to the Bernoulli random walk. Given real numbers , one can form the random variable

已知结果和反例

where are iid random signs (with either sign +1, -1 chosen with probability 1/2). This is a discrete random variable which typically takes values. However, if there are various arithmetic relations between the step sizes , then many of the possible sums collide, and certain values may then arise with much higher probability. To measure this, define the concentration probability by the formula

Intuitively, this probability measures the amount of additive structure present between the . There are two (opposing) problems in the subject:

证明或构造的主线

Ideally one would like answers to both of these problems which come close to inverting each other, and this is the guiding motivation for our paper.

One of the first forward Littlewood-Offord theorems was by Erdős , who showed

阅读时建议盯住的点

Theorem 1. If at least k of the are non-zero, then .

In fact the sharp bound was computed by Erdős as $\binom{k}{\lfloor k/2\rfloor}/2^k$; the proof relies, incidentally, on Sperner’s theorem , which is of relevance to the ongoing polymath1 project . (An earlier result of Littlewood and Offord gave a weaker bound of .) Taking contrapositives, we obtain an inverse Littlewood-Offord theorem:

值得单独记下的条目

• (Forward Littlewood-Offord problem) Given some structural assumptions on , what bounds can one place on ?
• (Inverse Littlewood-Offord problem) Given some bounds on , what structural assumptions can one then conclude about ?
• Start with the trivial progression . Also, pick an integer k a little bit smaller than .
• Call an element x of Q “bad” if adding the progression to Q significantly increases the size of Q, and “good” otherwise.
• If only a few of the are bad, STOP.
• Otherwise, if there are a lot of bad , there is a way to use Hölder’s inequality to find a bad x with the property that S is much more likely to fall into a translate of than it is to Q. Replace Q with this larger GAP and return to step 2.

阅读和落地时建议先做的 5 件事

1. 用自己的语言重写定义和结论，不看原文能不能说清对象是什么。
2. 找一个最小反例或边界情形，确认假设少一条会怎样。
3. 把证明拆成可独立检验的引理，每步只保留一个新想法。
4. 若涉及计算或形式化，先写可复现的小例子，再谈一般情形。
5. 记下尚未解决的缺口：缺估计、缺构造，还是缺正确的范畴。

和智能体、形式化工具怎么接

龙虾PRO做 OpenClaw 落地时，数学笔记最有用的部分往往是「可检验的步骤」：定义、反例、引理边界。智能体适合帮忙展开计算和检索，不适合代替你决定哪条假设能扔。

本文侧重全链路风控方法论。落地时请用自身业务单据做回放验证，不要把示例阈值直接当生产策略。 相关：风控体检 · 方案资源