{
  "abstract": "We denote the length of an addition chain with fixed degree $d\\geq 2$ leading to $n$ by $l^d(n)$. We study the counting function $$ F_d(m,r):=\\#\\{n\\in[d^m,d^{m+1})~:~ l^d(n)\\leq m+r\\} $$ establishing upper and lower bounds, which generalizes previous classical investigations of De Koninck, Doyon, and Verreault",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 1,
  "authors": [
    {
      "name": "Theophilus Agama"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/anpmc5vkwxyf2.bib",
  "cited_by": 0,
  "doi": null,
  "fulltext_url": null,
  "id": "anpmc5vkwxyf2",
  "issns": [],
  "landing_url": "https://hal.science/hal-05756229v1",
  "language": "en",
  "licence": "CC-BY-ND-4.0",
  "licence_label": "CC BY-ND 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nd/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.math"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://hal.science/hal-05756229/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-20",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/anpmc5vkwxyf2.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:36Z",
      "native_id": "hal-05756229",
      "source": "hal",
      "url": "https://hal.science/hal-05756229v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "hal:0.math",
      "subfield": "general"
    }
  ],
  "title": "COUNTING FIXED DEGREE d ≥ 2 ADDITION CHAINS",
  "title_text": "COUNTING FIXED DEGREE d ≥ 2 ADDITION CHAINS",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:36Z",
  "url": "https://research.draconitic.com/paper/anpmc5vkwxyf2",
  "venue": "HAL",
  "versions": []
}