Search Results for ""

The number of nodes in a graph is called its order.

Consider a one-dimensional Hamiltonian map of the form H(p,q)=1/2p^2+V(q), (1) which satisfies Hamilton's equations q^. = (partialH)/(partialp) (2) p^. = ...

The surface with parametric equations x = (sinhvcos(tauu))/(1+coshucoshv) (1) y = (sinhvsin(tauu))/(1+coshucoshv) (2) z = (coshvsinh(u))/(1+coshucoshv), (3) where tau is the ...

A curvature such as Gaussian curvature which is detectable to the "inhabitants" of a surface and not just outside observers. An extrinsic curvature, on the other hand, is not ...

For 0<=x<=pi/2, 2/pix<=sinx<=x.

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}, ...

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...