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

着色的极小重构

Minimal reconstructions of a coloring

Diego Gamboa, Carlos Uzcategui-Aylwin

AI总结:

该研究围绕集合上着色的极小重构问题展开,定义了相关的齐次集、非平凡重构与极小重构概念,证明了当基础集足够大时,着色的极小重构距离r(φ)仅能取1或4两个值,推进了着色重构理论的研究。

摘要:

有限集或可数集$X$上的着色是指函数$\varphi: [X]^{2} \to \{0,1\}$,其中$[X]^{2}$是$X$的所有无序对构成的集合。$\varphi$的齐次集集合记为$Hom(\varphi)$,由所有满足$\varphi$在$[H]^2$上取常值的子集$H \subseteq X$组成;显然有$Hom(\varphi) = Hom(1-\varphi)$。若对于$X$上任意满足$Hom(\varphi) = Hom(\psi)$的着色$\psi$,都有$\psi= \varphi$或$\psi= 1-\varphi$,则称着色$\varphi$可从其齐次集在补运算下重构。我们用$\mathcal{R}$表示所有可从自身齐次集重构的着色构成的集合。设$\varphi$和$\psi$是$X$上的着色,定义\\[ D(\varphi, \psi) = \{ \{x,y\} \in [X]^2: \\; \psi\{x,y\} \neq \varphi\{x,y\}\}。 \\]若$\varphi\not\in \mathcal{R}$,令\\[ r(\varphi) = \min\{|D(\varphi, \psi)|: \\; Hom(\varphi) = Hom(\psi), \\, \psi\neq \varphi, \\, \psi\neq 1-\varphi\}。 \\]满足$Hom(\varphi)=Hom(\psi)$、$\varphi\neq \psi$且$1-\varphi\neq \psi$的着色$\psi$称为$\varphi$的非平凡重构。若进一步满足$r(\varphi) =|D(\varphi, \psi)|$,则称$\psi$是$\varphi$的极小重构。本文的研究目的是分析着色的极小重构,我们证明当$X$的规模足够大时,$r(\varphi)$只能取1或4这两个值。

英文摘要:

A coloring on a finite or countable set $X$ is a function $φ: [X]^{2} \to \{0,1\}$, where $[X]^{2}$ is the collection of unordered pairs of $X$. The collection of homogeneous sets for $φ$, denoted by $Hom(φ)$, consist of all $H \subseteq X$ such that $φ$ is constant on $[H]^2$; clearly, $Hom(φ) = Hom(1-φ)$. A coloring $φ$ is \textit{reconstructible} up to complementation from its homogeneous sets if, for any coloring $ψ$ on $X$ such that $Hom(φ) = Hom(ψ)$, either $ψ= φ$ or $ψ= 1-φ$. By $\mathcal{R}$ we denote the collection of all colorings reconstructible from their homogeneous sets. Let $φ$ and $ψ$ be colorings on $X$, and set \[ D(φ, ψ) = \{ \{x,y\} \in [X]^2: \; ψ\{x,y\} \neq φ\{x,y\}\}. \] If $φ\not\in \mathcal{R}$, let \[ r(φ) = \min\{|D(φ, ψ)|: \; Hom(φ) = Hom(ψ), \, ψ\neq φ, \, ψ\neq 1-φ\}. \] A coloring $ψ$ such that $Hom(φ)=Hom(ψ)$, $φ\neq ψ$ and $1-φ\neq ψ$ is called a {\em non trivial reconstruction} of $φ$. If, in addition, $r(φ) =|D(φ, ψ)|$, we call $ψ$ a {\em minimal reconstruction} of $φ$. The purpose of this article is to study the minimal reconstructions of a coloring. We show that, for large enough $X$, $r(φ)$ can only takes the values $1$ or $4$.

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

↑