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

小Mendelsohn三元系的良序

Good sequencings for small Mendelsohn triple systems

Donald L. Kreher, Douglas R. Stinson, Shannon Veitch

摘要:

$v$阶的门德尔松三元系(Mendelsohn triple system of order $v$或MTS $(v)$)是将完全图分解为有向3圈的一种分解。我们用$(x,y,z)$,$(y,z,x)$或$(z,x,y)$表示具有边$(x,y)$,$(y,z)$和$(z,x)$的有向3-圈. MTS $(v)$的$\ell$ -良好测序是设计点的排列,例如$[x_1 \; \cdots \; x_v]$,使得对于设计中的每个三重$(x,y,z)$,不是$x = x_i$、$y = x_j$和$z = x_k$与$i < j < k$和$k-i+1 \leq \ell$ ;或与$j < k < i$和$i-j+1 \leq \ell$ ;或与$k < i < j$和$j-k+1 \leq \ell$的情况。

英文摘要:

A Mendelsohn triple system of order $v$ (or MTS$(v)$) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges $(x,y)$, $(y,z)$ and $(z,x)$ by $(x,y,z)$, $(y,z,x)$ or $(z,x,y)$. An $\ell$-good sequencing of a MTS$(v)$ is a permutation of the points of the design, say $[x_1 \; \cdots \; x_v]$, such that, for every triple $(x,y,z)$ in the design, it is not the case that $x = x_i$, $y = x_j$ and $z = x_k$ with $i < j < k$ and $k-i+1 \leq \ell$; or with $j < k < i$ and $i-j+1 \leq \ell$; or with $k < i < j$ and $j-k+1 \leq \ell$.

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

↑