再论扩散数和覆盖数
Revisiting the spreading and covering numbers
摘要:
我们重新讨论计算扩展数和覆盖数的问题。我们证明了一些扩展数与其元素和为d的非负整数2 × 2矩阵的个数之间的联系,并构造了一个计算覆盖数的改进上界的算法。
英文摘要:
We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2x2 matrices whose entries sum to d, and we construct an algorithm to compute improved upper bounds for the covering numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。