连续两场比赛中的一个国王
A King in every two consecutive tournaments
摘要:
我们将锦标赛$T=([n], E)$视为一个通信网络,其中在每一轮通信中,处理器$P_i$针对每个有向边$ij \in E(T)$向$P_j$发送其信息。根据Landau定理(1953),$T$中有一个King,即,一种处理器,其初始输入在两轮或更少的时间内到达每一个其它处理器。即,一种处理器$P_ν$,使得在沿着$T$的边缘的两轮通信之后,$P_ν$的初始信息到达所有其它处理器。在这里,我们考虑一个更一般的情况下,对手选择一个任意系列的比赛$T_1, T_2,\ldots$,使在每一轮$s=1, 2, \ldots$,通信是由相应的比赛$T_s$。我们证明,对于对手选择的每一系列比赛,它仍然是真实的,经过两轮通信,至少一个处理器的初始输入到达每个人。具体地说,我们证明了,对于每两个比赛$T_1, T_2$有一个顶点在$[n]$,可以达到所有顶点通过(i)$T_1$中的一步,或(ii)一步在$T_2$或(iii)一步在$T_1$中的一步,随后在$T_2$。}
英文摘要:
We think of a tournament $T=([n], E)$ as a communication network where in each round of communication processor $P_i$ sends its information to $P_j$, for every directed edge $ij \in E(T)$. By Landau's theorem (1953) there is a King in $T$, i.e., a processor whose initial input reaches every other processor in two rounds or less. Namely, a processor $P_ν$ such that after two rounds of communication along $T$'s edges, the initial information of $P_ν$ reaches all other processors. Here we consider a more general scenario where an adversary selects an arbitrary series of tournaments $T_1, T_2,\ldots$, so that in each round $s=1, 2, \ldots$, communication is governed by the corresponding tournament $T_s$. We prove that for every series of tournaments that the adversary selects, it is still true that after two rounds of communication, the initial input of at least one processor reaches everyone. Concretely, we show that for every two tournaments $T_1, T_2$ there is a vertex in $[n]$ that can reach all vertices via (i) A step in $T_1$, or (ii) A step in $T_2$ or (iii) A step in $T_1$ followed by a step in $T_2$. }
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。