formulasearchengine - User contributions [en]

Line–sphere intersection

2014-05-09T20:15:56Z

199.46.196.231: Reformatted equations. You cannot square a vector!!!!

Nice to meet you, I am Marvella Shryock. California is where her home is but she requirements to transfer because of her family members. To collect coins is a factor that I'm completely addicted to. For many years I've been operating as a payroll clerk. My site [http://www.breda.nl/users/noeliadfebdftijfsdnt over the counter std test]

Alpha beta filter

2014-01-13T17:03:05Z

199.46.200.232: /* The alpha beta gamma extension */

A '''confidence band''' is used in [[statistics|statistical analysis]] to represent the uncertainty in an estimate of a curve or function based on limited or noisy data. Similarly, a '''prediction band''' is used to represent the uncertainty about the value of a new data-point on the curve, but subject to noise. Confidence and prediction bands are often used as part of the graphical presentation of results of a [[regression analysis]].

Confidence bands are closely related to [[confidence intervals]], which represent the uncertainty in an estimate of a single numerical value. "As confidence intervals, by construction, only refer to a single point, they are narrower (at this point) than a confidence band which is supposed to hold simultaneously at many points."<ref>p.65 in W. Härdle, M. Müller, S. Sperlich, A. Werwatz (2004), Nonparametric and Semiparametric Models, Springer, ISBN 3540207228 [http://sfb649.wiwi.hu-berlin.de/fedc_homepage/xplore/ebooks/html/spm/spmhtmlnode17.html],[http://books.google.com/books?id=qPCmAOS-CoMC&lpg=PA65&vq=As%20confidence%20intervals%2C%20by%20construction%2C%20only%20refer%20to%20a%20single%20point%2C%20they%20are%20narrower%20(at%20this%20point)%20than%20a%20confidence%20band%20which%20is%20supposed%20to%20hold%20simultaneously%20at%20many%20points&pg=PA65#v=snippet&q=As%20confidence%20intervals,%20by%20construction,%20only%20refer%20to%20a%20single%20point,%20they%20are%20narrower%20(at%20this%20point)%20than%20a%20confidence%20band%20which%20is%20supposed%20to%20hold%20simultaneously%20at%20many%20points&f=false]</ref>

==Pointwise and simultaneous confidence bands==

Suppose our aim is to estimate a function ''f(x)''. For example, ''f(x)'' might be the proportion of people of a particular age ''x'' who support a given candidate in an election. If ''x'' is measured at the precision of a single year, we can construct a separate 95% confidence interval for each age. Each of these confidence intervals covers the corresponding true value ''f(x)'' with probability 0.95. Taken together, these confidence intervals constitute a ''95% pointwise confidence band'' for ''f(x)''.

In mathematical terms, a pointwise confidence band <math>\hat{f}(x)\pm w(x)</math> with coverage probability 1−α satisfies the following condition separately for each value of ''x'':

:<math>
{\rm Pr}\Big(\hat{f}(x)-w(x) \le f(x) \le \hat{f}(x)+w(x)\Big) = 1-\alpha,
</math>

where <math>\hat{f}(x)</math> is the point estimate of ''f''(''x'').

The ''simultaneous coverage probability'' of a collection of confidence intervals is the probability that all of them cover their corresponding true values simultaneously. In the example above, the simultaneous coverage probability is the probability that the intervals for x=18,19,... all cover their true values (assuming that 18 is the youngest age at which a person can vote). If each interval individually has coverage probability 0.95, the simultaneous coverage probability is generally less than 0.95. A ''95% simultaneous confidence band'' is a collection of confidence intervals for all values ''x'' in the domain of ''f(x)'' that is constructed to have simultaneous coverage probability 0.95.

In mathematical terms, a simultaneous confidence band <math>\hat{f}(x)\pm w(x)</math> with coverage probability 1−α satisfies the following condition:

:<math>
{\rm Pr}\Big(\hat{f}(x)-w(x) \le f(x) \le \hat{f}(x)+w(x) \;\;\;\; \text{ for all } x\Big) = 1-\alpha.
</math>

In nearly all cases, a simultaneous confidence band will be wider than a pointwise confidence band with the same coverage probability.

[[Image:binomial confidence band.svg|thumb|325px|Confidence bands for simulated data depicting the proportion of voters supporting a given candidate in election, as a function of the voters' ages. Pointwise 95% confidence bands, and simultaneous 95% confidence bands constructed using the [[Bonferroni method]] are shown.]]

==Confidence bands in regression analysis==

Confidence bands commonly arise in [[regression analysis]].<ref>{{cite journal |last= Liu|first= W|coauthors=Lin S., Piegorsch W.W.|year=2008| title= Construction of Exact Simultaneous Confidence Bands for a Simple Linear Regression Model|journal= International Statistical Review|volume=76| issue=1|pages=39–57|doi=10.1111/j.1751-5823.2007.00027.x }}</ref> In the case of a simple regression involving a single independent variable, results can be presented in the form of a plot showing the estimated regression line along with either point-wise or simultaneous confidence bands. Commonly used methods for constructing simultaneous confidence bands in regression are the [[Bonferroni method|Bonferroni]] and [[Scheffé's method|Scheffé]] methods; see [[Familywise error rate#Controlling procedures|Familywise error rate controlling procedures]] for more.

[[Image:Regression confidence band.svg|thumb|325px|Confidence bands for a simple linear regression analysis using simulated data. Pointwise 95% confidence bands, and simultaneous 95% confidence bands constructed using [[Scheffé's method]] are shown.]]

==Other applications of confidence bands==

Confidence bands arise whenever a statistical analysis focuses on estimating a function.

For example, confidence bands can be constructed around estimates of the [[empirical distribution function]]. Simple theory allows the construction of point-wise confidence intervals, but it is also possible to construct a simultaneous confidence band for the cumulative distribution function as a whole by inverting the [[Kolmogorov-Smirnov test#Setting confidence limits for the shape of a distribution function|Kolmogorov-Smirnov test]], or by using non-parametric likelihood methods
.<ref>{{cite journal |last=Owen |first= A.B. |year= 1995 |title=Nonparametric likelihood confidence bands for a distribution function |journal= Journal of the American Statistical Association|volume= 90|pages= 516–521| jstor=2291062 |doi=10.2307/2291062 |issue=430 |publisher=American Statistical Association}}</ref>

Confidence bands have also been devised for estimates of [[probability density function|density functions]], [[spectral density]] functions<ref>{{cite journal |last=Neumann | first=M.H.|coauthors=Paparoditis, E.|year=2008 |title=Simultaneous confidence bands in spectral density estimation|journal=Biometrika|volume=95|issue=2| doi=10.1093/biomet/asn005 |pages=381 }}</ref>
, [[quantile]] functions, [[smoothing|scatterplot smooths]], [[survival function]]s, and [[characteristic function (probability theory)|characteristic functions]]{{citation needed|date=April 2013}}.

==Prediction bands==

Prediction bands are related to [[prediction interval]]s in the same way that confidence bands are related to confidence intervals. Prediction bands commonly arise in regression analysis. The goal of a prediction band is to cover with a prescribed probability the values of one or more future observations from the same population from which a given data set was sampled. Just as prediction intervals are wider than confidence intervals, prediction bands will be wider than confidence bands.

In mathematical terms, a prediction band <math>\hat{f}(x)\pm w(x)</math> with coverage probability 1−α satisfies the following condition for each value of ''x'':

:<math>
{\rm Pr}\Big(\hat{f}(x)-w(x) \le y^* \le \hat{f}(x)+w(x)\Big) = 1-\alpha,
</math>

where ''y''* is an observation taken from the data-generating process at the given point ''x'' that is independent of the data used to construct the point estimate <math>\hat{f}(x)</math> and the confidence interval ''w(x)''. This is a pointwise prediction interval. It would be possible to construct a simultaneous interval for a finite number of independent observations using, for example, the Bonferroni method to widen the interval by an appropriate amount.

== References ==
{{reflist}}

{{Statistics}}

[[Category:Statistical inference]]

Radiative transfer equation and diffusion theory for photon transport in biological tissue

2013-10-14T20:55:48Z

199.46.199.232: /* Pencil beam normally incident on a semi-infinite medium */

In [[mathematics]], '''Casey's theorem''', also known as the generalized [[Ptolemy's theorem]], is a theorem in [[Euclidean geometry]] named after the Irish [[mathematics|mathematician]] [[John Casey (mathematician)|John Casey]].

== Formulation of the theorem==

[[Image:Theorem of casey2.png|thumb|350px|<math>t_{12} \cdot t_{34}+t_{41}\cdot t_{23}-t_{13}\cdot t_{24}=0 </math>]]

Let <math>\,O</math> be a circle of radius <math>\,R</math>. Let <math>\,O_1, O_2, O_3, O_4</math> be (in that order) four non-intersecting circles that lie inside <math>\,O</math> and tangent to it. Denote by <math>\,t_{ij}</math> the length of the exterior common tangent of the circles <math>\,O_i, O_j</math>. Then:<ref name="Cas"/>

:<math>\,t_{12} \cdot t_{34}+t_{41} \cdot t_{23}=t_{13}\cdot t_{24}.</math>

Note that in the degenerate case, where all four circles reduce to points, this is exactly [[Ptolemy's theorem]].

== Proof ==

The following proof is due<ref name="Bot"/> to Zacharias.<ref name="Zach"/> Denote the radius of circle <math>\,O_i</math> by <math>\,R_i</math> and its tangency point with the circle <math>\,O</math> by <math>\,K_i</math>. We will use the notation <math>\,O, O_i</math> for the centers of the circles.
Note that from [[Pythagorean theorem]],

:<math>\,t_{ij}^2=\overline{O_iO_j}^2-(R_i-R_j)^2.</math>

We will try to express this length in terms of the points <math>\,K_i,K_j</math>. By the [[law of cosines]] in triangle <math>\,O_iOO_j</math>,

:<math>\overline{O_iO_j}^2=\overline{OO_i}^2+\overline{OO_j}^2-2\overline{OO_i}\cdot \overline{OO_j}\cdot \cos\angle O_iOO_j</math>

Since the circles <math>\,O,O_i</math> tangent to each other:

:<math>\overline{OO_i} = R - R_i,\, \angle O_iOO_j = \angle K_iOK_j</math>

Let <math>\,C</math> be a point on the circle <math>\,O</math>. According to the [[law of sines]] in triangle <math>\,K_iCK_j</math>:

:<math>\overline{K_iK_j} = 2R\cdot \sin\angle K_iCK_j = 2R\cdot \sin\frac{\angle K_iOK_j}{2}</math>

Therefore,

:<math>\cos\angle K_iOK_j = 1-2\sin^2\frac{\angle K_iOK_j}{2}=1-2\cdot \left(\frac{\overline{K_iK_j}}{2R}\right)^2 = 1 - \frac{\overline{K_iK_j}^2}{2R^2}</math>

and substituting these in the formula above:

:<math>\overline{O_iO_j}^2=(R-R_i)^2+(R-R_j)^2-2(R-R_i)(R-R_j)\left(1-\frac{\overline{K_iK_j}^2}{2R^2}\right)</math>

:<math>\overline{O_iO_j}^2=(R-R_i)^2+(R-R_j)^2-2(R-R_i)(R-R_j)+(R-R_i)(R-R_j)\cdot \frac{\overline{K_iK_j}^2}{R^2}</math>

:<math>\overline{O_iO_j}^2=((R-R_i)-(R-R_j))^2+(R-R_i)(R-R_j)\cdot \frac{\overline{K_iK_j}^2}{R^2}</math>

And finally, the length we seek is

:<math>t_{ij}=\sqrt{\overline{O_iO_j}^2-(R_i-R_j)^2}=\frac{\sqrt{R-R_i}\cdot \sqrt{R-R_j}\cdot \overline{K_iK_j}}{R}</math>

We can now evaluate the left hand side, with the help of the original [[Ptolemy's theorem]] applied to the inscribed [[quadrilateral]] <math>\,K_1K_2K_3K_4</math>:

:<math>t_{12}t_{34}+t_{14}t_{23}=\frac{1}{R^2}\cdot \sqrt{R-R_1}\sqrt{R-R_2}\sqrt{R-R_3}\sqrt{R-R_4}\left(\overline{K_1K_2}\cdot \overline{K_3K_4}+\overline{K_1K_4}\cdot \overline{K_2K_3}\right)</math>

:<math>=\frac{1}{R^2}\cdot \sqrt{R-R_1}\sqrt{R-R_2}\sqrt{R-R_3}\sqrt{R-R_4}\left(\overline{K_1K_3}\cdot \overline{K_2K_4}\right)=t_{13}t_{24}</math>

Q.E.D.

==Further generalizations ==

It can be seen that the four circles need not lie inside the big circle. In fact, they may be tangent to it from the outside as well. In that case, the following change should be made:<ref name="John"/>
:
If <math>\,O_i, O_j</math> are both tangent from the same side of <math>\,O</math> (both in or both out), <math>\,t_{ij}</math> is the length of the exterior common tangent.
:
If <math>\,O_i, O_j</math> are tangent from different sides of <math>\,O</math> (one in and one out), <math>\,t_{ij}</math> is the length of the interior common tangent.
:
It is also worth noting that the converse of this statement is also true.<ref name="John"/> That is, if equality holds, the circles are tangent.

==Applications==

Casey's theorem and its converse can be used to prove a variety of statements in [[Euclidean geometry]].
:
For example, the shortest known proof<ref name="Cas"/> of [[Feuerbach's theorem]] uses the converse theorem.

==References==

<references>

<ref name="Cas">
{{cite journal
| first = J.
| author = Casey
| journal = Math. Proc. R. Ir. Acad.
| volume = 9
| pages = 396
| year = 1866
|separator = ,
}}
</ref>

<ref name="Zach">
{{cite journal
| first= M.
| last = Zacharias
| journal = [[Jahresbericht der Deutschen Mathematiker-Vereinigung]]
| volume = 52
| year = 1942
| separator = ,
}}
</ref>

<ref name="Bot">
{{cite book
| first = O.
| last = Bottema
| title = Hoofdstukken uit de Elementaire Meetkunde
| publisher = (translation by Reinie Erné as ''Topics in Elementary Geometry'', Springer 2008, of the second extended edition published by Epsilon-Uitgaven 1987)
| year = 1944
| separator = ,
}}
</ref>

<ref name="John">
{{cite book
| first = Roger A.
| last = Johnson
| title = Modern Geometry
| publisher = Houghton Mifflin, Boston (republished facsimile by Dover 1960, 2007 as ''Advanced Euclidean Geometry'')
| year = 1929
| separator = ,
}}

</ref>

</references>

==External links==
* {{MathWorld|urlname=CaseysTheorem|title=Casey's theorem}}
* [http://journals.cms.math.ca/cgi-bin/vault/public/view/CRUXv22n2/body/PDF/page49-53.pdf?file=page49-53 Shailesh Shirali: ''On a generalized Ptolemy Theorem'']

[[Category:Circles]]
[[Category:Euclidean geometry]]
[[Category:Theorems in geometry]]
[[Category:Articles containing proofs]]

Ruze's Equation

2013-10-03T01:04:50Z

199.46.200.231: /* Application to phased array */

In [[mathematics]], a '''Bose–Mesner algebra''' is a special set of [[Matrix (mathematics)|matrices]] which arise from a combinatorial structure known as an [[association scheme]], together with the usual set of rules for combining (forming the products of) those matrices, such that they form an [[associative algebra]], or, more precisely, a [[Unital algebra|unitary commutative algebra]]. Among these rules are:
:*the result of a product is also within the set of matrices,
:*there is an identity matrix in the set, and
:*such that taking products is [[Commutativity|commutative]].

Bose–Mesner algebras have applications in [[physics]] to [[spin model]]s, and in [[statistics]] to the [[design of experiments]]. They are named for [[R. C. Bose]] and Dale Marsh Mesner.<ref>Bose & Mesner (1959)</ref>

==Definition==
Let ''X'' be a set of ''v'' elements. Consider a partition of the 2-element subsets of ''X'' into ''n'' non-empty subsets, ''R''1, ..., ''R''''n'' such that:
* given an <math>x \in X</math>, the number of <math>y \in X</math> such that <math>\{x,y\} \in R_i</math> depends only on i (and not on ''x''). This number will be denoted by vi, and
* given <math>x,y \in X</math> with <math>\{x,y\} \in R_k</math>, the number of <math>z \in X</math> such that <math>\{x,z\} \in R_i</math> and <math>\{z,y\} \in R_j</math> depends only on ''i'',''j'' and ''k'' (and not on ''x'' and ''y''). This number will be denoted by <math>p^k_{ij}</math>.
This structure is enhanced by adding all pairs of repeated elements of ''X'' and collecting them in a subset ''R''0. This enhancement permits the parameters ''i'', ''j'', and ''k'' to take on the value of zero, and lets some of ''x'',''y'' or ''z'' be equal.

A set with such an enhanced partition is called an [[Association scheme]].<ref>{{harvnb|Cameron|van Lint|1991|loc=pp.197–198}}</ref> One may view an association scheme as a partition of the edges of a [[complete graph]] (with vertex set ''X'') into n classes, often thought of as color classes. In this representation, there is a loop at each vertex and all the loops receive the same 0th color.

The association scheme can also be represented algebraically. Consider the [[Matrix (mathematics)|matrices]] ''D''''i'' defined by:
: <math>(D_i)_{x,y} = \begin{cases}
1,& \text{if } \left(x,y\right)\in R_{i},\\
0,& \text{otherwise.} \end{cases} \qquad (1)</math>

Let <math>\mathcal{A}</math> be the [[vector space]] consisting of all [[Matrix (mathematics)|matrices]] <math>\sideset{}{_{i=0}^{n}}\sum a_{i}D_{i}</math>, with <math>a_{i}</math> complex.<ref>{{harvnb|Camion|1998}}</ref><ref>{{harvnb|Delsarte|Levenshtein|1998}}</ref>

The definition of an [[association scheme]] is equivalent to saying that the <math>D_{i}</math> are ''v'' × ''v'' (0,1)-[[Matrix (mathematics)|matrices]] which satisfy

# <math>D_i</math> is symmetric,
# <math>\sum_{i=0}^n D_{i}=J </math> (the all-ones matrix),
# <math>D_0=I,</math>
# <math>D_i D_j = \sum_{k=0}^n p^k_{ij} D_k = D_j D_i,\qquad i,j=0,\ldots,n.</math>

The (''x'',''y'')-th entry of the left side of 4. is the number of two colored paths of length two joining ''x'' and ''y'' (using "colors" ''i'' and ''j'') in the graph. Note that the rows and columns of <math>D_i</math> contain <math>v_i</math> 1s:

: <math>D_i J=J D_i = v_i J. \qquad (2)</math>

From 1., these [[Matrix (mathematics)|matrices]] are [[Symmetric matrix|symmetric]]. From 2., <math>D_{0},\ldots,D_{n}</math> are [[Linear independence|linearly independent]], and the dimension of <math>\mathcal{A}</math> is <math>n+1</math>. From 4., <math>\mathcal{A}</math> is closed under multiplication, and multiplication is always associative. This [[Associative algebra|associative]] [[commutative algebra]] <math>\mathcal{A}</math> is called the '''Bose–Mesner algebra''' of the [[association scheme]]. Since the [[Matrix (mathematics)|matrices]] in <math>\mathcal{A}</math> are symmetric and commute with each other, they can be simultaneously diagonalized. This means that there is a [[Matrix (mathematics)|matrix]] <math>S</math> such that to each <math>A\in\mathcal{A}</math> there is a [[diagonal matrix]] <math>\Lambda_{A}</math> with <math>S^{-1}A S=\Lambda_{A}</math>. This means that <math>\mathcal{A}</math> is semi-simple and has a unique basis of primitive idempotents <math>J_{0},\ldots,J_{n}</math>. These are complex n × n [[Matrix (mathematics)|matrices]] satisfying

: <math>
J_i^2 =J_i, i=0,\ldots,n, \qquad (3)
</math>

: <math>
J_i J_k=0, i\neq k, \qquad (4)
</math>

: <math>
\sum_{i=0}^n J_i = I. \qquad (5)
</math>

The '''Bose–Mesner algebra''' has two distinguished bases: the basis consisting of the [[Adjacency matrix|adjacency matrices]] <math>D_i</math>, and the basis consisting of the irreducible [[Idempotent matrix|idempotent matrices]] <math>E_k</math>. By definition, there exist well-defined [[complex number]]s such that

: <math>
D_{i}=\sum_{k=0}^n p_i (k) E_k, \qquad (6)
</math>

and

: <math>
|X|E_{k}=\sum_{i=0}^n q_k\left(i\right)D_i. \qquad (7)
</math>

The p-numbers <math>p_i (k)</math>, and the q-numbers <math>q_k(i)</math>, play a prominent role in the theory.<ref>{{harvnb|Camion|1998}}</ref> They satisfy well-defined orthogonality relations. The p-numbers are the [[eigenvalues]] of the [[adjacency matrix]] <math>D_i</math>.

==Theorem==

The [[eigenvalues]] of <math>p_{i}\left(k\right)</math> and <math>q_{k}\left(i\right)</math>, satisfy the orthogonality conditions:

: <math>
\sum_{k=0}^n \mu_i p_i (k)p_\ell (k)=v v_i \delta_{i \ell}, \quad(8)
</math>

: <math>
\sum_{k=0}^n \mu_i q_k (i) q_\ell (i)=v \mu_k \delta_{k \ell}. \quad(9)
</math>

Also

: <math>
\mu_j p_i (j) = v_i q_ j (i),\quad i,j=0,\ldots,n. \quad(10)
</math>

In [[Matrix (mathematics)|matrix]] notation, these are

: <math>
P^T \Delta_\mu P=v\Delta_v, \quad(11)
</math>

: <math>
Q^T \Delta_v Q=v\Delta_\mu, \quad(12)
</math>

where <math>\Delta_v = \operatorname{diag} \{v_0,v_1,\ldots,v_n\},\qquad \Delta_\mu = \operatorname{diag} \{\mu_0,\mu_1,\ldots,\mu_n\}.</math>

==Proof of theorem==

The [[eigenvalue]]s of <math>D_i D_\ell</math> are <math>p_i (k)p_\ell (k)</math> with multiplicities <math>\mu_k</math>. This implies that

: <math>
v v_i \delta_{i\ell} = \operatorname{trace}D_i D_\ell = \sum_{k=0}^n \mu_i p_i(k) p_\ell (k), \quad(13)
</math>

which proves Equation <math>\left(8\right)</math> and Equation <math>\left(11\right)</math>,

: <math>
Q = v P^{-1} = \Delta_v^{-1} P^T \Delta_\mu, \quad(14)
</math>

which gives Equations <math>(9)</math>, <math>(10)</math> and <math>(12)</math>.<math>\Box</math>

There is an analogy between extensions of [[association scheme]]s and [[Kronecker's theorem|extensions]] of [[finite field]]s. The cases we are most interested in are those where the extended schemes are defined on the <math>n</math>-th [[Cartesian power]] <math>X=\mathcal{F}^{n}</math> of a set <math>\mathcal{F}</math> on which a basic [[association scheme]] <math>\left(\mathcal{F},K\right)</math> is defined. A first [[association scheme]] defined on <math>X=\mathcal{F}^{n}</math> is called the <math>n</math>-th [[Kronecker product|Kronecker power]] <math>\left(\mathcal{F},K\right)_{\otimes}^{n}</math> of <math>\left(\mathcal{F},K\right)</math>. Next the extension is defined on the same set <math>X=\mathcal{F}^{n}</math> by gathering classes of <math>\left(\mathcal{F},K\right)_{\otimes}^{n}</math>. The [[Kronecker product|Kronecker power]] corresponds to the [[polynomial ring]] <math>F\left[X\right]</math> first defined on a [[Finite field|field]] <math>\mathbb{F}</math>, while the extension scheme corresponds to the [[extension field]] obtained as a quotient. An example of such an extended scheme is the [[Hamming scheme]].

[[Association scheme]]s may be merged, but merging them leads to non-symmetric [[association scheme]]s, whereas all usual [[code]]s are [[subgroup]]s in symmetric [[Abelian variety|Abelian schemes]].<ref>{{harvnb|Delsarte|Levenshtein|1998}}</ref><ref>{{harvnb|Camion|1998}}</ref><ref>{{harvnb|MacWilliams|Sloane|1978}}</ref>

==See also==
* [[Association scheme]]

{{More footnotes|date=September 2010}}

==Notes==

{{Reflist}}

==References==

* {{Cite book|first=Rosemary A.|last=Bailey|authorlink=Rosemary A. Bailey|url=http://www.maths.qmul.ac.uk/~rab/Asbook |title=Association schemes: Designed experiments, algebra and combinatorics|series=Cambridge Studies in Advanced Mathematics|volume=84|publisher=Cambridge University Press|year=2004|pages=387|isbn=978-0-521-82446-0| mr=2047311|ref=harv}}

* {{cite book | last1=Bannai | first1=Eiichi | last2=Ito | first2=Tatsuro | title=Algebraic combinatorics I: Association schemes | publisher=The Benjamin/Cummings Publishing Co., Inc. | location=Menlo Park, CA | year=1984 | pages=xxiv+425 | isbn=0-8053-0490-8 | mr=0882540 | unused_data= }}

* Bannai, Etsuko (2001) "Bose–Mesner algebras associated with four-weight spin models", ''Graphs and Combinatorics'', 17 (4),589–598. {{doi|10.1007/PL00007251}}

* {{citation| last1=Bose|first1=R. C.| authorlink1=R. C. Bose| last2=Mesner|first2=D. M.|year=1959|title=On linear associative algebras corresponding to association schemes of partially balanced designs|journal=[[Annals of Mathematical Statistics]]|volume=30|issue=1|pages=21–38| url=http://projecteuclid.org/euclid.aoms/1177706356 | doi=10.1214/aoms/1177706356 | mr = 102157 | jstor = 2237117}}

* {{citation|last=Cameron|first=P. J.|last2=van Lint|first2=J. H.|title=Designs, Graphs, Codes and their Links|year=1991|publisher=Cambridge University Press|location=Cambridge|isbn=0-521-42385-6}}

* {{citation|last1= Camion|first1=P.|authorlink1=Paul Camion|chapter=Codes and association schemes: Basic properties of association schemes relevant to coding| title=Handbook of coding theory|editor1-last= Pless|editor1-first=V. S.|editor1-link=Vera Pless|editor2-last=Huffman|editor2-first=W. C.|publisher=Elsevier|place= The Netherlands|year= 1998}}

* {{citation|last1=Delsarte|first1=P.|last2=Levenshtein|first2=V. I.|authorlink2=Vladimir Levenshtein|title=Association schemes and coding theory|journal=IEEE Transactions in Information Theory| volume= 44| issue= 6|pages= 2477–2504|year= 1998}}

* {{citation| first1=F. J.|last1= MacWilliams|first2=N. J. A.|last2= Sloane|authorlink2=Neil J. A. Sloane|title=The theory of error-correcting codes|publisher= Elsevier|place= New York|year= 1978}}

* Nomura, K. (1997) "An algebra associated with a spin model", ''Journal of Algebraic Combinatorics'', 6 (1), 53–58. {{DOI|10.1023/A:1008644201287}}

{{Experimental design|state=expanded}}

{{DEFAULTSORT:Bose-Mesner Algebra}}
[[Category:Algebraic combinatorics]]
[[Category:Design of experiments]]
[[Category:Analysis of variance]]
[[Category:Representation theory]]
[[Category:Algebra]]

Range ambiguity resolution

2013-07-31T16:45:57Z

199.46.199.230:

In mathematics, the '''continuous dual Hahn polynomials''' are a family of [[orthogonal polynomials]] in the [[Askey scheme]] of hypergeometric orthogonal polynomials. They are defined in terms of [[generalized hypergeometric function]]s by
:<math>S_n(x^2;a,b,c)= {}_3F_2(-n,a+ix,a-ix;a+b,a+c;1).\ </math>

{{harvs|txt | last1=Koekoek | first1=Roelof | last2=Lesky | first2=Peter A. | last3=Swarttouw | first3=René F. | title=Hypergeometric orthogonal polynomials and their q-analogues | publisher=[[Springer-Verlag]] | location=Berlin, New York | series=Springer Monographs in Mathematics | isbn=978-3-642-05013-8 | doi=10.1007/978-3-642-05014-5 | mr=2656096 | year=2010|loc=14}} give a detailed list of their properties.

Closely related polynomials include the [[dual Hahn polynomials]] ''R''''n''(''x'';γ,δ,''N''), the [[continuous Hahn polynomials]] ''p''''n''(''x'',''a'',''b'', {{overline|''a''}}, {{overline|''b''}}), and the [[Hahn polynomials]]. These polynomials all have ''q''-analogs with an extra parameter ''q'', such as the [[q-Hahn polynomials]] ''Q''''n''(''x'';α,β, ''N'';''q''), and so on.

==Orthogonality==
{{Empty section|date=September 2011}}

==Recurrence and difference relations==
{{Empty section|date=September 2011}}

==Rodrigues formula==
{{Empty section|date=September 2011}}

==Generating function==
{{Empty section|date=September 2011}}

==Relation to other polynomials==

*[[Wilson polynomials]] are a generalization of continuous dual Hahn polynomials

==References==

*{{Citation | last1=Hahn | first1=Wolfgang | title=Über Orthogonalpolynome, die q-Differenzengleichungen genügen | doi=10.1002/mana.19490020103 | mr=0030647 | year=1949 | journal=Mathematische Nachrichten | issn=0025-584X | volume=2 | pages=4–34}}
*{{Citation | last1=Koekoek | first1=Roelof | last2=Lesky | first2=Peter A. | last3=Swarttouw | first3=René F. | title=Hypergeometric orthogonal polynomials and their q-analogues | publisher=[[Springer-Verlag]] | location=Berlin, New York | series=Springer Monographs in Mathematics | isbn=978-3-642-05013-8 | doi=10.1007/978-3-642-05014-5 | mr=2656096 | year=2010}}
*{{dlmf|id=18.19|title=Hahn Class: Definitions|first=Tom H. |last=Koornwinder|first2=Roderick S. C.|last2= Wong|first3=Roelof |last3=Koekoek||first4=René F. |last4=Swarttouw}}

[[Category:Special hypergeometric functions]]
[[Category:Orthogonal polynomials]]

Grzegorczyk hierarchy

2012-06-15T00:05:21Z

199.46.245.232: Added complexityClasses box, as the hierarchy is included in it

When Krishna went as usually only occurs in the office, Sadhu came and asked the rupee but instead accidentally paused and gave him an awful cold stare before saying, "Your death is not too distant!" You are going to die in a train accident in only a week "(On Indeed, it very dramatic). However, he gave a "you-are-doomed" laughter and quickly walked distant. The key inhabited district are your City, the Hub, the Canal Side, and the Theatre Centre. There are several [http://remontywroclaw.net.pl/tag/lokale-uslugowe-warszawa/ mieszkania wilanów sprzedaż] and erected houses in those floors. Bradwell and Campbell Park are a lower priced option with small houses and flats for young adults who have price complications. Posh areas consists of Loughton with big houses with four or more bedrooms. Susan then introduced me to two guys named Carl Barnes and Jason Zimmerman. These both young men who were in charge running flight services. The interview went well and I ended up being equiped. As a line service rep, I'd personally be answerable for fueling and towing airplanes, among other things. It marked the beginning associated with the incredible 4 years at that airport. There could be as many sections to the closet once you choose positive everything has place. Not much more searching little items regarding socks that never appear to have a lover. They will be in their space and simply found. Is actually usually frustrating when you get up for work in the morning, walk to your closet and have to do a search for the clothes you want for day time. By planning a space for whatever gets delivered you want to keep associated with closet you won't have an obstacle finding your clothes. And here is where i come in. At Samana land for sale. I help you buying right from the puppy owners. Why? Because i and my partner possess a survey perform. We measured around 67 million m2 of land only in Samana. That means we have more than 1500 land virginia homes in Samana. Whatever sort of land you are waiting for, has got it. Count on that you are dealing directly with the owners, an individual always has the best and lowest prices, and that is where you are money with!!! This is surprising as 10 rice we saw in those area only sands simply no construction while now we do not see anyplace that is empty place our ankle. Why and how it happened no one knows. Nevertheless were some great initiatives at the ruler which is the developers who advised to go ahead to resell the industry. Once it was experimented people are lured order heavily, so the price fully gone up. American citizen Mister. Donald Trump even put his hand along the Dubai Property market. And also celebrities formerly bought their own towers several even put for resell. Make particular know the terms of your lease . Some places will require you just lease for around a year, while others maintain 30 days to month rental lessen. Pay close attention to any stipulations so that no one gets having difficulties. Be aware that many places will charge some associated with a fee to folks that break their leases old. Anytime is a fantastic time to buy a house that is well priced and what you need to live in, and is affordable, if you intend to live there a lot more than 5 quite a few. If not its better to rent and invest the savings and housing costs. If you're investor, number of obvious better places to park your an income.