A Proof of Rogers' Conjecture on Pairs of Convex Domains
โ Scribed by Gkunbaum, B.
- Book ID
- 120098344
- Publisher
- Oxford University Press
- Year
- 1964
- Tongue
- English
- Weight
- 161 KB
- Volume
- s1-39
- Category
- Article
- ISSN
- 0024-6107
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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')
## 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
E. J. Williams conjectured that for every prime power \(v \geqslant 3\) there exists a \(v(v-1) \times v\) design balanced for pairs of interacting residual effects, and he proved this conjecture for the case in which \(v\) is a prime. Later, this conjecture was verified for \(v \leqslant 64\) by ma