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

de Bruijn图中的双射

Bijections in de Bruijn Graphs

Josef Rukavicka

摘要:

$m$阶T-网是一个由$m$结点和$2m$有向边组成的图,其中每个结点的入度和出度都等于$2$.(T网的一个著名例子是de Bruijn图。给定$m$阶的T网$N$,存在所谓的"加倍"过程,该过程从具有$2m$节点和$4m$边的$N$创建T网$N^*$。设$|X|$表示图$X$中欧拉圈的个数.已知$| N^*|=2^{m-1}|N|$.在本文中,我们提出了一个新的证明这个身份。此外,我们还证明了$|N|\leq 2^{m-1}$.设$Θ(X)$表示图$X$中所有欧拉圈的集合,$S(n)$表示长度为$n$的所有二进制序列的集合。利用新的证明,我们构建了一个双射$Θ(N)\times S(m-1)\rightarrow Θ(N^*)$,这使我们能够解决斯坦利的一个开放的问题:我们找到一个双射之间的de Bruijn序列的顺序$n$和$S(2^{n-1})$。

英文摘要:

A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called "doubling" process that creates a T-net $N^*$ from $N$ with $2m$ nodes and $4m$ edges. Let $|X|$ denote the number of Eulerian cycles in a graph $X$. It is known that $| N^*|=2^{m-1}|N|$. In this paper we present a new proof of this identity. Moreover we prove that $|N|\leq 2^{m-1}$. Let $Θ(X)$ denote the set of all Eulerian cycles in a graph $X$ and $S(n)$ the set of all binary sequences of length $n$. Exploiting the new proof we construct a bijection $Θ(N)\times S(m-1)\rightarrow Θ(N^*)$, which allows us to solve one of Stanley's open questions: we find a bijection between de Bruijn sequences of order $n$ and $S(2^{n-1})$.

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

↑