首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
A 2 ? (v,k,λ;q) design is a pair (V, B) of a v-dimensional vector space V over GF(q) and a collection B of k-dimensional subspaces of V such that each 2-dimensional subspace of V is contained in exactly λ members of B. Assuming transitivity of their automorphism groups on the nonzero vectors of V, we give a classification of nontrivial such designs for v = 7, q = 2,3 with small λ, together with the nonexistence proof of those designs for v ? 6. © 1995 John Wiley & Sons, Inc.  相似文献   

5.
6.
Let M be an irreducible, orientable, closed 3-manifold with fundamental group G. We show that if the pro-p completion of G is infinite then G is either soluble-by-finite or contains a free subgroup of rank 2. Both authors are partially supported by “Bolsa de produtividade de pesquisa” from CNPq, Brazil. Received: 16 February 2006  相似文献   

7.
A set of kind s in the Galois space S r,q is a set of points such that any s+1 are linearly independent but there is at least one subset of s+2 The packing problem is that of finding , the largest size of kind s in S r,q. The main result is the evaluation of for all sr5. linearly dependent points. Some partial results bounding m s 6,3 are also given.  相似文献   

8.
Letq be an odd prime power not divisible by 3. In Part I of this series, it was shown that the number of points in a rank-n combinatorial geometry (or simple matroid) representable over GF(3) and GF(q) is at mostn 2. In this paper, we show that, with the exception ofn = 3, a rank-n geometry that is representable over GF(3) and GF(q) and contains exactlyn 2 points is isomorphic to the rank-n Dowling geometry based on the multiplicative group of GF(3).This research was partially supported by the National Science Foundation under Grants DMS-8521826 and DMS-8500494.  相似文献   

9.
The class of groups defined by periodic paired relations, as introduced by Vinberg, includes the generalized triangle groups, the generalized tetrahedron groups, and the generalized Coxeter groups. We observe that any group defined by periodic paired relations Γ can be realized as a so-called “Pride group”. Using results of Howie and Kopteva we give necessary and sufficient conditions for this Pride group to be non-spherical. Under such conditions, we show that Γ satisfies the Tits alternative.

Communicated by A. Olshanskiy  相似文献   

10.
11.
In the paper we propose a modification of the classical construction of the (Minkowskian) incidence structures based on permutation groups. Dropping out explicit assumptions concerning rigidity and transitivity (and assuming an arbitrary finite ”dimension”) we obtain a wider class of structures. Their geometrical properties are studied; in particular, we establish their automorphism groups and discuss some problems related to axiomatic characterization.  相似文献   

12.
A collection Q of linearly independent w-suhicfs of the n-dimensional vector space V(n) over GF(2) is a w-quilt if whenever X and Y are distinct elements of Q, then X is disjoint from the linear span of Y. The main problem is to determine the maximum possibility cardinality of a w-quilt in V(n) for fixed w and n. Here a graph T(Q) is associated with each quilt Q. The connected components of T(Q) are shown to be complete graphs and the structure of the subquilts corresponding to these components is completely determined. By use of Ramsey type arguments these results are shown to lead to new upper bounds on the cardinality of a w-quilt in V(n) where n = w + 2, a case of particular interest.  相似文献   

13.
USINGFINITEGEOMETRIESTOCONSTRUCT3-PBIB(2)DESIGNSAND3-DESIGNS¥YANGBENFU(DepartmentofMathematics,ChengduTeachersCollege,Chengdu...  相似文献   

14.
Let G be a group (or vector space) and A a group of transformations of G. A then acts as a group of transformations of P(G), the set of subsets of G. It is meaningful to study the orbit structure of P(G) under the action of A. The question of the existence of elements of P(G) with trivial isotropy subgroup seems to be of interest in studying the action of A on G. In this paper actions of affine groups over GF (2) are considered. It is proved, by an inductive construction, that every vector space over GF (2) of dimension at least six contains a subset with trivial isotropy subgroup.  相似文献   

15.
16.
17.
The paper describes methods of constructing of residually connected and flag-transitive geometries and corresponding presentations cf finite groups. The methods are illustrated on the finite simple group U4(2). As a result all residually connected and flag-transitive geometries of the group U4(2) with maximsl subgroups as the stabilizers of geometries' elements (exclsding rank 4 geometries with a trivial Borel subgroup) were described. USing these geometries several "natural" presentations of the group U4(2) were obtained.  相似文献   

18.
Letq be a prime power not divisible by 3. We show that the number of points (or rank-1 flats) in a combinatorial geometry (or simple matroid) of rankn representable over GF(3) and GF(q) is at mostn 2. Whenq is odd, this bound is sharp and is attained by the Dowling geometries over the cyclic group of order 2.This research was partially supported by National Science Foundation Grant DMS-8521826 and a North Texas State University Faculty Research Grant.  相似文献   

19.
In Pralle and Shpectorov (Adv Geom 7(1):1–17, 2007) the class of ovoidal hyperplanes in dual polar spaces of rank 4 is described. In this paper we observe that by removing such a hyperplane and a related second hyperplane one obtains a nice geometry for the group stabilising the ovoidal hyperplane. We show that this group acts flag-transitively and that the geometry is simply connected.  相似文献   

20.
An (n, d) set in the projective geometry PG(r, q) is a set of n points, no d of which are dependent. The packing problem is that of finding n(r, q, d), the largest size of an (n, d) set in PG(r, q). The packing problem for PG(r, 3) is considered. All of the values of n(r, 3, d) for r ? 5 are known. New results for r = 6 are n(6, 3, 5) = 14 and 20 ? n(6, 3, 4) ? 31. In general, upper bounds on n(r, q, d) are determined using a slightly improved sphere-packing bound, the linear programming approach of coding theory, and an orthogonal (n, d) set with the known extremal values of n(r, q, d)—values when r and d are close to each other. The BCH constructions and computer searches are used to give lower bounds. The current situation for the packing problem for PG(r, 3) with r ? 15 is summarized in a final table.  相似文献   

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

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