scispace - formally typeset
Open AccessJournal ArticleDOI

Modular Hadamard martrices and related designs

Reads0
Chats0
TLDR
The related combinatorial designs are the main concern of this paper; some results dealing with the existence and construction of modular Hadamard matrices will be included in a later paper.
Citations
More filters
Journal ArticleDOI

Graphs with constant μ and μ

TL;DR: In this article, it was shown that a connected graph has constant μ and μ if and only if it has two distinct nonzero Laplace eigenvalues, which leads to strong conditions for existence.
Book ChapterDOI

Graphs with Few Eigenvalues

TL;DR: A graph with only one eigenvalue (for A, L, or Q) is edgeless as mentioned in this paper, and a connected graph with two distinct adjacency eigenvalues is complete.
Journal ArticleDOI

A survey on modular Hadamard matrices

TL;DR: These constructions of 32-modular Hadamard matrices for every size n divisible by 4 are provided, based on the description of several families of modular Golay pairs and quadruples.
Journal ArticleDOI

On the structure of regular pairwise balanced designs

TL;DR: D determinantal conditions necessary for the existence of (r,λ)-designs are obtained and a generalization of this inequality is obtained.
Journal ArticleDOI

Algebraic duality theorems with combinatorial applications

TL;DR: In this paper, the dual structure of combinatorial designs has been studied in the context of tactical decompositions and partial geometric designs, and two linear algebra results have been proved.
References
More filters
Journal ArticleDOI

Modular Hadamard matrices and related designs. II

TL;DR: In this paper, the inner product of any two distinct row vectors is a multiple of a fixed (positive) integer n; such a matrix is also referred to as an H(n, h) matrix with parameters n and h.