A $k$-representation of an integer $\l$ is a representation of $\l$ as sum of $k$ powers of $2$, where representations differing by the order are considered as distinct. Let $\W(\sigma,k)$ be the maximum number of such representations for integers $\l$ whose binary representation has exactly $\sigma$ non-zero digits. $\W(\sigma,k)$ can be recovered from $\W(1,k)$ via an explicit formula, thus in some sense $\W(1,k)$ is the fundamental object. In this paper we prove that $(\W(1,k)/k!)^{1/k}$ tends to a computable limit as $k$ diverges. This result improves previous bounds which were obtained with purely combinatorial tools.
Representation of a 2-power as sum of k 2-powers: the asymptotic behavior / G. Molteni. - In: INTERNATIONAL JOURNAL OF NUMBER THEORY. - ISSN 1793-0421. - 8:8(2012 Sep), pp. 1923-1963.
Representation of a 2-power as sum of k 2-powers: the asymptotic behavior
G. Molteni
2012
Abstract
A $k$-representation of an integer $\l$ is a representation of $\l$ as sum of $k$ powers of $2$, where representations differing by the order are considered as distinct. Let $\W(\sigma,k)$ be the maximum number of such representations for integers $\l$ whose binary representation has exactly $\sigma$ non-zero digits. $\W(\sigma,k)$ can be recovered from $\W(1,k)$ via an explicit formula, thus in some sense $\W(1,k)$ is the fundamental object. In this paper we prove that $(\W(1,k)/k!)^{1/k}$ tends to a computable limit as $k$ diverges. This result improves previous bounds which were obtained with purely combinatorial tools.File | Dimensione | Formato | |
---|---|---|---|
28-molteni-Representation_of_a_2-power_as_sum_of_k_2-powers_the_asymptotic_behavior.pdf
accesso aperto
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
966.28 kB
Formato
Adobe PDF
|
966.28 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.