中文

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

数论 2021-01-06 v1 组合数学

摘要

Let \Fp=Z/pZ\F_p = \Z/p\Z. The \emph{height} of a point a=(a1,...,ad)\Fpd\mathbf{a}=(a_1,..., a_d) \in \F_p^d is hp(a)=min{i=1d(kaimodp):k=1,...,p1}.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,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.

关键词

引用

@article{arxiv.math/0703418,
  title  = {Heights in finite projective space, and a problem on directed graphs},
  author = {Melvyn B. Nathanson and Blair D. Sullivan},
  journal= {arXiv preprint arXiv:math/0703418},
  year   = {2021}
}

备注

10 pages