On n–Fold Blocking Sets

Beutelspacher, Albrecht; Eugeni, Franco

doi:10.1016/s0304-0208(08)73123-2

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1988

2023

Publication Types

Select...

Other1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key ingredient in the proof of Theorem 1.3 is to establish the connection between Question 1.2 and the question of determining the maximum number of disjoint blocking sets in P 2 (F q ), first studied by Beutelspacher and Eugeni [BE86]. The latter question can be formulated more generally and abstractly in the setting of hypergraph coloring; see [BMPS06] for related discussions.…”

Section: Introductionmentioning

confidence: 99%

Proportion of blocking curves in a pencil

Shamil¹,

Ghioca²,

Yip³

2023

Preprint

View full text Add to dashboard Cite

Let L be a pencil of plane curves defined over F q with no F q -points in its base locus. We investigate the number of curves in L whose F q -points form a blocking set. When the degree of the pencil is allowed to grow with respect to q, we show that the geometric problem can be translated into a purely combinatorial problem about disjoint blocking sets. We also study the same problem when the degree of the pencil is fixed.

show abstract

Section: Introductionmentioning

confidence: 99%