2014/09/23 by Masaaki Homma, Homma, Masaaki, Seon Jeong Kim +1 · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Finite Group Theory Research #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1409.6421
A nonsingular surface of degree d ≥ 2 in ℙ3 over \mathbbFq has at most ((d-1)q+1)d \mathbbFq-lines, and this bound is optimal for d = 2, √(q)+1, q+1.