关于纯 $κ$-稀疏间隙集的一个特定序列
A certain sequence on pure $κ-$sparse gapsets
AI总结:
本文研究纯 $κ$-稀疏间隙集,证明亏格 $3n+1$ 与 $3n+2$ 两类特定最大距离条件下的间隙集基数相等,并计算了对称与伪对称间隙集的基数,对应OEIS序列A374773。
摘要:
本文研究纯 $κ$-稀疏间隙集,重点获取文献[1]表3中观察到的序列的相关信息,该序列在OEIS中编号为A374773。我们验证:对所有 $n\in \mathbb{N}$,亏格为 $3n+1$ 且相邻两元素间最大距离为 $2n$ 的间隙集集合的基数,等于亏格为 $3n+2$ 且相邻两元素间最大距离为 $2n+1$ 的间隙集集合的基数。特别地,我们计算了这些情形下对称间隙集与伪对称间隙集的基数。
英文摘要:
In this paper, we study the pure $κ-$sparse gapsets and our focus on getting information about the sequence observed in Table 3 at [1], this sequence is listed in OEIS as A374773. We verify that the cardinality of the set of gapsets with genus $3n+1$ such that the maximum distance between two consecutive elements is $2n$ is equal to the cardinality of the set of gapsets with genus $3n+2$ such that the maximum distance between two consecutive elements is $2n+1$, for all $n\in \mathbb{N}$. In particular, we compute the cardinality of the symmetric and pseudo-symmetric gapsets in these cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。