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

围长条件与Rota基猜想

Girth conditions and Rota's basis conjecture

Benjamin Friedman, Sean McGuinness

摘要:

Rota基猜想(RBC)指出,给定秩为$n$的拟阵$M$中的$n$基的集合$\mathcal{B}$,总是可以找到$n$关于$\mathcal{B}$的不相交彩虹基。本文证明了:如果$M$的围长至少为$n-o(\sqrt{n})$,且$M$中没有元素属于$\mathcal{B}$中多于一个的$o(\sqrt{n})$基,则至少可以找到关于$\mathcal{B}$的$n - o(n)$不相交彩虹基.这个结果可以看作是Geelen和Humphries工作的延伸,他们证明了在$M$是铺路的情况下RBC,并且$\mathcal{B}$是成对不相交的集合。我们广泛使用Bucić等人提出的级联思想。

英文摘要:

Rota's basis conjecture (RBC) states that given a collection $\mathcal{B}$ of $n$ bases in a matroid $M$ of rank $n$, one can always find $n$ disjoint rainbow bases with respect to $\mathcal{B}$. In this paper, we show that if $M$ has girth at least $n-o(\sqrt{n})$, and no element of $M$ belongs to more than $o(\sqrt{n})$ bases in $\mathcal{B}$, then one can find at least $n - o(n)$ disjoint rainbow bases with respect to $\mathcal{B}$. This result can be seen as an extension of the work of Geelen and Humphries, who proved RBC in the case where $M$ is paving, and $\mathcal{B}$ is a pairwise disjoint collection. We make extensive use of the cascade idea introduced by Bucić et al.

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

↑