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
- A central limit theorem for the degree of a random product of Cremona transformations
- COUNTING FIXED DEGREE d โฅ 2 ADDITION CHAINS
- BOUNDS FOR MINIMAL LENGTH OF FIXED DEGREE CHAINS
- Degree of irrationality of a product of two elliptic curves
- Extremal spectral radius of nonregular graphs with a fixed odd maximum degree
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 -