我们研究了一类在完全图$K_n$上的加权Max-Cut实例,其中边权按字典序递减几何分布:第i条边的权重为$r^{N-i}$,其中$N=\binom{n}{2}$。对于$r\ge 2$,字典序第一划分是最优的;对于$r=1$,所有边权重相等,平衡划分获胜。在本文中,我们研究中间区域$1< r <2$。几何加权使早期边占据主导地位,并凸显出$k$-孤立划分$C_k=\{1,\dots,k\}\mid\{k+1,\dots,n\}$作为最优的自然候选。对于每个$n$和$k\le\lfloor n/2\rfloor-1$,我们定义阈值多项式$P^{n,k}(r)$,其唯一的根$r_k(n)\in(1,2)$决定了$C_k$和$C_{k+1}$的主导地位交换时刻。我们证明,对于固定的$n$,这些阈值随着$k$严格递减,并且当$n\to\infty$时,$r_k(n)\to 1$。作为主要结果,我们证明,对于$r\in(r_k(n),r_{k-1}(n))$,划分$C_k$在所有孤立划分中达到最大权重,从而为孤立划分家族提供了清晰的相图。我们推测,当$n\ge 7$时,孤立划分在所有$2^{n-1}$划分中是全局最优的;所有小$n$的反例都被完全刻画,并且对于$n\le 100$的广泛计算支持这一猜想。
英文摘要:
We study a family of weighted Max-Cut instances on the complete graph $K_n$ in which edge weights decrease geometrically in lexicographic order: the $i$-th edge has weight $r^{N-i}$ where $N=\binom{n}{2}$. For $r\ge 2$, the lexicographically first cut is optimal; for $r=1$, all edges have equal weight and the balanced partition wins. In this paper we study the intermediate regime $1< r <2$.
The geometric weighting makes early edges dominant and singles out the $k$-isolated cuts $C_k=\{1,\dots,k\}\mid\{k+1,\dots,n\}$ as natural candidates for optimality. For each $n$ and $k\le\lfloor n/2\rfloor-1$, we define threshold polynomials $P^{n,k}(r)$ whose unique roots $r_k(n)\in(1,2)$ determine when $C_k$ and $C_{k+1}$ exchange dominance. We prove that, for fixed $n$, these thresholds are strictly decreasing in $k$ and that $r_k(n)\to 1$ as $n\to\infty$. As our main result, we show that for $r\in(r_k(n),r_{k-1}(n))$ the cut $C_k$ achieves maximum weight among all isolated cuts, yielding a sharp phase diagram for the isolated-cut family.
We conjecture that isolated cuts are globally optimal among all $2^{n-1}$ cuts when $n\ge 7$; all counterexamples for small $n$ are characterized completely, and extensive computations for $n\le 100$ support the conjecture.