Skip to content
DraconiticResearch
Search Sources API
186,125 studies31 sourcesUpdated 59 min ago
PreprintCC BY-ND 4.0HAL

BOUNDS FOR MINIMAL LENGTH OF FIXED DEGREE CHAINS

  • Theophilus Agama
Open at sourcePDFCite

Abstract

We study fixed degree (d≥ 2) addition chains, i.e. sequences in which each term is the sum of at most d earlier terms, and we establish explicit bounds on the minimal length ℓd(n) of such chains leading to an integer n. For an upper bound, we give constructive Brauer-type bounds: for $d^m\leq n

Related

  1. MINIMAL LENGTH OF FIXED DEGREE S-RICH CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  2. COUNTING FIXED DEGREE d ≥ 2 ADDITION CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  3. 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
  4. Examples of absolutely minimal polyhedral chains in maximum norm spaces
    Roger Züst
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  5. On the quadratic length of plane Cremona maps of degree 4
    Alberto Calabri, Nguyen Thi Ngoc Giao
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{agama2026bounds,
  title = {{BOUNDS FOR MINIMAL LENGTH OF FIXED DEGREE CHAINS}},
  author = {Theophilus Agama},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  url = {https://hal.science/hal-05756224v1},
  note = {CC BY-ND 4.0},
}
RIS
TY  - UNPB
TI  - BOUNDS FOR MINIMAL LENGTH OF FIXED DEGREE CHAINS
AU  - Theophilus Agama
PY  - 2026
DA  - 2026/09/20
PB  - HAL
UR  - https://hal.science/hal-05756224v1
AB  - We study fixed degree (d≥ 2) addition chains, i.e. sequences in which each term is the sum of at most d earlier terms, and we establish explicit bounds on the minimal length ℓ^d(n) of such chains leading to an integer n. For an upper bound, we give constructive Brauer-type bounds: for $d^m\leq n
ER  -