On the number of combinations without unit separation
β Scribed by John Konvalina
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 250 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the following graph labeling problem, introduced by Leung et al. (3. Y-T. Leung, 0. Vornberger, and J. D. Witthoff, On some variants of the bandwidth minimization problem. SIAM J. Comput. 13 (1984) 650-667). Let G be a graph of order n, and f a bijection from the separation number of G,
Let \(K\) be an algebraic number field and \(k\) be a proper subfield of \(K\). Then we have the relations between the relative degree \([K: k]\) and the increase of the rank of the unit groups. Especially, in the case of \(m\) th cyclotomic field \(Q\left(\zeta_{m}\right)\), we determine the number
## Abstract The separation number is affected by a variety of extraβcolumn factors (e.g. the injection process, the nature of the sample, and plumbing defects in the inlet and detector) as well as factors related to column efficiency. The magnitude of the separation number, as affected by the colum