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

Abstract

Let p = /p. The height of a point a=(a1,..., ad) ∈ pd is hp(a) = \Σi=1d (kai p) : k=1,...,p-1\. 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…