首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 379 毫秒
1.
In this paper, it is shown that the necessary conditions for the existence of a ( gv, {g, 3 α }, 3, λ)-DF in Z gv for α∈ {0, 1, 2} are also sufficient with two exceptions of (v, g, λ, α) = (9, 1, 1, 1), (9, 1, 2, 2). Finally, the existence spectrum of a cyclic (3, λ)-GDD of type g v is determined.  相似文献   

2.
In this paper, the necessary and sufficient conditions for the existence of a (gv, g, 3, λ)-difference family in Z gv are established. As a consequence, the existence spectrum of a cyclic (3, λ)-GDD of type g v without short orbits is determined. This work was supported by National Natural Science Foundation of China (Grants Nos. 10771013, 10831002)  相似文献   

3.
In this paper, several recursive constructions for directed difference family and perfect directed difference family are presented by means of difference matrix and incomplete difference matrix. Finally the necessary and sufficient conditions for the existence of a (gv, g, 3, λ)-directed difference family in Zgv are established. As a consequence, the necessary and sufficient conditions for the existence of a cyclic directed group divisible design with block size three and type gv are obtained.  相似文献   

4.
5.
A direct construction of six mutually orthogonal Latin squares of order 48 is given. © 1997 John Wiley & Sons, Inc. J Combin Designs 5:463–466, 1997  相似文献   

6.
The concept of a (q, k, λ, t) almost dltterence tamlly (ADF) nas oeen introduced and studied by C. Ding and J. Yin as a useful generalization of the concept of an almost difference set. In this paper, we consider, more generally, (q, K,λ, t, Q)-ADFs, where K = {k1, k2,.…, kr} is a set of positive integers and Q = (q1,q2,... ,qr) is a given block-size distribution sequence. A necessary condition for the existence of a (q, K, λ, t, Q)-ADF is given, and several infinite classes of (q, K, A, t, Q)-ADFs are constructed.  相似文献   

7.
《Discrete Mathematics》2023,346(3):113295
We introduce the concept of a disjoint partial difference family (DPDF) and an external partial difference family (EPDF), a natural generalization of the much-studied disjoint difference family (DDF), external difference family (EDF) and partial difference set (PDS). We establish properties and indicate connections to other recently-studied combinatorial structures. We show how DPDFs and EPDFs may be formed from PDSs, and present various cyclotomic constructions for DPDFs and EPDFs. As part of this, we develop a unified cyclotomic framework, which yields some known results on PDSs, DDFs and EDFs as special cases.  相似文献   

8.
The concept of a (q, k, λ, t) almost difference family (ADF) has been introduced and studied by C. Ding and J. Yin as a useful generalization of the concept of an almost difference set. In this paper, we consider, more generally, (q, K, λ, t, Q)-ADFs, where K = {k1, k2, ..., kr} is a set of positive integers and Q = (q1, q2,..., qr) is a given block-size distribution sequence. A necessary condition for the existence of a (q, K, λ, t, Q)-ADF is given, and several infinite classes of (q, K, λ, t, Q)-ADFs are constructed.  相似文献   

9.
10.
In this paper, the necessary and sufficient conditions for the existence of a (gv, g, 3, λ)- difference family in Zgv are established. As a consequence, the existence spectrum of a cyclic (3, λ)-GDD of type gv without short orbits is determined.  相似文献   

11.
The existence of a (q, k, 1) difference family in GF(q) has been completely solved for k = 3. For k = 4, 5 partial results have been given by Bose, Wilson, and Buratti. In this article, we continue the investigation and show that the necessary condition for the existence of a (q, k, 1) difference family in GF(q), i.e., q ≡ 1 (mod k(k − 1)) is also sufficient for k = 4, 5. For general k, Wilson's bound shows that a (q, k, 1) difference family in GF(q) exists whenever q ≡ 1 (mod k(k − 1)) and q > [k(k − 1)/2]k(k−1). An improved bound on q is also presented. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 21–30, 1999  相似文献   

12.
In this paper we give some results on cyclic BIBDs with block size 4. It is proved that a cyclic B(4,1;4n u) exists where u is a product of primes congruent to 1 modulo 6 and n is a positive integer and n ≥ 3. In the case of n = 2, we also give some partial results on the existence of a cyclic B(4,1;42u) where u is a product of primes congruent to 1 modulo 6. © 2004 Wiley Periodicals, Inc.  相似文献   

13.
We consider the totally real cyclic quintic fields , generated by a root of the polynomial

Assuming that is square free, we compute explicitly an integral basis and a set of fundamental units of and prove that has a power integral basis only for . For (both values presenting the same field) all generators of power integral bases are computed.

  相似文献   


14.
Given a subgroup N of an additive group G, a (G,N,k,1) difference family (DF) is a set D of k-subsets of G such that (d – d | d, d D, d d, D D) = G – N. Generalizing a construction by Genma, Jimbo, and Mishima [4], we give a new condition for realizing a (Ck G, Ck × {0}, k, 1)-DF starting from a (G, {0}, k, 1)-DF. Among the consequences, new cyclic Steiner 2-designs are obtained.  相似文献   

15.
We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external differences that occur, and were first defined in the context of classifying optimal strong algebraic manipulation detection codes. We establish new necessary conditions for the existence of (n,m,k,λ)-SEDFs; in particular giving a near-complete treatment of the λ=2 case. For the case m=2, we obtain a structural characterization for partition type SEDFs (of maximum possible k and λ), showing that these correspond to Paley partial difference sets. We also prove a version of our main result for generalized SEDFs, establishing non-trivial necessary conditions for their existence.  相似文献   

16.
Splitting number     
We show that it is consistent with that every uncountable set can be continuously mapped onto a splitting family.

  相似文献   


17.
Variable‐weight optical orthogonal codes (OOCs) were introduced by G.‐C. Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, by using incomplete difference matrices and perfect relative difference families, a balanced ‐OOC is obtained for every positive integer .  相似文献   

18.
A Steiner 2-design is said to be G-invariantly resolvable if admits an automorphism group G and a resolution invariant under G. Introducing and studying resolvable difference families, we characterize the class of G-invariantly resolvable Steiner 2-designs arising from relative difference families over G. Such designs have been already studied by Genma, Jimbo, and Mishima [13] in the case in which G is cyclic. Developping their results, we prove that any (p, k, 1)-DF (p prime) whose base blocks exactly cover p–1/k(k–1) distinct cosets of the k-th roots of unity (mod p), leads to a Ckp-invariantly resolvable cyclic (kp,k,1)-BBD. This induced us to propose several constructions for DF's having this property. In such a way we prove, in particular, the existence of a C5p-invariantly resolvable cyclic (5p, 5, 1)-BBD for each prime p = 20n + 1 < 1.000.  相似文献   

19.
We show the existence of unbounded orbits in perturbations of generic geodesic flow in T2 by a generic periodic potential. Different from previous work such as in Mather (1997), the initial values of the orbits obtained here are not required sufficiently large.  相似文献   

20.
A (v, k, λ) difference family ((v, k, λ)-DF in short) over an abelian group G of order v, is a collection F=(Bi|i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A (v, k, λ)-DDF is a difference family with disjoint blocks. In this paper, by using Weil's theorem on character sum estimates, it is proved that there exists a (p^n, 4, 1)-DDF, where p = 1 (rood 12) is a prime number and n ≥1.  相似文献   

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

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