首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order n with index λ , denoted by TQS λ ( n ) , is a pair ( X , ? ) , where X is an n ‐set and ? is a set of oriented tetrahedra (blocks) such that every cyclic triple on X is contained in exactly λ members of ? . A TQS λ ( n ) is pure if there do not exist two blocks with the same vertex set. When λ = 1 , the spectrum of a pure TQS ( n ) has been completely determined by Ji. In this paper, we show that there exists a pure TQS 2 ( n ) if and only if n 1 , 2 ( mod 3 ) and n 7 . A corollary is that a simple QS 4 ( n ) also exists if and only if n 1 , 2 ( mod 3 ) and n 7 .  相似文献   

2.
Candelabra quadruple systems (CQS) were first introduced by Hanani who used them to determine the existence of Steiner quadruple systems. In this paper, a new method has been developed by constructing partial candelabra quadruple systems with odd group size, which is a generalization of the even cases, to complete a design. New results of candelabra quadruple systems have been obtained, i.e. we show that for any , there exists a CQS for all , and .  相似文献   

3.
4.
This paper gives some recursive constructions for cyclic 3‐designs. Using these constructions we improve Grannell and Griggs's construction for cyclic Steiner quadruple systems, and many known recursive constructions for cyclic Steiner quadruple systems are unified. Finally, some new infinite families of cyclic Steiner quadruple systems are obtained. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:178‐201, 2011  相似文献   

5.
An oriented tetrahedron is a set of four vertices and four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order n (briefly TQS(n)) is a pair (X,B), where X is an nelement set and B is a set of oriented tetrahedra such that every cyclic triple on X is contained in a unique member of B. A TQS(n) (X,B) is pure if there do not exist two oriented tetrahedra with the same vertex set. In this paper, we show that there is a pure TQS(n) if and only if n = 2,4 (mod 6), n > 4, or n = 1,5 (mod 12). One corollary is that there is a simple two-fold quadruple system of order n if and only if n = 2,4 (mod 6) and n > 4, or n = 1,5 (mod 12). Another corollary is that there is an overlarge set of pure Mendelsohn triple systems of order n for n=1,3 (mod 6), n > 3, or n =0,4 (mod 12).  相似文献   

6.
L. Ji 《组合设计杂志》2007,15(6):469-477
A Steiner quadruple system of order v (briefly SQS (v)) is a pair (X, ), where X is a v‐element set and is a set of 4‐element subsets of X (called blocks or quadruples), such that each 3‐element subset of X is contained in a unique block of . The chromatic number of an SQS(v)(X, ) is the smallest m for which there is a map such that for all , where . The system (X, ) is equitably m‐chromatic if there is a proper coloring with minimal m for which the numbers differ from each other by at most 1. Linek and Mendelsohn showed that an equitably 3‐chromatic SQS(v) exists for v ≡ 4, 8, 10 (mod 12), v ≥ 16. In this article we show that an equitably 3‐chromatic SQS(v) exists for v ≡ 2 (mod 12) with v > 2. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 469–477, 2007  相似文献   

7.
A t-(v, k, 1) directed design (or simply a t-(v, k, 1)DD) is a pair (S, ℐ), where S is a v-set and ℐ is a collection of k-tuples (called blocks) of S, such that every t-tuple of S belongs to a unique block. The t-(v, k, 1)DD is called resolvable if ℐ can be partitioned into some parallel classes, so that each parallel class is a partition of S. It is proved that a resolvable 3-(v, 4, 1)DD exists if and only if v = 0 (mod 4).  相似文献   

8.
Transverse Steiner quadruple systems with five holes are either of type g5 or g4u1. We concentrate on the systems of type g4u1 and settle existence except when gu ≡ 2 (mod 4) and all except 40 parameter situations when gu + 2 ≡ 0 (mod 4). The question of existence for transverse quadruple systems of type g4u1 with index λ > 1 is completely solved for all λ ≥ 13 and λ ∈ {4, 6, 8, 9, 10, 12}. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 315–340, 2007  相似文献   

9.
In this article, we construct overlarge sets of disjoint S(3, 4, 3n − 1) and overlarge sets of disjoint S(3, 4, 3n + 1) for all n ≥ 2. Up to now, the only known infinite sequence of overlarge sets of disjoint S(3, 4, v) were the overlarge sets of disjoint S(3, 4, 2n) obtained from the oval conics of desarguesian projective planes of order 2n. © 1999 John Wiley & Sons, Inc. J Combin Design 7: 311–315, 1999  相似文献   

10.
The purpose of this article is to show the link between Jordan quadruple systems with quadripotents and Jordan algebras. We also extend the notions of the orthogonality, primitivity, and minimality of tripotents in a Jordan triple system to that of quadripotents in a Jordan quadruple system. We refine the Peirce decomposition of a Jordan quadruple system with respect to a quadripotent to be with respect to a system of orthogonal quadripotents and get the multiplication rules of the Peirce spaces. We show that the notions of primitive and minimal quadripotents coincide in a Jordan quadruple system.  相似文献   

11.
A Steiner quadruple system of order 2n is Semi‐Boolean (SBQS(2n) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry PG(n?1, 2). We prove by means of explicit constructions that for any n, up to isomorphism, there exist at least 2? 3(n?4)/2? regular and resolvable SBQS(2n). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 229–239, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10050  相似文献   

12.
13.
Let D ( n ) be the number of pairwise disjoint Steiner quadruple systems (SQS) of order n . A simple counting argument shows that D ( n ) n ? 3 and a set of n ? 3 such systems is called a large set. No nontrivial large set was constructed yet, although it is known that they exist if  n 2 or 4 ( mod 6 ) is large enough. When n 7 and n 1 or 5 ( mod 6 ) , we present a recursive construction and prove a recursive formula on D ( 4 n ) , as follows: D ( 4 n ) 2 n + min { D ( 2 n ) , 2 n ? 7 } . The related construction has a few advantages over some of the previously known constructions for pairwise disjoint SQSs.  相似文献   

14.
A direct construction for rotational Steiner quadruple systems of order p+ 1 having a nontrivial multiplier automorphism is presented, where p≡13 (mod24) is a prime. We also give two improved product constructions. By these constructions, the known existence results of rotational Steiner quadruple systems are extended. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 353–368, 2009  相似文献   

15.
Hader A. Elgendy 《代数通讯》2018,46(4):1727-1757
We study the Peirce decomposition for a Jordan quadruple system with respect to a quadripotent and get the multiplication rules for the Peirce spaces.  相似文献   

16.
L. Ji  L. Zhu 《组合设计杂志》2002,10(6):433-443
An improved product construction is presented for rotational Steiner quadruple systems. Direct constructions are also provided for small orders. It is known that the existence of a rotational Steiner quadruple system of order υ+1 implies the existence of an optimal optical orthogonal code of length υ with weight four and index two. New infinite families of orders are also obtained for both rotational Steiner quadruple systems and optimal optical orthogonal codes. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 433–443, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10025  相似文献   

17.
18.
19.
Hader A. Elgendy 《代数通讯》2018,46(9):3840-3864
We extend the notion of compatibility of tripotents in a Jordan triple system to that of quadripotents in a Jordan quadruple system and get a criterion for compatibility of quadripotents in a Jordan quadruple system.  相似文献   

20.
A resolvable modified group divisible design (RMGDD) is an MGDD whose blocks can be partitioned into parallel classes. In this article, we investigate the existence of RMGDDs with block size three and show that the necessary conditions are also sufficient with two exceptions. © 2005 Wiley Periodicals, Inc. J Combin Designs 15: 2–14, 2007  相似文献   

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

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