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

彩色正交表中的计数模式

Counting patterns in colored orthogonal arrays

Amanda Montejano, Oriol Serra

摘要:

设$S$是一个正交数组$OA(d,k)$,$c$是它的基集$X$的$r$ -染色.我们给出了一个组合恒等式,它将$S$中的向量数与$c$下给定的颜色模式与颜色类的基数联系起来。几个应用程序的身份被认为是。其中,我们证明了整数区间$[1,n]$的每一个均匀$r$ --染色至少有$1/2(n/r)^2+O(n)$单色Schur三元组。我们还表明,在一个正交表$OA(d,d-1)$,单色矢量的每种颜色的数量只取决于错过该颜色的矢量的数量和颜色类的基数。

英文摘要:

Let $S$ be an orthogonal array $OA(d,k)$ and let $c$ be an $r$--coloring of its ground set $X$. We give a combinatorial identity which relates the number of vectors in $S$ with given color patterns under $c$ with the cardinalities of the color classes. Several applications of the identity are considered. Among them, we show that every equitable $r$--coloring of the integer interval $[1,n]$ has at least $1/2(n/r)^2+O(n)$ monochromatic Schur triples. We also show that in an orthogonal array $OA(d,d-1)$, the number of monochromatic vectors of each color depends only on the number of vectors which miss that color and the cardinality of the color class.

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

↑