Fisher's inequality

Fisher's inequality

In combinatorial mathematics, Fisher's inequality, named after Ronald Fisher, is a necessary condition for the existence of a balanced incomplete block design satisfying certain prescribed conditions.

Fisher, a population geneticist and statistician, was concerned with the design of experiments studying the differences among several different varieties of plants, under each of a number of different growing conditions, called "blocks".

Let:

* "v" be the number of varieties of plants;
* "b" be the number of blocks.

It was required that:

* "k" different varieties are in each block, "k" < "v"; no variety occurs twice in any one block;
* any two varieties occur together in exactly &lambda; blocks;

Fisher's inequality states simply that

: v ge b.,

References

* R. A. Fisher, "An examination of the different possible solutions of a problem in incomplete blocks", "Annals of Eugenics", volume 10, 1940, pages 52&ndash;75.
* R. C. Bose, "A Note on Fisher's Inequality for Balanced Incomplete Block Designs", "Annals of Mathematical Statistics", 1949, pages 619&ndash;620.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Fisher information — In statistics and information theory, the Fisher information (denoted mathcal{I}( heta)) is the variance of the score. It is named in honor of its inventor, the statistician R.A. Fisher.DefinitionThe Fisher information is a way of measuring the… …   Wikipedia

  • Ronald Fisher — R. A. Fisher Born 17 February 1890(1890 02 17) East Finchley, London …   Wikipedia

  • Entropy power inequality — In mathematics, the entropy power inequality is a result in probability theory that relates to so called entropy power of random variables. It shows that the entropy power of suitably well behaved random variables is a superadditive function. The …   Wikipedia

  • List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • List of inequalities — This page lists Wikipedia articles about named mathematical inequalities. Inequalities in pure mathematics =Analysis= * Askey–Gasper inequality * Bernoulli s inequality * Bernstein s inequality (mathematical analysis) * Bessel s inequality *… …   Wikipedia

  • Block design — In combinatorial mathematics, a block design (more fully, a balanced incomplete block design) is a particular kind of set system, which has long standing applications to experimental design (an area of statistics) as well as purely combinatorial… …   Wikipedia

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Combinatorial design — theory is the part of combinatorial mathematics that deals with the existence and construction of systems of finite sets whose intersections have specified numerical properties. For instance, a balanced incomplete block design (usually called for …   Wikipedia

  • Symmetric design — In combinatorial mathematics, a symmetric design is a block design with equal numbers of points and blocks. Thus, it has the fewest possible blocks given the number of points (by Fisher s inequality).That is, a symmetric design is a ( v , b , r …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”