Let f（n）denote the number of factorizations of the natural number n into factors larger than 1, not considering the order of the factors. We call each of these factorizations a multiplicative partition of n, or simp...Let f（n）denote the number of factorizations of the natural number n into factors larger than 1, not considering the order of the factors. We call each of these factorizations a multiplicative partition of n, or simply, partition. Also let f（1）=1. On the upper bound of f（n）, J. F. Hughes and J. O. Shallit proved that f（n）≤2n<sup>2<sup>1/2</sup></sup> and mentioned two conjectures:展开更多
In [1] Edmonds showed that for any linear objective function a basis of an independent system obtained by greedy algorithm is always a maximum iff the independent system satisfies Steinitz exchange axiom. Such a syste...In [1] Edmonds showed that for any linear objective function a basis of an independent system obtained by greedy algorithm is always a maximum iff the independent system satisfies Steinitz exchange axiom. Such a system is called a matroid.展开更多
文摘Let f（n）denote the number of factorizations of the natural number n into factors larger than 1, not considering the order of the factors. We call each of these factorizations a multiplicative partition of n, or simply, partition. Also let f（1）=1. On the upper bound of f（n）, J. F. Hughes and J. O. Shallit proved that f（n）≤2n<sup>2<sup>1/2</sup></sup> and mentioned two conjectures:
文摘In [1] Edmonds showed that for any linear objective function a basis of an independent system obtained by greedy algorithm is always a maximum iff the independent system satisfies Steinitz exchange axiom. Such a system is called a matroid.
