On perfect hashing of numbers with sparse digit representation via multiplication by a constant

Details On perfect hashing of numbers with sparse digit representation via multiplication by a constant On perfect hashing of numbers with sparse digit representation via multiplication by a constant

2010-03-16

arxiv.org/abs/1003.3196v2

Mathematics

Number Theory

5 pages

Scientific paper

Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base $b$) in a fixed sparse set. We show the existence of an optimal (resp. almost-optimal in the latter case) `magic' multiplier constant that provides a perfect hash function which transfers the information from the given sparse coefficients into consecutive digits. Studying the convolution case we also obtain a result of non-degeneracy for Schur functions as polynomials in the elementary symmetric functions in positive characteristic.

Affiliated with

Also associated with

No associations

Rating

On perfect hashing of numbers with sparse digit representation via multiplication by a constant 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 On perfect hashing of numbers with sparse digit representation via multiplication by a constant, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On perfect hashing of numbers with sparse digit representation via multiplication by a constant will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246645