The number of submatrices of a given type in a Hadamard matrix and related results
✍ Scribed by P Frankl; V Rödl; R.M Wilson
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 477 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A nonsymmetric Bush-type Hadamard matrix of order 36 is constructed which leads to two new infinite classes of symmetric designs with parameters: where m is any positive integer.
This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor
ROTHE of Ann Arbor, Mich. (USA.). (Eingegangen am 6. 3. 1950.) \*) For any point set U the closure is denoted by F. The symbol n denotea intersection -The symbol (y 1 P(y)} denotes the set of all y having the property P . Sometimes we will shortly write {PI, e.g., {I SO) = (ylZ(y) 5 0 ) .