Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | https://arxiv.org/abs/2004.05221 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Sumário:
- Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator} (gap). This viewpoint leads to explicit identities for two aggregate statistics of the chain: the sum of the determiners and the sum of the chain elements. We then derive the corresponding lower bounds by using the positivity of the regulators. In parallel, we establish an identity for the reciprocal sum of the chain, showing how the harmonic profile of the chain can also be written in terms of the same gap sequence. These identities provide a unified way to compare addition chains of the same target and length. The paper concludes with a balancing problem that asks for the chain(s) that minimize the difference between the arithmetic sum and the harmonic sum, together with a structural decomposition of that optimization objective.