首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
The main result of this paper is that point sets of PG(n, q 3), q = p h , p ≥ 7 prime, of size less than 3(q 3(n?k) + 1)/2 intersecting each k-space in 1 modulo q points (these are always small minimal blocking sets with respect to k-spaces) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p 3), p ≥ 7 prime, of size less than 3(p 3(n?k) + 1)/2 with respect to k-spaces are linear. We also give a classification of small linear blocking sets of PG(n, q 3) which meet every (n ? 2)-space in 1 modulo q points.  相似文献   

2.
Let Ω and be a subset of Σ = PG(2n−1,q) and a subset of PG(2n,q) respectively, with Σ ⊂ PG(2n,q) and . Denote by K the cone of vertex Ω and base and consider the point set B defined by
in the André, Bruck-Bose representation of PG(2,qn) in PG(2n,q) associated to a regular spread of PG(2n−1,q). We are interested in finding conditions on and Ω in order to force the set B to be a minimal blocking set in PG(2,qn) . Our interest is motivated by the following observation. Assume a Property α of the pair (Ω, ) forces B to turn out a minimal blocking set. Then one can try to find new classes of minimal blocking sets working with the list of all known pairs (Ω, ) with Property α. With this in mind, we deal with the problem in the case Ω is a subspace of PG(2n−1,q) and a blocking set in a subspace of PG(2n,q); both in a mutually suitable position. We achieve, in this way, new classes and new sizes of minimal blocking sets in PG(2,qn), generalizing the main constructions of [14]. For example, for q = 3h, we get large blocking sets of size qn + 2 + 1 (n≥ 5) and of size greater than qn+2 + qn−6 (n≥ 6). As an application, a characterization of Buekenhout-Metz unitals in PG(2,q2k) is also given.  相似文献   

3.
In this paper we show that a small minimalblocking set in PG(2,p3), with p 7,is of Rédei type.  相似文献   

4.
A tangency set of PG (d,q) is a set Q of points with the property that every point P of Q lies on a hyperplane that meets Q only in P. It is known that a tangency set of PG (3,q) has at most points with equality only if it is an ovoid. We show that a tangency set of PG (3,q) with , or points is contained in an ovoid. This implies the non‐existence of minimal blocking sets of size , , and of with respect to planes in PG (3,q), and implies the extendability of partial 1‐systems of size , , or to 1‐systems on the hyperbolic quadric . © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 462–476, 2008  相似文献   

5.
A (k, d)-arc in PG(2, q) is a set of k points such that some d, but no d+1, of them are collinear. An outstanding problem is to find the maximum value of k for which a (k, d)-arc exists. A construction is given for a class of (k, p np m)-arcs in PG(2, p n). These arcs constitute a lower bound on the maximum possible value of k, and a subset of them is shown to be optimal.  相似文献   

6.
Let ${S = (\mathcal{P}, \mathcal{L}, \mathcal{H})}$ be the finite planar space obtained from the 3-dimensional projective space PG(3, n) of order n by deleting a set of n-collinear points. Then, for every point ${p\in S}$ , the quotient geometry S/p is either a projective plane or a punctured projective plane, and every line of S has size n or n + 1. In this paper, we prove that a finite planar space with lines of size n + 1 ? s and n + 1, (s ≥ 1), and such that for every point ${p\in S}$ , the quotient geometry S/p is either a projective plane of order n or a punctured projective plane of order n, is obtained from PG(3, n) by deleting either a point, or a line or a set of n-collinear points.  相似文献   

7.
A Cameron-Liebler line class is a set L of lines in PG(3, q) for which there exists a number x such that |LS|=x for all spreads S. There are many equivalent properties: Theorem 1 lists eight. This paper classifies Cameron-Liebler line classes with x4 (with two exceptions). It is also shown that the study of Cameron-Liebler line classes is equivalent to the study of weighted sets of points in PG(3, q) with two weights on lines.  相似文献   

8.
9.
10.
In this paper the classification of the (n, 3)-arcs in PG(2, 7) is presented. It has been obtained using a computer-based exhaustive search that exploits projective equivalence and produces exactly one representative of each equivalence class. For each (n, 3)-arc, the automorphism group and the maximal size of a contained k-arc have been found.  相似文献   

11.
Let A and B be disjoint sets of points in PG(2, q) the Desarguesian projective plane of order q, with |A|q, |B|=q+1, such that each line through a point of A meets B (just once). Then B is a line.  相似文献   

12.
A common characterization of the projective spaces PG(4, n) and PG(5, n) in terms of finite irreducible planar spaces is given.  相似文献   

13.
We show that a Z-cyclic triplewhist tournament on p players with three-person property, briefly 3PTWh(p), exists for any prime p≡ 1 (mod 4) with the only exceptions of p=5,13,17.  相似文献   

14.
We investigate the upper chromatic number of the hypergraph formed by the points and the k ‐dimensional subspaces of PG ( n , q ) ; that is, the most number of colors that can be used to color the points so that every k ‐subspace contains at least two points of the same color. Clearly, if one colors the points of a double blocking set with the same color, the rest of the points may get mutually distinct colors. This gives a trivial lower bound, and we prove that it is sharp in many cases. Due to this relation with double blocking sets, we also prove that for t 3 8 p + 1 , a small t ‐fold (weighted) ( n ? k ) ‐blocking set of PG ( n , p ) , p prime, must contain the weighted sum of t not necessarily distinct ( n ? k ) ‐spaces.  相似文献   

15.
1-Factorizations of the complete graph K n embedded in a finite Desarguesian projective plane PG(2, q), q even, are hyperfocused arcs of size n. The classification of hyperfocused arcs is motivated by applications to 2-level secret sharing schemes. So far it has been done for q  ≤ 16, and for special types of hyperfocused arcs. In this paper the case q = 32 is investigated and the following two results are proven. (i) Uniqueness of hyperfocused 12-arcs, up to projectivities. (ii) Non-existence of hyperfocused 14-arcs.  相似文献   

16.
Dedicated to Professor Wolfgang Schmidt on the occasion of his sixtieth birthday  相似文献   

17.
18.
19.
Put θ n = # {points in PG(n,2)} and φ n = #{lines in PG(n,2)}. Let ψ be anypoint-subset of PG(n,2). It is shown thatthe sum of L = #{internal lines of ψ} and L′= #{external lines of ψ} is the same for all ψ having the same cardinality:[6pt] Theorem A If k is defined by k = |ψ| ? θ n ? 1, then $$L + L' = \phi _{n - 1} + k(k - 1)/2.$$ (The generalization of this to subsets of PG(n,3) is also obtained.) Let $\mathcal{S}$ be a partial spreadof lines in PG(4,2) and let N denote the number of reguli contained in $\mathcal{S}$ .Use of Theorem A gives rise to a simple proof of:[6pt] Theorem B If $\mathcal{S}$ is maximal then one of the followingholds: (i) $\left| \mathcal{S} \right| = 5,{\text{ }}N = 10;{\text{ }}$ (ii) $\left| \mathcal{S} \right| = 7,{\text{ }}N = 4;{\text{ }}$ (iii) $\left| \mathcal{S} \right| = 9,{\text{ }}N = 4.$ If (i) holds then $\mathcal{S}$ is spread in a hyperplane.It is shown that possibility (ii) is realized by precisely threeprojectively distinct types of partial spread. Explicit examplesare also given of four projectively distinct types of partialspreads which realize possibility (iii). For one of these types,type X, the four reguli have a common line. It isshown that those partial spreads in PG(4,2) of size 9 which arise, by a simple construction, from a spreadin PG(5,2), are all of type X.  相似文献   

20.
Letm2(3,q) be the largest value ofk(k<q 2+1) for which there exists a completek-cap in PG(3,q),q even. In this paper, the known upper bound onm2(3,q) is improved. We also describe a number of intervals, fork, for which there does not exist a completek-cap in PG(3,q),q even. These results are then used to improve the known upper bounds on the number of points of a cap in PG(n, q),q even,n?4.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号