Search Results for ""

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

The log-series distribution, also sometimes called the logarithmic distribution (although this work reserves that term for a distinct distribution), is the distribution of ...

The logarithmic distribution is a continuous distribution for a variate X in [a,b] with probability function P(x)=(lnx)/(b(lnb-1)-a(lna-1)) (1) and distribution function ...

A topology induced by the metric g defined on a metric space X. The open sets are all subsets that can be realized as the unions of open balls B(x_0,r)={x in X|g(x_0,x)<r}, ...

Amazingly, the distribution of a difference of two normally distributed variates X and Y with means and variances (mu_x,sigma_x^2) and (mu_y,sigma_y^2), respectively, is ...

An algebraic surface of degree eight. The maximum number of ordinary double points known to exist on an octic surface is 168 (the Endraß octics), although the rigorous upper ...

The orthocubic (or ortho cubic) Z(X_4) is a self-isogonal cubic with pivot point at the orthocenter H, so it has parameter x=cosBcosC and trilinear equation (Cundy and Parry ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

The kth percentile P_k is that value of x, say x_k, which corresponds to a cumulative frequency of Nk/100, where N is the sample size.

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...