We study representations of integers n in binary expansions using the digits 0, ±1. We analyze the average number of such representations of minimal “weight” ( = number of non-zero digits). The asymptotic main term of this average involves a periodically oscillating function, which is analyzed in some detail. The main tool is the construction of a measure on [−1,1], which encodes the number of representations
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
This paper works with representations of natural numbers from 0 to 20000 written in terms of express...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...
Abstract. In a multi-base representation of an integer (in contrast to, for example, the binary or d...
This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Represen...
This paper deals with pairs of integers, written in base two expansions using digits 0,±1. Represent...
AbstractAsymptotic formulas on the average values of the “sum of digits” function and the average nu...
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
We improve some results about the asymptotic formulae in short intervals for the average number of r...
Applications of signed digit representations of an integer include computer arith-metic, cryptograph...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
International audienceMotivated by multiplication algorithms based on redundant number representatio...
We consider the problem of representing integers in close to optimal number of bits to support incre...
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
This paper works with representations of natural numbers from 0 to 20000 written in terms of express...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...
Abstract. In a multi-base representation of an integer (in contrast to, for example, the binary or d...
This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Represen...
This paper deals with pairs of integers, written in base two expansions using digits 0,±1. Represent...
AbstractAsymptotic formulas on the average values of the “sum of digits” function and the average nu...
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
We improve some results about the asymptotic formulae in short intervals for the average number of r...
Applications of signed digit representations of an integer include computer arith-metic, cryptograph...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
International audienceMotivated by multiplication algorithms based on redundant number representatio...
We consider the problem of representing integers in close to optimal number of bits to support incre...
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
This paper works with representations of natural numbers from 0 to 20000 written in terms of express...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...