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

PRODUCT DISTRIBUTION IN A FIXED DEGREE CHAIN

Abstract

We study multiplicative structures arising from \emph{fixed-degree} addition chains: increasing sequences s0=1<s1<โ‹ฏ<sh in which each term is the sum of at most dโ‰ฅ 2 earlier terms (repetition allowed). Writing ๐’ซ(L) for the set of integers that can be expressed as a product of distinct terms drawn from a (finite or infinite) fixed-degree chain L={Tm}, we develop a structural partition of chain steps into four classes ๐’œd,โ„ฌd,๐’žd,๐’Ÿd (dilate / large / medium / small) and introduce the notion of a \emph{run} of a given step type. By deriving precise two-sided log-sum (product) estimates along pure and mixed-type runs and translating these into elementary counting bounds (for example, run-level bounds of the shape โ‰ช(log x)1/2 in the logarithmic scale), we obtain a global sparsity result: under the mild structural hypothesis that the number of runs of types ๐’Ÿd and ๐’œdโˆช๐’Ÿd on initial segments of the chain is Od(1), the product-set ๐’ซ(L) has zero asymptotic density. In particular, for any such infinite chain L one has limxโŸถ โˆž(#{vโ‰ค x : vโˆˆ๐’ซ(L)})/x=0. The proof combines combinatorial run-analysis, elementary exponential growth estimates along runs, and an assembly of run-level contributions into explicit global counting bounds; quantitative run-level inequalities (involving the clearly defined parameters ฮปd and a slowly varying ฮด(m)=1/log m) are recorded and may be of independent interest for further study of fixed-degree chains

Related

  1. A central limit theorem for the degree of a random product of Cremona transformations
    Nguyen-Bac Dang, Giulio Tiozzo
    Indiana University Mathematics JournalPeer-reviewedHAL deposit licenceFull textDynamical systemsHAL
  2. COUNTING FIXED DEGREE d โ‰ฅ 2 ADDITION CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  3. BOUNDS FOR MINIMAL LENGTH OF FIXED DEGREE CHAINS
    Theophilus Agama
    HALPreprintCC BY-ND 4.0Full textGeneral mathematicsHAL
  4. Degree of irrationality of a product of two elliptic curves
    Yongnam Lee
    arXivPreprintCC0Full textAlgebra & number theoryarXiv
  5. Extremal spectral radius of nonregular graphs with a fixed odd maximum degree
    Zejun Huang, Chenxi Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{agama2026product,
  title = {{PRODUCT DISTRIBUTION IN A FIXED DEGREE CHAIN}},
  author = {Theophilus Agama},
  howpublished = {HAL},
  year = {2026},
  month = oct,
  url = {https://hal.science/hal-05784851v1},
  note = {CC BY-ND 4.0},
}
RIS
TY  - UNPB
TI  - PRODUCT DISTRIBUTION IN A FIXED DEGREE CHAIN
AU  - Theophilus Agama
PY  - 2026
DA  - 2026/10/07
PB  - HAL
UR  - https://hal.science/hal-05784851v1
AB  - We study multiplicative structures arising from \emph{fixed-degree} addition chains: increasing sequences s_0=1<s_1<โ‹ฏ<s_h in which each term is the sum of at most dโ‰ฅ 2 earlier terms (repetition allowed). Writing ๐’ซ(L) for the set of integers that can be expressed as a product of distinct terms drawn from a (finite or infinite) fixed-degree chain L={T_m}, we develop a structural partition of chain steps into four classes ๐’œ_d,โ„ฌ_d,๐’ž_d,๐’Ÿ_d (dilate / large / medium / small) and introduce the notion of a \emph{run} of a given step type. By deriving precise two-sided log-sum (product) estimates along pure and mixed-type runs and translating these into elementary counting bounds (for example, run-level bounds of the shape โ‰ช(log x)^1/2 in the logarithmic scale), we obtain a global sparsity result: under the mild structural hypothesis that the number of runs of types ๐’Ÿ_d and ๐’œ_dโˆช๐’Ÿ_d on initial segments of the chain is O_d(1), the product-set ๐’ซ(L) has zero asymptotic density. In particular, for any such infinite chain L one has lim_xโŸถ โˆž(#{vโ‰ค x : vโˆˆ๐’ซ(L)})/x=0. The proof combines combinatorial run-analysis, elementary exponential growth estimates along runs, and an assembly of run-level contributions into explicit global counting bounds; quantitative run-level inequalities (involving the clearly defined parameters ฮป_d and a slowly varying ฮด(m)=1/log m) are recorded and may be of independent interest for further study of fixed-degree chains
ER  -