How Intricate are (2s + 1)-Factorizations?
Canadian mathematical bulletin, Tome 30 (1987) no. 2, pp. 241-247
Voir la notice de l'article provenant de la source Cambridge
The intricacy of the problem of (2s + 1 )-factorizating Kn is determined. Some generalizations are also given.
Hilton, A. J. W. How Intricate are (2s + 1)-Factorizations?. Canadian mathematical bulletin, Tome 30 (1987) no. 2, pp. 241-247. doi: 10.4153/CMB-1987-034-2
@article{10_4153_CMB_1987_034_2,
author = {Hilton, A. J. W.},
title = {How {Intricate} are (2s + {1)-Factorizations?}},
journal = {Canadian mathematical bulletin},
pages = {241--247},
year = {1987},
volume = {30},
number = {2},
doi = {10.4153/CMB-1987-034-2},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-034-2/}
}
Cité par Sources :