Heights in finite projective space, and a problem on directed graphs

Details Heights in finite projective space, and a problem on directed graphs Heights in finite projective space, and a problem on directed graphs

2007-03-14

arxiv.org/abs/math/0703418v1

Mathematics

Number Theory

10 pages

Scientific paper

Let $\F_p = \Z/p\Z$. The \emph{height} of a point $\mathbf{a}=(a_1,..., a_d) \in \F_p^d$ is $h_p(\mathbf{a}) = \min \left\{\sum_{i=1}^d (ka_i \mod p) : k=1,...,p-1\right\}.$ Explicit formulas and estimates are obtained for the values of the height function in the case $d=2,$ and these results are applied to the problem of determining the minimum number of edges the must be deleted from a finite directed graph so that the resulting subgraph is acyclic.

Affiliated with

Also associated with

No associations

Rating

Heights in finite projective space, and a problem on directed graphs 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 Heights in finite projective space, and a problem on directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heights in finite projective space, and a problem on directed graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-715864