Integers with a small number of minimal addition chains

Autor:	Achim Flammenkamp
Rok vydání:	1999
Předmět:	Combinatorics Discrete mathematics Reduced graphs Small number Minimal addition chains Discrete Mathematics and Combinatorics Representation (mathematics) 3-smallstep-chains Theoretical Computer Science Mathematics
Zdroj:	Discrete Mathematics. 205:221-227
ISSN:	0012-365X
DOI:	10.1016/s0012-365x(99)00103-x
Popis:	For n∈ N the number of minimal addition chains, Λ(n), is examined by its representation by reduced graphs. It is shown that Λ(n)=1 implies n=2k or n=3 answering a question of Thurber. Further those n with Λ(n)=2 are characterized.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::970f58aebbdf71d4382840b81044d0eb https://doi.org/10.1016/s0012-365x(99)00103-x Zobrazit plný text záznamu Full Text from ScienceDirect