Civil Rights
Movements, leaders, victories and the continuing fight for equality.
Explore the people, places, events, achievements, struggles and stories that shaped our journey.
Movements, leaders, victories and the continuing fight for equality.
Innovation, patents, science, technology and world-changing contributions.
Pioneers, champions, Negro Leagues, records, activism and excellence.
Meet the people whose lives, choices and achievements shaped the journey.
Black towns, communities, institutions and places where history happened.
Moments that changed communities, movements, institutions and the nation.
Wilmington, North Carolina once had a thriving Black middle class and an elected interracial government. In 1898 white supremacists used violence to overthrow that government, kill Black residents and drive many others from the city.
MORE →Reflects the personal views, recollections, and perspective of the author, Mike Davis.
This is a personal recollection on the Move fire on May 13, 1985

In mathematics, the beta function, also called the Euler integral of the first kind, is a special function that is closely related to the gamma function and to binomial coefficients. It is defined by the integral
where are complex numbers such that and .
The beta function was studied by Leonhard Euler and Adrien-Marie Legendre and was given its name by Jacques Binet; its symbol is a Greek capital beta.
The beta function is symmetric, meaning that for all inputs and .[1]
A key property of the beta function is its close relationship to the gamma function:[1]
Write the product of two factorials as integrals. Since they are integrals in two separate variables, we can combine them into an iterated integral:
Changing variables by and , because and , we have that the limits of integrations for are to and the limits of integration for are to . Thus
Dividing both sides by gives the desired result.
The stated identity may be seen as a particular case of the identity for the integral of a convolution. Taking
one has:
See The Gamma Function, page 18–19[2] for a derivation of this relation.
The beta function is also closely related to binomial coefficients. When (or , by symmetry) is a positive integer, it follows from the definition of the gamma function that[1]
We have
and more generally
where denotes the digamma function.
Stirling's approximation gives the asymptotic formula
for large and .
If on the other hand is large and is fixed, then
The integral defining the beta function may be rewritten in a variety of ways, including the following:
where in the second-to-last identity } is any positive real number. One may move from the first integral to the second one by substituting .
For values we have:
The beta function can be written as an infinite sum:[3]
If and are equal we get
where is the rising factorial. The beta function can also be written as an infinite product
The beta function satisfies several identities analogous to corresponding identities for binomial coefficients, including a version of Pascal's identity
which can be proved as follows:
The above proof also shows the simple recurrence on one coordinate[4]
The positive integer values of the beta function are also the partial derivatives of the function
Indeed, for all nonnegative integers and ,
The Pascal-like identity above implies that this function is a solution to the first-order partial differential equation
For , the beta function may be written in terms of a convolution involving the truncated power function :
Evaluation at particular points simplifies the expression significantly; for example,
and[5]
By taking in this last formula, it follows that . Generalizing this into a bivariate identity for a product of beta functions leads to:
Also, by the Legendre duplication formula, we get
Euler's integral for the beta function may be converted into an integral over the Pochhammer contour as
This Pochhammer contour integral converges for all values of and and so gives the analytic continuation of the beta function.
Just as the gamma function for integers describes factorials, the beta function can define a binomial coefficient after adjusting indices:
Moreover, for integer , the beta function can be factored to give a closed form interpolation function for continuous values of :
The reciprocal beta function is the function
Interestingly, their integral representations closely relate as the definite integral of trigonometric functions with product of its power and multiple-angle:[6]
The incomplete beta function, a generalization of the beta function, is defined as[7][8]
For , the incomplete beta function coincides with the complete beta function. For positive integers and , the incomplete beta function is a polynomial of degree with rational coefficients.
Substituting and gives alternative integral forms:
It can also be written in terms of the hypergeometric function:
The regularized incomplete beta function (or regularized beta function for short) is defined in terms of the incomplete beta function and the complete beta function:
The regularized incomplete beta function is the cumulative distribution function of the beta distribution, and is related to the cumulative distribution function of a random variable following a binomial distribution with probability of single success and number of Bernoulli trials :
The continued fraction expansion is
with odd and even coefficients given by
The and convergents are less than , while the and convergents are greater than .
It converges rapidly for . For or , the function may be evaluated more efficiently through the relation .[8]
The beta function can be extended to a function with more than two arguments:
This multivariate beta function is used in the definition of the Dirichlet distribution. Its relationship to the beta function is analogous to the relationship between multinomial coefficients and binomial coefficients. For example, it satisfies a similar version of Pascal's identity:
The beta function is useful in computing and representing the scattering amplitude for Regge trajectories. Furthermore, it was the first known scattering amplitude in string theory, first conjectured by Gabriele Veneziano. It also occurs in the theory of the preferential attachment process, a type of stochastic urn process. The beta function is also important in statistics, e.g. for the beta distribution and beta prime distribution.
Even if unavailable directly, the complete and incomplete beta function values can be calculated using functions commonly included in spreadsheet or computer algebra systems.
In Microsoft Excel, for example, the complete beta function can be computed with the GammaLn function (or special.gammaln in Python's SciPy package):
Value = Exp(GammaLn(a) + GammaLn(b) − GammaLn(a + b))This result follows from the properties listed above.
The incomplete beta function cannot be directly computed using such relations and other methods must be used. In GNU Octave, it is computed using a continued fraction expansion.
The incomplete beta function has existing implementation in common languages. For instance, betainc (incomplete beta function) in MATLAB and GNU Octave, pbeta (probability of beta distribution) in R and betainc in SymPy. In SciPy, special.betainc computes the regularized incomplete beta function—which is, in fact, the cumulative beta distribution. To get the actual incomplete beta function, one can multiply the result of special.betainc by the result returned by the corresponding beta function. In Mathematica, Beta[x, a, b] and BetaRegularized[x, a, b] give and , respectively.
Source: Wikipedia. Article content is retrieved live through the MediaWiki API.
In mathematics, the multivariate gamma function Γp is a generalization of the gamma function. It is useful in multivariate statistics, appearing in the probability density function of the Wishart and inverse Wishart distributions, and the matrix variate beta distribution. It has two equivalent definitions. One is given as the following integral over the p × p {\displaystyle p\times p} positive-definite real matrices: Γ p ( a ) = ∫ S > 0 exp ( − t r ( S ) ) | S | a − p + 1 2 d S , {\displaystyle \Gamma _{p}(a)=\int _{S>0}\exp \left(-{\rm {tr}}(S)\right)\,\left|S\right|^{a-{\frac {p+1}{2}}}dS,} where | S | {\displaystyle |S|} denotes the determinant of S {\displaystyle S} . The other one, more useful to obtain a numerical result is: Γ p ( a ) = π p ( p − 1 ) / 4 ∏ j = 1 p Γ ( a + ( 1 − j ) / 2 ) . {\displaystyle \Gamma _{p}(a)=\pi ^{p(p-1)/4}\prod _{j=1}^{p}\Gamma (a+(1-j)/2).} In both definitions, a {\displaystyle a} is a complex number whose real part satisfies ℜ ( a ) > ( p − 1 ) / 2 {\displaystyle \Re (a)>(p-1)/2} . Note that Γ 1 ( a ) {\displaystyle \Gamma _{1}(a)} reduces to the ordinary gamma function. The second of the above definitions allows to directly obtain the recursive relationships for p ≥ 2 {\displaystyle p\geq 2} : Γ p ( a ) = π ( p − 1 ) / 2 Γ ( a ) Γ p − 1 ( a − 1 2 ) = π ( p − 1 ) / 2 Γ p − 1 ( a ) Γ ( a + ( 1 − p ) / 2 ) . {\displaystyle \Gamma _{p}(a)=\pi ^{(p-1)/2}\Gamma (a)\Gamma _{p-1}(a-{\tfrac {1}{2}})=\pi ^{(p-1)/2}\Gamma _{p-1}(a)\Gamma (a+(1-p)/2).} Thus Γ 2 ( a ) = π 1 / 2 Γ ( a ) Γ ( a − 1 / 2 ) {\displaystyle \Gamma _{2}(a)=\pi ^{1/2}\Gamma (a)\Gamma (a-1/2)} Γ 3 ( a ) = π 3 / 2 Γ ( a ) Γ ( a − 1 / 2 ) Γ ( a − 1 ) {\displaystyle \Gamma _{3}(a)=\pi ^{3/2}\Gamma (a)\Gamma (a-1/2)\Gamma (a-1)} and so on. This can also be extended to non-integer values of p {\displaystyle p} with the expression: Γ p ( a ) = π p ( p − 1 ) / 4 G ( a + 1 2 ) G ( a + 1 ) G ( a + 1 − p 2 ) G ( a + 1 − p 2 ) {\displaystyle \Gamma _{p}(a)=\pi ^{p(p-1)/4}{\frac {G(a+{\frac {1}{2}})G(a+1)}{G(a+{\frac {1-p}{2}})G(a+1-{\frac {p}{2}})}}} Where G is the Barnes G-function, the indefinite product of the Gamma function. The function is derived by Anderson from first principles who also cites earlier work by Wishart, Mahalanobis and others. There also exists a version of the multivariate gamma function which instead of a single complex number takes a p {\displaystyle p} -dimensional vector of complex numbers as its argument. It generalizes the above defined multivariate gamma function insofar as the latter is obtained by a particular choice of multivariate argument of the former.
In statistics, the complex Wishart distribution is a complex version of the Wishart distribution. It is the distribution of n {\displaystyle n} times the sample Hermitian covariance matrix of n {\displaystyle n} zero-mean independent Gaussian random variables. It has support for p × p {\displaystyle p\times p} Hermitian positive definite matrices. The complex Wishart distribution is also encountered in wireless communications, while analyzing the performance of Rayleigh fading MIMO wireless channels. The complex Wishart distribution is the density of a complex-valued sample covariance matrix. Let S p × p = ∑ i = 1 n G i G i H {\displaystyle S_{p\times p}=\sum _{i=1}^{n}G_{i}G_{i}^{H}} where each G i {\displaystyle G_{i}} is an independent column p-vector of random complex Gaussian zero-mean samples and ( . ) H {\displaystyle (.)^{H}} is an Hermitian (complex conjugate) transpose. If the covariance of G is E [ G G H ] = M {\displaystyle \mathbb {E} [GG^{H}]=M} then S ∼ n C W ( M , n , p ) {\displaystyle S\sim n{\mathcal {CW}}(M,n,p)} where C W ( M , n , p ) {\displaystyle {\mathcal {CW}}(M,n,p)} is the complex central Wishart distribution with n degrees of freedom and mean value, or scale matrix, M. f S ( S ) = | S | n − p e − tr ( M − 1 S ) | M | n ⋅ C Γ ~ p ( n ) , n ≥ p , | M | > 0 {\displaystyle f_{S}(\mathbf {S} )={\frac {\left|\mathbf {S} \right|^{n-p}e^{-\operatorname {tr} (\mathbf {M} ^{-1}\mathbf {S} )}}{\left|\mathbf {M} \right|^{n}\cdot {\mathcal {C}}{\widetilde {\Gamma }}_{p}(n)}},\;\;\;n\geq p,\;\;\;\left|\mathbf {M} \right|>0} where C Γ ~ p ( n ) = π p ( p − 1 ) / 2 ∏ j = 1 p Γ ( n − j + 1 ) {\displaystyle {\mathcal {C}}{\widetilde {\Gamma }}_{p}^{}(n)=\pi ^{p(p-1)/2}\prod _{j=1}^{p}\Gamma (n-j+1)} is the complex multivariate Gamma function. Using the trace rotation rule tr ( A B C ) = tr ( C A B ) {\displaystyle \operatorname {tr} (ABC)=\operatorname {tr} (CAB)} we also get f S ( S ) = | S | n − p | M | n ⋅ C Γ ~ p ( n ) exp ( − ∑ i = 1 p G i H M − 1 G i ) {\displaystyle f_{S}(\mathbf {S} )={\frac {\left|\mathbf {S} \right|^{n-p}}{\left|\mathbf {M} \right|^{n}\cdot {\mathcal {C}}{\widetilde {\Gamma }}_{p}(n)}}\exp \left(-\sum _{i=1}^{p}G_{i}^{H}\mathbf {M} ^{-1}G_{i}\right)} which is quite close to the complex multivariate pdf of G itself. The elements of G conventionally have circular symmetry such that E [ G G T ] = 0 {\displaystyle \mathbb {E} [GG^{T}]=0} . Inverse Complex Wishart The distribution of the inverse complex Wishart distribution of Y = S − 1 {\displaystyle \mathbf {Y} =\mathbf {S^{-1}} } according to Goodman, Shaman is f Y ( Y ) = | Y | − ( n + p ) e − tr ( M Y − 1 ) | M | − n ⋅ C Γ ~ p ( n ) , n ≥ p , det ( Y ) > 0 {\displaystyle f_{Y}(\mathbf {Y} )={\frac {\left|\mathbf {Y} \right|^{-(n+p)}e^{-\operatorname {tr} (\mathbf {M} \mathbf {Y^{-1}} )}}{\left|\mathbf {M} \right|^{-n}\cdot {\mathcal {C}}{\widetilde {\Gamma }}_{p}(n)}},\;\;\;n\geq p,\;\;\;\det \left(\mathbf {Y} \right)>0} where M = Γ − 1 {\displaystyle \mathbf {M} =\mathbf {\Gamma ^{-1}} } . If derived via a matrix inversion mapping, the result depends on the complex Jacobian determinant C J Y ( Y − 1 ) = | Y | − 2 p {\displaystyle {\mathcal {C}}J_{Y}(Y^{-1})=\left|Y\right|^{-2p}} Goodman and others discuss such complex Jacobians.
In mathematics, the gamma function, denoted by Γ {\displaystyle \Gamma } (capital Greek letter gamma), is the most common extension of the factorial function to complex numbers. First studied by Daniel Bernoulli, the gamma function is defined for all complex numbers z {\displaystyle z} except non-positive integers, and satisfies Γ ( n ) = ( n − 1 ) ! {\displaystyle \Gamma (n)=(n-1)!} for every positive integer n {\displaystyle n} . The gamma function can be defined via a convergent improper integral for complex numbers with positive real part: Γ ( z ) = ∫ 0 ∞ t z − 1 e − t d t , ℜ ( z ) > 0. {\displaystyle \Gamma (z)=\int _{0}^{\infty }t^{z-1}e^{-t}\,dt,\ \qquad \Re (z)>0.} The gamma function then is defined in the complex plane as the analytic continuation of this integral function: it is a meromorphic function which is holomorphic except at zero and the negative integers, where it has simple poles. Since the gamma function has no zeros, its reciprocal 1 / Γ {\displaystyle 1/\Gamma } is an entire function. In fact, the gamma function corresponds to the Mellin transform of exponential decay: Γ ( z ) = M { e − x } ( z ) . {\displaystyle \Gamma (z)={\mathcal {M}}\{e^{-x}\}(z).} Other extensions of the factorial function do exist, but the gamma function is the most popular and useful. It appears as a factor in various probability-distribution functions and other formulas in the fields of probability, statistics, analytic number theory, and combinatorics.
In mathematics, the beta function, also called the Euler integral of the first kind, is a special function that is closely related to the gamma function and to binomial coefficients. It is defined by the integral B ( z 1 , z 2 ) = ∫ 0 1 t z 1 − 1 ( 1 − t ) z 2 − 1 d t {\displaystyle \mathrm {B} (z_{1},z_{2})=\int _{0}^{1}t^{z_{1}-1}(1-t)^{z_{2}-1}\,dt} where z 1 , z 2 {\displaystyle z_{1},z_{2}} are complex numbers such that ℜ ( z 1 ) > 0 {\displaystyle \Re (z_{1})>0} and ℜ ( z 2 ) > 0 {\displaystyle \Re (z_{2})>0} . The beta function was studied by Leonhard Euler and Adrien-Marie Legendre and was given its name by Jacques Binet; its symbol B {\displaystyle \mathrm {B} } is a Greek capital beta.
Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.
MORE →Brown v. Board of Education in 1954.