Hypergraph encoding set systems and their linear representations
Abstract
We study t-designs of parameters (n,k,λ) over finite fields as group divisible designs and set systems admitting a transitive action of a linear group encoded in an hypergraph G whose vertex set of size n is partitioned into sets of size k in such a way that every t-subset is contained in at least λ subsets of G. We relate the problem to the representation theory of the general linear group (n,Fq) and the constructions of AG codes over finite fields.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.