TOPICS
Search

Search Results for ""


9441 - 9450 of 13135 for Computational GeometrySearch Results
Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...
A lattice L is locally subbounded if and only if each of its finite subsets is contained in a finitely generated bounded sublattice of L. Every locally bounded lattice is ...
For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...
The log-likelihood function F(theta) is defined to be the natural logarithm of the likelihood function L(theta). More precisely, F(theta)=lnL(theta), and so in particular, ...
By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...
The log sine function, also called the logsine function, is defined by S_n=int_0^pi[ln(sinx)]^ndx. (1) The first few cases are given by S_1 = -piln2 (2) S_2 = ...
The logarithmic capacity of a compact set E in the complex plane is given by gamma(E)=e^(-V(E)), (1) where V(E)=inf_(nu)int_(E×E)ln1/(|u-v|)dnu(u)dnu(v), (2) and nu runs over ...
Infinite series of various simple functions of the logarithm include sum_(k=1)^^^inftylnk = 1/2ln(2pi) (1) sum_(k=1)^^^infty(-1)^klnk = 1/2ln(1/2pi) (2) ...
A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...
The continuous distribution with parameters m and b>0 having probability and distribution functions P(x) = (e^(-(x-m)/b))/(b[1+e^(-(x-m)/b)]^2) (1) D(x) = 1/(1+e^(-(x-m)/b)) ...
1 ... 942|943|944|945|946|947|948 ... 1314 Previous Next

...