Random constructions and density results
From MaRDI portal
In this study authors 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. They 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 they list some more elaborate random techniques used in finite geometry.
Recommendations
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Minimal blocking sets in \(PG(2,8)\) and maximal partial spreads in \(PG(3,8)\)
- Probabilistic constructions in generalized quadrangles
- A new method to construct maximal partial spreads of smallest size in \(\mathrm{PG}(3,q)\)
- Maximal partial line spreads of non-singular quadrics
Cites work
- -nets and simplex range queries
- A Constructive Solution to a Tournament Problem
- A dense infinite Sidon sequence
- A lemma on the randomness of \(d\)th powers in \(\text{GF}(q),\;d\mid q-1\)
- A maximal partial spread of size 45 in \(PG(3,7)\)
- A note on maximal partial spreads with deficiency \(q+1\), \(q\) even
- Almost tight bounds for -nets
- Baer subplanes and blocking sets
- Blocking sets
- Blocking sets and complete k-arcs
- Blocking sets in \(\mathrm{PG}(r,q^n)\)
- Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
- Blocking sets in Desarguesian affine and projective planes
- Blocking Sets in Finite Projective Planes
- Concentration of multivariate polynomials and its applications
- Concentration of non‐Lipschitz functions and applications
- Constructions of large arcs and blocking sets in finite planes
- Graphs which contain all small graphs
- scientific article; zbMATH DE number 1594306 (Why is no real title available?)
- scientific article; zbMATH DE number 3849977 (Why is no real title available?)
- scientific article; zbMATH DE number 3823793 (Why is no real title available?)
- scientific article; zbMATH DE number 3903433 (Why is no real title available?)
- scientific article; zbMATH DE number 3917102 (Why is no real title available?)
- scientific article; zbMATH DE number 3961629 (Why is no real title available?)
- scientific article; zbMATH DE number 4054450 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 3783027 (Why is no real title available?)
- scientific article; zbMATH DE number 24836 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 90703 (Why is no real title available?)
- scientific article; zbMATH DE number 1226313 (Why is no real title available?)
- scientific article; zbMATH DE number 493031 (Why is no real title available?)
- scientific article; zbMATH DE number 736296 (Why is no real title available?)
- scientific article; zbMATH DE number 1511151 (Why is no real title available?)
- scientific article; zbMATH DE number 1787234 (Why is no real title available?)
- scientific article; zbMATH DE number 1795248 (Why is no real title available?)
- scientific article; zbMATH DE number 878888 (Why is no real title available?)
- scientific article; zbMATH DE number 1446825 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- Lower bounds on blocking sets
- Matchings and covers in hypergraphs
- Maximal partial spreads and the modular \(n\)-queen problem
- Maximal partial spreads and the modular \(n\)-queen problem. II
- Maximal partial spreads and the modular n-queen problem. III
- Near perfect coverings in graphs and hypergraphs
- New examples of complete k-arcs in PG(2,q)
- Normal spreads
- Note on disjoint blocking sets in Galois planes
- Note on the existence of large minimal blocking sets in Galois planes
- On (k,n)-blocking sets which can be obtained as a union of conics
- On a packing and covering problem
- On a particular class of minihypers and its applications. I: The result for general q
- On a particular class of minihypers and its applications. II: Improvements for \(q\) square
- On a Problem in Graph Theory
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- On a problem of Erdős and Lovász: Random lines in a projective plane
- On blocking sets of inversive planes
- On defining sets for projective planes
- On large minimal blocking sets in PG(2,q)
- On maximal partial spreads in PG(n, q)
- On small blocking sets
- On small blocking sets and their linearity
- On the minimum number of blocks defining a design
- On the number of pairwise non-isomorphic minimal blocking sets in \(\mathrm{PG}(2,q)\)
- On the ratio of optimal integral and fractional covers
- On the size of a blocking set in \(\text{PG}(2,p)\)
- On the size of a maximal partial spread
- On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
- Partial Spreads and Replaceable Nets
- Saturated configurations of points in projective Galois spaces
- Small blocking sets of Hermitian designs
- Small complete arcs in André planes of square order
- Small complete arcs in Galois planes
- Small complete arcs in projective planes
- Spreads and a conjecture of Bruck and Bose
- Superpolynomial lower bounds for monotone span programs
- Upper bounds on the covering number of Galois-planes with small order
Cited in
(13)- Two random constructions inside lacunary sets
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
- Multiple coverings of the farthest-off points with small density from projective geometry
- Randomized construction of complexes with large diameter
- Maximal partial line spreads of non-singular quadrics
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
- On coupon colorings of graphs
- Partition dimension of projective planes
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- On the metric dimension of incidence graphs of Möbius planes
- On the spectrum of the sizes of semiovals in PG(2,q), q odd
- On the spectrum of sizes of semiovals contained in the Hermitian curve
This page was built for publication: Random constructions and density results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009013)
