𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Neyman's conjecture: A characterization of the multinomials

✍ Scribed by Bikas Kumar Sinha; Thomas M Gerig

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
518 KB
Volume
16
Category
Article
ISSN
0047-259X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Equivalence of the Johnson-Neyman
On the Equivalence of the Johnson-Neyman Technique and Fieller's Theorem
✍ Prof. James R. Schwenke 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB 👁 2 views

It is shown that for the one-way analysisofcoveriance model with one covariate, when the hypotheeis of a common elope parameter haa beenrejectd, the Johneo~-Neyman procedure 1~5ulte in a confidence interval equivalent to that obtained using Fieller's theorem. It ie noted in Fieller's paper that the

On a Special Case of Carrell's Conjectur
On a Special Case of Carrell's Conjecture
✍ Jerzy Konarski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we study a conjecture of J. B. Carrell on the rationality of a compact Kahler manifold admitting a holomorphic vector field with isolated zeroes. The conjecture, formulated in terms of ‫ރ‬ q -actions, says that if ‫ރ‬ q is acting on a nonsingular projective variety X with exactly one f

On Meyniel's conjecture of the cop numbe
On Meyniel's conjecture of the cop number
✍ Linyuan Lu; Xing Peng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

## Abstract Meyniel conjectured that the cop number __c__(__G__) of any connected graph __G__ on __n__ vertices is at most for some constant __C__. In this article, we prove Meyniel's conjecture in special cases that __G__ has diameter 2 or __G__ is a bipartite graph of diameter 3. For general con