Abstract
In this paper we outline a construction method which has been used for minimal blocking sets in PG(2, q) and maximal partial line spreads in PG(n, q) and which must have a lot of more applications. We also give a survey on what is known about the spectrum of sizes of maximal partial line spreads in PG(n, q). At the end we list some more elaborate random techniques used in finite geometry.
Similar content being viewed by others
References
Abatangelo V. (1983). A class of complete ((q + 8)/3)-arcs in PG(2, q), with q = 2h and h ≥ 6 even. Ars Combin. 16, 103–111
Abbott H.L., Liu A. (1985). Property of B(s) and projective planes. Ars Combin. 20, 217–220
Ajtai M., Komlós J., Szemerédi E. (1981). A dense infinite Sidon sequence. Eur. J. Comb. 2, 1–11
Alon N., Spencer J. (1992). The probabilistic method. Wiley, New York
Alon N., Bollobás B., Kim J.H., Vu V.H.: Personal communication by V. H. Vu, see the preprint at: http://www.math.ucsd.edu/vanvu/papers/probmethod/ABKV.pdf.
Babai L., Gál A., Wigderson A. (1999). Superpolynomial lower bounds for monotone span programs. Combinatorica 19, 301–319
Barát J., Marcugini S., Pambianco F., Szőnyi T. (2005). Note on disjoint blocking sets in Galois planes. J. Comb. Designs 14, 149–158
Bartocci U. (1983). Dense k-sets in Galois planes. Boll. Unione Mat. Ital., VI. Ser. D, Algebra Geom. 2(1): 71–77
Béres T., Illés T.: Computational investigation of the covering number of finite projective planes with small order (in Hungarian). Alk. Mat. Lapok 17, 397–411 (1993/1997).
Beutelspacher A. (1980). Blocking sets and partial spreads in finite projective spaces. Geom. Dedicata 9, 425–449
Blokhuis A. (1994). On the size of a blocking set in PG(2, p). Combinatorica 14, 273–276
Blokhuis A.: Blocking sets in Desarguesian planes. In: Paul Erdős is Eighty, vol. 2. Miklós D., Sós V.T., Szőnyi T. (eds.) Bolyai Soc. Math. Studies, 2, Bolyai Society, Budapest, 133–155 (1996).
Blokhuis A., Metsch K. (1993). On the size of a maximal partial spread. Des. Codes Cryptogr. 3, 187–191
Blokhuis A., Metsch K. (1993). Large minimal blocking sets, strong representative systems and partial unitals. In: De Clerck F. et al. (eds) Finite Geometries. Cambridge University Press, Cambridge, pp. 37–52
Bollobás B., Thomason A. (1981). Graphs which contain all small graphs. Eur. J. Comb. 2, 13–15
Boros E. (1988). PG(2, p s), p > 2 has property B(p + 2). Ars Comb. 25, 111–114
Boros E., Szőnyi T., Tichler K. (2005). On defining sets for projective planes. Discrete Math. 303, 17–31
Bruen A.A. (1970). Baer subplanes and blocking sets. Bull. Am. Math. Soc. 76, 342–344
Bruen A.A. (1971). Blocking sets in finite projective planes. SIAM J. Appl. Math. 21, 380–392
Bruen A.A. (1972). Spreads and a conjecture of Bruck and Bose. J. Algebra 23, 519–537
Bruen A.A. (1971). Partial spreads and replaceable nets. Can. J. Math. 23, 381–391
Bruen A.A., Fisher J.C. (1974). Blocking sets and complete arcs. Pac. J. Math. 53, 73–84
Bruen A.A., Thas J.A. (1977). Blocking sets. Geom. Dedicata 6, 193–203
Bruen A.A., Rotschild B.L. (1982). Lower bounds on blocking sets. Pac. J. Math. 118, 303–311
Cameron P.J., Van Lint J.H.: Designs, Graphs, Codes and Their Links. Cambridge University Press (1991).
Dembowski P.: Finite Geometries. Springer, Berlin (1968 and 1997).
Drake D.A., Kitto C. (1994). Small blocking sets of Hermitian designs. J. Combin. Theory Ser. A 65, 322–329
Eisfeld J., Storme L., Sziklai P. (2005). On the spectrum of the sizes of maximal partial line spreads in PG(2n, q), n ≥ 3. Des. Codes Cryptogr. 36, 101–110
Erdős P. (1963). On a problem in graph theory. Math. Gazette 47, 220–223
Erdős P., Lovász L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), vol. II, vol. 10, pp. 609–627, Colloq. Math. Soc. J’anos Bolyai. North-Holland, Amsterdam (1975).
Erdős P., Silverman R., Stein A. (1983). Intersection properties of families of sets of nearly the same size. Ars Combin. 15, 247–259
Erdős P., Spencer J. Probabilistic Methods in Combinatorics. Akad. Kiadó, Academic Press, Budapest, New York (1974).
Fancsali Sz., Sziklai P. (2007). About maximal partial 2-spreads in PG(3 m - 1,q). Innovations in Incidence Geometry 4, 70–80
Frankl P., Rödl V. (1985). Near perfect covers in graphs and hypergraphs. Eur. J. Comb. 6, 317–326
Füredi Z. (1988). Matchings and covers in hypergraphs. Graphs Combin. 4, 115–206
Füredi Z., Pach J.: Traces of finite sets, extremal problems and geometric applications. In: Extremal Problems in Combinatorics. Visegrád, Hungary (1991). Bolyai Society Math. Studies 3, 251–282.
Gács A., Szőnyi T. (2003). On maximal partial spreads in PG(n, q). Des. Codes Cryptogr. 29, 123–129
Glynn D.G. (1982). A lower bound for maximal partial spreads in PG(3,q). Ars Combin. 13, 39–40
Govaerts P., Heden O., Storme L.: On the spectrum of sizes of maximal partial spreads in PG(3, q), q even, (manuscript).
Govaerts P., Storme L. (2003). On a particular class of minihypers and its applications. I: the result for general q. Des. Codes Cryptogr. 28, 51–63
Graham R.L., Spencer J. (1971). A constructive solution to a tournament problem. Can. Math. Bull. 14, 45–48
Gray K. (1990). On the minimum number of blocks defining a design. Bull. Austral. Math. Soc. 41, 97–112
Haussler D., Welzl E. (1987). ɛ-nets and simple range queries. Discrete Comput. Geom. 2, 127–151
Heden O. (1993). Maximal partial spreads and the modular n-queen problem. Discrete Math. 120, 75–91
Heden O. (1995). Maximal partial spreads and the modular n-queen problem II. Discrete Math. 142, 97–106
Heden O. (2002). Maximal partial spreads and the modular n-queen problem III. Discrete Math. 243, 135–150
Heden O. (2001). A maximal partial spreads of size 45 in PG(3, 7). Des. Codes Cryptogr. 22, 331–334
Hirschfeld J.W.P.: Projective Geometries Over Finite Fields. Clarendon Press, Oxford, 1979, 2nd edn, 1998.
Hirschfeld J.W.P.: Finite Projective Spaces of Three Dimensions. Oxford University Press (1985).
Hirschfeld J.W.P., Thas J.A.: General Galois Geometries. Oxford University Press (1991).
Hirschfeld J.W.P., Storme L. (2001). The packing problem in statistics, coding theory and finite projective spaces. In: Blokhuis A., J.W.P. Hirschfeld, Jungnickel D., Thas J.A. (eds) Finite Geometries. Developments of Mathematics, Kluwer, pp. 201–246
Hirschfeld J.W.P., Szőnyi T. (1991). Constructions of large arcs and blocking sets in finite planes. Eur. J. Comb. 12, 499–511
Illés T., Pisinger D. (2000). Upper bounds on the covering number of Galois-planes with small order. J. Heuristics 7, 59–76
Illés T., Szőnyi T., Wettl F. (1991). Blocking sets and maximal strong representative systems in finite projective planes. Mitt. Math. Sem. Giessen 201, 97–107
Innamorati S., Maturo A. (1991). On irreducible blocking sets in projective planes. Ratio Math. 2, 151–155
Janson S.: On concentration of probability. In: Bollobás B. (eds.) Contemporary Combinatorics, vol. 10, pp. 289–301. Bolyai Society Mathematical Studies (2002).
Jungnickel D., Storme L. (2003). A note on maximal partial spreads with deficiency q + 1, q even. J. Combin. Theory Ser. A 102, 443–446
Kahn J. (1992). On a problem of Erdős and Lovász: random lines in a projective plane. Combinatorica 12, 417–423
Kahn J. (1994). On a problem of Erdős and Lovász II, n(r) = O(r). J. Am. Math. Soc 7, 125–143
Kim J.H., Vu V.H. (2003). Small complete arcs in projective planes. Combinatorica 23, 311–363
Kim J.H., Vu V.H. (2000). Concentration of multivariate polynomials and its applications. Combinatorica 20, 417–434
Kiss Gy., Marcugini S., Pambianco F. (2005). On blocking sets of inversive planes. J. Combin. Designs 13, 268–275
Komlós J., Pach J., Woeginger G. (1992). Almost tight bounds for ɛ-nets. Discrete Comput. Geom. 7, 163–173
Korchmáros G. (1983). New examples of complete k-arcs in PG(2,q). Eur. J. Comb. 4, 329–334
Kovács S.J. (1992). Small saturated sets in finite projective planes. Rend. Mat. (Roma) 12, 157–164
Lovász L. (1975). On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383–390
Lunardon G. (1999). Normal spreads, Geom. Dedicata 75, 245–261
Lunardon G., Polverino O.: Linear blocking sets: a survey. In: Jungnickel D. (eds.) Finite Fields and Applications, pp. 356–362. Springer (2001).
Mazzocca F., Polverino O. (2006). Blocking sets in PG(2,q n) from cones of PG(2n,q). J. Algebraic Combin. 24, 61–81
Mazzocca F., Polverino O., Storme L. (2007). Blocking sets in PG(r, q n). Des. Codes Cryptogr. 44, 97–113
Metsch K., Storme L. (2002). On a particular class of minihypers and its applications: II. Improvements for q square. J. Com. Theory Ser. A 97, 269–393
Mengyán Cs. (2007). On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q). Des. Codes Cryptogr. 45, 259–267
Polito P., Polverino O. (1998). On small blocking sets. Combinatorica 18, 133–137
Polverino O., Szőnyi T., Weiner Zs. (1999). Blocking sets in Galois planes of square order. Acta Sci. Math. (Szeged) 65, 737–748
Rédei L. (1970). Lückenhafte Polynome über endlichen Körpern. Akadémiai Kiadó and Birkhäuser Verlag, Budapest Basel
Rödl V. (1985). On a packing and covering problem. Eur. J. Comb. 5, 69–78
Sziklai P. (2001). A lemma on the randomness of d-th powers in GF(q). d|q − 1, Bull. Belg. Math. Soc. 8, 95–98
Sziklai P., On small blocking sets and their linearity. J. Comb. Theory. Ser. A (to appear).
Szőnyi T. (1985). Small complete arcs in Galois planes. Geom. Dedicata 18, 161–172
Szőnyi T. (1992). Blocking sets in finite planes and spaces. Ratio Math. 5, 93–106
Szőnyi T. (1992). Note on the existence of large minimal blocking sets in Galois planes. Combinatorica 12, 227–235
Szőnyi T. (1997). Blocking sets in Desarguesian affine and projective planes. Finite Fields Appl. 3, 187–202
Szőnyi T. (1997). Some applications of algebraic curves in finite geometry and combinatorics. In: Bailey R.A. (eds) Surveys in Combinatorics. Cambridge University Press, Cambridge, pp. 198–236
Szőnyi, T. (1992). Small complete arcs in André planes of square order. Graphs Comb. 8, 81–89
Szőnyi T., Cossidente A., Gács A., Mengyán Cs., Siciliano A., Weiner Zs. (2005). On large minimal blocking sets in PG(2, q). J. Combin. Des. 13, 25–41
Szőnyi T., Gács A., Weiner Zs. (2003). On the spectrum of minimal blocking sets in PG(2,q). J. Geom. 76, 256–281
Szőnyi T., Weiner Zs.: On large minimal blocking sets (preprint).
Thomason A. (1987). Random Graphs, Strongly Regular Graphs and Pseudo-random graphs. In: Whitehead C. (eds) Surveys in Combinatorics 1987. Cambridge University Press, Cambridge, pp. 173–195
Ughi E. (1987). Saturated configurations of points in projective Galois spaces. Eur. J. Comb. 8, 325–334
Ughi E. (1988). On (k, n)-fold blocking sets which can be obtained as a union of conics. Geom. Dedicata 26, 241–246
Vu V.H. (2002). Concentration of non-Lipschitz functions and applications. Random Struct. Alg. 20, 262–316
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gács, A., Szőnyi, T. Random constructions and density results. Des. Codes Cryptogr. 47, 267–287 (2008). https://doi.org/10.1007/s10623-007-9149-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9149-3