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

Sperner分区系统

Sperner partition systems

P. C. Li, Karen Meagher

摘要:

集合$X$上的\textsl{Sperner $k$-partition system}是将$X$划分为$k$类的集合,使得划分的类形成Sperner集合系统(因此来自一个划分的类不是来自另一个划分的类的子集)。这些系统是由Meagher,Rimala和Stevens在\cite{MMS}中定义的,他们表明如果$|X| = k \ell$,那么最大的Sperner $k$ -分区系统具有大小$\frac{1}{k}\binom{|X|}{\ell}$。本文给出了最大的Sperner $k$ -划分系统的大小的界,其中$k$不划分$X$的大小,特别地,当$k=2$时给出了一个精确的界,当$|X| = 2k+1$,$|X|=2k+2$和$|X| = 3k-1$时给出了上界和下界.

英文摘要:

A \textsl{Sperner $k$-partition system} on a set $X$ is a set of partitions of $X$ into $k$ classes such that the classes of the partitions form a Sperner set system (so no class from a partition is a subset of a class from another partition). These systems were defined by Meagher, Moura and Stevens in \cite{MMS} who showed that if $|X| = k \ell$, then the largest Sperner $k$-partition system has size $\frac{1}{k}\binom{|X|}{\ell}$. In this paper we find bounds on the size of the largest Sperner $k$-partition system where $k$ does not divide the size of $X$, specifically, we give an exact bound when $k=2$ and upper and lower bounds when $|X| = 2k+1$, $|X|=2k+2$ and $|X| = 3k-1$.

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

↑