arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.14468math.COmath.GR
收藏

The Polychromatic Number of Small Subsets of the Integers Modulo $n$

Emelie Curl, John Goldwasser, Joe Sampson, Michael Young

英文摘要:

If $S$ is a subset of an abelian group $G$, the polychromatic number of $S$ in $G$ is the largest integer $k$ so that there is a $k-$coloring of the elements of $G$ such that every translate of $S$ in $G$ gets all $k$ colors. We determine the polychromatic number of all sets of size 2 or 3 in the group of integers mod n.

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

↑