Blocking sets of nonsecant lines to a conic in PG(2,q), q odd

被引：10

作者：

Aguglia, A

Korchmáros, G

机构：

[1] Politecn Bari, Dipartimento Matemat, I-70125 Bari, Italy

[2] Univ Basilicata, Dipartimento Matemat, I-85100 Potenza, Italy

来源：

JOURNAL OF COMBINATORIAL DESIGNS | 2005年 / 13卷 / 04期

关键词：

blocking set; conic in PG(2.q); Baer subplane; 51E21;

D O I：

10.1002/jcd.20042

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In a previous paper [1], all point sets of minimum size in PG(2,q), blocking all external lines to a given irreducible conic C, have been determined for every odd q. Here we obtain a similar classification for those point sets of minimum size, which meet every external and tangent line to C. (c) 2004 Wiley Periodicals, Inc.

引用

页码：292 / 301

页数：10

共 50 条

[41] A CHARACTERIZATION OF EXTERIOR LINES OF CERTAIN SETS OF POINTS IN PG(2,Q)
BLOKHUIS, A
WILBRINK, HA
GEOMETRIAE DEDICATA, 1987, 23 (02) : 253 - 254
[42] Minimal covering of all chords of a conic in PG(2, q), q even
Aguglia, A.
Korchmaros, G.
Siciliano, Alessandro
BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2006, 12 (05) : 651 - 655
[43] NUCLEI OF POINT SETS OF SIZE Q+1 CONTAINED IN THE UNION OF 2 LINES IN PG(2,Q)
KORCHMAROS, G
MAZZOCCA, F
COMBINATORICA, 1994, 14 (01) : 63 - 69
[44] Multiple Blocking Sets in PG(n, q), n > 3
János Barát
Leo Storme
Designs, Codes and Cryptography, 2004, 33 : 5 - 21
[45] Multiple blocking sets in PG(n, q), n≥3
Barát, J
Storme, L
DESIGNS CODES AND CRYPTOGRAPHY, 2004, 33 (01) : 5 - 21
[46] Small complete caps in PG(2, q), for q an odd square
Giulietti M.
Journal of Geometry, 2000, 69 (1-2) : 110 - 116
[47] Nets of conics of rank one in PG(2, q), q odd
Lavrauw, Michel
Popiel, Tomasz
Sheekey, John
JOURNAL OF GEOMETRY, 2020, 111 (03)
[48] The smallest minimal blocking sets of Q(6, q), q even
De Beule, J
Storme, L
JOURNAL OF COMBINATORIAL DESIGNS, 2003, 11 (04) : 290 - 303
[49] Ovoids of PG(3, q), q even, with a conic section
Brown, MR
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2000, 62 : 569 - 582
[50] On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q)
Csaba Mengyán
Designs, Codes and Cryptography, 2007, 45 : 259 - 267

← 1 2 3 4 5 →