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

关于在环中寻找受约束的独立集

On Finding Constrained Independent Sets in Cycles

Ishay Haviv

AI总结:

基于Schrijver关于稳定子集覆盖的拓扑结论,研究了环上受约束独立集的两个完全搜索问题,分析了它们在不同参数条件下的计算复杂度,证明了部分情形存在多项式时间算法,而特定限制下为PPA-完全。

摘要:

如果 $[n] = \{1,2,\ldots,n\}$ 的一个子集在顶点集 $[n]$ 上的环中构成独立集,则称其为稳定的。1978年,Schrijver通过拓扑论证证明,对于所有满足 $n \geq 2k$ 的整数 $n$ 和 $k$,$[n]$ 的稳定 $k$-子集族不能被 $n-2k+1$ 个相交族所覆盖。我们研究了两个完全搜索问题,其完全性依赖于这一结果。在第一个记为 $\mathsf{Schrijver}(n,k,m)$ 的问题中,给定对 $[n]$ 的稳定 $k$-子集使用 $m = m(n,k)$ 种颜色的着色访问权限,其中 $m \leq n-2k+1$,目标是找到一对被赋予相同颜色的不相交子集。虽然当 $m = n-2k+1$ 时已知该问题是 $\mathsf{PPA}$-完全的,但我们证明对于 $m < d \cdot \lfloor \frac{n}{2k+d-2} \rfloor$(其中 $d$ 为任意固定常数),该问题存在高效算法。对于 $m = \lfloor n/2 \rfloor-2k+1$,我们证明该问题可高效归约至 $\mathsf{Kneser}$ 问题。受这些问题间关系的启发,我们研究了 $[n]$ 的不稳定 $k$-子集族,这或许具有独立的研究价值。在第二个称为环中不公平独立集的问题中,给定 $[n]$ 的 $\ell$ 个子集 $V_1, \ldots, V_\ell$,其中 $\ell \leq n-2k+1$ 且对所有 $i \in [\ell]$ 满足 $|V_i| \geq 2$,目标是找到 $[n]$ 的一个稳定 $k$-子集 $S$,使其满足约束 $|S \cap V_i| \leq |V_i|/2$($i \in [\ell]$)。我们证明该问题是 $\mathsf{PPA}$-完全的,并且其对于 $n=3k$ 实例的限制至少与环加三角形问题一样难,后者目前尚无已知的高效算法。相反,我们证明存在一个常数 $c$,使得该问题对于 $n \geq c \cdot k$ 实例的限制可在多项式时间内求解。

英文摘要:

A subset of $[n] = \{1,2,\ldots,n\}$ is called stable if it forms an independent set in the cycle on the vertex set $[n]$. In 1978, Schrijver proved via a topological argument that for all integers $n$ and $k$ with $n \geq 2k$, the family of stable $k$-subsets of $[n]$ cannot be covered by $n-2k+1$ intersecting families. We study two total search problems whose totality relies on this result. In the first problem, denoted by $\mathsf{Schrijve}r(n,k,m)$, we are given an access to a coloring of the stable $k$-subsets of $[n]$ with $m = m(n,k)$ colors, where $m \leq n-2k+1$, and the goal is to find a pair of disjoint subsets that are assigned the same color. While for $m = n-2k+1$ the problem is known to be $\mathsf{PPA}$-complete, we prove that for $m < d \cdot \lfloor \frac{n}{2k+d-2} \rfloor$, with $d$ being any fixed constant, the problem admits an efficient algorithm. For $m = \lfloor n/2 \rfloor-2k+1$, we prove that the problem is efficiently reducible to the $\mathsf{Kneser}$ problem. Motivated by the relation between the problems, we investigate the family of unstable $k$-subsets of $[n]$, which might be of independent interest. In the second problem, called Unfair Independent Set in Cycle, we are given $\ell$ subsets $V_1, \ldots, V_\ell$ of $[n]$, where $\ell \leq n-2k+1$ and $|V_i| \geq 2$ for all $i \in [\ell]$, and the goal is to find a stable $k$-subset $S$ of $[n]$ satisfying the constraints $|S \cap V_i| \leq |V_i|/2$ for $i \in [\ell]$. We prove that the problem is $\mathsf{PPA}$-complete and that its restriction to instances with $n=3k$ is at least as hard as the Cycle plus Triangles problem, for which no efficient algorithm is known. On the contrary, we prove that there exists a constant $c$ for which the restriction of the problem to instances with $n \geq c \cdot k$ can be solved in polynomial time.

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

↑