798 字
4 分钟

Zero Sum Subsets

Background#

2024年7月17日,瞿振华教授莅临海亮高级中学,对全省来此参加数学夏令营的学生做报告,以开阔我们业余数学爱好者的眼界。

Introduction#

我们在学习 Elemental Number Theory 时,有如下熟知结论:

Conclusion_1#

Given nn integers {a1,a2,,an}\{a_1,a_2,\dots,a_n\} ,  I{1,2,,n}\exists\ I\subseteq \{1,2,\dots,n\} and I0, s.t. niIai|I|\ne 0,\ s.t.\ n|\sum_{i\in I}{a_i}
(可考虑部分和,以及利用鸽巢原理)
(其中 nn 为最佳,可取 n1n-111.)

Conclusion_2#

Erdo ̋s,Ginzburg\ and\ Ziv\ Theorem (1961)

Given 2n12n-1 integers {a1,a2,,an}\{a_1,a_2,\dots,a_n\}, I{1,2,,2n1}\exists\ I\subseteq \{1,2,\dots,2n-1\} and I=n, s.t. niIai|I|=n,\ s.t.\ n|\sum_{i\in I}{a_i}
(可使用反证法,取p-1次方,导出矛盾)
(其中 2n12n-1 为最佳,可取 n1n-10,10,1.)

General_Problem#

GG 为有限交换群, AA 是由 GG 中元素构成的可重集。
(1) A|A| 多大时,  BA\exists\ B \subseteq A and B0, s.t. σ(B)=0|B|\ne 0,\ s.t.\ \sigma(B)=0.(称为DavenportDavenport常数,记作 D(G)D(G) )
(2) kZ>0 k\in \mathbb{Z}_{>0} and exp(G)kexp(G)|k , A|A| 多大时, BA\exists B \subseteq A and B=k, s.t. σ(B)=0|B|=k,\ s.t.\ \sigma(B)=0.(记作 S(G)S(G) )(称 BBkkZerosumsubsetZero-sum-subset )

exp(G):=maxxG ord(x)exp(G):=\underset{x\in G}{max}\ ord(x)
G=Cn1Cn2Cnl, n1n2nl, exp(G)=nlG=C_{n_1}\oplus C_{n_2}\oplus\cdots\oplus C_{n_l},\ n_1|n_2|\cdots|n_l,\ exp(G)=n_l

σ(B):=xBx\sigma(B):=\sum_{x\in B}x, 约定 σ()=0\sigma(\emptyset)=0

(Con.1中, G=Z/nZ=CnG=\mathbb{Z} /n\mathbb{Z}=C_n)
(Con.2中, G=Cn,k=n=exp(Cn)G=C_n,k=n=exp(C_n) )

Concerning_Problem#

考虑 GG 秩为 22n=pn=p 的情形,即
A={(a1,b1),(a2,b2),,(am,bm)}Z2A=\{(a_1,b_1),(a_2,b_2),\dots,(a_m,b_m)\}\subset\mathbb{Z}^2
(1) 当 mm 多大时, BA\exists B \subseteq A and B0, s.t. σ(B)(0,0) (mod p)|B|\ne 0,\ s.t.\ \sigma(B)\equiv (0,0)\ (mod\ p)
(2) 当 mm 多大时, BA\exists B \subseteq A and B=p, s.t. σ(B)(0,0) (mod p)|B|=p,\ s.t.\ \sigma(B)\equiv (0,0)\ (mod\ p)

Ans1 = 2p1Ans_1\ =\ 2p-1 (2p22p-2 反例: p1p-1(0,1),(1,0)(0,1),(1,0) )
Ans2 = 4p3Ans_2\ =\ 4p-3 (4p44p-4 反例: p1p-1(0,0),(0,1),(1,0),(1,1)(0,0),(0,1),(1,0),(1,1) )
(注意到解决Con.1的鸽巢原理无法应用于此处)
(Problem_2 又被称为 Kemnitz’ ConjectureKemnitz’\ Conjecture )

Solution_1-Generating_Function#

可重集 A={a1,a2,,am}A=\{a_1,a_2,\dots,a_m\}, a1,a2,,amZ>0a_1,a_2,\dots,a_m \in \mathbb{Z}_{>0}
(1+xa1)(1+xa2)(1+xam)=BAxσ(B)(1+x^{a_1})(1+x^{a_2})\cdots(1+x^{a_m})=\sum_{B\subset A}x^{\sigma(B)}
利用: (1xa1)(1xa2)(1xam)=BA(1)Bxσ(B)(1-x^{a_1})(1-x^{a_2})\cdots(1-x^{a_m})=\sum_{B\subset A}(-1)^{|B|}x^{\sigma(B)}

For_Con.1#

n=p, a1,a2,,amZ>0n=p,\ a_1,a_2,\dots,a_m\in \mathbb{Z}_{>0}
Sk:={BA  σ(B)k (mod p)}, k=0,1,,p1S_k:=\{B\subset A\ |\ \sigma(B)\equiv k\ (mod\ p)\},\ k=0,1,\dots,p-1
f(x):=(1xa1)(1xa2)(1xam)Fp/(xp1)f(x):=(1-x^{a_1})(1-x^{a_2})\cdots(1-x^{a_m})\in \mathbb{F}_p/(x^p-1)
f(x)=BA(1)Bxσ(B)=k=0p1(BSk(1)B)xk  ()f(x)=\sum_{B\subset A}(-1)^{|B|}x^{\sigma(B)}=\sum_{k=0}^{p-1}(\sum_{B\in S_k}(-1)^{|B|})x^k\ \ (\star)
上式可看作是余式,所以表示方式是唯一的.
另一方面,又有 (1xaj)=(1x)()(1-x^{a_j})=(1-x)(\cdots) ,则 f(x)=(1x)pg(x)f(x)=(1-x)^pg(x)
(1x)p=1(p1)x+(p2)x2++(1)pxp==mod p1xp==mod xp10(1-x)^p=1-\binom{p}{1}x+ \binom{p}{2}x^2+\cdots+(-1)^px^p \overset{mod\ p}{==}1-x^p\overset{mod\ x^p-1}{==}0
 f(x)=0\Rightarrow\ f(x)=0 结合 ()(\star) \Rightarrow  0kp1, BSk(1)B0 (mod p)\forall\ 0\le k\le p-1,\ \sum_{B\in S_k}(-1)^{|B|}\equiv 0\ (mod\ p)
特别的,k=0k=0 时,Sk\emptyset \in S_kBSk(1)B0 (mod p)\sum_{B\in S_k}(-1)^{|B|}\equiv 0\ (mod\ p)
  BS0\Rightarrow\ \exists\ B\in S_0 and B0, s.t. σ(B)0 (mod p)|B|\ne 0,\ s.t.\ \sigma(B)\equiv 0\ (mod\ p).

$\Box$

注意到这种方法给出了 比使用鸽巢原理更多的信息.

For_Problem-1#

A={(ai,bi)  ai,biZ>0 ,i=1,2,,2p1}A=\{(a_i,b_i)\ |\ a_i,b_i\in\mathbb{Z}_{>0}\ ,i=1,2,\dots,2p-1\}
f(X1,X2):=i=12p1(1X1aiX2bi)Fp[X1,X2]/(X1p1,X2p1)f(X_1,X_2):=\prod_{i=1}^{2p-1}(1-X_1^{a_i}X_2^{b_i})\in \mathbb{F}_p[X_1,X_2]/(X_1^p-1,X_2^p-1)
记为向量形式: X=(X1,X2), αi=(ai,bi), Xαi=X1aiX2biX=(X_1,X_2),\ \alpha_i=(a_i,b_i),\ X^{\alpha_i}=X_1^{a_i}X_2^{b_i} Sα:={BA  σ(B)α (mod p)}, α={0,1,,p1}2S_{\alpha}:=\{B\subset A\ |\ \sigma(B)\equiv \alpha\ (mod\ p)\},\ \alpha=\{0,1,\dots,p-1\}^2
f(X1,X2)=i=12p1(1Xαi)=BA(1)Bxσ(B)f(X_1,X_2)=\prod_{i=1}^{2p-1}(1-X^{\alpha_i})=\sum_{B\subset A}(-1)^{|B|}x^{\sigma(B)}
f(X)=α{0,1,,p1}2(BSα(1)B)Xαf(X)=\sum_{\alpha\in\{0,1,\dots,p-1\}^2}(\sum_{B\in S_{\alpha}}(-1)^{|B|})X^{\alpha}
Lemma:Lemma: (1X1aiX2bi)=(1X1)ui(X1,X2)+(1X2)vi(X1,X2)(1-X_1^{a_i}X_2^{b_i})=(1-X_1)\cdot u_i(X_1,X_2)+(1-X_2)\cdot v_i(X_1,X_2)
It’s a simple task. A={f(X1,X2)  f(1,1)=0}, B=(X11,X21)A=\{f(X_1,X_2)\ |\ f(1,1)=0\},\ B=(X_1-1,X_2-1)
Fp[X1,X2]/A = Fp[X1,X2]/B\mathbb{F} _p[X_1,X_2]/A\ =\ \mathbb{F} _p[X_1,X_2]/B A=B\Rightarrow A=B

f(X1,X2)=i=12p1((1X1)ui(X1,X2)+(1X2)vi(X1,X2))=(1X1)s(1X2)t()f(X_1,X_2)=\prod_{i=1}^{2p-1}((1-X_1)\cdot u_i(X_1,X_2)+(1-X_2)\cdot v_i(X_1,X_2))=\sum(1-X_1)^s(1-X_2)^t(\cdots)
s+t=2p1  sp or tps+t=2p-1\ \Rightarrow\ s\ge p\ or\ t\ge p
(1X1)p=0(1-X_1)^p=0 and (1X2)p=0  f(X1,X2)=0 (1-X_2)^p=0\ \Rightarrow\ f(X_1,X_2)=0\ \Rightarrow
 α{0,1,,p1}2, BSα(1)B0 (mod p)\forall\ \alpha\in\{0,1,\dots,p-1\}^2,\ \sum_{B\in S_{\alpha}}(-1)^{|B|}\equiv 0\ (mod\ p)
S(0,0)   B0, s.t. σ(B)0 (mod p)\emptyset\in S_{(0,0)}\ \Rightarrow\ \exists\ |B|\ne 0,\ s.t.\ \sigma(B)\equiv 0\ (mod\ p)

$\Box$

Solution_2-Chevalley_Warning_Theorem#

F1,F2,,FmFp[x1,x2,,xn]F_1,F_2,\dots,F_m\in\mathbb{F}_p[x_1,x_2,\dots,x_n]
Z(F1,F2,,Fm)={x(Fp)n  F1(x)=F2(x)==Fm(x)=0}\mathcal{Z}(F_1,F_2,\dots,F_m)=\{x\in(\mathbb{F}_p)^n\ |\ F_1(x)=F_2(x)=\cdots=F_m(x)=0\}
#Z(F1,F2,,Fm)0 (mod p)   if   i=1ndeg(Fi)<n\#\mathcal{Z}(F_1,F_2,\dots,F_m)\equiv0\ (mod\ p)\ \ \ if\ \ \ \sum_{i=1}^{n}deg(F_i)< n

Theorem’s_Proof#

x=(x1,x2,,xn)Fpnx=(x_1,x_2,\dots,x_n)\in \mathbb{F}_p^n According to Fermat’s Little Theorem,
xZ(F1,F2,,Fm)  j=1m(1Fj(x)p1)=1Fpx\in \mathcal{Z}(F_1,F_2,\dots,F_m)\ \Leftrightarrow\ \prod_{j=1}^{m}(1-F_j(x)^{p-1})=1\in\mathbb{F}_p #Z(F1,F2,,Fm)xFpj=1m(1Fj(x)p1) (mod p)\#\mathcal{Z}(F_1,F_2,\dots,F_m)\equiv \sum_{x\in\mathbb{F}_p}\prod_{j=1}^{m}(1-F_j(x)^{p-1})\ (mod\ p)
约定 x0x=0=1.x^0|_{x=0}=1.
Lemma:Lemma:
a0\forall a\ge 0

\begin{eqnarray} \sum_{x\in \mathbb{F}_p}x^a = \left\{ \begin{aligned} &p-1 &p-1|a\ne 0\\ &0 &others \end{aligned} \right. \end{eqnarray}$$<br> $deg\prod_{j=1}^{m}(1-F_j(x)^{p-1})\le (p-1)\sum degF_j<(p-1)n$ $$\#\mathcal{Z}=\sum_{\{a_k\}}\ \sum_{(x_1,x_2,\dots,x_n)\in \mathbb{F}_p ^n}x_1^{a_1}x_2^{a_2}\cdots x_n^{a_n}=\sum_{\{a_k\}}(\sum_{x_1\in \mathbb{F}_p}x_1^{a_1})(\cdots)(\cdots)\cdots(\cdots)$$<br> 又 $a_1+a_2+\cdots+a_n<(p-1)n\ \Rightarrow\ \exists \ a_j\le p-2.$<br> 故 $\#\mathcal{Z}(F_1,F_2,\dots,F_m)\equiv0\ (mod\ p)$<br> <p align="right">$\Box$</p> #### For_Con.1 $A=\{a_1,a_2,\dots,a_p\},a_1,a_2,\dots,a_p>0$<br> $$F(x)=a_1x_1^{p-1}+a_2x_2^{p-1}+\cdots a_px_p^{p-1}\in \mathbb{F}_p[x]$$<br> $degF\le p-1< p$<br><br> $x=(x_1,x_2,\dots,x_n)\in \mathbb{F} _p^n$<br> $x\in \mathcal{Z}(F),\ x_{i_1},x_{i_2},\dots,x_{i_k}\ne 0,\ other\ x_i=0\ \Leftrightarrow\ a_{i_1}+a_{i_2}+\cdots+a_{i_k}\equiv 0\ (mod\ p)$<br><br> $N_k:=\#\{B\subset A\ |\ |B|=k,\sigma(B)\equiv 0\ (mod\ p)\}\ 0\le k\le p$,即 $k$ 元 $Zero-sum-subset$<br> $$\#\mathcal{Z}(F)=\sum_{k=0}^pN_k(p-1)^k\overset{C-W}{\equiv}0\ (mod\ p)$$<br> $$\#\mathcal{Z}(F)\equiv\sum_{k=0}^p(-1)^kN_k\equiv 0\ (mod\ p)$$<br> $ N_0=1\ (\emptyset)\ \Rightarrow\ \exists\ 0< k\le p,N_k\ne 0 $ <p align="right">$\Box$</p> #### For_Con.2 $Erdo ̋s,Ginzburg\ and\ Ziv\ Theorem$<br> $a_1,a_2,\dots,a_{2p-1}\in \mathbb{F}_p $ $$F_1=x_1^{p-1}+x_2^{p-1}+\cdots x_{2p-1}^{p-1}$$<br> $$F_2=a_1x_1^{p-1}+a_2x_2^{p-1}+\cdots a_{2p-1}x_{2p-1}^{p-1}$$<br> $degF_1+degF_2\le 2p-2< 2p-1$ $$\#\mathcal{Z}(F_1,F_2)=N_0+(p-1)^pN_p\equiv 0\ (mod\ p) $$<br> $\Rightarrow\ N_p\equiv N_0=1\ (mod\ p)$, obviously $N_p\ne 0$. <p align="right">$\Box$</p> #### For_Problem-1 $(a_i,b_i)\subset \mathbb{Z}^2\ ,i=1,2,\dots,2p-1$ $$F_1=a_1x_1^{p-1}+a_2x_2^{p-1}+\cdots a_{2p-1}x_{2p-1}^{p-1}$$<br> $$F_2=b_1x_1^{p-1}+b_2x_2^{p-1}+\cdots b_{2p-1}x_{2p-1}^{p-1}$$<br> $degF_1+degF_2\le 2p-2< 2p-1\ \Rightarrow\ \#\mathcal{Z}(F_1,F_2)\equiv 0\ (mod\ p)$<br> $x=(0,0,\dots,0)\in \mathcal{Z}(F_1,F_2)\ \Rightarrow\ \exists\ x\ne(0,0,\dots,0)\in \mathcal{Z}(F_1,F_2)$<br> <p align="right">$\Box$</p> 类似的,可以证明 $D((C_p)^r)=r(p-1)+1$. ### Kemnitz’_Conjecture's_Proof $C.\ Reiher\ \ 2007,(German),1999-2003\ IMO\ 4G1B$<br>

\begin{cases} F_1=x_1^{p-1}+x_2^{p-1}+\cdots x_{m}^{p-1}\ F_2=a_1x_1^{p-1}+a_2x_2^{p-1}+\cdots a_{m}x_{m}^{p-1}\ F_3=b_1x_1^{p-1}+b_2x_2^{p-1}+\cdots b_{m}x_{m}^{p-1} \end{cases}

$A=\{(a_i,b_i)\ |\ i=1,2,\dots,m\}$<br> $N_k(A):=\{B\subset A\ |\ |B|=k,\sigma(B)\equiv(0,0)\ (mod\ p)\}$<br> 使用 $C-W\ Theorem$ 前提: $m>3(p-1)$ 即 $m\ge 3p-2$ 后续技巧具体可见[Reference](#Reference) ### Reference [On Kemnitz’ conjecture concerning lattice-points in the plane](https://blog.yhx1415926.top/scr/content/posts/reference/On_Kemnitz’_conjecture_concerning_lattice-points_in_the_plane.pdf)

支持与分享

如果这篇文章对你有帮助,欢迎分享给更多人或赞助支持!

赞助
Zero Sum Subsets
https://yhx1415926.github.io/posts/zerosumsubsets/
作者
yao1415926
发布于
2024-07-21
许可协议
CC BY 4.0
最后更新于 2024-07-21,距今已过 631 天

部分内容可能已过时

评论区

Profile Image of the Author
Yao1415926
Hello, I'm yao1415926.
公告
欢迎所有旅人踏进我的魔女驿站——请慢慢探索。
音乐
封面

音乐

暂未播放

0:00 0:00
暂无歌词
分类
标签
站点统计
文章
5
分类
5
标签
10
总字数
6,847
运行时长
0
最后活动
0 天前

目录