当前期刊: Journal of Combinatorial Designs Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Pure tetrahedral quadruple systems with index two
    J. Comb. Des. (IF 0.731) Pub Date : 2020-10-23
    Ruijing Liu; Junling Zhou

    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

    更新日期:2020-10-26
  • The last two perfect Mendelsohn designs with block size 5
    J. Comb. Des. (IF 0.731) Pub Date : 2020-08-18
    Terry S. Griggs; Andrew R. Kozlik

    We complete the existence spectrum of perfect Mendelsohn designs PMD ( v , 5 ) as v ≡ 0 , 1 ( mod 5 ) , v ≠ 6 , 10 by exhibiting previously unknown designs PMD ( 15 , 5 ) and PMD ( 20 , 5 ) .

    更新日期:2020-10-22
  • Rigidity and a common framework for mutually unbiased bases and k‐nets
    J. Comb. Des. (IF 0.731) Pub Date : 2020-08-25
    Sloan Nietert; Zsombor Szilágyi; Mihály Weiner

    Many deep connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called k ‐nets (and in particular, between collections of MUBs and finite affine planes). Here we introduce the notion of a k ‐net over a C * ‐algebra, providing a common framework for both objects. In the commutative case, we recover (classical) k ‐nets, while the choice of M d

    更新日期:2020-10-22
  • A note on λ‐designs
    J. Comb. Des. (IF 0.731) Pub Date : 2020-09-28
    Ajeet K. Yadav; Rajendra M. Pawale; Mohan S. Shrikhande

    Let r and r′, (r > r′) be the two replication numbers of a λ ‐design D . We show that if r − r ′ is a prime power or 33, then D is a design of type‐1. We derive two inequalities, where equality holds if and only if D is a design of type‐1. Let D be a λ ‐design with two block sizes with v = n p + 1 points, where p is prime and 2 ⩽ n ⩽ 22 . We develop a procedure to obtain exceptions for such type‐1

    更新日期:2020-10-22
  • Biembeddings of cycle systems using integer Heffter arrays
    J. Comb. Des. (IF 0.731) Pub Date : 2020-09-28
    Nicholas J. Cavenagh; Diane M. Donovan; Emine Ş. Yazıcı

    In this paper, we use constructions of Heffter arrays to verify the existence of face 2‐colorable embeddings of cycle decompositions of the complete graph. Specifically, for n ≡ 1 ( mod 4 ) and k ≡ 3 ( mod 4 ) , n ≫ k ⩾ 7 and when n ≡ 0 ( mod 3 ) then k ≡ 7 ( mod 12 ) , there exist face 2‐colorable embeddings of the complete graph K 2 n k + 1 onto an orientable surface where each face is a cycle of

    更新日期:2020-10-22
  • Restrictions on parameters of partial difference sets in nonabelian groups
    J. Comb. Des. (IF 0.731) Pub Date : 2020-10-07
    Eric Swartz; Gabrielle Tauscheck

    A partial difference set S in a finite group G satisfying 1 ∉ S and S = S − 1 corresponds to an undirected strongly regular Cayley graph Cay ( G , S ) . While the case when G is abelian has been thoroughly studied, there are comparatively few results when G is nonabelian. In this paper, we provide restrictions on the parameters of a partial difference set that apply to both abelian and nonabelian groups

    更新日期:2020-10-08
  • An extension of a construction of covering arrays
    J. Comb. Des. (IF 0.731) Pub Date : 2020-08-04
    Daniel Panario, Mark Saaltink, Brett Stevens, Daniel Wevrick

    By Raaphorst et al, for a prime power q , covering arrays (CAs) with strength 3 and index 1, defined over the alphabet F q , were constructed using the output of linear feedback shift registers defined by cubic primitive polynomials in F q [ x ] . These arrays have 2 q 3 − 1 rows and q 2 + q + 1 columns. We generalize this construction to apply to all polynomials; provide a new proof that CAs are indeed

    更新日期:2020-08-04
  • Partitionable sets, almost partitionable sets, and their applications
    J. Comb. Des. (IF 0.731) Pub Date : 2020-07-20
    Yanxun Chang, Simone Costa, Tao Feng, Xiaomiao Wang

    This paper introduces almost partitionable sets (APSs) to generalize the known concept of partitionable sets. These notions provide a unified frame to construct Z ‐cyclic patterned starter whist tournaments and cyclic balanced sampling plans excluding contiguous units. The existences of partitionable sets and APSs are investigated. As an application, a large number of optical orthogonal codes achieving

    更新日期:2020-07-20
  • Legendre G‐array pairs and the theoretical unification of several G‐array families
    J. Comb. Des. (IF 0.731) Pub Date : 2020-07-15
    K. T. Arasu, D. A. Bulutoglu, J. R. Hollon

    We investigate how Legendre G ‐array pairs are related to several different perfect binary G ‐array families. In particular we study the relations between Legendre G ‐array pairs, Sidelnikov‐Lempel‐Cohn‐Eastman Z q − 1 ‐arrays, Yamada‐Pott G ‐array pairs, Ding‐Helleseth‐Martinsen Z 2 × Z p m ‐arrays, Yamada Z ( q − 1 ) ∕ 2 ‐arrays, Szekeres Z p m ‐array pairs, Paley Z p m ‐array pairs, and Baumert

    更新日期:2020-07-15
  • On split graphs with three or four distinct (normalized) Laplacian eigenvalues
    J. Comb. Des. (IF 0.731) Pub Date : 2020-07-13
    Shuchao Li, Wanting Sun

    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 ‐extremal if it is of diameter l having exactly l + 1 distinct Laplacian (resp, normalized Laplacian) eigenvalues. A graph is split if its vertex set can be partitioned into a clique and a stable set. Each split graph is of diameter at most 3. In this paper

    更新日期:2020-07-13
  • Affine Mendelsohn triple systems and the Eisenstein integers
    J. Comb. Des. (IF 0.731) Pub Date : 2020-06-24
    Alex W. Nowak

    We define a Mendelsohn triple system (MTS) of order coprime with 3, and having multiplication affine over an abelian group, to be affine, nonramified. By exhibiting a one‐to‐one correspondence between isomorphism classes of affine MTS and those of modules over the Eisenstein integers, we solve the isomorphism problem for affine, nonramified MTS and enumerate these isomorphism classes (extending the

    更新日期:2020-06-24
  • A note on 3‐partite graphs without 4‐cycles
    J. Comb. Des. (IF 0.731) Pub Date : 2020-06-22
    Zequn Lv, Mei Lu, Chunqiu Fang

    Let C 4 be a cycle of order 4. Write e x ( n , n , n , C 4 ) for the maximum number of edges in a balanced 3‐partite graph whose vertex set consists of three parts, each has n vertices that have no subgraph isomorphic to C 4 . In this paper, we show that e x ( n , n , n , C 4 ) ≥ 3 2 n ( p + 1 ) , where n = p ( p − 1 ) 2 and p is a prime number. Note that e x ( n , n , n , C 4 ) ≤ ( 3 2 2 + o ( 1 )

    更新日期:2020-06-22
  • Ternary codes, biplanes, and the nonexistence of some quasisymmetric and quasi‐3 designs
    J. Comb. Des. (IF 0.731) Pub Date : 2020-06-22
    Akihiro Munemasa, Vladimir D. Tonchev

    The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasisymmetric 2‐ ( 56 , 12 , 9 ) and 2‐ ( 57 , 12 , 11 ) designs with intersection numbers 0 and 3, and the nonexistence of a 2‐ ( 267 , 57 , 12 ) quasi‐3 design. The nonexistence of a 2‐ ( 149 , 37 , 9 ) quasi‐3 design is also proved.

    更新日期:2020-06-22
  • Symmetric designs and projective special linear groups of dimension at most four
    J. Comb. Des. (IF 0.731) Pub Date : 2020-06-07
    Seyed Hassan Alavi, Mohsen Bayat, Asharf Daneshkhah

    In this article, we study symmetric ( v , k , λ ) designs admitting a flag‐transitive and point‐primitive automorphism group G whose socle is isomorphic to a projective special linear group of dimension at most four. We, in particular, determine all such possible parameters ( v , k , λ ) and show that such a design belongs to one of two infinite families of point‐hyperplane designs or it is isomorphic

    更新日期:2020-06-07
  • On the maximum double independence number of Steiner triple systems
    J. Comb. Des. (IF 0.731) Pub Date : 2020-05-29
    Dylan Lusi, Charles J. Colbourn

    The maximum independence number of Steiner triple systems of order v is well‐known. Motivated by questions of access balancing in storage systems, we determine the maximum total cardinality of a pair of disjoint independent sets of Steiner triple systems of order v for all admissible orders.

    更新日期:2020-05-29
  • Exceptions and characterization results for type‐1 λ‐designs
    J. Comb. Des. (IF 0.731) Pub Date : 2020-05-18
    Ajeet Kumar Yadav, Rajendra M. Pawale, Mohan S. Shrikhande

    Let X be a finite set with v elements, called points and β be a family of subsets of X , called blocks. A pair ( X , β ) is called λ ‐design whenever ∣ β ∣ = ∣ X ∣ and 1. for all B i , B j ∈ β , i ≠ j , ∣ B i ∩ B j ∣ = λ ; 2. for all B j ∈ β , ∣ B j ∣ = k j > λ , and not all k j are equal. The only known examples of λ ‐designs are so‐called type‐1 designs, which are obtained from symmetric designs

    更新日期:2020-05-18
  • Some new group divisible designs with block size 4 and two or three group sizes
    J. Comb. Des. (IF 0.731) Pub Date : 2020-05-14
    R. Julian R. Abel, Yudhistira A. Bunjamin, Diana Combe

    Group divisible designs (GDDs) with block size 4 and at most 30 points are known for all feasible group types except three, namely 2 3 5 4 , 3 5 6 2 , and 2 2 5 5 . In this paper we provide solutions for the first two of these three 4‐GDDs without assuming any automorphisms. We also construct several other 4‐GDDs. These include classes of 4‐GDDs of types ( 3 m ) 4 ( 6 m ) q ( 3 n ) 1 for 0 ≤ n ≤ (

    更新日期:2020-05-14
  • Combinatorial designs for deep learning
    J. Comb. Des. (IF 0.731) Pub Date : 2020-05-04
    Shoko Chisaki, Ryoh Fuji‐Hara, Nobuko Miyamoto

    Deep learning is a machine learning methodology using a multilayer neural network. Let V 1 , V 2 , … , V L be mutually disjoint node sets (layers). A multilayer neural network can be regarded as a union of the complete bipartite graphs K ∣ V i ∣ , ∣ V i + 1 ∣ on consecutive two node sets V i and V i + 1 for i = 1 , 2 , … , L − 1 . The edges of a bipartite graph function as weights which are represented

    更新日期:2020-05-04
  • Deza graphs with parameters (v,k,k−2,a)
    J. Comb. Des. (IF 0.731) Pub Date : 2020-05-03
    Vladislav V. Kabanov, Leonid Shalaginov

    A Deza graph with parameters ( v , k , b , a ) is a k ‐regular graph on v vertices in which the number of common neighbors of two distinct vertices takes one of the following values: b or a , where b ≥ a . In the previous papers Deza graphs with b = k − 1 were characterized. In this paper, we characterize Deza graphs with b = k − 2 .

    更新日期:2020-05-03
  • Packing cliques in 3‐uniform hypergraphs
    J. Comb. Des. (IF 0.731) Pub Date : 2020-04-22
    Ramin Javadi, Ehsan Poorhadi, Farshad Fallah

    For positive integers n ≥ k ≥ t , a collection B of k ‐subsets of an n ‐set X is called a t ‐packing if every t ‐subset of X appears in at most one set in B . In this paper, we investigate the existence of the maximum 3‐packings whenever n is sufficiently larger than k . When n ≢ 2 ( mod k − 2 ) , the optimal value for the size of a 3‐packing is settled. In other cases, lower and upper bounds are obtained

    更新日期:2020-04-22
  • Constructions of pairs of orthogonal latin cubes
    J. Comb. Des. (IF 0.731) Pub Date : 2020-04-16
    Vladimir N. Potapov

    A pair of orthogonal latin cubes of order q is equivalent to a maximum distance separable code with distance 3 or to an OA 1 ( 3 , 5 , q ) orthogonal array. We construct pairs of orthogonal latin cubes for sequences of previously unknown orders q i = 16 ( 18 i − 1 ) + 4 and q i ′ = 16 ( 18 i + 5 ) + 4 . The minimal new obtained parameters of orthogonal arrays are OA 1 ( 3 , 5 , 84 ) .

    更新日期:2020-04-16
  • Quasigroups constructed from perfect Mendelsohn designs with block size 4
    J. Comb. Des. (IF 0.731) Pub Date : 2020-04-04
    Terry S. Griggs, Aleš Drápal, Andrew R. Kozlik

    Several varieties of quasigroups obtained from perfect Mendelsohn designs with block size 4 are defined. One of these is obtained from the so‐called directed standard construction and satisfies the law x y ⋅ ( y ⋅ x y ) = x and another satisfies Stein's third law x y ⋅ y x = y . Such quasigroups which satisfy the flexible law x ⋅ y x = x y ⋅ x are investigated and characterized. Quasigroups which satisfy

    更新日期:2020-04-04
  • Colourings of star systems
    J. Comb. Des. (IF 0.731) Pub Date : 2020-03-28
    Iren Darijani, David A. Pike

    An e ‐star is a complete bipartite graph K 1 , e . An e ‐star system of order n > 1 , S e ( n ) , is a partition of the edges of the complete graph K n into e ‐stars. An e ‐star system is said to be k ‐colourable if its vertex set can be partitioned into k sets (called colour classes) such that no e ‐star is monochromatic. The system S e ( n ) is k ‐chromatic if S e ( n ) is k ‐colourable but is not

    更新日期:2020-03-28
  • On determining when small embeddings of partial Steiner triple systems exist
    J. Comb. Des. (IF 0.731) Pub Date : 2020-03-17
    Darryn Bryant, Ajani De Vas Gunasekara, Daniel Horsley

    A partial Steiner triple system of order u is a pair ( U , A ) , where U is a set of u elements and A is a set of triples of elements of U such that any two elements of U occur together in at most one triple. If each pair of elements occur together in exactly one triple it is a Steiner triple system. An embedding of a partial Steiner triple system ( U , A ) is a (complete) Steiner triple system ( V

    更新日期:2020-03-17
  • An improved recursive construction for disjoint Steiner quadruple systems
    J. Comb. Des. (IF 0.731) Pub Date : 2020-03-13
    Tuvi Etzion, Junling Zhou

    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

    更新日期:2020-03-13
  • The existence of disjoint (hooked) near‐Rosa sequences and applications
    J. Comb. Des. (IF 0.731) Pub Date : 2020-03-11
    Beth A. Austin, Nabil Shalaby

    We show that the necessary conditions are sufficient for the existence of two disjoint near (hooked) Rosa sequences, with all admissible orders n ≥ 6 and all possible defects. Further, we apply this result for the existence of new types of cyclic and simple GDDs.

    更新日期:2020-03-11
  • Short k‐radius sequences, k‐difference sequences and universal cycles
    J. Comb. Des. (IF 0.731) Pub Date : 2020-03-09
    Xiande Zhang

    An n ‐ary k ‐radius sequence is a finite sequence of elements taken from an alphabet of size n in which any two distinct elements occur within distance k of each other somewhere in the sequence. The study of constructing short k ‐radius sequences was motivated by some problems occurring in large data transfer. Let f k ( n ) be the shortest length of any n ‐ary k ‐radius sequence. We show that the conjecture

    更新日期:2020-03-09
  • Design theory and some forbidden configurations
    J. Comb. Des. (IF 0.731) Pub Date : 2020-03-06
    R. P. Anstee, Farzin Barekat, Zachary Pellegrin

    In this paper we relate t ‐designs to a forbidden configuration problem in extremal set theory. Let 1 t 0 ℓ denote a column of t 1's on top of ℓ 0's. Let q ⋅ 1 t 0 ℓ denote the ( t + ℓ ) × q matrix consisting of t rows of q 1's and ℓ rows of q 0's. We consider extremal problems for matrices avoiding certain submatrices. Let A be a (0, 1)‐matrix forbidding any ( t + ℓ ) × ( λ + 2 ) submatrix ( λ + 2

    更新日期:2020-03-06
  • Large monochromatic components in 3‐edge‐colored Steiner triple systems
    J. Comb. Des. (IF 0.731) Pub Date : 2020-02-27
    Louis DeBiasio, Michael Tait

    It is known that in any r‐coloring of the edges of a complete r‐uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple system on n vertices, what is the largest monochromatic component one can guarantee in an arbitrary 3‐coloring of the edges? Gyárfás proved that ( 2 n + 3 ) / 3 is an absolute lower bound and that this lower bound is best possible for infinitely

    更新日期:2020-02-27
  • Classification of skew‐Hadamard matrices of order 32 and association schemes of order 31
    J. Comb. Des. (IF 0.731) Pub Date : 2020-02-14
    Akihide Hanaki, Hadi Kharaghani, Ali Mohammadian, Behruz Tayfeh‐Rezaie

    Using a backtracking algorithm along with an essential change to the rows of representatives of known 13 710 027 equivalence classes of Hadamard matrices of order 32, we make an exhaustive computer search feasible and show that there are exactly 6662 inequivalent skew‐Hadamard matrices of order 32. Two skew‐Hadamard matrices are considered SH‐equivalent if they are similar by a signed permutation matrix

    更新日期:2020-02-14
  • Q5‐factorization of λKn
    J. Comb. Des. (IF 0.731) Pub Date : 2020-02-11
    Oğuz Doğan, Selda Küçükçifçi, Emine Ş. Yazıcı

    Qk is the simple graph whose vertices are the k‐tuples with entries in {0, 1} and edges are the pairs of k‐tuples that differ in exactly one position. In this paper, we proved that there exists a Q5‐factorization of λKn if and only if (a) n ≡ 0(mod 32) if λ ≡ 0(mod 5) and (b) n ≡ 96(mod 160) if λ ≢ 0(mod 5).

    更新日期:2020-02-11
  • The existence of large set of symmetric partitioned incomplete latin squares
    J. Comb. Des. (IF 0.731) Pub Date : 2020-02-09
    Cong Shen, Haitao Cao, Lijun Ji

    In this paper, we investigate the existence of large sets of symmetric partitioned incomplete latin squares of type gu (LSSPILSs) which can be viewed as a generalization of the well‐known golf designs. Constructions for LSSPILSs are presented from some other large sets, such as golf designs, large sets of group divisible designs, and large sets of Room frames. We prove that there exists an LSSPILS(gu)

    更新日期:2020-02-09
  • A complete solution to the infinite Oberwolfach problem
    J. Comb. Des. (IF 0.731) Pub Date : 2020-02-05
    Simone Costa

    Let F be a 2‐regular graph of order v. The Oberwolfach problem, OP(F), asks for a 2‐factorization of the complete graph on v vertices in which each 2‐factor is isomorphic to F. In this paper, we give a complete solution to the Oberwolfach problem over infinite complete graphs, proving the existence of solutions that are regular under the action of a given involution free group G. We will also consider

    更新日期:2020-02-05
  • All group‐based latin squares possess near transversals
    J. Comb. Des. (IF 0.731) Pub Date : 2020-02-03
    Luis Goddyn, Kevin Halasz

    In a latin square of order n, a near transversal is a collection of n −1 cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square possesses a near transversal. We show that this conjecture is true for every latin square that is main class equivalent to the Cayley table of a finite group.

    更新日期:2020-02-03
  • Some results on the Ryser design conjecture
    J. Comb. Des. (IF 0.731) Pub Date : 2019-12-16
    Tushar D. Parulekar, Sharad S. Sane

    A Ryser design has equally many points as blocks with the provision that every two blocks intersect in a fixed number of points λ . An improper Ryser design has only one replication number and is thus symmetric design. A proper Ryser design has two replication numbers. The only known construction of a Ryser design is the complementation of a symmetric design. Such a Ryser design is called a Ryser design

    更新日期:2019-12-16
  • Sequencing partial Steiner triple systems
    J. Comb. Des. (IF 0.731) Pub Date : 2019-12-11
    Brian Alspach, Donald L. Kreher, Adrián Pastine

    A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point‐disjoint blocks. We prove that if a partial Steiner triple system has at most three point‐disjoint blocks, then it is sequenceable.

    更新日期:2019-12-11
  • Partial difference sets and amorphic Cayley schemes in non‐abelian 2‐groups
    J. Comb. Des. (IF 0.731) Pub Date : 2019-12-08
    Tao Feng, Zhiwen He, Yu Qing Chen

    In this paper, we consider regular automorphism groups of graphs in the RT2 family and the Davis‐Xiang family and amorphic abelian Cayley schemes from these graphs. We derive general results on the existence of non‐abelian regular automorphism groups from abelian regular automorphism groups and apply them to the RT2 family and Davis‐Xiang family and their amorphic abelian Cayley schemes to produce

    更新日期:2019-12-08
  • Geometric groups of second order and related combinatorial structures
    J. Comb. Des. (IF 0.731) Pub Date : 2019-12-06
    Andrew Woldar

    In 1977, D. Betten defined a geometric group to be a permutation group ( G , Ω ) such that G = Aut ( R ) for some hypergraph R on Ω . In this paper, we extend Betten's notion of a geometric group to what we call a geometric group of second order. By definition, this is a permutation group for which G = Aut ( R ) for some set R = { R 1 , R 2 , … , R d } of hypergraphs on Ω . Our main focus will be on

    更新日期:2019-12-06
  • On t‐designs and s‐resolvable t‐designs from hyperovals
    J. Comb. Des. (IF 0.731) Pub Date : 2019-12-03
    Tran van Trung

    Hyperovals in projective planes turn out to have a link with t‐designs. Motivated by an unpublished work of Lonz and Vanstone, we present a construction for t‐designs and s‐resolvable t‐designs from hyperovals in projective planes of order 2 n . We prove that the construction works for t ≤ 5 . In particular, for t = 5 the construction yields a family of 5‐ ( 2 n + 2 , 8 , 70 ( 2 n − 2 − 1 ) ) designs

    更新日期:2019-12-03
  • There is no (95, 40, 12, 20) strongly regular graph
    J. Comb. Des. (IF 0.731) Pub Date : 2019-12-03
    Jernej Azarija, Tilen Marc

    We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.

    更新日期:2019-12-03
  • Infinite families of 2‐designs from a class of cyclic codes
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-27
    Xiaoni Du, Rong Wang, Cuiling Fan

    Combinatorial t ‐designs have wide applications in coding theory, cryptography, communications, and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a t ‐design. In this paper, we first determine the weight distributions of a class of linear codes derived from the dual of some extended cyclic codes. We then obtain infinite families of 2‐designs

    更新日期:2019-11-27
  • Cyclic cycle systems of the complete multipartite graph
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-20
    Andrea Burgess, Francesca Merola, Tommaso Traetta

    In this paper, we study the existence problem for cyclic ℓ ‐cycle decompositions of the graph K m [ n ] , the complete multipartite graph with m parts of size n , and give necessary and sufficient conditions for their existence in the case that 2 ℓ | ( m − 1 ) n .

    更新日期:2019-11-20
  • A generalization of Heffter arrays
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-19
    Simone Costa, Fiorenza Morini, Anita Pasotti, Marco Antonio Pellegrini

    In this paper, we define a new class of partially filled arrays, called relative Heffter arrays, that are a generalization of the Heffter arrays introduced by Archdeacon in 2015. Let v = 2 n k + t be a positive integer, where t divides 2 n k , and let J be the subgroup of Z v of order t . A H t ( m , n ; s , k ) Heffter array over Z v relative to J is an m × n partially filled array with elements in

    更新日期:2019-11-19
  • Lagrangian densities of linear forests and Turán numbers of their extensions
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-19
    Sinan Hu, Yuejian Peng, Biao Wu

    The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. Recently, Lagrangian densities of hypergraphs and Turán numbers of their extensions have been studied actively. However, determining the Lagrangian density of a hypergraph is not an easy task even for a “simple” hypergraph. For example, to determine the Lagrangian density of K 4 3 is equivalent to determine the Turán

    更新日期:2019-11-19
  • Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-16
    Alexander Sidorenko

    For a family F of r ‐graphs, let ex ( n , F ) denote the maximum number of edges in an F ‐free r ‐graph on n vertices. Let F r ( v , e ) denote the family of all r ‐graphs with e edges and at most v vertices. We prove that ex ( n , F r ( r + 1 , 2 ) ∪ F r ( r + 2 , 3 ) ) = ( 1 r − o ( 1 ) ) ( n r − 1 ) .

    更新日期:2019-11-16
  • Paley type partial difference sets in abelian groups
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-16
    Zeying Wang

    Partial difference sets with parameters ( v , k , λ , μ ) = ( v , ( v − 1 ) / 2 , ( v − 5 ) / 4 , ( v − 1 ) / 4 ) are called Paley type partial difference sets. In this note, we prove that if there exists a Paley type partial difference set in an abelian group of order v, where v is not a prime power, then v = n 4 or 9 n 4 , n > 1 an odd integer. In 2010, Polhill constructed Paley type partial difference

    更新日期:2019-11-16
  • A note on one inequality of Drápal–Valent type
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-14
    Tomáš J. Kepka, Petr C. Němec

    In this note, an elementary proof of a generalized Drápal–Valent type‐inequality is presented.

    更新日期:2019-11-14
  • On the upper chromatic number and multiple blocking sets of PG(n,q)
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-11
    Zoltán L. Blázsik, Tamás Héger, Tamás Szőnyi

    We investigate the upper chromatic number of the hypergraph formed by the points and the k ‐dimensional subspaces of PG ( n , q ) ; that is, the most number of colors that can be used to color the points so that every k ‐subspace contains at least two points of the same color. Clearly, if one colors the points of a double blocking set with the same color, the rest of the points may get mutually distinct

    更新日期:2019-11-11
  • Infinite families of 3‐designs from APN functions
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-08
    Chunming Tang

    Combinatorial t ‐designs have nice applications in coding theory, finite geometries, and several engineering areas. A classical method for constructing t ‐designs is by the action of a permutation group that is t ‐transitive or t ‐homogeneous on a point set. This approach produces t ‐designs, but may not yield ( t + 1 ) ‐designs. The objective of this paper is to study how to obtain 3‐designs with

    更新日期:2019-11-08
  • There are 3155 nonisomorphic perfect one‐factorizations of K16
    J. Comb. Des. (IF 0.731) Pub Date : 2019-11-03
    Mariusz Meszka

    We enumerate all nonisomorphic perfect one‐factorizations of K 16 .

    更新日期:2019-11-03
  • The spectrum of semicyclic holey group divisible designs with block size three
    J. Comb. Des. (IF 0.731) Pub Date : 2019-10-31
    Lidong Wang, Tao Feng, Rong Pan, Xiaomiao Wang

    We determine a necessary and sufficient condition for the existence of semicyclic holey group divisible designs with block size three and group type ( n , m t ) . New recursive constructions on semicyclic incomplete holey group divisible designs are introduced to settle this problem completely.

    更新日期:2019-10-31
  • New lower bounds for partial k‐parallelisms
    J. Comb. Des. (IF 0.731) Pub Date : 2019-10-31
    Tao Zhang, Yue Zhou

    Due to the applications in network coding, subspace codes and designs have received many attentions. Suppose that k ∣ n and V ( n , q ) is an n ‐dimensional space over the finite field F q . A k ‐spread is a ( q n − 1 ) / ( q k − 1 ) ‐set of k ‐dimensional subspaces of V ( n , q ) such that each nonzero vector is contained in exactly one element of it. A partial k ‐parallelism in V ( n , q ) is a set

    更新日期:2019-10-31
  • Extreme nonassociativity in order nine and beyond
    J. Comb. Des. (IF 0.731) Pub Date : 2019-10-30
    Aleš Drápal, Viliam Valent

    The main concern of this paper are quasigroups of order nine that possess at most 18 associative triples. The order nine is the least order for which there exists a quasigroup ( Q , * ) such that x   *   ( y   *   z ) = ( x   *   y )   *   z holds if and only if x = y = z . Up to isomorphism there is only one such quasigroup of this order. It has remarkable properties that bind it to a nearfield, to

    更新日期:2019-10-30
  • Constructions of primitive formally dual pairs having subsets with unequal sizes
    J. Comb. Des. (IF 0.731) Pub Date : 2019-09-29
    Shuxing Li, Alexander Pott

    The concept of formal duality was proposed by Cohn, Kumar and Schürmann, which reflects a remarkable symmetry among energy‐minimizing periodic configurations. This formal duality was later translated into a purely combinatorial property by Cohn, Kumar, Reiher and Schürmann, where the corresponding combinatorial objects were called formally dual pairs. Motivated by this surprising application on the

    更新日期:2019-09-29
  • Decomposable super‐simple RBIBDs with block size 4 and index 6
    J. Comb. Des. (IF 0.731) Pub Date : 2019-09-26
    Xianwei Sun, R. Julian R. Abel, Huangshen Yu, Dianhua Wu

    Necessary conditions for the existence of a decomposable super‐simple resolvable ( v , 4 , 6 ) ‐BIBD whose two component subdesigns are both resolvable ( v , 4 , 3 ) ‐BIBDs are v ≡ 0 (mod 4 ) and v ≥ 16 . In this paper, it is proved that these necessary conditions are sufficient, except possibly for v ∈ { 268 , 284 , 292 , 296 } .

    更新日期:2019-09-26
  • Nonsymmetric 2‐(v,k,λ) designs, with (r,λ)  = 1, admitting a solvable flag‐transitive automorphism group of affine type
    J. Comb. Des. (IF 0.731) Pub Date : 2019-09-24
    Mauro Biliotti, Alessandro Montinaro, Pierluigi Rizzo

    Nonsymmetric 2 ‐ ( v , k , λ ) designs, with ( r , λ ) = 1 , admitting a solvable flag‐transitive automorphism group of affine type not contained in A Γ L 1 ( v ) are classified.

    更新日期:2019-09-24
  • On a question of Thas on partial 3‐(qn + 1, q + 1, 1) designs
    J. Comb. Des. (IF 0.731) Pub Date : 2019-09-23
    Klaus Metsch, Geertrui Van de Voorde

    In this note, we answer a question of JA Thas about partial 3 ‐ ( q n + 1 , q + 1 , 1 ) designs. We then extend this answer to a result about the embedding of certain partial 3 ‐ ( q 2 + 1 , q + 1 , 1 ) designs into Möbius planes.

    更新日期:2019-09-23
  • Plateaued functions, partial geometric difference sets, and partial geometric designs
    J. Comb. Des. (IF 0.731) Pub Date : 2019-09-18
    Bangteng Xu

    Plateaued functions on finite fields have been studied in many papers in recent years. As a generalization of plateaued functions on finite fields, we introduce the notion of a plateaued function on a finite abelian group. We will give a characterization of a plateaued function in terms of an equation of the matrix associated to the function. Then we establish a one‐to‐one correspondence between the

    更新日期:2019-09-18
  • On the structure of small strength‐2 covering arrays
    J. Comb. Des. (IF 0.731) Pub Date : 2019-09-08
    Janne I. Kokkala, Karen Meagher, Reza Naserasr, Kari J. Nurmela, Patric R. J. Östergård, Brett Stevens

    A covering array CA ( N ; t , k , v ) of strength t is an N × k array of symbols from an alphabet of size v such that in every N × t subarray, every t ‐tuple occurs in at least one row. A covering array is optimal if it has the smallest possible N for given t , k , and v , and uniform if every symbol occurs ⌊ N ∕ v ⌋ or ⌈ N ∕ v ⌉ times in every column. Before this paper, the only known optimal covering

    更新日期:2019-09-08
  • Group divisible 3‐designs with block size four and group type 1ns1
    J. Comb. Des. (IF 0.731) Pub Date : 2019-08-29
    Xiangqian Li, Yanxun Chang, Junling Zhou

    In this article, we mainly consider the existence problem of a group divisible design GDD ( 3 , 4 , n + s ) of type 1 n s 1 . We present two recursive constructions for this configuration using candelabra systems and construct explicitly a few small examples admitting given automorphism groups. As an application, several new infinite classes of GDD ( 3 , 4 , n + s ) s of type 1 n s 1 are produced.

    更新日期:2019-08-29
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
3分钟学术视频演讲大赛
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
ACS Publications填问卷
阿拉丁试剂right
麻省大学
西北大学
湖南大学
华东师范大学
王要兵
化学所
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
胡眆昊
杨财广
廖矿标
试剂库存
down
wechat
bug