2020/07/31 by Jozefien D’haeseleer, D'haeseleer, Jozefien · 1 citation
Mathematics · Engineering · #Finite Group Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2007.15851
In this article, we analyse maximal sets of k-spaces, in PG(n,q) and AG(n,q), n>2k+t+2, that pairwise meet in at least a t-space. It is known that for both PG(n,q) and AG(n,q), the largest example is a t-pencil, i.e. the set of all k-spaces containing a fixed t-space. In this paper, we analyse the structure of the second largest maximal example in both PG(n,q) and AG(n,q).