筛选条件 共查询到53条结果
排序方式
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (7)

It is well known that, whenever k divides n, the complete k-uniform hypergraph on n vertices can be partitioned into disjoint perfect matchings. Equiv......

Maximum w-cyclic holey group divisible packings with block size three and applications to optical orthogonal codes

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (11)

In this paper we investigate combinatorial constructions for w-cyclic holey group divisible packings with block size three (3-HGDPs). For any positive......

Reduction for flag-transitive 2-( v , k , lambda ) designs with ( r , lambda ) = 2

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (9)

This paper studies flag-transitive 2- ( v , k , lambda ) designs with ( r , lambda ) = 2. We prove that if D is a flag-transitive nontrivial 2- ( v , ......

Super-simple resolvable balanced incomplete block designs with block size 4 and index 2 (vol 15, pg 341, 2007)

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (6)

In this note, we present a corrected proof of Lemma 5.8 which was wrong due to the incorrectness of Construction 2.3, from our paper.

Infinite families of 2-designs derived from affine-invariant codes

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (10)

In this paper, we first study a general type of affine-invariant codes and their support 2-designs. Then we derive infinite families of 2-designs from......

Further results on large sets of partitioned incomplete Latin squares

期刊: JOURNAL OF COMBINATORIAL DESIGNS, ; ()

In this article, we continue to study the existence of large sets of partitioned incomplete Latin squares (LSPILS). We complete the determination of t......

Existence of strong difference families and constructions for eight new 2-designs

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (4)

Using group rings and characters as in the theory of abelian difference sets, some nonexistence results for strong difference families are provided. E......

The existence of r-golf designs

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (4)

An r-golf design of order v, briefly by r-G(v), is a large set of idempotent Latin squares of order v (ILS(v)s) which contains r symmetric ILS(v)s and......

Partial geometric designs with block sizes three and four

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2021; 29 (5)

In this paper, we focus on partial geometric designs with block sizes three and four. First, we show that a partial geometric design with block size t......

On split graphs with three or four distinct (normalized) Laplacian eigenvalues

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2020; 28 (11)

It is well known to us that a graph of diameter l has at least l + 1 eigenvalues. A graph is said to be Laplacian (resp, normalized Laplacian) l-extre......

Partitionable sets, almost partitionable sets, and their applications

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2020; 28 (11)

This paper introduces almost partitionable sets (APSs) to generalize the known concept of partitionable sets. These notions provide a unified frame to......

The existence of large set of symmetric partitioned incomplete latin squares

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2020; 28 (5)

In this paper, we investigate the existence of large sets of symmetric partitioned incomplete latin squares of type g(u) (LSSPILSs) which can be viewe......

Classification of skew-Hadamard matrices of order 32 and association schemes of order 31

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2020; 28 (6)

Using a backtracking algorithm along with an essential change to the rows of representatives of known 13 710 027 equivalence classes of Hadamard matri......

Shortk-radius sequences,k-difference sequences and universal cycles

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2020; 28 (7)

Ann-aryk-radius sequence is a finite sequence of elements taken from an alphabet of sizenin which any two distinct elements occur within distancekof e......

An improved recursive construction for disjoint Steiner quadruple systems

期刊: JOURNAL OF COMBINATORIAL DESIGNS, 2020; 28 (8)

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......

共53条页码: 1/4页15条/页