arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.4668math.CO
收藏

超图的最小权边判别器

Minimum-Weight Edge Discriminator in Hypergraphs

Bhaswar B. Bhattacharya, Sayantan Das, Shirshendu Ganguly

摘要:

本文在超图中引入了最小权边判别子的概念,并研究了它的各种性质。对于一个超图$\mathcal H=(\mathcal V, \mathcal E)$,一个函数$λ: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\}$被称为是$\mathcal H$上的一个{ \it边集},如果对于所有的超边$E_i\in \mathcal E$,$\sum_{v\in E_i}{λ(v)}>0$,对于每两个不同的超边$E_i, E_j \in \mathcal E$,$\sum_{v\in E_i}{λ(v)}\ne \sum_{v\in E_j}{λ(v)}$。$\mathcal H$上的{ \it最优边鉴别器},用$λ_\mathcal H$表示,是满足$\sum_{v\in \mathcal V}λ_\mathcal H (v)=\min_λ\sum_{v\in \mathcal V}{λ(v)}$的$\mathcal H$上的边鉴别器,其中,在$\mathcal H$上的所有边鉴别器上取最小值。本文证明了任何具有$|\mathcal E|=n$的超图$\mathcal H=(\mathcal V, \mathcal E)$都满足$\sum_{v\in \mathcal V} λ_\mathcal H(v)\leq n(n+1)/2$,且等式成立当且仅当$\mathcal E$的元素互不相交.对于$r$ -一致超图$\mathcal H=(\mathcal V, \mathcal E)$,由Sidon序列的结果推出了$\sum_{v\in \mathcal V}λ_{\mathcal H}(v)\leq |\mathcal V|^{r+1}+o(|\mathcal V|^{r+1})$,并利用完全$r$ -一致超图得到了其上界的常数因子.其次,我们构造了一些特殊超图的最优边判别器,这些超图包括路、圈和完全$r$ -部超图。最后,我们证明了任何超图$\mathcal H=(\mathcal V, \mathcal E)$上没有最优边集满足$\sum_{v\in \mathcal V} λ_\mathcal H (v)=n(n+1)/2-1$,这反过来又引起了许多其他有趣的组合问题。

英文摘要:

In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, a function $λ: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\}$ is said to be an {\it edge-discriminator} on $\mathcal H$ if $\sum_{v\in E_i}{λ(v)}>0$, for all hyperedges $E_i\in \mathcal E$, and $\sum_{v\in E_i}{λ(v)}\ne \sum_{v\in E_j}{λ(v)}$, for every two distinct hyperedges $E_i, E_j \in \mathcal E$. An {\it optimal edge-discriminator} on $\mathcal H$, to be denoted by $λ_\mathcal H$, is an edge-discriminator on $\mathcal H$ satisfying $\sum_{v\in \mathcal V}λ_\mathcal H (v)=\min_λ\sum_{v\in \mathcal V}{λ(v)}$, where the minimum is taken over all edge-discriminators on $\mathcal H$. We prove that any hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, with $|\mathcal E|=n$, satisfies $\sum_{v\in \mathcal V} λ_\mathcal H(v)\leq n(n+1)/2$, and equality holds if and only if the elements of $\mathcal E$ are mutually disjoint. For $r$-uniform hypergraphs $\mathcal H=(\mathcal V, \mathcal E)$, it follows from results on Sidon sequences that $\sum_{v\in \mathcal V}λ_{\mathcal H}(v)\leq |\mathcal V|^{r+1}+o(|\mathcal V|^{r+1})$, and the bound is attained up to a constant factor by the complete $r$-uniform hypergraph. Next, we construct optimal edge-discriminators for some special hypergraphs, which include paths, cycles, and complete $r$-partite hypergraphs. Finally, we show that no optimal edge-discriminator on any hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, with $|\mathcal E|=n (\geq 3)$, satisfies $\sum_{v\in \mathcal V} λ_\mathcal H (v)=n(n+1)/2-1$, which, in turn, raises many other interesting combinatorial questions.

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

↑