Proof of a conjecture on hadamard 2-groups
โ Scribed by Robert G Kraemer
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 473 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Fix n. Let r(n) denote the largest number r for which there is an r\_n (1, &1)matrix H satisfying the matrix equation HH =nI r . The Hadamard conjecture states that for n divisible by 4 we have r(n)=n. Let =>0. In this paper, we show that the Extended Riemann Hypothesis and recent results on the asy
## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume
In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs: ## . z;(t~-I)~ . The meaning of the odd notation on the 1e:ft of (1) is as follows: write . . . C(k+n-1)2 ; then ## K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1 alId, af course, (1) is restated as (1')