首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 4 毫秒
1.
More than thirty new upper bounds on the smallest size t 2(2, q) of a complete arc in the plane PG(2, q) are obtained for (169 ≤ q ≤ 839. New upper bounds on the smallest size t 2(n, q) of the complete cap in the space PG(n, q) are given for n = 3 and 25 ≤ q ≤ 97, q odd; n = 4 and q = 7, 8, 11, 13, 17; n = 5 and q = 5, 7, 8, 9; n = 6 and q = 4, 8. The bounds are obtained by computer search for new small complete arcs and caps. New upper bounds on the largest size m 2(n, q) of a complete cap in PG(n, q) are given for q = 4, n = 5, 6, and q = 3, n = 7, 8, 9. The new lower bound 534 ≤ m 2(8, 3) is obtained by finding a complete 534-cap in PG(8, 3). Many new sizes of complete arcs and caps are obtained. The updated tables of upper bounds for t 2(n, q), n ≥ 2, and of the spectrum of known sizes for complete caps are given. Interesting complete caps in PG(3, q) of large size are described. A proof of the construction of complete caps in PG(3, 2 h ) announced in previous papers is given; this is modified from a construction of Segre. In PG(2, q), for q = 17, δ = 4, and q = 19, 27, δ = 3, we give complete ${(\frac{1}{2}(q + 3) + \delta)}$ -arcs other than conics that share ${\frac{1}{2}(q + 3)}$ points with an irreducible conic. It is shown that they are unique up to collineation. In PG(2, q), ${{q \equiv 2}}$ (mod 3) odd, we propose new constructions of ${\frac{1}{2} (q + 7)}$ -arcs and show that they are complete for q ≤ 3701.  相似文献   

2.
It is known that the largest size of cap in PG(5, 3) is 56, but very little is known about complete caps of smaller size; the previously known complete caps withk < 56 all had size at most 43. In this paper we construct complete 48-caps and show that any 53-cap is extendable to a 56-cap. From this last result, we derive new upper bounds on the largest size of cap in PG(r, 3) forr 6. The results are obtained from a blend of geometric and coding theoretic techniques.  相似文献   

3.
The problem is considered of constructing a maximal set of lines, with no three in a pencil, in the finite projective geometry PG(3, q) of three dimensions over GF(q). (A pencil is the set of q+1 lines in a plane and passing through a point.) It is found that an orbit of lines of a Singer cycle of PG(3, q) gives a set of size q 3 + q 2 + q + 1 which is definitely maximal in the case of q odd. A (q 3 + q 2 + q + 1)-cap contained in the hyperbolic (or Klein) quadric of PG(5, q) also comes from the construction. (A k-cap is a set of k points with no three in a line.) This is generalized to give direct constructions of caps in quadrics in PG(5, q). For q odd and greater than 3 these appear to be the largest caps known in PG(5, q). In particular it is shown how to construct directly a large cap contained in the Klein quadric, given an ovoid skew to an elliptic quadric of PG(3, q). Sometimes the cap is also contained in an elliptic quadric of PG(5, q) and this leads to a set of q 3 + q 2 + q + 1 lines of PG(3,q 2) contained in the non-singular Hermitian surface such that no three lines pass through a point. These constructions can often be applied to real and complex spaces.  相似文献   

4.
A computer search in the finite projective spaces PG(n, q) for the spectrum of possible sizes k of complete k-caps is done. Randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete cap are given for many values of n and q. Many new sizes of complete caps are obtained.  相似文献   

5.
This article investigates cyclic completek-caps in PG(3,q). Namely, the different types of completek-capsK in PG(3,q) stabilized by a cyclic projective groupG of orderk, acting regularly on the points ofK, are determined. We show that in PG(3,q),q even, the elliptic quadric is the only cyclic completek-cap. Forq odd, it is shown that besides the elliptic quadric, there also exist cyclick-caps containingk/2 points of two disjoint elliptic quadrics or two disjoint hyperbolic quadrics and that there exist cyclick-caps stabilized by a transitive cyclic groupG fixing precisely one point and one plane of PG(3,q). Concrete examples of such caps, found using AXIOM and CAYLEY, are presented.  相似文献   

6.
We establish a representation of a spread of the generalized quadrangle T 2(0), o an oval of PG(2, q), q even, in terms of a certain family of q ovals of PG(2, q) and investigate the properties of this representation. Using this representation we show that to every flock of a translation oval cone in PG(3, q) (-flock), q even, there corresponds a spread of T 2(o) for an oval o determined by the -flock. This gives constructions of new spreads of T 2(o), for certain ovals o, and in some cases solves the existence problem for spreads. It also provides a geometrical characterization of the ovals associated with a flock of a quadratic cone.  相似文献   

7.
The classification of cone-representations of projective planes of orderq 3 of index 3 and rank 4 (and so in PG(6,q)) is completed. Any projective plane with a non-spread representation (being a cone-representation of the second kind) is a dual generalised Desarguesian translation plane, as found by Jha and Johnson, and conversely. Indeed, given any collineation of PG(2,q) with no fixed points, there exists such a projective plane of order q3 , where q is a prime power, that has the second kind of cone-representation of index 3 and rank 4 in PG(6,q). An associated semifield plane of order q 3 is also constructed at most points of the plane. Although Jha and Johnson found this plane before, here we can show directly the geometrical connection between these two kinds of planes.  相似文献   

8.
A t-blocking set in the finite projective space PG(d, q) with dt+1 is a set of points such that any (d–t)-dimensional subspace is incident with a point of and no t-dimensional subspace is contained in . It is shown that | |q t +...+1+q t–1q and the examples of minimal cardinality are characterized. Using this result it is possible to prove upper and lower bounds for the cardinality of partial t-spreads in PG(d, q). Finally, examples of blocking sets and maximal partial spreads are given.  相似文献   

9.
The known examples of embedded unitals (i.e. Hermitian arcs) in PG(2, q 2) are B-unitals, i.e. they can be obtained from ovoids of PG(3, q) by a method due to Buekenhout. B-unitals arising from elliptic quadrics are called BM-unitals. Recently, BM-unitals have been classified and their collineation groups have been investigated. A new characterization is given in this paper. We also compute the linear collineation group fixing the B-unital arising from the Segre-Tits ovoid of PG(3, 2 r ), r3 odd. It turns out that this group is an Abelian group of order q 2.Research supported by MURST.  相似文献   

10.
We prove that a parabolic unitalU in a translation plane of orderq 2 with kernel containing GF(q) is a Buekenhout-Metz unital if and only if certain Baer subplanes containing the translation line of meetU in 1 moduloq points. As a corollary we show that a unital 16-03 in PG(2,q 2) is classical if and only if it meets each Baer subplane of PG(2,q 2) in 1 moduloq points.  相似文献   

11.
Our main result is the following characterization of Denniston's maximal arcs: If a maximal arcK in PG(2,q),q even, is invariant under a linear collineation group of PG(2,q) which is cyclic and has orderq+1, thenK is a Denniston's maximal arc.This work was partially supported by a grant of M.P.I. (Research project Strutture geometriche combinatorie e loro applicazioni).  相似文献   

12.
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check (LDPC) codes defined by (dual) classical generalized quadrangles. We analyze the geometry of the non-singular parabolic quadric in PG(4,q) to find information about the LDPC codes defined by Q (4,q), and . For , and , we are able to describe small weight codewords geometrically. For , q odd, and for , we improve the best known lower bounds on the minimum distance, again only using geometric arguments. Similar results are also presented for the LDPC codes LU(3,q) given in [Kim, (2004) IEEE Trans. Inform. Theory, Vol. 50: 2378–2388]  相似文献   

13.
A (k,n)-arc in PG(2,q) is usually defined to be a set of k points in the plane such that some line meets in n points but such that no line meets in more than n points. There is an extensive literature on the topic of (k,n)-arcs. Here we keep the same definition but allow to be a multiset, that is, permit to contain multiple points. The case k=q 2+q+2 is of interest because it is the first value of k for which a (k,n)-arc must be a multiset. The problem of classifying (q 2+q+2,q+2)-arcs is of importance in coding theory, since it is equivalent to classifying 3-dimensional q-ary error-correcting codes of length q 2+q+2 and minimum distance q 2. Indeed, it was the coding theory problem which provided the initial motivation for our study. It turns out that such arcs are surprisingly rich in geometric structure. Here we construct several families of (q 2+q+2,q+2)-arcs as well as obtain some bounds and non-existence results. A complete classification of such arcs seems to be a difficult problem.  相似文献   

14.
Error-Correcting Codes over an Alphabet of Four Elements   总被引:1,自引:0,他引:1  
The problem of finding the values of Aq(n,d)—the maximum size of a code of length n and minimum distance d over an alphabet of q elements—is considered. Upper and lower bounds on A4(n,d) are presented and some values of this function are settled. A table of best known bounds on A4(n,d) is given for n 12. When q M < 2q, all parameters for which Aq(n,d) = M are determined.  相似文献   

15.
We identify the points of PG(2, q) ith the directions of lines in GF(q 3), viewed as a 3-dimensional affine space over GF(q). Within this frameork we associate to a unital in PG(2, q) a certain polynomial in to variables, and show that the combinatorial properties of the unital force certain restrictions on the coefficients of this polynomial. In particular, if q = p 2 where p is prime then e show that a unital is classical if and only if at least (q - 2) secant lines meet it in the points of a Baer subline.  相似文献   

16.
A k-cover of =PG(3q) is a set S of lines of such that every point is on exactly k lines of S. S is proper if it contains no spread. The existence of proper k-covers of is necessary for the existence of maximal partial packings of q 2+q+1–k spreads of . Here we give the first construction of proper 2-packings of PG(3,q) with q even; for q odd these have been constructed by Ebert.  相似文献   

17.
In the projective planes PG(2, q), more than 1230 new small complete arcs are obtained for ${q \leq 13627}$ and ${q \in G}$ where G is a set of 38 values in the range 13687,..., 45893; also, ${2^{18} \in G}$ . This implies new upper bounds on the smallest size t 2(2, q) of a complete arc in PG(2, q). From the new bounds it follows that $$t_{2}(2, q) < 4.5\sqrt{q} \, {\rm for} \, q \leq 2647$$ and q = 2659,2663,2683,2693,2753,2801. Also, $$t_{2}(2, q) < 4.8\sqrt{q} \, {\rm for} \, q \leq 5419$$ and q = 5441,5443,5449,5471,5477,5479,5483,5501,5521. Moreover, $$t_{2}(2, q) < 5\sqrt{q} \, {\rm for} \, q \leq 9497$$ and q = 9539,9587,9613,9623,9649,9689,9923,9973. Finally, $$t_{2}(2, q) <5 .15\sqrt{q} \, {\rm for} \, q \leq 13627$$ and q = 13687,13697,13711,14009. Using the new arcs it is shown that $$t_{2}(2, q) < \sqrt{q}\ln^{0.73}q {\rm for} 109 \leq q \leq 13627\, {\rm and}\, q \in G.$$ Also, as q grows, the positive difference ${\sqrt{q}\ln^{0.73} q-\overline{t}_{2}(2, q)}$ has a tendency to increase whereas the ratio ${\overline{t}_{2}(2, q)/(\sqrt{q}\ln^{0.73} q)}$ tends to decrease. Here ${\overline{t}_{2}(2, q)}$ is the smallest known size of a complete arc in PG(2,q). These properties allow us to conjecture that the estimate ${t_{2}(2,q) < \sqrt{q}\ln ^{0.73}q}$ holds for all ${q \geq 109.}$ The new upper bounds are obtained by finding new small complete arcs in PG(2,q) with the help of a computer search using randomized greedy algorithms. Finally, new forms of the upper bound on t 2(2,q) are proposed.  相似文献   

18.
In [2] it was shown that if q ≥ 4n2−8n+2 then there are no subplanes of order q contained in the set of internal points of a conic in PG(2,qn), q odd, n≥ 3. In this article we improve this bound in the case where q is prime to , and prove a stronger theorem by considering sublines instead of subplanes. We also explain how one can apply this result to flocks of a quadratic cone in PG(3,qn), ovoids of Q(4,qn), rank two commutative semifields, and eggs in PG(4n−1,q). AMS Classification:11T06, 05B25, 05E12, 51E15  相似文献   

19.
We investigate the partial linear spaces, fully embedded in an affine space with the property that for every antiflag {p,L}, the number of lines through p intersecting L is either 0,α, or q. Besides some general results we prove a complete classification of those geometries fully embedded in an affine plane of order q and of the connected geometries with 1<α<q, fully embedded in .  相似文献   

20.
We show that if an ovoid of Q (4,q),q even, admits a flock of conics then that flock must be linear. It follows that an ovoid of PG (3,q),q even, which admits a flock of conics must be an elliptic quadric. This latter result is used to give a characterisation of the classical example Q -(5,q) among the generalized quadrangles T 3( ), where is an ovoid of PG (3q) and q is even, in terms of the geometric configuration of the centres of certain triads.  相似文献   

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

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