Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 38 min ago
PreprintCC BY-ND 4.0HAL

ON SOME COMPUTATIONAL RESULTS ON ADDITION CHAINS

Abstract

We introduce the iterated factor method as an extension of the factor method due to Alfred Brauer. This new method has been used to obtain an improved upper bound for an optimal length of an addition chain leading to 2^n -1 in special cases that depends on the binary structure of the exponent n.

Related

  1. COUNTING FIXED DEGREE d ≥ 2 ADDITION CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  2. MATRIX THEORETIC AND COMBINATORIAL STRUCTURES IN ADDITION CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  3. AN EXTENDED STRUCTURAL SCHOLZ RESULT ON ADDITION CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  4. On the distribution of the minimal length of addition chains
    Jean-Marie De Koninck, Nicolas Doyon, William Verreault
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. On the Spectrum of Some Temperley-Lieb Spin Chains
    Robert Ferydouni, Bruno Nachtergaele
    arXivPreprintarXiv licenceFull textMathematical physicsCondensed matterarXiv
BibTeX
@misc{agama2026some,
  title = {{ON SOME COMPUTATIONAL RESULTS ON ADDITION CHAINS}},
  author = {Theophilus Agama},
  howpublished = {HAL},
  year = {2026},
  month = oct,
  url = {https://hal.science/hal-05784769v1},
  note = {CC BY-ND 4.0},
}
RIS
TY  - UNPB
TI  - ON SOME COMPUTATIONAL RESULTS ON ADDITION CHAINS
AU  - Theophilus Agama
PY  - 2026
DA  - 2026/10/07
PB  - HAL
UR  - https://hal.science/hal-05784769v1
AB  - We introduce the iterated factor method as an extension of the factor method due to Alfred Brauer. This new method has been used to obtain an improved upper bound for an optimal length of an addition chain leading to 2^n -1 in special cases that depends on the binary structure of the exponent n.
ER  -