中文

基于布尔立方体上组合旗的阈值函数个数的下界

组合数学 2018-11-27 v1 代数拓扑

摘要

E={(1,b1,,bn)Rn+1  bi=±1,  i=1,,n} E=\{ (1, b_1, \ldots , b_n)\in R^{n+1} \mid \; b_i= \pm 1 ,\; i=1, \ldots, n \}, E0×n:={W=(wi1,,win)wikE,k=1,,n,dimspan(wi1,,win)=n},E^{\times n}_{\ne 0} := \{ W=(w_{i_1}, \ldots , w_{i_n}) \mid w_{i_k}\in E, \, k=1, \ldots, n, \, dim \, span(w_{i_1}, \ldots , w_{i_n}) = n \},qlW:=span(winl+1,,win)E.q^W_l := |span(w_{i_{n-l+1}}, \ldots , w_{i_n}) \cap E|. 则对于任意权重 p=(p1,,p2n)p=(p_1, \ldots, p_{2^n}), piRp_i\in R, i=12npi=1\sum_{i=1}^{2^n}{p_i} =1, 关于阈值函数个数 P(2,n)P(2,n) 我们有以下下界 P(2,n)2WE0×n1pi1pi2piqnWqnWqn1Wq1W,P(2, n) \geq 2\sum_{W\in E^{\times n}_{\ne 0}}{\frac{1- p_{i_1} -p_{i_2} - \cdots - p_{i_{q_n^W}}}{q_n^W\cdot q_{n-1}^W\cdots q_1^W}}, 且该不等式右端与 pp 的选取无关。此处分子中使用的指标对应于向量 span(wi1,,win)E={wi1,,win,wiqnW}span(w_{i_1}, \ldots , w_{i_n})\cap E = \left\{w_{i_1}, \ldots, w_{i_n}, \ldots w_{i_{q_n^W}}\right\}

关键词

引用

@article{arxiv.1811.10087,
  title  = {A Lower Bound of the Number of Threshold Functions in Terms of Combinatorial Flags on the Boolean Cube},
  author = {Anwar Irmatov},
  journal= {arXiv preprint arXiv:1811.10087},
  year   = {2018}
}

备注

11 pages