Journal of Combinatorial Designs
Издатель: Wiley · ISSN 10638539 · 13 статей
- Issue Information
-
Updating the Incomplete MOLS Table for v up to 100
ABSTRACT Incomplete transversal designs have wide application in the construction of other designs such as transversal designs, block designs, frames, statistical designs, and Latin rectangles. Other areas where they are used include...
-
On Complete Morphisms of Butson Hadamard Matrices
ABSTRACT A complete morphism of Butson classes replaces each entry of a matrix in by an block, uniformly, to produce a matrix in . We show that every complete morphism is described by a pair , where and is a unitary matrix annihilated...
-
The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors
ABSTRACT The Hamilton‐Waterloo problem asks for the existence of a 2‐factorization of the complete graph of odd order in which of the 2‐factors are isomorphic to a given 2‐factor , and of the 2‐factors are isomorphic to a given 2‐factor...
-
Multiplier Obstructions for Legendre Pairs of Length 333
ABSTRACT A Legendre pair of length 333 would yield a Hadamard matrix of order 668. We study the structured case in which both sequences are fixed by a common subgroup acting by coordinate multiplication. We prove that such a pair can...
-
Classifying Equidistant Permutation Codes
ABSTRACT A permutation code of length is a set of codewords, each of which contains every symbol of a set of size exactly once. A permutation code in which any two distinct codewords differ in the same number of coordinates is called...
-
Divisible Design Graphs Derived From Collections of Affine Designs
ABSTRACT A divisible design graph is a finite regular graph whose vertex set can be partitioned into classes of equal size such that the number of common neighbors of two distinct vertices depends only on whether they belong to the same...
-
Partial Steiner Triple Systems With an Almost Parallel Class Missing Any Given Point
ABSTRACT We say that a hypergraph is factor critical if it has no 1‐factor but deletion of any vertex results in a hypergraph that has a 1‐factor. We show that any factor‐critical hypergraph of order has at least edges, and that for all...
-
Exact Values and Bounds on Covering Schemes of Strength Two
ABSTRACT In this work, we investigate covering schemes of strength 2 over finite abelian groups, establishing new lower and upper bounds and evaluating new exact values. A main result is a new general lower bound that improves the...
-
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the...
-
Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points
ABSTRACT A symmetric ‐design is said to be ‐pyramidal, with , under the action of a group if acts as an automorphism group fixing points and acting sharply transitively on the remaining ones. We show that, necessarily, . In particular,...
-
Block‐Primitive Rank 3 t‐Designs With Sporadic or Alternating Socle
ABSTRACT In this paper, we classify nontrivial ‐ designs with and admitting an automorphism group that acts primitively with rank 3 on the block set, under the assumption that the socle is a sporadic simple group or an alternating...
-
On Flag‐Transitive 2‐(v,k,λ) Designs With λ≤4
ABSTRACT Let be a non‐trivial 2‐ design with , admitting a flag‐transitive automorphism group which is also properly innately transitive on points. Then is of almost simple quotient type. As a corollary, we obtain that is innately...