Nathanson heights in finite vector spaces

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

Let $p$ be a prime, and let $\mathbb{Z}_p$ denote the field of integers modulo $p$. The \emph{Nathanson height} of a point $v \in \mathbb{Z}_p^n$ is the sum of the least nonnegative integer representatives of its coordinates. The Nathanson height of a subspace $V \subseteq \mathbb{Z}_p^n$ is the least Nathanson height of any of its nonzero points. In this paper, we resolve a conjecture of Nathanson [M. B. Nathanson, Heights on the finite projective line, International Journal of Number Theory, to appear], showing that on subspaces of $\mathbb{Z}_p^n$ of codimension one, the Nathanson height function can only take values about $p, p/2, p/3, ....$ We show this by proving a similar result for the coheight on subsets of $\mathbb{Z}_p$, where the \emph{coheight} of $A \subseteq \mathbb{Z}_p$ is the minimum number of times $A$ must be added to itself so that the sum contains 0. We conjecture that the Nathanson height function has a similar constraint on its range regardless of the codimension, and produce some evidence that supports this conjecture.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Nathanson heights in finite vector spaces 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 Nathanson heights in finite vector spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nathanson heights in finite vector spaces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-431283

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.