Nets in groups, minimum length $g$-adic representations, and minimal additive complements

Details Nets in groups, minimum length $g$-adic representations, and minimal additive complements Nets in groups, minimum length $g$-adic representations, and minimal additive complements

2008-12-02

arxiv.org/abs/0812.0560v1

Mathematics

Number Theory

16 pages

Scientific paper

The number theoretic analogue of a net in metric geometry suggests new problems and results in combinatorial and additive number theory. For example, for a fixed integer g > 1, the study of h-nets in the additive group of integers with respect to the generating set A_g = {g^i:i=0,1,2,...} requires a knowledge of the word lengths of integers with respect to A_g. A g-adic representation of an integer is described that algorithmically produces a representation of shortest length. Additive complements and additive asymptotic complements are also discussed, together with their associated minimality problems.

Affiliated with

Also associated with

No associations

Rating

Nets in groups, minimum length $g$-adic representations, and minimal additive complements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nets in groups, minimum length $g$-adic representations, and minimal additive complements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nets in groups, minimum length $g$-adic representations, and minimal additive complements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719014