530 research outputs found
Pairwise transitive 2-designs
We classify the pairwise transitive 2-designs, that is, 2-designs such that a
group of automorphisms is transitive on the following five sets of ordered
pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,
intersecting block-pairs and non-intersecting block-pairs. These 2-designs fall
into two classes: the symmetric ones and the quasisymmetric ones. The symmetric
examples include the symmetric designs from projective geometry, the 11-point
biplane, the Higman-Sims design, and designs of points and quadratic forms on
symplectic spaces. The quasisymmetric examples arise from affine geometry and
the point-line geometry of projective spaces, as well as several sporadic
examples.Comment: 28 pages, updated after review proces
Cohomology-Developed Matrices -- constructing families of weighing matrices and automorphism actions
The aim of this work is to construct families of weighing matrices via their
automorphism group action. This action is determined from the
-cohomology groups of the underlying abstract group. As a consequence,
some old and new families of weighing matrices are constructed. These include
the Paley Conference, the Projective-Space, the Grassmannian, and the
Flag-Variety weighing matrices. We develop a general theory relying on low
dimensional group-cohomology for constructing automorphism group actions, and
in turn obtain structured matrices that we call \emph{Cohomology-Developed
matrices}. This "Cohomology-Development" generalizes the Cocyclic and Group
Developments. The Algebraic structure of modules of Cohomology-Developed
matrices is discussed, and an orthogonality result is deduced. We also use this
algebraic structure to define the notion of \emph{Quasiproducts}, which is a
generalization of the Kronecker-product
Twisted Permutation Codes
We introduce twisted permutation codes, which are frequency permutation
arrays analogous to repetition permutation codes, namely, codes obtained from
the repetition construction applied to a permutation code. In particular, we
show that a lower bound for the minimum distance of a twisted permutation code
is the minimum distance of a repetition permutation code. We give examples
where this bound is tight, but more importantly, we give examples of twisted
permutation codes with minimum distance strictly greater than this lower bound.Comment: 20 page
- …