Search Results for ""
981 - 990 of 3930 for Regularized Beta FunctionSearch Results

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...
Let phi_x^((k)) denote the recursive function of k variables with Gödel number x, where (1) is normally omitted. Then if g is a partial recursive function, there exists an ...
The complete elliptic integral of the second kind, illustrated above as a function of k, is defined by E(k) = E(1/2pi,k) (1) = ...
There are a number of formulas variously known as Hurwitz's formula. The first is zeta(1-s,a)=(Gamma(s))/((2pi)^s)[e^(-piis/2)F(a,s)+e^(piis/2)F(-a,s)], where zeta(z,a) is a ...
The Fransén-Robinson constant F is defined by F=int_0^infty(dx)/(Gamma(x))=2.8077702420... (OEIS A058655) where Gamma(x) is the gamma function. No closed-form expression in ...
Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...
The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...
The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...
The inverse function of the logarithm, defined such that log_b(antilog_bz)=z=antilog_b(log_bz). The antilogarithm in base b of z is therefore b^z.
A type of integral named after Henstock and Kurzweil. Every Lebesgue integrable function is HK integrable with the same value.

...