Avoiding Secants of Given Size in Finite Projective Planes

ABSTRACT Let be a prime power and be a natural number. What are the possible cardinalities of point sets in a projective plane of order , which do not intersect any line at exactly points? This problem and its variants have been investigated before, in relation with blocking sets, untouchable sets or sets of even type, among others. In this article, we show a series of results which point out the existence of all or almost all possible values for , provided that is not close to the extremal values 0 or . Moreover, using polynomial techniques we show that for every prescribed list of numbers , there exists a point set with the following property: holds for the th line , .

Authors

Institutions

Publication Details

Journal
Journal of Combinatorial Designs
Published
2024-12-30
DOI
https://doi.org/10.1002/jcd.21968
Citations
1
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Avoiding Secants of Given Size in Finite Projective Planes

Tamás Héger, Zoltán Lóránt Nagy
1 citations
Journal of Combinatorial Designs
graph theory and CDMA systems
0.21
article

Avoiding Secants of Given Size in Finite Projective Planes

Tamás Héger, Zoltán Lóránt Nagy
article en
1 citations

Abstract

ABSTRACT Let be a prime power and be a natural number. What are the possible cardinalities of point sets in a projective plane of order , which do not intersect any line at exactly points? This problem and its variants have been investigated before, in relation with blocking sets, untouchable sets or sets of even type, among others. In this article, we show a series of results which point out the existence of all or almost all possible values for , provided that is not close to the extremal values 0 or . Moreover, using polynomial techniques we show that for every prescribed list of numbers , there exists a point set with the following property: holds for the th line , .

Journal of Combinatorial DesignsVol. 33(3)
Eötvös Loránd University (HU), Budapest University of Technology and Economics (HU)
Eötvös Loránd Tudományegyetem, Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Openalex Percentile: Top 44%
graph theory and CDMA systems
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.