2008/02/14 by Simona Settepanella, Settepanella, Simona
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #FOS: Computer and information sciences #Finite Group Theory Research #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.0802.2045
arxiv created 2008/02/14 · openalex publication_date 2008/02/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is well know that the theory of minimal blocking sets is studied by several author. Another theory which is also studied by a large number of researchers is the theory of hyperplane arrangements. We can remark that the affine space AG(n,q) is the complement of the line at infinity in PG(n,q). Then AG(n,q) can be regarded as the complement of an hyperplane arrangement in PG(n,q)! Therefore the study of blocking sets in the affine space AG(n,q) is simply the study of blocking sets in the complement of a finite arrangement in PG(n,q). In this paper the author generalizes this remark starting to study the problem of existence of blocking sets in the complement of a given hyperplane arrangement in PG(n,q). As an example she solves the problem for the case of braid arrangement. Moreover she poses significant questions on this new and interesting problem.